Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/string_to_wostream.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/string_to_wostream.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/string_to_wostream.h	(revision 70339)
@@ -0,0 +1,13 @@
+// Include string_utils.h instead if you're linking against apertium
+
+#ifndef __STRING_TO_WOSTREAM_H_
+#define __STRING_TO_WOSTREAM_H_
+
+#include <iterator>
+
+static std::wostream & operator<<(std::wostream & ostr, std::string const & str) {
+  ostr << str.c_str();
+  return ostr;
+}
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/att_compiler.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/att_compiler.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/att_compiler.cc	(revision 70339)
@@ -0,0 +1,376 @@
+/*
+ * Copyright (C) 2013 Dávid Márk Nemeskey
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <lttoolbox/att_compiler.h>
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/transducer.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/string_to_wostream.h>
+
+using namespace std;
+
+AttCompiler::AttCompiler() :
+starting_state(0)
+{
+}
+
+AttCompiler::~AttCompiler()
+{
+}
+
+void 
+AttCompiler::clear() 
+{
+  for (map<int, AttNode*>::const_iterator it = graph.begin(); it != graph.end();
+      ++it) 
+  {
+    delete it->second;
+  }
+  graph.clear();
+  alphabet = Alphabet();
+}
+
+/** 
+ * Converts symbols like @0@ to epsilon, @_SPACE_@ to space, etc.
+ * @todo Are there other special symbols? If so, add them, and maybe use a map
+ *       for conversion?
+ */
+void 
+AttCompiler::convert_hfst(wstring& symbol) 
+{
+  if (symbol == L"@0@" || symbol == L"ε") 
+  {
+    symbol = L"";
+  } 
+  else if (symbol == L"@_SPACE_@") 
+  {
+    symbol = L" ";
+  }
+}
+
+/**
+ * Returns the code of the symbol in the alphabet. Run after convert_hfst has
+ * run.
+ *
+ * Also adds all non-multicharacter symbols (letters) to the @p letters set.
+ *
+ * @return the code of the symbol, if @p symbol is multichar; its first (and
+ *         only) character otherwise.
+ */
+int 
+AttCompiler::symbol_code(const wstring& symbol) 
+{
+  if (symbol.length() > 1) {
+    alphabet.includeSymbol(symbol);
+    return alphabet(symbol);
+  } else if (symbol == L"") {
+    return 0;
+  } else if (iswpunct(symbol[0]) || iswspace(symbol[0])) {
+    return symbol[0];
+  } else {
+    letters.insert(symbol[0]);
+    if(iswlower(symbol[0]))
+    {
+      letters.insert(towupper(symbol[0]));
+    }
+    else if(iswupper(symbol[0]))
+    {
+      letters.insert(towlower(symbol[0]));
+    }
+    return symbol[0];
+  }
+}
+
+void 
+AttCompiler::parse(string const &file_name, wstring const &dir) 
+{
+  clear();
+
+  wifstream infile(file_name.c_str());  // TODO: error checking
+  vector<wstring> tokens;
+  wstring line;
+  bool first_line = true;       // First line -- see below
+  bool seen_input_symbol = false;
+
+  while (getline(infile, line)) 
+  {
+    tokens.clear();
+    int from, to;
+    wstring upper, lower;
+
+    if (line.length() == 0 && first_line) 
+    {
+      wcerr << "Error: empty file '" << file_name << "'." << endl;
+      exit(EXIT_FAILURE);
+    }
+    if (first_line && line.find(L"\t") == wstring::npos)
+    {
+      wcerr << "Error: invalid format '" << file_name << "'." << endl;
+      exit(EXIT_FAILURE);
+    }
+
+    /* Empty line. */
+    if (line.length() == 0) 
+    {
+      continue;
+    }
+    split(line, L'\t', tokens);
+
+    from = convert(tokens[0]);
+
+    AttNode* source = get_node(from);
+    /* First line: the initial state is of both types. */
+    if (first_line) 
+    {
+      starting_state = from;
+      first_line = false;
+    }
+
+    /* Final state. */
+    if (tokens.size() <= 2) 
+    {
+      finals.insert(from);
+    } 
+    else 
+    {
+      to = convert(tokens[1]);
+      if(dir == L"RL")
+      {
+        upper = tokens[3];
+        lower = tokens[2];
+      }
+      else
+      {
+        upper = tokens[2];
+        lower = tokens[3];
+      }
+      convert_hfst(upper);
+      convert_hfst(lower);
+      if(upper != L"")
+      {
+        seen_input_symbol = true; 
+      }
+      /* skip lines that have an empty left side and output 
+         if we haven't seen an input symbol */
+      if(upper == L"" && lower != L"" && !seen_input_symbol) 
+      {
+        continue;
+      }
+      int tag = alphabet(symbol_code(upper), symbol_code(lower));
+      /* We don't read the weights, even if they are defined. */
+      source->transductions.push_back(Transduction(to, upper, lower, tag));
+
+      get_node(to);
+    }
+  }
+
+  /* Classify the nodes of the graph. */
+  map<int, TransducerType> classified;
+  classify(starting_state, classified, false, BOTH);
+
+  infile.close();
+}
+
+/** Extracts the sub-transducer made of states of type @p type. */
+Transducer 
+AttCompiler::extract_transducer(TransducerType type) 
+{
+  Transducer transducer;
+  /* Correlation between the graph's state ids and those in the transducer. */
+  map<int, int> corr;
+  set<int> visited;
+
+  corr[starting_state] = transducer.getInitial();
+  _extract_transducer(type, starting_state, transducer, corr, visited);
+
+  /* The final states. */
+  bool noFinals = true;
+  for (set<int>::const_iterator f = finals.begin(); f != finals.end(); ++f) 
+  {
+    if (corr.find(*f) != corr.end()) 
+    {
+      transducer.setFinal(corr[*f]);
+      noFinals = false;
+    }
+  }
+
+/*
+  if(noFinals)
+  {
+    wcerr << L"No final states (" << type << ")" << endl;
+    wcerr << L"  were:" << endl;
+    wcerr << L"\t" ;
+    for (set<int>::const_iterator f = finals.begin(); f != finals.end(); ++f) 
+    {
+      wcerr << *f << L" ";
+    }
+    wcerr << endl;
+  }
+*/
+  return transducer;
+}
+
+/**
+ * Recursively fills @p transducer (and @p corr) -- helper method called by
+ * extract_transducer().
+ */
+void 
+AttCompiler::_extract_transducer(TransducerType type, int from,
+                         Transducer& transducer, map<int, int>& corr,
+                         set<int>& visited) 
+{
+  if (visited.find(from) != visited.end()) 
+  {
+    return;
+  } 
+  else 
+  {
+    visited.insert(from);
+  }
+
+  AttNode* source = get_node(from);
+
+  /* Is the source state new? */
+  bool new_from = corr.find(from) == corr.end();
+  int from_t, to_t;
+
+  for (vector<Transduction>::const_iterator it = source->transductions.begin();
+       it != source->transductions.end(); ++it) 
+  {
+    if ((it->type & type) != type) 
+    {
+      continue;  // Not the right type
+    }
+    /* Is the target state new? */
+    bool new_to = corr.find(it->to) == corr.end();
+
+    if (new_from) 
+    {
+      corr[from] = transducer.size() + (new_to ? 1 : 0);
+    }
+    from_t = corr[from];
+
+    /* Now with the target state: */
+    if (!new_to) 
+    {
+      /* We already know it, possibly by a different name: link them! */
+      to_t = corr[it->to];
+      transducer.linkStates(from_t, to_t, it->tag);
+    } 
+    else 
+    {
+      /* We haven't seen it yet: add a new state! */
+      to_t = transducer.insertNewSingleTransduction(it->tag, from_t);
+      corr[it->to] = to_t;
+    }
+    _extract_transducer(type, it->to, transducer, corr, visited);
+  }  // for
+}
+
+
+/**
+ * Classifies the edges of the transducer graphs recursively. It works like
+ * this:
+ * - the type of the starting state is BOTH (already set)
+ * - in case of an epsilon move, the type of the target state is the same as
+ *   that of the source
+ * - the first non-epsilon transition determines the type of the whole path
+ * - it is also the time from which we begin filling the @p visited set.
+ *
+ * @param from the id of the source state.
+ * @param visited the ids of states visited by this path.
+ * @param path are we in a path?
+ */
+void 
+AttCompiler::classify(int from, map<int, TransducerType>& visited, bool path,
+              TransducerType type) 
+{
+  AttNode* source = get_node(from);
+  if (visited.find(from) != visited.end()) 
+  {
+    if (path && ( (visited[from] & type) == type) ) 
+    {
+      return;
+    }
+  }
+
+  if (path) 
+  {
+    visited[from] |= type;
+  }
+
+  for (vector<Transduction>::iterator it = source->transductions.begin();
+       it != source->transductions.end(); ++it) 
+  {
+    bool next_path = path;
+    int  next_type = type;
+    bool first_transition = !path && it->upper != L"";
+    if (first_transition) 
+    {
+      /* First transition: we now know the type of the path! */
+      bool upper_word  = (it->upper.length() == 1 &&
+                          letters.find(it->upper[0]) != letters.end());
+      bool upper_punct = (it->upper.length() == 1 && iswpunct(it->upper[0]));
+      next_type = UNDECIDED;
+      if (upper_word)  next_type |= WORD;
+      if (upper_punct) next_type |= PUNCT;
+      next_path = true;
+    } 
+    else 
+    {
+      /* Otherwise (not yet, already): target's type is the same as ours. */
+      next_type = type;
+    }
+    it->type |= next_type;
+    classify(it->to, visited, next_path, next_type);
+  }  // for
+}
+
+/** Writes the transducer to @p file_name in lt binary format. */
+void 
+AttCompiler::write(FILE *output) 
+{
+//  FILE* output = fopen(file_name, "w");
+  Transducer punct_fst = extract_transducer(PUNCT);
+
+  /* Non-multichar symbols. */
+  Compression::wstring_write(wstring(letters.begin(), letters.end()), output);
+  /* Multichar symbols. */
+  alphabet.write(output);
+  /* And now the FST. */
+  if(punct_fst.numberOfTransitions() == 0)
+  {
+    Compression::multibyte_write(1, output);
+  }
+  else
+  {
+    Compression::multibyte_write(2, output);
+  }
+  Compression::wstring_write(L"main@standard", output);
+  Transducer word_fst = extract_transducer(WORD);
+  word_fst.write(output);
+  wcout << L"main@standard" << " " << word_fst.size();
+  wcout << " " << word_fst.numberOfTransitions() << endl;
+  Compression::wstring_write(L"final@inconditional", output);
+  if(punct_fst.numberOfTransitions() != 0) 
+  {
+    punct_fst.write(output);
+    wcout << L"final@inconditional" << " " << punct_fst.size();
+    wcout << " " << punct_fst.numberOfTransitions() << endl;
+  }
+//  fclose(output);
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/buffer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/buffer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/buffer.h	(revision 70339)
@@ -0,0 +1,273 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _BUFFER_
+#define _BUFFER_
+
+#include <iostream>
+#include <cstdlib>
+#include <cstring>
+
+using namespace std;
+
+/**
+ * Generic circular buffer class
+ */
+template <class T>
+class Buffer
+{
+private:
+  /**
+   * Buffer size.
+   */
+  unsigned int size;
+  
+  /**
+   * Buffer array.
+   */
+  T *buf;
+   
+  /**
+   * Buffer current position.
+   */
+  unsigned int currentpos;
+  
+  /**
+   * Last position.
+   */
+  unsigned int lastpos;
+  
+  
+  void copy(Buffer const &b)
+    {
+      currentpos = b.currentpos;
+      lastpos = b.lastpos;
+      size = b.size;
+      buf = new T[size];
+      memcpy(buf, b.buf, size);
+    }
+
+  void destroy()
+    {
+      delete[] buf;
+    }
+
+public:  
+
+  /**
+   * Constructor
+   * @param buf_size buffer size
+   */
+  Buffer(unsigned int const buf_size=2048)
+    {
+      if(buf_size == 0)
+      {
+	wcerr << "Error: Cannot create empty buffer." << endl;
+	exit(EXIT_FAILURE);
+      }    
+      buf = new T[buf_size];
+      size = buf_size;
+      currentpos = 0;
+      lastpos = 0;
+    }
+
+  /**
+   * Copy constructor.
+   */
+  Buffer(Buffer const &b)
+    {
+      copy(b);
+    }
+
+  /**
+   * Destructor.
+   */
+  ~Buffer()
+    {
+      destroy();
+    }
+
+   /**
+    * Get size of buffer
+    */
+   unsigned int getSize() const
+    {
+      return size;
+    }
+
+  /**
+   * Assign operator.
+   */
+  Buffer & operator=(Buffer const &b)
+    {
+      if(&b != this)
+      {
+	destroy();
+	copy(b);
+      }
+      return *this;
+    }
+    
+  /**
+   * Add an element to the buffer.
+   * @param value the value.
+   * @return reference to the stored object.
+   */
+  T & add(T const &value)
+    {
+      if(lastpos == size)
+      {
+	lastpos = 0;
+      }
+      buf[lastpos++] = value;
+      currentpos = lastpos;
+      return buf[lastpos - 1];
+    }
+  
+
+  /**
+   * Add an element to the buffer and not modify its content, getting the
+   * next free reference
+   * @return reference to the stored object.
+   */
+  T & add(void)
+    {
+      if(lastpos == size)
+      {
+	lastpos = 0;
+      }
+      currentpos = lastpos;
+      return buf[lastpos -1];
+    }
+
+
+  /**
+   * Consume the buffer's current value.
+   * @return the current value.
+   */
+  T& next()
+    {
+      if(currentpos != lastpos)
+      {
+	if(currentpos == size)
+	{
+	  currentpos = 0;
+	}
+	return buf[currentpos++];
+      }
+      else
+      {
+	return last();
+      }
+    }
+    
+  /**
+   * Get the last element of the buffer.
+   * @return last element.
+   */
+  T & last() const
+    {
+      if(lastpos != 0)
+      {
+	return buf[lastpos-1];
+      }
+      else
+      {
+	return buf[size-1];
+      }
+    }
+ 
+  /**
+   * Get the current buffer position.
+   * @return the position.
+   */
+  unsigned int getPos() const
+    {
+      return currentpos;
+    }
+
+  /**
+   * Set the buffer to a new position.
+   * @param newpos the new position.
+   */
+  void setPos(unsigned int const newpos)
+    {
+      currentpos = newpos;
+    }
+
+  /**
+   * Return the range size between the buffer current position and a
+   * outside stored given position that is previous to the current.
+   * @param prevpos the given position.
+   * @return the range size.
+   */
+  unsigned int diffPrevPos(unsigned int const prevpos) const
+    {
+      if(prevpos <= currentpos)
+      {
+	return currentpos - prevpos;
+      }
+      else
+      {
+	return currentpos + size - prevpos;
+      }
+    } 
+
+  /**
+   * Return the range size between the buffer current position and a
+   * outside stored given position that is following to the current.
+   * @param postpos the given position.
+   * @return the range size.
+   */
+  unsigned int diffPostPos(unsigned int const postpos) const
+    {
+      if(postpos >= currentpos)
+      {
+	return postpos - currentpos;
+      }
+      else
+      {
+	return postpos + size - currentpos;
+      }
+    }
+
+  /**
+   * Checks the buffer for emptyness.
+   * @return true if the buffer is empty.
+   */
+  bool isEmpty() const
+    {
+      return currentpos == lastpos;   
+    }
+  
+  /**
+   * Gets back 'posback' positions in the buffer.
+   * @param posback the amount of position to get back.
+   */
+  void back(unsigned int const posback)
+    {
+      if(currentpos > posback)
+      {
+        currentpos-=posback;
+      }
+      else
+      {
+        currentpos = size - (posback-currentpos);
+      }
+    }
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compiler.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compiler.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compiler.cc	(revision 70339)
@@ -0,0 +1,930 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/compiler.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/entry_token.h>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <lttoolbox/string_to_wostream.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libxml/encoding.h>
+
+using namespace std;
+
+wstring const Compiler::COMPILER_DICTIONARY_ELEM    = L"dictionary";
+wstring const Compiler::COMPILER_ALPHABET_ELEM      = L"alphabet";
+wstring const Compiler::COMPILER_SDEFS_ELEM         = L"sdefs";
+wstring const Compiler::COMPILER_SDEF_ELEM          = L"sdef";
+wstring const Compiler::COMPILER_N_ATTR             = L"n";
+wstring const Compiler::COMPILER_PARDEFS_ELEM       = L"pardefs";
+wstring const Compiler::COMPILER_PARDEF_ELEM        = L"pardef";
+wstring const Compiler::COMPILER_PAR_ELEM           = L"par";
+wstring const Compiler::COMPILER_ENTRY_ELEM         = L"e";
+wstring const Compiler::COMPILER_RESTRICTION_ATTR   = L"r";
+wstring const Compiler::COMPILER_RESTRICTION_LR_VAL = L"LR";
+wstring const Compiler::COMPILER_RESTRICTION_RL_VAL = L"RL";
+wstring const Compiler::COMPILER_PAIR_ELEM          = L"p";
+wstring const Compiler::COMPILER_LEFT_ELEM          = L"l";
+wstring const Compiler::COMPILER_RIGHT_ELEM         = L"r";
+wstring const Compiler::COMPILER_S_ELEM             = L"s";
+wstring const Compiler::COMPILER_REGEXP_ELEM        = L"re";
+wstring const Compiler::COMPILER_SECTION_ELEM       = L"section";
+wstring const Compiler::COMPILER_ID_ATTR            = L"id";
+wstring const Compiler::COMPILER_TYPE_ATTR	    = L"type";
+wstring const Compiler::COMPILER_IDENTITY_ELEM      = L"i";
+wstring const Compiler::COMPILER_JOIN_ELEM	    = L"j";
+wstring const Compiler::COMPILER_BLANK_ELEM	    = L"b";
+wstring const Compiler::COMPILER_POSTGENERATOR_ELEM = L"a";
+wstring const Compiler::COMPILER_GROUP_ELEM         = L"g";
+wstring const Compiler::COMPILER_LEMMA_ATTR         = L"lm";
+wstring const Compiler::COMPILER_IGNORE_ATTR        = L"i";
+wstring const Compiler::COMPILER_IGNORE_YES_VAL     = L"yes";
+wstring const Compiler::COMPILER_ALT_ATTR           = L"alt";
+wstring const Compiler::COMPILER_V_ATTR             = L"v";
+wstring const Compiler::COMPILER_VL_ATTR            = L"vl";
+wstring const Compiler::COMPILER_VR_ATTR            = L"vr";
+
+Compiler::Compiler() :
+reader(0),
+verbose(false),
+first_element(false),
+acx_current_char(0)
+{
+}
+
+Compiler::~Compiler()
+{
+}
+
+void
+Compiler::parseACX(string const &fichero, wstring const &dir)
+{
+  if(dir == COMPILER_RESTRICTION_LR_VAL)
+  {
+    reader = xmlReaderForFile(fichero.c_str(), NULL, 0);
+    if(reader == NULL)
+    {
+      wcerr << "Error: cannot open '" << fichero << "'." << endl;
+      exit(EXIT_FAILURE);
+    }
+    int ret = xmlTextReaderRead(reader);
+    while(ret == 1)
+    {
+      procNodeACX();
+      ret = xmlTextReaderRead(reader);
+    }
+  }
+}
+
+void
+Compiler::parse(string const &fichero, wstring const &dir)
+{
+  direction = dir;
+  reader = xmlReaderForFile(fichero.c_str(), NULL, 0);
+  if(reader == NULL)
+  {
+    wcerr << "Error: Cannot open '" << fichero << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  int ret = xmlTextReaderRead(reader);
+  while(ret == 1)
+  {
+    procNode();
+    ret = xmlTextReaderRead(reader);
+  }
+
+  if(ret != 0)
+  {
+    wcerr << L"Error: Parse error at the end of input." << endl;
+  }
+
+  xmlFreeTextReader(reader);
+  xmlCleanupParser();
+
+ 
+  // Minimize transducers 
+  for(map<wstring, Transducer, Ltstr>::iterator it = sections.begin(),
+                                               limit = sections.end(); 
+      it != limit; it++)
+  {
+    (it->second).minimize();
+  }
+}
+
+
+void
+Compiler::procAlphabet()
+{
+  int tipo=xmlTextReaderNodeType(reader);
+
+  if(tipo != XML_READER_TYPE_END_ELEMENT)
+  {
+    int ret = xmlTextReaderRead(reader);
+    if(ret == 1)
+    {          
+      xmlChar const *valor = xmlTextReaderConstValue(reader);
+      letters = XMLParseUtil::towstring(valor);
+      bool espai = true;
+      for(unsigned int i = 0; i < letters.length(); i++)  
+      {
+        if(!isspace(letters.at(i))) 
+        {
+          espai = false;
+          break;
+        }
+      }
+      if(espai == true)  // libxml2 returns '\n' for <alphabet></alphabet>, should be empty
+      {
+        letters = L"";
+      } 
+    }
+    else
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Missing alphabet symbols." << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+}
+
+void
+Compiler::procSDef()
+{
+  alphabet.includeSymbol(L"<"+attrib(COMPILER_N_ATTR)+L">");
+}
+
+void
+Compiler::procParDef()
+{
+  int tipo=xmlTextReaderNodeType(reader);
+
+  if(tipo != XML_READER_TYPE_END_ELEMENT)
+  {
+    current_paradigm = attrib(COMPILER_N_ATTR);
+  }
+  else
+  {
+    if(!paradigms[current_paradigm].isEmpty())
+    {
+      paradigms[current_paradigm].minimize();
+      paradigms[current_paradigm].joinFinals();
+      current_paradigm = L"";
+    }
+  }
+}
+
+int
+Compiler::matchTransduction(list<int> const &pi, 
+				 list<int> const &pd, 
+				 int estado, Transducer &t)
+{
+  list<int>::const_iterator izqda, dcha, limizqda, limdcha;
+
+  if(direction == COMPILER_RESTRICTION_LR_VAL)
+  {
+    izqda = pi.begin();
+    dcha = pd.begin();
+    limizqda = pi.end();
+    limdcha = pd.end();
+  }
+  else
+  {
+    izqda = pd.begin();
+    dcha = pi.begin();
+    limizqda = pd.end();
+    limdcha = pi.end();
+  }
+ 
+
+  if(pi.size() == 0 && pd.size() == 0)
+  {
+    estado = t.insertNewSingleTransduction(alphabet(0, 0), estado);
+  }
+  else
+  {
+    map<int, set<int> >::iterator acx_map_ptr;
+    int rsymbol = 0;
+
+    while(true)
+    {
+      int etiqueta;
+      
+      acx_map_ptr = acx_map.end();
+      
+      if(izqda == limizqda && dcha == limdcha)
+      {
+        break;
+      }
+      else if(izqda == limizqda)
+      {
+        etiqueta = alphabet(0, *dcha);
+        dcha++;
+      }
+      else if(dcha == limdcha)
+      {
+        etiqueta = alphabet(*izqda, 0);
+        acx_map_ptr = acx_map.find(*izqda);
+        rsymbol = 0;
+        izqda++;
+      }
+      else
+      {
+        etiqueta = alphabet(*izqda, *dcha);
+        acx_map_ptr = acx_map.find(*izqda);
+        rsymbol = *dcha;
+        izqda++;
+        dcha++;
+      }
+
+      int nuevo_estado = t.insertSingleTransduction(etiqueta, estado);
+      
+      if(acx_map_ptr != acx_map.end())
+      {
+        for(set<int>::iterator it = acx_map_ptr->second.begin(); 
+            it != acx_map_ptr->second.end(); it++)
+        { 
+          t.linkStates(estado, nuevo_estado, alphabet(*it ,rsymbol));
+        }
+      }
+      estado = nuevo_estado;
+    }
+  }
+
+  return estado;
+}
+
+
+void
+Compiler::requireEmptyError(wstring const &name)
+{
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Non-empty element '<" << name << L">' should be empty." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+bool 
+Compiler::allBlanks()
+{
+  bool flag = true;
+  wstring text = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+  
+  for(unsigned int i = 0, limit = text.size(); i < limit; i++)
+  {
+    flag = flag && iswspace(text[i]);
+  }
+  
+  return flag;
+}
+
+void 
+Compiler::readString(list<int> &result, wstring const &name)
+{
+  if(name == L"#text")
+  {
+    wstring value = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+    for(unsigned int i = 0, limit = value.size(); i < limit; i++)
+    {
+      result.push_back(static_cast<int>(value[i]));
+    }
+  }
+  else if(name == COMPILER_BLANK_ELEM)
+  {
+    requireEmptyError(name);
+    result.push_back(static_cast<int>(L' '));
+  }
+  else if(name == COMPILER_JOIN_ELEM)
+  {
+    requireEmptyError(name);
+    result.push_back(static_cast<int>(L'+'));
+  }
+  else if(name == COMPILER_POSTGENERATOR_ELEM)
+  {
+    requireEmptyError(name);
+    result.push_back(static_cast<int>(L'~'));
+  }
+  else if(name == COMPILER_GROUP_ELEM)
+  {
+    int tipo=xmlTextReaderNodeType(reader);
+    if(tipo != XML_READER_TYPE_END_ELEMENT)
+    {
+      result.push_back(static_cast<int>(L'#'));
+    }
+  }
+  else if(name == COMPILER_S_ELEM)
+  {
+    requireEmptyError(name);
+    wstring symbol = L"<" + attrib(COMPILER_N_ATTR) + L">";
+
+    if(!alphabet.isSymbolDefined(symbol))
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Undefined symbol '" << symbol << L"'." << endl;
+      exit(EXIT_FAILURE);
+    }
+    
+    result.push_back(alphabet(symbol));
+  }
+  else
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Invalid specification of element '<" << name;
+    wcerr << L">' in this context." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+void
+Compiler::skipBlanks(wstring &name)
+{
+  while(name == L"#text" || name == L"#comment")
+  {
+    if(name != L"#comment")
+    {
+      if(!allBlanks())
+      {
+        wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader); 
+        wcerr << L"): Invalid construction." << endl;
+        exit(EXIT_FAILURE);
+      }
+    }
+    
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  }
+}
+
+void
+Compiler::skip(wstring &name, wstring const &elem)
+{
+  skip(name, elem, true);
+}
+
+void
+Compiler::skip(wstring &name, wstring const &elem, bool open)
+{
+  xmlTextReaderRead(reader);
+  name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  wstring slash;
+
+  if(!open)
+  {
+    slash = L"/";
+  }
+  
+  while(name == L"#text" || name == L"#comment")
+  {
+    if(name != L"#comment")
+    {
+      if(!allBlanks())
+      {
+        wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+        wcerr << L"): Invalid construction." << endl;
+        exit(EXIT_FAILURE);
+      }
+    }
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));  
+  }    
+    
+  if(name != elem)
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Expected '<" << slash << elem << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+EntryToken
+Compiler::procIdentity()
+{
+  list<int> both_sides;
+
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    wstring name = L"";
+
+    while(true)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+      if(name == COMPILER_IDENTITY_ELEM)
+      {
+        break;
+      }
+      readString(both_sides, name);
+    }
+  }
+  
+  if(verbose && first_element && (both_sides.front() == (int)L' ')) 
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Entry begins with space." << endl; 
+  }
+  first_element = false; 
+  EntryToken e;
+  e.setSingleTransduction(both_sides, both_sides);
+  return e;
+}
+
+EntryToken
+Compiler::procTransduction()
+{
+  list<int> lhs, rhs;
+  wstring name;
+  
+  skip(name, COMPILER_LEFT_ELEM);
+
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    name = L"";
+    while(true)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+      if(name == COMPILER_LEFT_ELEM)
+      {
+        break;
+      }
+      readString(lhs, name);
+    }
+  }
+
+  if(verbose && first_element && (lhs.front() == (int)L' ')) 
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Entry begins with space." << endl;
+  }
+  first_element = false;
+ 
+  skip(name, COMPILER_RIGHT_ELEM);
+
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    name = L"";
+    while(true)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+      if(name == COMPILER_RIGHT_ELEM)
+      {
+        break;
+      }
+      readString(rhs, name);
+    }    
+  }
+
+  skip(name, COMPILER_PAIR_ELEM, false);
+  
+  EntryToken e;
+  e.setSingleTransduction(lhs, rhs);
+  return e;
+}
+
+wstring
+Compiler::attrib(wstring const &name)
+{
+  return XMLParseUtil::attrib(reader, name);
+} 
+
+EntryToken
+Compiler::procPar()
+{
+  EntryToken e;
+  wstring nomparadigma = attrib(COMPILER_N_ATTR);
+  first_element = false;
+
+  if(current_paradigm != L"" && nomparadigma == current_paradigm)
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Paradigm refers to itself '" << nomparadigma << L"'." <<endl;
+    exit(EXIT_FAILURE);
+  }
+
+  if(paradigms.find(nomparadigma) == paradigms.end())
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Undefined paradigm '" << nomparadigma << L"'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  e.setParadigm(nomparadigma);
+  return e;
+}
+
+void
+Compiler::insertEntryTokens(vector<EntryToken> const &elements)
+{
+  if(current_paradigm != L"")
+  {
+    // compilation of paradigms
+    Transducer &t = paradigms[current_paradigm];
+    int e = t.getInitial();
+    
+    for(unsigned int i = 0, limit = elements.size(); i < limit; i++)
+    {
+      if(elements[i].isParadigm())
+      {
+	e = t.insertTransducer(e, paradigms[elements[i].paradigmName()]);
+      }
+      else if(elements[i].isSingleTransduction())
+      {
+        e = matchTransduction(elements[i].left(), 
+                                  elements[i].right(), e, t);
+      }
+      else if(elements[i].isRegexp())
+      {
+	RegexpCompiler analyzer;
+	analyzer.initialize(&alphabet);
+	analyzer.compile(elements[i].regExp());
+	e = t.insertTransducer(e, analyzer.getTransducer(), alphabet(0,0));
+      }
+      else
+      {
+        wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+        wcerr << L"): Invalid entry token." << endl;
+        exit(EXIT_FAILURE);
+      }
+    }
+    t.setFinal(e);
+  }
+  else
+  {
+    // compilaci�n de dictionary
+
+    Transducer &t = sections[current_section];
+    int e = t.getInitial();
+
+    for(unsigned int i = 0, limit = elements.size(); i < limit; i++)
+    {
+      if(elements[i].isParadigm())
+      {
+        if(i == elements.size()-1)
+	{
+	  // paradigma sufijo
+	  if(suffix_paradigms[current_section].find(elements[i].paradigmName()) != suffix_paradigms[current_section].end())
+	  {
+	    t.linkStates(e, suffix_paradigms[current_section][elements[i].paradigmName()], 0);
+            e = postsuffix_paradigms[current_section][elements[i].paradigmName()];
+	  }
+          else
+          {
+            e = t.insertNewSingleTransduction(alphabet(0, 0), e);
+            suffix_paradigms[current_section][elements[i].paradigmName()] = e;
+            e = t.insertTransducer(e, paradigms[elements[i].paradigmName()]);
+            postsuffix_paradigms[current_section][elements[i].paradigmName()] = e;
+	  }
+	}
+        else if(i == 0)
+	{
+          // paradigma prefijo
+	  if(prefix_paradigms[current_section].find(elements[i].paradigmName()) != prefix_paradigms[current_section].end())
+	  {
+            e = prefix_paradigms[current_section][elements[i].paradigmName()];
+	  }
+	  else
+	  {
+            e = t.insertTransducer(e, paradigms[elements[i].paradigmName()]);
+            prefix_paradigms[current_section][elements[i].paradigmName()] = e;
+	  }
+        }
+	else
+	{
+          // paradigma intermedio
+          e = t.insertTransducer(e, paradigms[elements[i].paradigmName()]);
+	}
+      }
+      else if(elements[i].isRegexp())
+      {
+	RegexpCompiler analyzer;
+	analyzer.initialize(&alphabet);
+	analyzer.compile(elements[i].regExp());
+	e = t.insertTransducer(e, analyzer.getTransducer(), alphabet(0,0));
+      }
+      else
+      {
+        e = matchTransduction(elements[i].left(), elements[i].right(), e, t);
+      }
+    }
+    t.setFinal(e);
+  }
+}
+
+
+void
+Compiler::requireAttribute(wstring const &value, wstring const &attrname,
+                           wstring const &elemname)
+{
+  if(value == L"")
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);  
+    wcerr << L"): '<" << elemname;
+    wcerr << L"' element must specify non-void '";
+    wcerr << attrname << L"' attribute." << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+
+void
+Compiler::procSection()
+{
+  int tipo=xmlTextReaderNodeType(reader);
+
+  if(tipo != XML_READER_TYPE_END_ELEMENT)
+  {
+    wstring const &id = attrib(COMPILER_ID_ATTR);
+    wstring const &type = attrib(COMPILER_TYPE_ATTR);
+    requireAttribute(id, COMPILER_ID_ATTR, COMPILER_SECTION_ELEM);
+    requireAttribute(type, COMPILER_TYPE_ATTR, COMPILER_SECTION_ELEM);
+    
+    current_section = id;
+    current_section += L"@";
+    current_section.append(type);
+  }
+  else
+  {
+    current_section = L"";
+  }
+}
+
+void
+Compiler::procEntry()
+{
+  wstring atributo=this->attrib(COMPILER_RESTRICTION_ATTR);
+  wstring ignore = this->attrib(COMPILER_IGNORE_ATTR);
+  wstring altval = this->attrib(COMPILER_ALT_ATTR);
+  wstring varval = this->attrib(COMPILER_V_ATTR);
+  wstring varl   = this->attrib(COMPILER_VL_ATTR);
+  wstring varr   = this->attrib(COMPILER_VR_ATTR);
+
+  //�if entry is masked by a restriction of direction or an ignore mark
+  if((atributo != L"" && atributo != direction) 
+   || ignore == COMPILER_IGNORE_YES_VAL
+   || (altval != L"" && altval != alt)
+   || (direction == COMPILER_RESTRICTION_RL_VAL && varval != L"" && varval != variant)
+   || (direction == COMPILER_RESTRICTION_RL_VAL && varl != L"" && varl != variant_left)
+   || (direction == COMPILER_RESTRICTION_LR_VAL && varr != L"" && varr != variant_right))
+  {
+    // parse to the end of the entry
+    wstring name = L"";
+
+    while(name != COMPILER_ENTRY_ELEM)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+    }
+
+    return;
+  }
+
+  vector<EntryToken> elements;
+
+  while(true)
+  {
+    int ret = xmlTextReaderRead(reader);
+    if(ret != 1)
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Parse error." << endl;
+      exit(EXIT_FAILURE);
+    }
+    wstring name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+    skipBlanks(name);
+
+    if(current_paradigm == L"" && verbose)
+    {
+      first_element = true;
+    }
+
+    int tipo = xmlTextReaderNodeType(reader);
+    if(name == COMPILER_PAIR_ELEM)
+    {      
+      elements.push_back(procTransduction());
+    }
+    else if(name == COMPILER_IDENTITY_ELEM)
+    {
+      elements.push_back(procIdentity());
+    }
+    else if(name == COMPILER_REGEXP_ELEM)
+    {
+      elements.push_back(procRegexp());
+    }
+    else if(name == COMPILER_PAR_ELEM)
+    {
+      elements.push_back(procPar());
+
+      // detecci�n del uso de paradigmas no definidos
+
+      wstring const &p = elements.rbegin()->paradigmName();
+
+      if(paradigms.find(p) == paradigms.end())
+      {
+        wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+        wcerr << L"): Undefined paradigm '" << p << L"'." <<endl;
+        exit(EXIT_FAILURE);
+      }
+      // descartar entradas con paradigms vac�os (por las direciones,
+      // normalmente
+      if(paradigms[p].isEmpty())
+      {
+        while(name != COMPILER_ENTRY_ELEM || tipo != XML_READER_TYPE_END_ELEMENT)
+        {
+          xmlTextReaderRead(reader);
+          name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+          tipo = xmlTextReaderNodeType(reader);
+        }
+        return;
+      }
+    }
+    else if(name == COMPILER_ENTRY_ELEM && tipo == XML_READER_TYPE_END_ELEMENT)
+    {
+      // insertar elements into letter transducer
+      insertEntryTokens(elements);
+      return;
+    }
+    else if(name == L"#text" && allBlanks())
+    {
+    }
+    else
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Invalid inclusion of '<" << name << L">' into '<" << COMPILER_ENTRY_ELEM;
+      wcerr << L">'." << endl; 
+      exit(EXIT_FAILURE);
+    }
+  }
+}
+
+void
+Compiler::procNodeACX()
+{
+  xmlChar  const *xnombre = xmlTextReaderConstName(reader);
+  wstring nombre = XMLParseUtil::towstring(xnombre);
+  if(nombre == L"#text")
+  {
+    /* ignore */
+  }
+  else if(nombre == L"analysis-chars")
+  {
+    /* ignore */
+  }
+  else if(nombre == L"char")
+  {
+    acx_current_char = static_cast<int>(attrib(L"value")[0]);
+  }
+  else if(nombre == L"equiv-char")
+  {
+    acx_map[acx_current_char].insert(static_cast<int>(attrib(L"value")[0]));
+  }
+  else if(nombre == L"#comment")
+  {
+    /* ignore */
+  }
+  else
+  {
+    wcerr << L"Error in ACX file (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Invalid node '<" << nombre << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+void
+Compiler::procNode()
+{
+  xmlChar const *xnombre = xmlTextReaderConstName(reader);
+  wstring nombre = XMLParseUtil::towstring(xnombre);
+
+  // HACER: optimizar el orden de ejecuci�n de esta ristra de "ifs"
+
+  if(nombre == L"#text")
+  {
+    /* ignorar */
+  }
+  else if(nombre == COMPILER_DICTIONARY_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == COMPILER_ALPHABET_ELEM)
+  {
+    procAlphabet();
+  }
+  else if(nombre == COMPILER_SDEFS_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == COMPILER_SDEF_ELEM)
+  {
+    procSDef();
+  }
+  else if(nombre == COMPILER_PARDEFS_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == COMPILER_PARDEF_ELEM)
+  {
+    procParDef();
+  }
+  else if(nombre == COMPILER_ENTRY_ELEM)
+  {
+    procEntry();
+  }
+  else if(nombre == COMPILER_SECTION_ELEM)
+  {
+    procSection();
+  }
+  else if(nombre== L"#comment")
+  {
+    /* ignorar */
+  }
+  else
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Invalid node '<" << nombre << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+EntryToken
+Compiler::procRegexp()
+{
+  EntryToken et;
+  xmlTextReaderRead(reader);
+  wstring re = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+  et.setRegexp(re);
+  xmlTextReaderRead(reader);
+  return et;
+}
+
+void 
+Compiler::write(FILE *output)
+{
+  // letters
+  Compression::wstring_write(letters, output);
+  
+  // symbols
+  alphabet.write(output);
+  
+  // transducers
+  Compression::multibyte_write(sections.size(), output);
+
+  int conta=0;
+  for(map<wstring, Transducer, Ltstr>::iterator it = sections.begin(),
+                                               limit = sections.end(); 
+      it != limit; it++)
+  {
+    conta++;
+    wcout << it->first << " " << it->second.size();
+    wcout << " " << it->second.numberOfTransitions() << endl;
+    Compression::wstring_write(it->first, output);
+    it->second.write(output);
+  }
+}
+
+void
+Compiler::setAltValue(string const &a)
+{
+  alt = XMLParseUtil::stows(a);
+}
+
+void
+Compiler::setVariantValue(string const &v)
+{
+  variant = XMLParseUtil::stows(v);
+}
+
+void
+Compiler::setVariantLeftValue(string const &v)
+{
+  variant_left = XMLParseUtil::stows(v);
+}
+
+void
+Compiler::setVariantRightValue(string const &v)
+{
+  variant_right = XMLParseUtil::stows(v);
+}
+
+void
+Compiler::setVerbose(bool verbosity)
+{
+  verbose = verbosity;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compression.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compression.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compression.cc	(revision 70339)
@@ -0,0 +1,301 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/compression.h>
+#include <lttoolbox/my_stdio.h>
+
+#include <cstdlib>
+#include <iostream>
+
+void 
+Compression::writeByte(unsigned char byte, FILE *output)
+{
+  if(fwrite_unlocked(&byte, 1, 1, output) != 1)
+  {
+    wcerr << L"I/O Error writing" << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+unsigned char
+Compression::readByte(FILE *input)
+{
+  unsigned char value;
+  if(fread_unlocked(&value, 1, 1, input) != 1)
+  {
+//    Not uncomment this code since
+//    wcerr << L"I/O Error reading" << endl;
+//    exit(EXIT_FAILURE);
+  }
+
+  return value;
+}
+
+void
+Compression::multibyte_write(unsigned int value, FILE *output)
+{
+  if(value < 0x00000040)
+  {
+    unsigned char byte = (unsigned char) value;
+    writeByte(byte, output);
+  }
+  else if(value < 0x00004000)
+  {
+    unsigned char low = (unsigned char) value;
+    unsigned char up =  (unsigned char) (value >> 8);
+    up = up | 0x40;
+    writeByte(up, output);
+    writeByte(low, output);
+  }
+  else if(value < 0x00400000)
+  {
+    unsigned char low = (unsigned char) value;
+    unsigned char middle = (unsigned char) (value >> 8);
+    unsigned char up = (unsigned char) (value >> 16);
+    up = up | 0x80; 
+    writeByte(up, output);
+    writeByte(middle, output);
+    writeByte(low, output);
+  }
+  else if(value < 0x40000000)
+  {
+    unsigned char low = (unsigned char) value;
+    unsigned char middlelow = (unsigned char) (value >> 8);
+    unsigned char middleup = (unsigned char) (value >> 16);
+    unsigned char up = (unsigned char) (value >> 24);
+    up = up | 0xc0; 
+    writeByte(up, output);
+    writeByte(middleup, output);
+    writeByte(middlelow, output);
+    writeByte(low, output);
+  }
+  else
+  {
+    wcerr << L"Out of range: " << value << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+void
+Compression::multibyte_write(unsigned int value, ostream &output)
+{
+  if(value < 0x00000040)
+  {
+    unsigned char byte = (unsigned char) value;
+    output.write(reinterpret_cast<char *>(&byte), sizeof(char));
+  }
+  else if(value < 0x00004000)
+  {
+    unsigned char low = (unsigned char) value;
+    unsigned char up =  (unsigned char) (value >> 8);
+    up = up | 0x40;
+    output.write(reinterpret_cast<char *>(&up), sizeof(char));
+    output.write(reinterpret_cast<char *>(&low), sizeof(char));
+  }
+  else if(value < 0x00400000)
+  {
+    unsigned char low = (unsigned char) value;
+    unsigned char middle = (unsigned char) (value >> 8);
+    unsigned char up = (unsigned char) (value >> 16);
+    up = up | 0x80; 
+    output.write(reinterpret_cast<char *>(&up), sizeof(char));
+    output.write(reinterpret_cast<char *>(&middle), sizeof(char));
+    output.write(reinterpret_cast<char *>(&low), sizeof(char));
+    
+  }
+  else if(value < 0x40000000)
+  {
+    unsigned char low = (unsigned char) value;
+    unsigned char middlelow = (unsigned char) (value >> 8);
+    unsigned char middleup = (unsigned char) (value >> 16);
+    unsigned char up = (unsigned char) (value >> 24);
+    up = up | 0xc0; 
+
+    output.write(reinterpret_cast<char *>(&up), sizeof(char));
+    output.write(reinterpret_cast<char *>(&middleup), sizeof(char));
+    output.write(reinterpret_cast<char *>(&middlelow), sizeof(char));
+    output.write(reinterpret_cast<char *>(&low), sizeof(char));
+  }
+  else
+  {
+    wcerr << "Out of range: " << value << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+
+unsigned int
+Compression::multibyte_read(FILE *input)
+{
+  unsigned int result = 0;
+
+  unsigned char up = readByte(input);
+  if(up < 0x40)
+  {
+    result = (unsigned int) up;
+  }
+  else if(up < 0x80)
+  {
+    up = up & 0x3f;
+    unsigned int aux = (unsigned int) up;
+    aux = aux << 8;
+    unsigned char low = readByte(input);
+    result = (unsigned int) low;
+    result = result | aux;
+  }
+  else if(up < 0xc0)
+  {
+    up = up & 0x3f;
+    unsigned int aux = (unsigned int) up;
+    aux = aux << 8;
+    unsigned char middle = readByte(input);
+    result = (unsigned int) middle;
+    aux = result | aux;
+    aux = aux << 8;
+    unsigned char low = readByte(input);
+    result = (unsigned int) low;
+    result = result | aux;
+  }
+  else
+  {
+    up = up & 0x3f;
+    unsigned int aux = (unsigned int) up;
+    aux = aux << 8;
+    unsigned char middleup = readByte(input);
+    result = (unsigned int) middleup;
+    aux = result | aux;
+    aux = aux << 8;
+    unsigned char middlelow = readByte(input);
+    result = (unsigned int) middlelow;
+    aux = result | aux;
+    aux = aux << 8;
+    unsigned char low = readByte(input);
+    result = (unsigned int) low;
+    result = result | aux;
+  }
+   
+  return result;
+}
+
+unsigned int
+Compression::multibyte_read(istream &input)
+{
+  unsigned char up;
+  unsigned int result = 0;
+
+  input.read(reinterpret_cast<char *>(&up), sizeof(char));
+  if(up < 0x40)
+  {
+    result = (unsigned int) up;
+  }
+  else if(up < 0x80)
+  {
+    up = up & 0x3f;
+    unsigned int aux = (unsigned int) up;
+    aux = aux << 8;
+    unsigned char low;
+    input.read(reinterpret_cast<char *>(&low), sizeof(char));
+    result = (unsigned int) low;
+    result = result | aux;
+  }
+  else if(up < 0xc0)
+  {
+    up = up & 0x3f;
+    unsigned int aux = (unsigned int) up;
+    aux = aux << 8;
+    unsigned char middle;
+    input.read(reinterpret_cast<char *>(&middle), sizeof(char));
+    result = (unsigned int) middle;
+    aux = result | aux;
+    aux = aux << 8;
+    unsigned char low;
+    input.read(reinterpret_cast<char *>(&low), sizeof(char));
+    result = (unsigned int) low;
+    result = result | aux;
+  }
+  else
+  {
+    up = up & 0x3f;
+    unsigned int aux = (unsigned int) up;
+    aux = aux << 8;
+    unsigned char middleup;
+    input.read(reinterpret_cast<char *>(&middleup), sizeof(char));
+    result = (unsigned int) middleup;
+    aux = result | aux;
+    aux = aux << 8;
+    unsigned char middlelow;
+    input.read(reinterpret_cast<char *>(&middlelow), sizeof(char));
+    result = (unsigned int) middlelow;
+    aux = result | aux;
+    aux = aux << 8;
+    unsigned char low;
+    input.read(reinterpret_cast<char *>(&low), sizeof(char));
+    result = (unsigned int) low;
+    result = result | aux;
+  }
+   
+  return result;
+}
+
+
+void
+Compression::wstring_write(wstring const &str, FILE *output)
+{
+  Compression::multibyte_write(str.size(), output);
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(static_cast<int>(str[i]), output);
+  }
+}
+
+wstring
+Compression::wstring_read(FILE *input)
+{
+  wstring retval = L"";
+
+  for(unsigned int i = 0, limit = Compression::multibyte_read(input);
+      i != limit; i++)
+  {
+    retval += static_cast<wchar_t>(Compression::multibyte_read(input));
+  }
+
+  return retval;
+}
+
+void
+Compression::string_write(string const &str, FILE *output)
+{
+  Compression::multibyte_write(str.size(), output);
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(static_cast<int>(str[i]), output);
+  }
+}
+
+string
+Compression::string_read(FILE *input)
+{
+  string retval = "";
+
+  for(unsigned int i = 0, limit = Compression::multibyte_read(input);
+      i != limit; i++)
+  {
+    retval += static_cast<char>(Compression::multibyte_read(input));
+  }
+  
+  return retval;
+}
+
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/expander.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/expander.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/expander.cc	(revision 70339)
@@ -0,0 +1,636 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <lttoolbox/compiler.h>
+#include <lttoolbox/expander.h>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/my_stdio.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libxml/encoding.h>
+
+#ifdef _WIN32
+#include <utf8_fwrap.hpp>
+#endif
+
+using namespace std;
+
+Expander::Expander() :
+reader(0)
+{
+  LtLocale::tryToSetLocale();
+}
+
+Expander::~Expander()
+{
+}
+
+void
+Expander::expand(string const &fichero, FILE *output)
+{
+  reader = xmlReaderForFile(fichero.c_str(), NULL, 0);
+  if(reader == NULL)
+  {
+    wcerr << "Error: Cannot open '" << fichero << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  int ret = xmlTextReaderRead(reader);
+  while(ret == 1)
+  {
+    procNode(output);
+    ret = xmlTextReaderRead(reader);
+  }
+
+  if(ret != 0)
+  {
+    wcerr << L"Error: Parse error at the end of input." << endl;
+  }
+
+  xmlFreeTextReader(reader);
+  xmlCleanupParser();
+}
+
+void
+Expander::procParDef()
+{
+  int tipo=xmlTextReaderNodeType(reader);
+
+  if(tipo != XML_READER_TYPE_END_ELEMENT)
+  {
+    current_paradigm = attrib(Compiler::COMPILER_N_ATTR);
+  }
+  else
+  {
+    current_paradigm = L"";
+  }
+}
+
+void
+Expander::requireEmptyError(wstring const &name)
+{
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Non-empty element '<" << name << L">' should be empty." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+bool 
+Expander::allBlanks()
+{
+  bool flag = true;
+  wstring text = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+  
+  for(unsigned int i = 0, limit = text.size(); i < limit; i++)
+  {
+    flag = flag && isspace(text[i]);
+  }
+  
+  return flag;
+}
+
+void 
+Expander::readString(wstring &result, wstring const &name)
+{
+  if(name == L"#text")
+  {
+    wstring value = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+    result.append(value);
+  }
+  else if(name == Compiler::COMPILER_BLANK_ELEM)
+  {
+    requireEmptyError(name);
+    result += L' ';
+  }
+  else if(name == Compiler::COMPILER_JOIN_ELEM)
+  {
+    requireEmptyError(name);
+    result += L'+';
+  }
+  else if(name == Compiler::COMPILER_POSTGENERATOR_ELEM)
+  {
+    requireEmptyError(name);
+    result += L'~';
+  }
+  else if(name == Compiler::COMPILER_GROUP_ELEM)
+  {
+    int tipo=xmlTextReaderNodeType(reader);
+    if(tipo != XML_READER_TYPE_END_ELEMENT)
+    {
+      result += L'#';
+    }
+  }
+  else if(name == Compiler::COMPILER_S_ELEM)
+  {
+    requireEmptyError(name);
+    result += L'<';
+    result.append(attrib(Compiler::COMPILER_N_ATTR));
+    result += L'>';
+  }
+  else
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Invalid specification of element '<" << name;
+    wcerr << L">' in this context." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+void
+Expander::skipBlanks(wstring &name)
+{
+  if(name == L"#text")
+  {
+    if(!allBlanks())
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader); 
+      wcerr << L"): Invalid construction." << endl;
+      exit(EXIT_FAILURE);
+    }
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  }
+}
+
+void
+Expander::skip(wstring &name, wstring const &elem)
+{
+  xmlTextReaderRead(reader);
+  name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  
+  if(name == L"#text")
+  {
+    if(!allBlanks())
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Invalid construction." << endl;
+      exit(EXIT_FAILURE);
+    }
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  }    
+    
+  if(name != elem)
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Expected '<" << elem << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+wstring
+Expander::procIdentity()
+{
+  wstring both_sides = L"";
+
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    wstring name = L"";
+
+    while(true)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+      if(name == Compiler::COMPILER_IDENTITY_ELEM)
+      {
+        break;
+      }
+      readString(both_sides, name);
+    }
+  }
+  return both_sides;  
+}
+
+pair<wstring, wstring>
+Expander::procTransduction()
+{
+  wstring lhs = L"", rhs = L""; 
+  wstring name = L"";
+  
+  skip(name, Compiler::COMPILER_LEFT_ELEM);
+
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    name = L"";
+    while(true)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+      if(name == Compiler::COMPILER_LEFT_ELEM)
+      {
+        break;
+      }
+      readString(lhs, name);
+    }
+  }
+ 
+  skip(name, Compiler::COMPILER_RIGHT_ELEM);
+
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    name = L"";
+    while(true)
+    {
+      xmlTextReaderRead(reader);
+      name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+      if(name == Compiler::COMPILER_RIGHT_ELEM)
+      {
+        break;
+      }
+      readString(rhs, name);
+    }    
+  }
+
+  skip(name, Compiler::COMPILER_PAIR_ELEM);  
+  
+  pair<wstring, wstring> e(lhs, rhs);
+  return e;
+}
+
+wstring
+Expander::attrib(wstring const &nombre)
+{
+  return XMLParseUtil::attrib(reader, nombre);
+} 
+
+wstring
+Expander::procPar()
+{
+  EntryToken e;
+  wstring nomparadigma = attrib(Compiler::COMPILER_N_ATTR);
+  return nomparadigma;
+}
+
+void
+Expander::requireAttribute(wstring const &value, wstring const &attrname,
+                           wstring const &elemname)
+{
+  if(value == L"")
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);  
+    wcerr << L"): '<" << elemname;
+    wcerr << L"' element must specify non-void '";
+    wcerr<< attrname << L"' attribute." << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+void
+Expander::procEntry(FILE *output)
+{
+  wstring atributo=this->attrib(Compiler::COMPILER_RESTRICTION_ATTR);
+  wstring entrname=this->attrib(Compiler::COMPILER_LEMMA_ATTR);
+  wstring altval = this->attrib(Compiler::COMPILER_ALT_ATTR);
+  wstring varval = this->attrib(Compiler::COMPILER_V_ATTR);
+  wstring varl   = this->attrib(Compiler::COMPILER_VL_ATTR);
+  wstring varr   = this->attrib(Compiler::COMPILER_VR_ATTR);
+  
+  wstring myname = L"";
+  if(this->attrib(Compiler::COMPILER_IGNORE_ATTR) == L"yes"
+   || altval != L"" && altval != alt
+   || (varval != L"" && varval != variant && atributo == Compiler::COMPILER_RESTRICTION_RL_VAL)
+   || ((varl != L"" && varl != variant_left) && (varr != L"" && varr != variant_right))
+   || (varl != L"" && varl != variant_left && atributo == Compiler::COMPILER_RESTRICTION_RL_VAL)
+   || (varr != L"" && varr != variant_right && atributo == Compiler::COMPILER_RESTRICTION_LR_VAL))
+  {    
+    do
+    {
+      int ret = xmlTextReaderRead(reader);
+      if(ret != 1)
+      {
+        wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+        wcerr << L"): Parse error." << endl;
+        exit(EXIT_FAILURE);
+      }
+      myname = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+     // wcerr << L"Hola " << myname << L" " << Compiler::COMPILER_ENTRY_ELEM << endl;
+    }
+    while(myname != Compiler::COMPILER_ENTRY_ELEM);
+    return;
+  }
+  
+  EntList items, items_lr, items_rl;
+  if(atributo == Compiler::COMPILER_RESTRICTION_LR_VAL 
+   || (varval != L"" && varval != variant && atributo != Compiler::COMPILER_RESTRICTION_RL_VAL)
+   || varl != L"" && varl != variant_left)
+  {
+    items_lr.push_back(pair<wstring, wstring>(L"", L""));
+  }
+  else if(atributo == Compiler::COMPILER_RESTRICTION_RL_VAL
+        || (varr != L"" && varr != variant_right))
+  {
+    items_rl.push_back(pair<wstring, wstring>(L"", L""));
+  }
+  else
+  {
+    items.push_back(pair<wstring, wstring>(L"", L""));
+  }
+
+  while(true)
+  {
+    int ret = xmlTextReaderRead(reader);
+    if(ret != 1)
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Parse error." << endl;
+      exit(EXIT_FAILURE);
+    }
+    wstring name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+    skipBlanks(name);
+
+    int tipo = xmlTextReaderNodeType(reader);
+    if(name == Compiler::COMPILER_PAIR_ELEM)
+    {      
+      pair<wstring, wstring> p = procTransduction();
+      append(items, p);
+      append(items_lr, p);
+      append(items_rl, p);
+    }
+    else if(name == Compiler::COMPILER_IDENTITY_ELEM)
+    {
+      wstring val = procIdentity();
+      append(items, val);
+      append(items_lr, val);
+      append(items_rl, val);
+    }
+    else if(name == Compiler::COMPILER_REGEXP_ELEM)
+    {
+      wstring val = L"__REGEXP__" + procRegexp();
+      append(items, val);
+      append(items_lr, val);
+      append(items_rl, val);
+    }
+    else if(name == Compiler::COMPILER_PAR_ELEM)
+    {
+      wstring p = procPar();
+      // detecci�n del uso de paradigmas no definidos
+
+      if(paradigm.find(p) == paradigm.end() &&
+         paradigm_lr.find(p) == paradigm_lr.end() &&
+         paradigm_rl.find(p) == paradigm_rl.end())
+      {
+        wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+        wcerr << L"): Undefined paradigm '" << p << L"'." <<endl;
+        exit(EXIT_FAILURE);
+      }
+      
+      if(atributo == Compiler::COMPILER_RESTRICTION_LR_VAL)
+      {
+        if(paradigm[p].size() == 0 && paradigm_lr[p].size() == 0)
+        {
+          skip(name, Compiler::COMPILER_ENTRY_ELEM);
+          return;
+        }
+        EntList first = items_lr;
+        append(first, paradigm[p]);
+        append(items_lr, paradigm_lr[p]);
+        items_lr.insert(items_lr.end(), first.begin(), first.end());
+      }
+      else if(atributo == Compiler::COMPILER_RESTRICTION_RL_VAL)
+      {
+        if(paradigm[p].size() == 0 && paradigm_rl[p].size() == 0)
+        {
+          skip(name, Compiler::COMPILER_ENTRY_ELEM);
+          return;
+        }
+        EntList first = items_rl;
+        append(first, paradigm[p]);
+        append(items_rl, paradigm_rl[p]);
+        items_rl.insert(items_rl.end(), first.begin(), first.end());
+      }
+      else
+      {
+        if(paradigm_lr[p].size() > 0)
+        {
+          items_lr.insert(items_lr.end(), items.begin(), items.end());
+        }
+        if(paradigm_rl[p].size() > 0)
+        {
+          items_rl.insert(items_rl.end(), items.begin(), items.end());
+        }
+        
+        EntList aux_lr = items_lr;
+        EntList aux_rl = items_rl;
+        append(aux_lr, paradigm[p]);
+        append(aux_rl, paradigm[p]);
+        append(items_lr, paradigm_lr[p]);
+        append(items_rl, paradigm_rl[p]);
+        append(items, paradigm[p]);
+        items_rl.insert(items_rl.end(), aux_rl.begin(), aux_rl.end());
+        items_lr.insert(items_lr.end(), aux_lr.begin(), aux_lr.end());
+      }
+    }
+    else if(name == Compiler::COMPILER_ENTRY_ELEM && tipo == XML_READER_TYPE_END_ELEMENT)
+    {
+      if(current_paradigm == L"")
+      {
+        for(EntList::iterator it = items.begin(),
+                                                 limit = items.end();
+            it != limit; it++)
+        {
+          fputws_unlocked(it->first.c_str(), output);
+          fputwc_unlocked(L':', output);
+          fputws_unlocked(it->second.c_str(), output);
+          fputwc_unlocked(L'\n', output);
+        }
+        for(EntList::iterator it = items_lr.begin(),
+                                                 limit = items_lr.end();
+            it != limit; it++)
+        {
+          fputws_unlocked(it->first.c_str(), output);
+          fputwc_unlocked(L':', output);
+          fputwc_unlocked(L'>', output);
+          fputwc_unlocked(L':', output);
+          fputws_unlocked(it->second.c_str(), output);
+          fputwc_unlocked(L'\n', output);
+        }
+        for(EntList::iterator it = items_rl.begin(),
+                                                 limit = items_rl.end();
+            it != limit; it++)
+        {
+          fputws_unlocked(it->first.c_str(), output);
+          fputwc_unlocked(L':', output);
+          fputwc_unlocked(L'<', output);
+          fputwc_unlocked(L':', output);
+          fputws_unlocked(it->second.c_str(), output);
+          fputwc_unlocked(L'\n', output);
+        }
+      }
+      else
+      {
+        paradigm_lr[current_paradigm].insert(paradigm_lr[current_paradigm].end(),
+                                             items_lr.begin(), items_lr.end());
+        paradigm_rl[current_paradigm].insert(paradigm_rl[current_paradigm].end(),
+                                             items_rl.begin(), items_rl.end());
+        paradigm[current_paradigm].insert(paradigm[current_paradigm].end(),
+                                          items.begin(), items.end());
+      }
+
+      return;
+    }
+    else if(name == L"#text" && allBlanks())
+    {
+    }
+    else if(name == L"#comment")
+    {
+    }
+    else
+    {
+      wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+      wcerr << L"): Invalid inclusion of '<" << name << L">' into '<" << Compiler::COMPILER_ENTRY_ELEM;
+      wcerr << L">'." << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+}
+
+void
+Expander::procNode(FILE *output)
+{
+  xmlChar const *xnombre = xmlTextReaderConstName(reader);
+  wstring nombre = XMLParseUtil::towstring(xnombre);
+
+  // HACER: optimizar el orden de ejecuci�n de esta ristra de "ifs"
+
+  if(nombre == L"#text")
+  {
+    /* ignorar */
+  }
+  else if(nombre == Compiler::COMPILER_DICTIONARY_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == Compiler::COMPILER_ALPHABET_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == Compiler::COMPILER_SDEFS_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == Compiler::COMPILER_SDEF_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == Compiler::COMPILER_PARDEFS_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == Compiler::COMPILER_PARDEF_ELEM)
+  {
+    procParDef();
+  }
+  else if(nombre == Compiler::COMPILER_ENTRY_ELEM)
+  {
+    procEntry(output);
+  }
+  else if(nombre == Compiler::COMPILER_SECTION_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == L"#comment")
+  {
+    /* ignorar */
+  }
+  else
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Invalid node '<" << nombre << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+wstring
+Expander::procRegexp()
+{
+  xmlTextReaderRead(reader);
+  wstring re = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+  xmlTextReaderRead(reader);
+  return re;
+}
+
+void
+Expander::append(EntList &result,
+		 EntList const &endings)
+{
+  EntList temp;
+  EntList::iterator it, limit;
+  EntList::const_iterator it2, limit2;
+
+  for(it = result.begin(), limit = result.end(); it != limit; it++)
+  {
+    for(it2 = endings.begin(), limit2 = endings.end(); it2 != limit2; it2++)
+    {
+      temp.push_back(pair<wstring, wstring>(it->first + it2->first, 
+		   		          it->second + it2->second));
+    }
+  }
+
+  result = temp;
+}
+
+void
+Expander::append(EntList &result, wstring const &endings)
+{  
+  EntList::iterator it, limit;
+  for(it = result.begin(), limit = result.end(); it != limit; it++)
+  {
+    it->first.append(endings);
+    it->second.append(endings);
+  }
+}
+
+void
+Expander::append(EntList &result, 
+		 pair<wstring, wstring> const &endings)
+{
+  EntList::iterator it, limit;
+  for(it = result.begin(), limit = result.end(); it != limit; it++)
+  {
+    it->first.append(endings.first);
+    it->second.append(endings.second);
+  }
+}
+
+void
+Expander::setAltValue(string const &a)
+{
+  alt = XMLParseUtil::stows(a);
+}
+
+void
+Expander::setVariantValue(string const &v)
+{
+  variant = XMLParseUtil::stows(v);
+}
+
+void
+Expander::setVariantLeftValue(string const &v)
+{
+  variant_left = XMLParseUtil::stows(v);
+}
+
+void
+Expander::setVariantRightValue(string const &v)
+{
+  variant_right = XMLParseUtil::stows(v);
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/expander.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/expander.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/expander.h	(revision 70339)
@@ -0,0 +1,234 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _EXPANDER_
+#define _EXPANDER_
+
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/string_to_wostream.h>
+
+#include <list>
+#include <map>
+#include <libxml/xmlreader.h>
+#include <string>
+
+using namespace std;
+
+typedef list<pair<wstring, wstring> > EntList;
+
+/**
+ * An expander of dictionaries
+ */
+class Expander
+{
+private:
+  /**
+   * The libxml2's XML reader
+   */
+  xmlTextReaderPtr reader;
+  
+  /**
+   * The alt value
+   */
+  wstring alt;
+  
+  /**
+   * The variant value (monodix)
+   */
+  wstring variant;
+  
+  /**
+   * The variant value (left side of bidix)
+   */
+  wstring variant_left;
+  
+  /**
+   * The variant value (right side of bidix)
+   */
+  wstring variant_right;
+  
+  /**
+   * The paradigm being compiled
+   */
+  wstring current_paradigm;
+  
+  /**
+   * The direction of the compilation, 'lr' (left-to-right) or 'rl'
+   * (right-to-left)
+   */
+  wstring direction;
+  
+  /**
+   * Paradigms
+   */
+  map<wstring, EntList, Ltstr> paradigm;
+
+  map<wstring, EntList, Ltstr> paradigm_lr;
+
+  map<wstring, EntList, Ltstr> paradigm_rl;
+
+  /**
+   * Method to parse an XML Node
+   */
+  void procNode(FILE *output);
+
+  /**
+   * Parse the &lt;pardef&gt; element
+   */
+  void procParDef();
+  
+  /**
+   * Parse the &lt;e&gt; element
+   */
+  void procEntry(FILE *output);
+
+  /**
+   * Parse the &lt;re&gt; element
+   * @return the string representing the regular expression
+   */
+  wstring procRegexp();
+
+  /**
+   * Gets an attribute value with their name and the current context
+   * @param name the name of the attribute
+   * @return the value of the attribute
+   */
+  wstring attrib(wstring const &name);
+
+  /**
+   * Parse the &lt;p&lt; element
+   * @return a pair of string, left part and right part of a transduction
+   */
+  pair<wstring, wstring> procTransduction();
+
+  /**
+   * Parse the &lt;i&lt; element
+   * @return a string from the dictionary's entry
+   */
+  wstring procIdentity();
+
+  /**
+   * Parse the &lt;par&gt; element
+   * @return the name of the paradigm
+   */
+  wstring procPar();
+
+  /**
+   * Skip all document #text nodes before "elem"
+   * @param name the name of the node
+   * @param elem the name of the expected node
+   */
+  void skip(wstring &name, wstring const &elem);
+
+  /**
+   * Skip all blank #text nodes before "name"
+   * @param name the name of the node
+   */
+  void skipBlanks(wstring &name);
+  
+  
+  void readString(wstring &result, wstring const &name);
+  
+  /**
+   * Force an element to be empty, and check for it
+   * @param name the element 
+   */
+  void requireEmptyError(wstring const &name);
+
+  /**
+   * Force an attribute to be specified, amd check for it
+   * @param value the value of the attribute
+   * @param attrname the name of the attribute
+   * @param elemname the parent of the attribute
+   */
+  void requireAttribute(wstring const &value, wstring const &attrname,
+                        wstring const &elemname);
+
+  /**
+   * True if all the elements in the current node are blanks
+   * @return true if all are blanks
+   */
+  bool allBlanks();
+
+  /**
+   * Append a list of endings to a list of current transductions.
+   * @param result the current partial transductions, and after calling
+   *               this method, the result of concatenations.
+   * @param endings the endings to be appended.
+   */
+  static void append(list<pair<wstring, wstring> > &result, 
+                     list<pair<wstring, wstring> > const &endings);
+
+  /**
+   * Append a list of endings to a list of current transductions.
+   * @param result the current partial transductions, and after calling
+   *               this method, the result of concatenations.
+   * @param endings the endings to be appended.
+   */
+  static void append(list<pair<wstring, wstring> > &result, 
+                     wstring const &endings);
+
+  /**
+   * Append a list of endings to a list of current transductions.
+   * @param result the current partial transductions, and after calling
+   *               this method, the result of concatenations.
+   * @param endings the endings to be appended.
+   */
+  static void append(list<pair<wstring, wstring> > &result, 
+	             pair<wstring, wstring> const &endings);
+
+public:
+  /**
+   * Constructor
+   */
+  Expander();
+
+  /**
+   * Destructor
+   */
+  ~Expander();
+
+  /**
+   * Compile dictionary to letter transducers
+   */
+  void expand(string const &fichero, FILE *output);
+  /**
+   * Set the alt value to use in compilation
+   * @param a the value
+   */
+   void setAltValue(string const &a);
+
+  /**
+   * Set the variant value to use in expansion
+   * @param v the value
+   */
+   void setVariantValue(string const &v);
+
+  /**
+   * Set the variant_left value to use in expansion
+   * @param v the value
+   */
+   void setVariantLeftValue(string const &v);
+
+  /**
+   * Set the variant_right value to use in expansion
+   * @param v the value
+   */
+   void setVariantRightValue(string const &v);
+};
+
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_comp.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_comp.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_comp.cc	(revision 70339)
@@ -0,0 +1,243 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/compiler.h>
+#include <lttoolbox/att_compiler.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/string_to_wostream.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <string>
+#include <getopt.h>
+
+using namespace std;
+
+/* 
+ * Error function that does nothing so that when we fallback from
+ * XML to AT&T, the user doesn't get a message unless it's really
+ * invalid XML.
+ */ 
+void errorFunc(void *ctx, const char *msg, ...) 
+{
+  return;
+} 
+
+void endProgram(char *name)
+{
+  if(name != NULL)
+  {
+    cout << basename(name) << " v" << PACKAGE_VERSION <<": build a letter transducer from a dictionary" << endl;
+    cout << "USAGE: " << basename(name) << " [-avh] lr | rl dictionary_file output_file [acx_file]" << endl;
+    cout << "  -v:     set language variant" << endl;
+    cout << "  -a:     set alternative (monodix)" << endl;
+    cout << "  -l:     set left language variant (bidix)" << endl;
+    cout << "  -r:     set right language variant (bidix)" << endl;
+    cout << "Modes:" << endl;
+    cout << "  lr:     left-to-right compilation" << endl;
+    cout << "  rl:     right-to-left compilation" << endl;
+  }
+  exit(EXIT_FAILURE);
+}
+
+
+int main(int argc, char *argv[])
+{
+  char ttype = 'x'; 
+  Compiler c;
+  AttCompiler a; 
+  c.setVerbose(false);
+  
+#if HAVE_GETOPT_LONG
+  int option_index=0;
+#endif
+
+  string vl;
+  string vr;
+
+  while (true) {
+#if HAVE_GETOPT_LONG
+    static struct option long_options[] =
+    {
+      {"alt",       required_argument, 0, 'a'},
+      {"var",       required_argument, 0, 'v'},
+      {"var-left",  required_argument, 0, 'l'},
+      {"var-right", required_argument, 0, 'r'},
+      {"help",      no_argument,       0, 'h'}, 
+      {"verbose",   no_argument,       0, 'V'}, 
+      {0, 0, 0, 0}
+    };
+
+    int cnt=getopt_long(argc, argv, "a:v:l:r:hV", long_options, &option_index);
+#else
+    int cnt=getopt(argc, argv, "a:v:l:r:hV");
+#endif
+    if (cnt==-1)
+      break;
+
+    switch (cnt)
+    {
+      case 'a':
+        c.setAltValue(optarg);
+        break;
+
+      case 'v':
+        c.setVariantValue(optarg);
+        break;
+
+      case 'l':
+        vl = optarg;
+        c.setVariantLeftValue(vl);
+        break;
+
+      case 'r':
+        vr = optarg;
+        c.setVariantRightValue(vr);
+        break;
+
+      case 'V':
+        c.setVerbose(true);
+        break;
+
+      case 'h':
+      default:
+        endProgram(argv[0]);
+        break;
+    }
+  }
+
+  string opc;
+  string infile;
+  string outfile;
+  string acxfile;
+
+  switch(argc - optind + 1)
+  {
+    case 5:
+      opc = argv[argc-4];
+      infile = argv[argc-3];
+      outfile = argv[argc-2];
+      acxfile = argv[argc-1];
+      break;
+
+    case 4:
+      opc = argv[argc-3];
+      infile = argv[argc-2];
+      outfile = argv[argc-1];
+      break;
+
+    default:
+      endProgram(argv[0]);
+      break;
+  }
+
+  xmlTextReaderPtr reader;
+  reader = xmlReaderForFile(infile.c_str(), NULL, 0);
+  xmlGenericErrorFunc handler = (xmlGenericErrorFunc)errorFunc;
+  initGenericErrorDefaultFunc(&handler);
+  if(reader != NULL)
+  {
+    int ret = xmlTextReaderRead(reader);
+    if(ret != 1)
+    {
+      ttype = 'a';
+    }
+    xmlFreeTextReader(reader);
+    xmlCleanupParser();
+  }
+  else
+  {
+    wcerr << "Error: Cannot not open file '" << infile << "'." << endl << endl;
+    exit(EXIT_FAILURE);
+  }
+  initGenericErrorDefaultFunc(NULL);
+  
+
+  if(opc == "lr")
+  {
+    if(vr == "" && vl != "")
+    {
+      cout << "Error: -l specified, but mode is lr" << endl;
+      endProgram(argv[0]);
+    }
+    if(ttype == 'a') 
+    {
+#if defined __clang__
+      locale::global(locale(""));;
+#elif defined __APPLE__
+      LtLocale::tryToSetLocale();
+#else
+      locale::global(locale(""));;
+#endif
+      a.parse(infile, Compiler::COMPILER_RESTRICTION_LR_VAL);
+    }
+    else
+    {
+      LtLocale::tryToSetLocale();
+      if(acxfile != "")
+      {
+        c.parseACX(acxfile, Compiler::COMPILER_RESTRICTION_LR_VAL);
+      }    
+      c.parse(infile, Compiler::COMPILER_RESTRICTION_LR_VAL);
+    }
+  }
+  else if(opc == "rl")
+  {
+    if(vl == "" && vr != "")
+    {
+      cout << "Error: -r specified, but mode is rl" << endl;
+      endProgram(argv[0]);
+    }
+    if(ttype == 'a')
+    {
+#if defined __clang__
+      locale::global(locale(""));;
+#elif defined __APPLE__
+      LtLocale::tryToSetLocale();
+#else
+      locale::global(locale(""));;
+#endif
+      a.parse(infile, Compiler::COMPILER_RESTRICTION_RL_VAL);
+    }
+    else
+    {
+      LtLocale::tryToSetLocale();
+      c.parse(infile, Compiler::COMPILER_RESTRICTION_RL_VAL);
+    }    
+  }
+  else
+  {
+    endProgram(argv[0]);
+  }
+
+  FILE *output = fopen(outfile.c_str(), "wb");
+  if(!output)
+  {
+    wcerr << "Error: Cannot open file '" << outfile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  if(ttype == 'a') 
+  {
+    a.write(output);
+  }
+  else
+  {
+    c.write(output);
+  }
+  fclose(output);
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_expand.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_expand.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_expand.cc	(revision 70339)
@@ -0,0 +1,146 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <lttoolbox/expander.h>
+#include <lttoolbox/lttoolbox_config.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <string>
+#include <getopt.h>
+
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace std;
+
+void endProgram(char *name)
+{
+  if(name != NULL)
+  {
+    cout << basename(name) << " v" << PACKAGE_VERSION <<": expand the contents of a dictionary file" << endl;
+    cout << "USAGE: " << basename(name) << " [-avlrh] dictionary_file [output_file]" << endl;
+  }
+  exit(EXIT_FAILURE);
+}
+
+int main(int argc, char *argv[])
+{
+  FILE *input = NULL, *output = NULL;
+  Expander e;
+
+#if HAVE_GETOPT_LONG
+  int option_index=0;
+#endif
+
+  while (true) {
+#if HAVE_GETOPT_LONG
+    static struct option long_options[] =
+    {
+      {"alt",       required_argument, 0, 'a'},
+      {"var",       required_argument, 0, 'v'},
+      {"var-left",  required_argument, 0, 'l'},
+      {"var-right", required_argument, 0, 'r'},
+      {"help",      no_argument,       0, 'h'}, 
+      {0, 0, 0, 0}
+    };
+
+    int cnt=getopt_long(argc, argv, "a:v:l:r:h", long_options, &option_index);
+#else
+    int cnt=getopt(argc, argv, "a:v:l:r:h");
+#endif
+    if (cnt==-1)
+      break;
+
+    switch (cnt)
+    {
+      case 'a':
+        e.setAltValue(optarg);
+        break;
+
+      case 'v':
+        e.setVariantValue(optarg);
+        break;
+
+      case 'l':
+        e.setVariantLeftValue(optarg);
+        break;
+
+      case 'r':
+        e.setVariantRightValue(optarg);
+        break;
+
+      case 'h':
+      default:
+        endProgram(argv[0]);
+        break;
+    }
+  }
+
+  string infile;
+  string outfile;
+
+  switch(argc - optind + 1)
+  {
+    case 2:
+      infile = argv[argc-1];
+      input = fopen(infile.c_str(), "rb");
+      if(input == NULL)
+      {
+        wcerr << "Error: Cannot open file '" << infile << "'." << endl;
+        exit(EXIT_FAILURE);
+      }      
+      fclose(input);
+      output = stdout;
+      break;
+    
+    case 3:
+      infile = argv[argc-2];
+      input = fopen(infile.c_str(), "rb");
+      if(input == NULL)
+      {
+        wcerr << "Error: Cannot open file '" << infile << "'." << endl;
+        exit(EXIT_FAILURE);
+      }
+      fclose(input);
+
+      outfile = argv[argc-1];
+      output = fopen(argv[argc-1], "wb");
+      if(output == NULL)
+      {
+        wcerr << "Error: Cannot open file '" << outfile << "'." << endl;
+        exit(EXIT_FAILURE);
+      }
+      break;
+
+    default:
+      endProgram(argv[0]);
+      break;
+  }
+
+#ifdef _MSC_VER
+  _setmode(_fileno(output), _O_U8TEXT);
+#endif
+
+  e.expand(infile, output);
+  fclose(output);
+  
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_locale.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_locale.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_locale.cc	(revision 70339)
@@ -0,0 +1,48 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/lt_locale.h>
+
+#include <clocale>
+#include <iostream>
+#ifdef __MINGW32__
+#include <windows.h>
+#endif
+
+using namespace std;
+
+
+void
+LtLocale::tryToSetLocale()
+{
+#if !defined(__CYGWIN__) && !defined (__MINGW32__)
+  if(setlocale(LC_CTYPE, "") != NULL)
+  {
+    return;
+  }
+ 
+  wcerr << "Warning: unsupported locale, fallback to \"C\"" << endl;
+
+  setlocale(LC_ALL, "C");
+#endif
+#ifdef __CYGWIN__
+  setlocale(LC_ALL, "C.UTF-8");
+#endif
+#ifdef __MINGW32__
+  //SetConsoleInputCP(65001);
+  SetConsoleOutputCP(65001);
+#endif
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_print.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_print.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_print.cc	(revision 70339)
@@ -0,0 +1,109 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/transducer.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/lttoolbox_config.h>
+
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <string>
+
+using namespace std;
+
+void endProgram(char *name)
+{
+  if(name != NULL)
+  {
+    cout << basename(name) << " v" << PACKAGE_VERSION <<": dump a transducer to text in ATT format" << endl;
+    cout << "USAGE: " << basename(name) << " bin_file " << endl;
+  }
+  exit(EXIT_FAILURE);
+}
+
+
+int main(int argc, char *argv[])
+{
+  if(argc != 2) 
+  {
+    endProgram(argv[0]);
+  }
+
+  LtLocale::tryToSetLocale();
+
+
+  FILE *input = fopen(argv[1], "r");
+  if(!input)
+  {
+    wcerr << "Error: Cannot open file '" << argv[1] << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  Alphabet alphabet;
+  set<wchar_t> alphabetic_chars;
+
+  map<wstring, Transducer> transducers;
+
+  // letters
+  int len = Compression::multibyte_read(input);
+  while(len > 0)
+  {
+    alphabetic_chars.insert(static_cast<wchar_t>(Compression::multibyte_read(input)));
+    len--;
+  }  
+
+  // symbols  
+  alphabet.read(input);
+
+  len = Compression::multibyte_read(input);
+
+  while(len > 0)
+  {
+    int len2 = Compression::multibyte_read(input);
+    wstring name = L"";
+    while(len2 > 0)
+    {
+      name += static_cast<wchar_t>(Compression::multibyte_read(input));
+      len2--;
+    }
+    transducers[name].read(input);
+
+    len--;
+  } 
+
+  /////////////////////
+ 
+  FILE *output = stdout;
+  map<wstring, Transducer>::iterator penum = transducers.end();
+  penum--;
+  for(map<wstring, Transducer>::iterator it = transducers.begin(); it != transducers.end(); it++)
+  {
+    it->second.joinFinals();
+    it->second.show(alphabet, output);
+    if(it != penum) 
+    {
+      fwprintf(output, L"--\n", it->first.c_str());
+    }
+  }
+
+  fclose(input);
+  
+  return 0;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_proc.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_proc.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_proc.cc	(revision 70339)
@@ -0,0 +1,339 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/fst_processor.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include <getopt.h>
+#include <iostream>
+#include <libgen.h>
+
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+#ifdef _WIN32
+#include <utf8_fwrap.hpp>
+#endif
+
+using namespace std;
+
+void endProgram(char *name)
+{
+  cout << basename(name) << ": process a stream with a letter transducer" << endl;
+  cout << "USAGE: " << basename(name) << " [ -a | -b | -c | -d | -e | -g | -n | -p | -s | -t | -v | -h -z -w ] fst_file [input_file [output_file]]" << endl;
+  cout << "Options:" << endl;
+#if HAVE_GETOPT_LONG
+  cout << "  -a, --analysis:         morphological analysis (default behavior)" << endl;
+  cout << "  -b, --bilingual:        lexical transfer" << endl;
+  cout << "  -c, --case-sensitive:   use the literal case of the incoming characters" << endl;
+  cout << "  -d, --debugged-gen      morph. generation with all the stuff" <<endl;
+  cout << "  -e, --decompose-nouns:  Try to decompound unknown words" << endl;
+  cout << "  -g, --generation:       morphological generation" << endl;
+  cout << "  -l, --tagged-gen:       morphological generation keeping lexical forms" << endl;
+  cout << "  -m, --tagged-nm-gen:    same as -l but without unknown word marks" << endl;
+  cout << "  -n, --non-marked-gen    morph. generation without unknown word marks" << endl;
+  cout << "  -o, --surf-bilingual:   lexical transfer with surface forms" << endl;
+  cout << "  -p, --post-generation:  post-generation" << endl;
+  cout << "  -s, --sao:              SAO annotation system input processing" << endl;
+  cout << "  -t, --transliteration:  apply transliteration dictionary" << endl;
+  cout << "  -v, --version:          version" << endl;
+  cout << "  -z, --null-flush:       flush output on the null character " << endl;
+  cout << "  -w, --dictionary-case:  use dictionary case instead of surface case" << endl;
+  cout << "  -h, --help:             show this help" << endl;
+#else
+  cout << "  -a:   morphological analysis (default behavior)" << endl;
+  cout << "  -b:   lexical transfer" << endl;
+  cout << "  -c:   use the literal case of the incoming characters" << endl;
+  cout << "  -d:   morph. generation with all the stuff" << endl;
+  cout << "  -e:   try to decompose unknown words as compounds" << endl;
+  cout << "  -g:   morphological generation" << endl;
+  cout << "  -l:   morphological generation keeping lexical forms" << endl;
+  cout << "  -n:   morph. generation without unknown word marks" << endl;
+  cout << "  -o:   lexical transfer with surface forms" << endl;
+  cout << "  -p:   post-generation" << endl;
+  cout << "  -s:   SAO annotation system input processing" << endl;
+  cout << "  -t:   apply transliteration dictionary" << endl;
+  cout << "  -v:   version" << endl;
+  cout << "  -z:   flush output on the null character " << endl;
+  cout << "  -w:   use dictionary case instead of surface case" << endl;
+  cout << "  -h:   show this help" << endl;
+#endif
+  exit(EXIT_FAILURE);
+}
+
+void checkValidity(FSTProcessor const &fstp)
+{
+  if(!fstp.valid())
+  {
+    exit(EXIT_FAILURE);
+  }
+}
+
+int main(int argc, char *argv[])
+{
+  int cmd = 0;
+  FSTProcessor fstp;
+
+#if HAVE_GETOPT_LONG
+  static struct option long_options[]=
+    {
+      {"analysis",        0, 0, 'a'},
+      {"bilingual",       0, 0, 'b'},
+      {"surf-bilingual",  0, 0, 'o'},
+      {"generation",      0, 0, 'g'},
+      {"non-marked-gen",  0, 0, 'n'},
+      {"debugged-gen",    0, 0, 'd'},
+      {"tagged-gen",      0, 0, 'l'},
+      {"tagged-nm-gen",   0, 0, 'm'},
+      {"post-generation", 0, 0, 'p'},
+      {"sao",             0, 0, 's'},
+      {"transliteration", 0, 0, 't'},
+      {"null-flush",      0, 0, 'z'},
+      {"dictionary-case", 0, 0, 'w'},
+      {"version",	  0, 0, 'v'},
+      {"case-sensitive",  0, 0, 'c'},
+      {"help",            0, 0, 'h'}
+    };
+#endif
+
+  while(true)
+  {
+#if HAVE_GETOPT_LONG
+    int option_index;
+    int c = getopt_long(argc, argv, "abceglmndopstzwvh", long_options, &option_index);
+#else
+    int c = getopt(argc, argv, "abceglmndopstzwvh");
+#endif
+
+    if(c == -1)
+    {
+      break;
+    }
+
+    switch(c)
+    {
+    case 'c':
+      fstp.setCaseSensitiveMode(true);
+      break;
+
+    case 'e':
+    case 'a':
+    case 'b':
+    case 'o':
+    case 'l':
+    case 'm':
+    case 'g':
+    case 'n':
+    case 'd':
+    case 'p':
+    case 't':
+    case 's':
+      if(cmd == 0)
+      {
+	cmd = c;
+      }
+      else
+      {
+	endProgram(argv[0]);
+      }
+      break;
+
+    case 'z':
+      fstp.setNullFlush(true);
+      break;
+
+    case 'w':
+      fstp.setDictionaryCaseMode(true);
+      break;
+
+    case 'v':
+      cout << basename(argv[0]) << " version " << PACKAGE_VERSION << endl;
+      exit(EXIT_SUCCESS);
+      break;
+    case 'h':
+    default:
+      endProgram(argv[0]);
+      break;
+    }
+  }
+
+  FILE *input = stdin, *output = stdout;
+  LtLocale::tryToSetLocale();
+
+  if(optind == (argc - 3))
+  {
+    FILE *in = fopen(argv[optind], "rb");
+    if(in == NULL || ferror(in))
+    {
+      wcerr << "Error: Cannot not open file '" << argv[optind] << "'." << endl << endl;
+      exit(EXIT_FAILURE);
+    }
+
+    input = fopen(argv[optind+1], "rb");
+    if(input == NULL || ferror(input))
+    {
+      wcerr << "Error: Cannot not open file '" << argv[optind+1] << "'." << endl << endl;
+      exit(EXIT_FAILURE);
+    }
+
+    output= fopen(argv[optind+2], "wb");
+    if(output == NULL || ferror(output))
+    {
+      wcerr << "Error: Cannot not open file '" << argv[optind+2] << "'." << endl << endl;
+      exit(EXIT_FAILURE);
+    }
+
+    fstp.load(in);
+    fclose(in);
+  }
+  else if(optind == (argc -2))
+  {
+    FILE *in = fopen(argv[optind], "rb");
+    if(in == NULL || ferror(in))
+    {
+      wcerr << "Error: Cannot not open file '" << argv[optind] << "'." << endl << endl;
+      exit(EXIT_FAILURE);
+    }
+
+    input = fopen(argv[optind+1], "rb");
+    if(input == NULL || ferror(input))
+    {
+      wcerr << "Error: Cannot not open file '" << argv[optind+1] << "'." << endl << endl;
+      exit(EXIT_FAILURE);
+    }
+
+    fstp.load(in);
+    fclose(in);
+  }
+  else if(optind == (argc - 1))
+  {
+    FILE *in = fopen(argv[optind], "rb");
+    if(in == NULL || ferror(in))
+    {
+      wcerr << "Error: Cannot not open file '" << argv[optind] << "'." << endl << endl;
+      exit(EXIT_FAILURE);
+     }
+    fstp.load(in);
+    fclose(in);
+  }
+  else
+  {
+    endProgram(argv[0]);
+  }
+
+#ifdef _MSC_VER
+  	_setmode(_fileno(input), _O_U8TEXT);
+	_setmode(_fileno(output), _O_U8TEXT);
+#endif
+
+  try
+  {
+    switch(cmd)
+    {
+      case 'n':
+        fstp.initGeneration();
+        checkValidity(fstp);
+        fstp.generation(input, output, gm_clean);
+        break;
+
+      case 'g':
+        fstp.initGeneration();
+        checkValidity(fstp);
+        fstp.generation(input, output);
+        break;
+
+      case 'd':
+        fstp.initGeneration();
+        checkValidity(fstp);
+        fstp.generation(input, output, gm_all);
+        break;
+
+      case 'l':
+        fstp.initGeneration();
+        checkValidity(fstp);
+        fstp.generation(input, output, gm_tagged);
+        break;
+
+      case 'm':
+        fstp.initGeneration();
+        checkValidity(fstp);
+        fstp.generation(input, output, gm_tagged_nm);
+        break;
+
+      case 'p':
+        fstp.initPostgeneration();
+        checkValidity(fstp);
+        fstp.postgeneration(input, output);
+        break;
+
+      case 's':
+        fstp.initAnalysis();
+        checkValidity(fstp);
+        fstp.SAO(input, output);
+        break;
+
+      case 't':
+        fstp.initPostgeneration();
+        checkValidity(fstp);
+        fstp.transliteration(input, output);
+        break;
+
+      case 'o':
+        fstp.initBiltrans();
+        checkValidity(fstp);
+        fstp.setBiltransSurfaceForms(true);
+        fstp.bilingual(input, output);
+        break;
+
+      case 'b':
+        fstp.initBiltrans();
+        checkValidity(fstp);
+        fstp.bilingual(input, output);
+        break;
+
+      case 'e':
+        fstp.initDecomposition();
+        checkValidity(fstp);
+        fstp.analysis(input, output);
+        break;
+
+      case 'a':
+      default:
+        fstp.initAnalysis();
+        checkValidity(fstp);
+        fstp.analysis(input, output);
+        break;
+    }
+  }
+  catch (exception& e)
+  {
+    wcerr << e.what();
+    if (fstp.getNullFlush()) {
+      fputwc_unlocked(L'\0', output);
+    }
+
+    exit(1);
+  }
+
+  fclose(input);
+  fclose(output);
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_tmxcomp.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_tmxcomp.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_tmxcomp.cc	(revision 70339)
@@ -0,0 +1,138 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/tmx_compiler.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/lt_locale.h>
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <string>
+#include <getopt.h>
+
+using namespace std;
+
+void endProgram(char *name)
+{
+  if(name != NULL)
+  {
+    cout << basename(name) << " v" << PACKAGE_VERSION <<": build a letter transducer from a TMX translation memory" << endl;
+    cout << "USAGE: " << basename(name) << " [OPTIONS] lang1-lang2 tmx_file output_file" << endl;
+    cout << "Modes:" << endl;
+    cout << "  lang1:     input language" << endl;
+    cout << "  lang2:     output language" << endl;
+    cout << "Options:" <<endl;
+#if HAVE_GETOPT_LONG
+    cout << "  -o, --origin-code code   the language code to be taken as lang1" << endl;
+    cout << "  -m, --meta-code code     the language code to be taken as lang2" << endl;
+#else
+    cout << "  -o code   the language code to be taken as lang1" << endl;
+    cout << "  -m code   the language code to be taken as lang2" << endl;
+#endif
+  }
+  exit(EXIT_FAILURE);
+}
+
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+
+  if(argc != 4)
+  {
+    endProgram(argv[0]);
+  }
+
+  TMXCompiler c;
+
+#if HAVE_GETOPT_LONG
+  int option_index = 0;
+#endif
+  while(true)
+  {
+#if HAVE_GETOPT_LONG
+    static struct option long_options[] =
+    {
+      {"origin-code", required_argument, 0, 'o'},
+      {"meta-code", required_argument, 0, 'm'},
+      {0, 0, 0, 0}
+    };
+    
+    int c_t = getopt_long(argc, argv, "o:m:", long_options, &option_index);
+#else
+    int c_t = getopt(argc, argv, "o:m:");
+#endif   
+    if(c_t == -1)
+    {
+      break;
+    }
+    
+    switch(c_t)
+    {
+      case 'o':
+        {
+          wchar_t *param = new wchar_t[strlen(optarg)+1];
+          if((size_t) -1 != mbstowcs(param, optarg, strlen(optarg)))
+	  {
+            c.setOriginLanguageCode(param);
+	  }
+    	  delete[] param;
+        }
+        break;
+      
+      case 'm':
+        {
+          wchar_t *param = new wchar_t[strlen(optarg)+1];
+          if((size_t) -1 != mbstowcs(param, optarg, strlen(optarg)))
+	  {
+            c.setMetaLanguageCode(param);
+	  }
+    	  delete[] param;
+        }
+        break;
+        
+      default:
+        endProgram(argv[0]);
+        break;
+    }
+  }
+
+  string opc = argv[argc-3];
+  wchar_t* lo = new wchar_t[opc.size()+1];
+  wchar_t* lm = new wchar_t[opc.size()+1];
+
+  if(((size_t) -1 == mbstowcs(lo, opc.substr(0, opc.find('-')).c_str(), opc.size()))|| 
+     ((size_t) -1 == mbstowcs(lm, opc.substr(opc.find('-')+1).c_str(), opc.size())))
+  {
+    delete[] lo;
+    delete[] lm;
+    endProgram(argv[0]);
+  }
+
+
+  c.parse(argv[argc-2], lo, lm);
+  delete[] lo;
+  delete[] lm;
+
+  FILE *output = fopen(argv[argc-1], "w");
+  if(!output)
+  {
+    wcerr << "Error: Cannot open file '" << argv[2] << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  c.write(output);
+  fclose(output);
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_trim.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_trim.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_trim.cc	(revision 70339)
@@ -0,0 +1,218 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/transducer.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/lttoolbox_config.h>
+
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <string>
+
+void endProgram(char *name)
+{
+  if(name != NULL)
+  {
+    cout << basename(name) << " v" << PACKAGE_VERSION <<": trim a transducer to another transducer" << endl;
+    cout << "USAGE: " << basename(name) << " analyser_bin_file bidix_bin_file trimmed_bin_file " << endl;
+  }
+  exit(EXIT_FAILURE);
+}
+
+std::pair<std::pair<Alphabet, wstring>, std::map<wstring, Transducer> >
+read_fst(FILE *bin_file)
+{
+  Alphabet new_alphabet;
+  wstring letters = L"";
+
+  std::map<wstring, Transducer> transducers;
+
+  // letters
+  int len = Compression::multibyte_read(bin_file);
+  while(len > 0)
+  {
+    letters.push_back(static_cast<wchar_t>(Compression::multibyte_read(bin_file)));
+    len--;
+  }
+
+  // symbols
+  new_alphabet.read(bin_file);
+
+  len = Compression::multibyte_read(bin_file);
+
+  while(len > 0)
+  {
+    int len2 = Compression::multibyte_read(bin_file);
+    wstring name = L"";
+    while(len2 > 0)
+    {
+      name += static_cast<wchar_t>(Compression::multibyte_read(bin_file));
+      len2--;
+    }
+    transducers[name].read(bin_file);
+
+    len--;
+  }
+
+  std::pair<Alphabet, wstring> alph_letters;
+  alph_letters.first = new_alphabet;
+  alph_letters.second = letters;
+  return std::pair<std::pair<Alphabet, wstring>, std::map<wstring, Transducer> > (alph_letters, transducers);
+}
+
+std::pair<std::pair<Alphabet, wstring>, std::map<wstring, Transducer> >
+trim(FILE *file_mono, FILE *file_bi)
+{
+  std::pair<std::pair<Alphabet, wstring>, std::map<wstring, Transducer> > alph_trans_mono = read_fst(file_mono);
+  Alphabet alph_mono = alph_trans_mono.first.first;
+  std::map<wstring, Transducer> trans_mono = alph_trans_mono.second;
+  std::pair<std::pair<Alphabet, wstring>, std::map<wstring, Transducer> > alph_trans_bi = read_fst(file_bi);
+  Alphabet alph_bi = alph_trans_bi.first.first;
+  std::map<wstring, Transducer> trans_bi = alph_trans_bi.second;
+
+  // The prefix transducer is the union of all transducers from bidix,
+  // with a ".*" appended
+  Transducer union_transducer;
+  // The "." in ".*" is a set of equal pairs of the output symbols
+  // from the monodix alphabet (<n>:<n> etc.)
+  Alphabet alph_prefix = alph_bi;
+  set<int> loopback_symbols;    // ints refer to alph_prefix
+  alph_prefix.createLoopbackSymbols(loopback_symbols, alph_mono, Alphabet::right);
+
+  for(std::map<wstring, Transducer>::iterator it = trans_bi.begin(); it != trans_bi.end(); it++)
+  {
+    Transducer union_tmp = it->second;
+    if(union_transducer.isEmpty())
+    {
+      union_transducer = union_tmp;
+    }
+    else
+    {
+      union_transducer.unionWith(alph_bi, union_tmp);
+    }
+  }
+  union_transducer.minimize();
+
+  Transducer prefix_transducer = union_transducer.appendDotStar(loopback_symbols);
+  // prefix_transducer should _not_ be minimized (both useless and takes forever)
+  Transducer moved_transducer = prefix_transducer.moveLemqsLast(alph_prefix);
+
+
+  for(std::map<wstring, Transducer>::iterator it = trans_mono.begin(); it != trans_mono.end(); it++)
+  {
+    Transducer trimmed = it->second.intersect(moved_transducer,
+                                              alph_mono,
+                                              alph_prefix);
+
+    wcout << it->first << " " << it->second.size();
+    wcout << " " << it->second.numberOfTransitions() << endl;
+    if(it->second.numberOfTransitions() == 0)
+    {
+      wcerr << L"Warning: empty section! Skipping it ..."<<endl;
+      trans_mono[it->first].clear();
+    }
+    else if(trimmed.hasNoFinals()) {
+      wcerr << L"Warning: section had no final state after trimming! Skipping it ..."<<endl;
+      trans_mono[it->first].clear();
+    }
+    else {
+      trimmed.minimize();
+      trans_mono[it->first] = trimmed;
+    }
+  }
+
+  alph_trans_mono.second = trans_mono;
+  return alph_trans_mono;
+}
+
+
+int main(int argc, char *argv[])
+{
+  if(argc != 4)
+  {
+    endProgram(argv[0]);
+  }
+
+  LtLocale::tryToSetLocale();
+
+  FILE *analyser = fopen(argv[1], "rb");
+  if(!analyser)
+  {
+    wcerr << "Error: Cannot not open file '" << argv[1] << "'." << endl << endl;
+    exit(EXIT_FAILURE);
+  }
+  FILE *bidix = fopen(argv[2], "rb");
+  if(!bidix)
+  {
+    wcerr << "Error: Cannot not open file '" << argv[2] << "'." << endl << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  std::pair<std::pair<Alphabet, wstring>, std::map<wstring, Transducer> > trimmed = trim(analyser, bidix);
+  Alphabet alph_t = trimmed.first.first;
+  wstring letters = trimmed.first.second;
+  std::map<wstring, Transducer> trans_t = trimmed.second;
+
+  int n_transducers = 0;
+  for(std::map<wstring, Transducer>::iterator it = trans_t.begin(); it != trans_t.end(); it++)
+  {
+    if(!(it->second.isEmpty()))
+    {
+      n_transducers++;
+    }
+  }
+
+  if(n_transducers == 0)
+  {
+    wcerr << L"Error: Trimming gave empty transducer!" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  // Write the file:
+  FILE *output = fopen(argv[3], "wb");
+  if(!output)
+  {
+    wcerr << "Error: Cannot not open file '" << argv[3] << "'." << endl << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  // letters
+  Compression::wstring_write(letters, output);
+
+  // symbols
+  alph_t.write(output);
+
+  // transducers
+  Compression::multibyte_write(n_transducers, output);
+  for(std::map<wstring, Transducer>::iterator it = trans_t.begin(); it != trans_t.end(); it++)
+  {
+    if(!(it->second.isEmpty()))
+    {
+      Compression::wstring_write(it->first, output);
+      it->second.write(output);
+    }
+  }
+
+  fclose(analyser);
+  fclose(bidix);
+  fclose(output);
+
+  return 0;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/tmx_compiler.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/tmx_compiler.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/tmx_compiler.cc	(revision 70339)
@@ -0,0 +1,663 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/tmx_compiler.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/entry_token.h>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <lttoolbox/string_to_wostream.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libxml/encoding.h>
+
+#ifdef _WIN32
+#define swprintf _snwprintf
+#endif
+
+using namespace std;
+
+wstring const TMXCompiler::TMX_COMPILER_TMX_ELEM     = L"tmx";
+wstring const TMXCompiler::TMX_COMPILER_HEADER_ELEM  = L"header"; 
+wstring const TMXCompiler::TMX_COMPILER_BODY_ELEM    = L"body";
+wstring const TMXCompiler::TMX_COMPILER_TU_ELEM      = L"tu";
+wstring const TMXCompiler::TMX_COMPILER_TUV_ELEM     = L"tuv";
+wstring const TMXCompiler::TMX_COMPILER_HI_ELEM      = L"hi";
+wstring const TMXCompiler::TMX_COMPILER_PH_ELEM      = L"ph";
+wstring const TMXCompiler::TMX_COMPILER_XMLLANG_ATTR = L"xml:lang";
+wstring const TMXCompiler::TMX_COMPILER_LANG_ATTR    = L"lang";
+wstring const TMXCompiler::TMX_COMPILER_SEG_ELEM     = L"seg";
+wstring const TMXCompiler::TMX_COMPILER_PROP_ELEM    = L"prop";
+
+TMXCompiler::TMXCompiler() :
+reader(0)
+{
+  LtLocale::tryToSetLocale();
+  alphabet.includeSymbol(L"<n>"); // -1 -> numbers
+  alphabet.includeSymbol(L"<b>"); // -2 -> blanks
+}
+
+TMXCompiler::~TMXCompiler()
+{
+}
+
+void
+TMXCompiler::parse(string const &fichero, wstring const &lo, wstring const &lm)
+{
+  origin_language = lo;
+  meta_language = lm;
+  reader = xmlReaderForFile(fichero.c_str(), NULL, 0);
+  if(reader == NULL)
+  {
+    wcerr << "Error: Cannot open '" << fichero << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  int ret = xmlTextReaderRead(reader);
+  while(ret == 1)
+  {
+    procNode();
+    ret = xmlTextReaderRead(reader);
+  }
+
+  if(ret != 0)
+  {
+    wcerr << L"Error: Parse error at the end of input." << endl;
+  }
+
+  xmlFreeTextReader(reader);
+  xmlCleanupParser();
+
+  // Minimize transducer
+  transducer.minimize();
+}
+
+void
+TMXCompiler::requireEmptyError(wstring const &name)
+{
+  if(!xmlTextReaderIsEmptyElement(reader))
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Non-empty element '<" << name << L">' should be empty." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+bool 
+TMXCompiler::allBlanks()
+{
+  bool flag = true;
+  wstring text = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+  
+  for(unsigned int i = 0, limit = text.size(); i < limit; i++)
+  {
+    flag = flag && iswspace(text[i]);
+  }
+  
+  return flag;
+}
+
+void
+TMXCompiler::skipBlanks(wstring &name)
+{
+  while(name == L"#text" || name == L"#comment")
+  {
+    if(name != L"#comment")
+    {
+      if(!allBlanks())
+      {
+        wcerr << "Error (" << xmlTextReaderGetParserLineNumber(reader); 
+        wcerr << "): Invalid construction." << endl;
+        exit(EXIT_FAILURE);
+      }
+    }
+    
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  }
+}
+
+void
+TMXCompiler::skip(wstring &name, wstring const &elem)
+{
+  xmlTextReaderRead(reader);
+  name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  
+  while(name == L"#text" || name == L"#comment")
+  {
+    if(name != L"#comment")
+    {
+      if(!allBlanks())
+      {
+        wcerr << "Error (" << xmlTextReaderGetParserLineNumber(reader);
+        wcerr << "): Invalid construction." << endl;
+        exit(EXIT_FAILURE);
+      }
+    }
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));  
+  }    
+    
+  if(name != elem)
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Expected '<" << elem << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+wstring
+TMXCompiler::attrib(wstring const &name)
+{
+  return XMLParseUtil::attrib(reader, name);
+} 
+
+void
+TMXCompiler::requireAttribute(wstring const &value, wstring const &attrname,
+                           wstring const &elemname)
+{
+  if(value == L"")
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);  
+    wcerr << L"): '<" << elemname;
+    wcerr << L"' element must specify non-void '";
+    wcerr << attrname << L"' attribute." << endl;
+    exit(EXIT_FAILURE);
+  }  
+}
+
+wstring
+TMXCompiler::getTag(size_t const &val) const
+{
+  wchar_t cad[32];
+  swprintf(cad, 32, L"<%d>", val);
+  return cad;
+}
+
+void
+TMXCompiler::insertTU(vector<int> const &origin, vector<int> const &meta)
+{
+  if(origin.size() < 5 || meta.size() < 5)
+  {
+    return;
+  }
+  
+  if(origin[0] == alphabet(L"<b>") || meta[0] == alphabet(L"<b>"))
+  {
+    return;
+  }
+  
+  if(origin.size() != 0 && meta.size() != 0)
+  {
+    int source = transducer.getInitial();
+    for(size_t i = 0 ;; i++)
+    {
+      int s1 = 0, s2 = 0;
+      if(origin.size() > i)
+      {
+        s1 = origin[i];
+      }
+      if(meta.size() > i)
+      {
+        s2 = meta[i];
+      }
+      if(s1 == 0 && s2 == 0)
+      {
+        break;
+      }
+      source = transducer.insertSingleTransduction(alphabet(s1, s2), source);
+    }
+    transducer.setFinal(source);
+  }
+}
+
+void
+TMXCompiler::split(vector<int> const &v, vector<vector<int> > &sv, int const symbol) const
+{
+  sv.clear();
+  
+  for(unsigned int i = 0, limit = v.size(), j = 0; i != limit; i++)
+  {
+    if(sv.size() == j)
+    {
+      sv.push_back(vector<int>());
+    }
+    if(v[i] == symbol)
+    {
+      j++;
+    }
+    else
+    {
+      sv[j].push_back(v[i]);
+    }
+  }
+}
+
+vector<int>
+TMXCompiler::join(vector<vector<int> > const &v, int const s) const
+{
+  vector<int> result;
+  for(unsigned int i = 0, limit = v.size(); i != limit; i++)
+  {
+    for(unsigned int j = 0, limit2 = v[i].size(); j != limit2; j++)
+    {
+      result.push_back(v[i][j]);
+    }
+    if(i != limit - 1)
+    {
+      result.push_back(s);  
+    }
+  }
+  
+  return result;
+}
+
+void
+TMXCompiler::align_blanks(vector<int> &o, vector<int> &m)
+{
+  vector<unsigned int> puntos;
+  vector<int> resultado_o, resultado_m;
+  
+  int const symbol = alphabet(L"<b>");
+  
+  vector<vector<int> > so, sm;
+  
+  split(o, so, symbol);
+  split(m, sm, symbol);
+  
+  if(so.size() == sm.size())
+  {
+    for(unsigned int i = 0, limit = sm.size(); i != limit; i++)
+    {
+      trim(so[i]);
+      trim(sm[i]);
+      if(sm.size() - 1 != i)
+      {
+        sm[i].push_back(L'(');
+        sm[i].push_back(L'#');
+      }
+    /*
+      while(so[i].size() < sm[i].size())
+      {
+        so[i].push_back(0);
+      }
+      while(so[i].size() > sm[i].size())
+      {
+        sm[i].push_back(0);
+      }*/
+    } 
+    o = join(so, L' ');
+    m = join(sm, L')');
+  }
+  else
+  {
+    for(unsigned int i = 0, limit = so.size(); i != limit; i++)
+    {
+      trim(so[i]);
+    }
+    for(unsigned int i = 0, limit = sm.size(); i != limit; i++)
+    {
+      trim(sm[i]);
+      if(sm.size() - 1 != i)
+      {
+        sm[i].push_back(L'(');
+        sm[i].push_back(L'#');
+      }
+    }
+    o = join(so, L' ');
+    m = join(sm, L')');
+  }
+}
+
+void
+TMXCompiler::procTU()
+{
+  wstring name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  int type = xmlTextReaderNodeType(reader);
+  vector<int> origin;
+  vector<int> meta;
+  vector<int> foo;
+  
+  while(name != TMX_COMPILER_TU_ELEM || type != XML_READER_TYPE_END_ELEMENT)
+  {
+    if(name == TMX_COMPILER_TUV_ELEM && type != XML_READER_TYPE_END_ELEMENT)
+    {
+      wstring l = attrib(TMX_COMPILER_XMLLANG_ATTR);
+      if(l == L"")
+      {
+        l = attrib(TMX_COMPILER_LANG_ATTR);
+      }
+      
+      vector<int> *ref;
+      if(l == meta_language)
+      {
+        ref = &meta;
+      }
+      else if(l == origin_language)
+      {
+        ref = &origin;
+      }   
+      else
+      {
+        ref = &foo;
+      }
+      
+      while(name != TMX_COMPILER_TUV_ELEM || type != XML_READER_TYPE_END_ELEMENT)
+      {
+        xmlTextReaderRead(reader);
+        name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+        type = xmlTextReaderNodeType(reader);
+        
+        if(name == L"#text")
+        {
+          wstring l = XMLParseUtil::towstring(xmlTextReaderConstValue(reader));
+          for(size_t i = 0, limit = l.size(); i != limit; i++)
+          {
+            ref->push_back(l[i]);
+          }
+        }
+        else if(name == TMX_COMPILER_HI_ELEM || name == TMX_COMPILER_PH_ELEM)
+        {
+          if(type != XML_READER_TYPE_END_ELEMENT)
+          {
+            ref->push_back(alphabet(L"<b>"));
+          }
+        }
+      }
+    }
+    xmlTextReaderRead(reader);
+    name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+    type = xmlTextReaderNodeType(reader);
+  }
+  
+  trim(origin);
+  trim(meta);
+//  wcout << L"DESPUES DE TRIM\n";
+//  printvector(origin);
+//  printvector(meta);
+
+  align(origin, meta);
+//  wcout << L"DESPUES DE ALIGN\n";
+//  printvector(origin);
+//  printvector(meta);
+  align_blanks(origin, meta);
+//  wcout << L"DESPUES DE ALIGNBLANKS\n";
+//  printvector(origin);
+//  printvector(meta);
+  insertTU(origin, meta);
+}
+
+void
+TMXCompiler::procNode()
+{
+  xmlChar const *xnombre = xmlTextReaderConstName(reader);
+  wstring nombre = XMLParseUtil::towstring(xnombre);
+
+  // HACER: optimizar el orden de ejecuci�n de esta ristra de "ifs"
+
+  if(nombre == L"#text")
+  {
+    /* ignorar */
+  }
+  else if(nombre == TMX_COMPILER_TMX_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == TMX_COMPILER_HEADER_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == TMX_COMPILER_BODY_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == TMX_COMPILER_PROP_ELEM)
+  {
+    /* ignorar */
+  }
+  else if(nombre == TMX_COMPILER_TU_ELEM)
+  {
+    procTU();
+  }
+  else if(nombre== L"#comment")
+  {
+    /* ignorar */
+  }
+  else
+  {
+    wcerr << L"Error (" << xmlTextReaderGetParserLineNumber(reader);
+    wcerr << L"): Invalid node '<" << nombre << L">'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+void 
+TMXCompiler::write(FILE *output)
+{
+  // letters (empty to keep the file format)
+  Compression::wstring_write(L"", output);
+  
+  // symbols
+  alphabet.write(output);
+  
+  // transducers
+  Compression::multibyte_write(1, output); // keeping file format
+  Compression::wstring_write(L"", output); // keeping file format
+  transducer.write(output);
+
+  wcout << origin_language << L"->" << meta_language << L" ";
+  wcout << transducer.size() << L" " << transducer.numberOfTransitions();
+  wcout << endl;
+}
+
+void
+TMXCompiler::trim(vector<int> &v) const
+{
+  while(v.size() > 0)
+  {
+    if(iswspace(v[v.size()-1]))
+    {
+      v.pop_back();
+    }
+    else
+    {
+      break;
+    }
+  }
+  
+  bool principio = true;
+  vector<int> aux;
+  for(unsigned int i = 0, limit = v.size(); i < limit; i++)
+  {
+    if(!iswspace(v[i]) || !principio)
+    {
+      principio = false;
+      aux.push_back(v[i]);
+    }      
+  }
+  
+  v = aux;
+}
+
+void
+TMXCompiler::align(vector<int> &origin, vector<int> &meta)
+{
+  vector<unsigned int> numbers_origin_start,
+                       numbers_origin_length;
+  vector<int> modified_origin, modified_meta;
+
+  // compile information from origin
+  for(unsigned int i = 0, limit = origin.size(); i != limit; i++)
+  {
+    int nl = numberLength(origin, i);
+    if(nl != 0)
+    {
+      numbers_origin_start.push_back(i);
+      numbers_origin_length.push_back(nl);
+      i += nl-1;
+      modified_origin.push_back(alphabet(L"<n>"));
+    }
+    else
+    {
+      modified_origin.push_back(origin[i]);
+    }  
+  }
+    
+  // compile information from meta
+  for(int i = 0, limit = meta.size(); i != limit; i++)
+  {
+    unsigned int nl = numberLength(meta, i);
+    if(nl != 0)
+    {
+      bool tocado = false;
+      for(int j = 0, limit2 = numbers_origin_start.size(); j != limit2; j++)
+      {
+        if(nl == numbers_origin_length[j])
+        {
+          if(vectorcmp(origin, numbers_origin_start[j],
+                       meta, i, nl))
+          {
+            modified_meta.push_back(L'@');
+            modified_meta.push_back(L'(');
+            wchar_t *valor = new wchar_t[8];
+            swprintf(valor, 8, L"%d", j+1);
+            for(int k = 0, limit3 = wcslen(valor); k != limit3; k++)
+            {
+              modified_meta.push_back(valor[k]);
+            }
+            delete[] valor;
+            modified_meta.push_back(L')');
+            i += nl-1;
+            tocado = true;
+            break;
+          }
+        }
+      }
+      
+      if(!tocado)
+      {
+        if((unsigned int) i >= nl)
+        {
+          return;
+        }          
+
+        for(unsigned int j = i; j < nl; i++, j++)
+        {
+          modified_meta.push_back(meta[i]);
+        }
+        i--;
+      }
+    }  
+    else
+    {
+      modified_meta.push_back(meta[i]);
+    }
+  }
+  
+  origin = modified_origin;
+  meta = modified_meta;  
+}
+
+unsigned int
+TMXCompiler::numberLength(vector<int> &v, unsigned int const position) const
+{
+  for(unsigned int i = position, limit = v.size(); i < limit; i++)
+  {
+    if(!iswdigit(v[i]) && (v[i] != L'.' || i == position) && (v[i] != L',' || i == position))
+    {
+      if(i == position)
+      {
+        return 0;
+      }
+      else
+      {   
+        while(i != position)
+        {
+          i--;
+          if(iswdigit(v[i]))
+          {
+            return i - position + 1;
+          }
+        }  
+      }    
+    }
+  }
+
+  unsigned int i = v.size();
+  
+  while(i != position)
+  {
+    i--;
+    if(iswdigit(v[i]))
+    {
+      return i - position + 1;
+    }
+  }
+  
+  return 0;
+}
+
+bool
+TMXCompiler::vectorcmp(vector<int> const &orig, unsigned int const begin_orig,
+                       vector<int> const &meta, unsigned int const begin_meta,
+                       unsigned const int length) const
+{
+  for(unsigned int i = begin_orig, j = begin_meta, count = 0; count != length;
+      i++, j++, count++)
+  {
+    if(orig[i] != meta[j])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+void 
+TMXCompiler::printvector(vector<int> const &v, wostream &os)
+{
+  for(unsigned int i = 0, limit = v.size(); i != limit; i++)
+  {
+    if(i != 0)
+    {
+      os << L" ";
+    }
+    if(v[i] > 31)
+    {
+      os << v[i] << L" ('" << wchar_t(v[i]) << L"')";
+    }
+    else
+    {
+      os << v[i];
+    }      
+  }
+  os << endl;
+}
+
+void 
+TMXCompiler::setOriginLanguageCode(wstring const &code)
+{
+  // nada
+}
+
+void 
+TMXCompiler::setMetaLanguageCode(wstring const &code)
+{
+  // nada
+}
+
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/transducer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/transducer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/transducer.cc	(revision 70339)
@@ -0,0 +1,1168 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/transducer.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/my_stdio.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <vector>
+
+int
+Transducer::newState()
+{
+  int nstate = transitions.size();
+
+  while(transitions.find(nstate) != transitions.end())
+  {
+    nstate++;
+  }
+  transitions[nstate].clear();  // force creating
+
+  return nstate;
+}
+
+Transducer::Transducer()
+{
+  initial = newState();
+}
+
+Transducer::~Transducer()
+{
+  destroy();
+}
+
+Transducer::Transducer(Transducer const &t)
+{
+  copy(t);
+}
+
+Transducer &
+Transducer::operator =(Transducer const &t)
+{
+  if(this != &t)
+  {
+    destroy();
+    copy(t);
+  }
+  return *this;
+}
+
+int
+Transducer::insertSingleTransduction(int const tag, int const source)
+{
+  if(transitions.find(source) != transitions.end())
+  {
+    if(transitions[source].count(tag) == 1)
+    {
+      pair<multimap<int,int>::iterator, multimap<int,int>::iterator > range;
+      range = transitions[source].equal_range(tag);
+      return range.first->second;
+    }
+    else if(transitions[source].count(tag) == 0)
+    {
+      // new state
+      int state = newState();
+      transitions[source].insert(pair<int, int>(tag, state));
+      return state;
+    }
+    else if(transitions[source].count(tag) == 2)
+    {
+      // there's a local cycle, must be ignored and treated like in '1'
+      pair<multimap<int,int>::iterator, multimap<int,int>::iterator> range;
+      range = transitions[source].equal_range(tag);
+      for(; range.first != range.second; range.first++)
+      {
+        if(range.first->second != source)
+        {
+          return range.first->second;
+        }
+      }
+      return -1;
+    }
+    else
+    {
+      return -1;
+    }
+  }
+  else
+  {
+    return -1;
+  }
+}
+
+int
+Transducer::insertNewSingleTransduction(int const tag, int const source)
+{
+  int state = newState();
+  transitions[source].insert(pair<int, int>(tag, state));
+  return state;
+}
+
+int
+Transducer::insertTransducer(int const source, Transducer &t,
+                                 int const epsilon_tag)
+{
+  map<int, int> relacion;
+
+  t.joinFinals(epsilon_tag);
+
+  for(map<int, multimap<int, int> >::const_iterator it = t.transitions.begin(),
+                                                    limit = t.transitions.end();
+      it != limit; it++)
+  {
+    relacion[it->first] = newState();
+  }
+
+  for(map<int, multimap<int, int> >::const_iterator it = t.transitions.begin();
+      it != t.transitions.end(); it++)
+  {
+    for(multimap<int, int>::const_iterator it2 = it->second.begin(),
+                                           limit2 = (it->second).end();
+        it2 != limit2; it2++)
+    {
+      transitions[relacion[it->first]].insert(pair<int, int>(it2->first, relacion[it2->second]));
+    }
+  }
+
+  transitions[source].insert(pair<int, int>(epsilon_tag,
+					     relacion[t.initial]));
+
+  return relacion[*(t.finals.begin())];
+}
+
+void
+Transducer::linkStates(int const source, int const destino,
+			    int const etiqueta)
+{
+
+  if(transitions.find(source) != transitions.end() &&
+     transitions.find(destino) != transitions.end())
+  {
+    // new code
+    pair<multimap<int, int>::iterator, multimap<int, int>::iterator> range;
+    range = transitions[source].equal_range(etiqueta);
+    for(;range.first != range.second; range.first++)
+    {
+      if(range.first->first == etiqueta && range.first->second == destino)
+      {
+        return;
+      }
+    }
+    // end of new code
+    transitions[source].insert(pair<int, int>(etiqueta, destino));
+  }
+  else
+  {
+    wcerr << L"Error: Trying to link nonexistent states (" << source;
+    wcerr << L", " << destino << L", " << etiqueta << L")" << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+bool
+Transducer::isFinal(int const state) const
+{
+  return finals.find(state) != finals.end();
+}
+
+void
+Transducer::setFinal(int const state, bool valor)
+{
+/*
+  int initial_copy = getInitial();
+  if(state == initial_copy)
+  {
+    wcerr << L"Setting initial state to final" << endl;
+  }
+*/
+  if(valor)
+  {
+    finals.insert(state);
+  }
+  else
+  {
+    finals.erase(state);
+  }
+}
+
+int
+Transducer::getInitial() const
+{
+  return initial;
+}
+
+set<int>
+Transducer::closure(int const state, int const epsilon_tag)
+{
+  set<int> nonvisited, result;
+
+  nonvisited.insert(state);
+  result.insert(state);
+
+  while(nonvisited.size() > 0)
+  {
+    int auxest = *nonvisited.begin();
+    pair<multimap<int, int>::iterator, multimap<int, int>::iterator> rango;
+    rango = transitions[auxest].equal_range(epsilon_tag);
+    while(rango.first != rango.second)
+    {
+      if(result.find(rango.first->second) == result.end())
+      {
+        result.insert(rango.first->second);
+        nonvisited.insert(rango.first->second);
+      }
+      rango.first++;
+    }
+    nonvisited.erase(auxest);
+  }
+
+  return result;
+}
+
+void
+Transducer::joinFinals(int const epsilon_tag)
+{
+  if(finals.size() > 1)
+  {
+    int state = newState();
+
+    for(set<int>::iterator it = finals.begin(), limit = finals.end();
+        it != limit; it++)
+    {
+      linkStates(*it, state, epsilon_tag);
+    }
+
+    finals.clear();
+    finals.insert(state);
+  }
+  else if(finals.size() == 0)
+  {
+    wcerr << L"Error: empty set of final states" <<endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+bool
+Transducer::isEmptyIntersection(set<int> const &s1, set<int> const &s2)
+{
+
+  if(s1.size() < s2.size())
+  {
+    for(set<int>::const_iterator it = s1.begin(), limit = s1.end(); it != limit; it++)
+    {
+      if(s2.find(*it) != s2.end())
+      {
+	return false;
+      }
+    }
+  }
+  else
+  {
+    for(set<int>::const_iterator it = s2.begin(), limit = s2.end(); it != limit; it++)
+    {
+      if(s1.find(*it) != s1.end())
+      {
+        return false;
+      }
+    }
+  }
+
+  return true;
+}
+
+void
+Transducer::determinize(int const epsilon_tag)
+{
+  vector<set<int> > R(2);
+  map<int, set<int> > Q_prima;
+  map<set<int>, int> Q_prima_inv;
+
+  map<int, multimap<int, int> > transitions_prima;
+
+  unsigned int talla_Q_prima = 0;
+  Q_prima[0] = closure(initial, epsilon_tag);
+
+  Q_prima_inv[Q_prima[0]] = 0;
+  R[0].insert(0);
+
+  int initial_prima = 0;
+  set<int> finals_prima;
+
+  if(isFinal(initial))
+  {
+    finals_prima.insert(0);
+  }
+
+  int t = 0;
+
+  while(talla_Q_prima != Q_prima.size())
+  {
+    talla_Q_prima = Q_prima.size();
+    R[(t+1)%2].clear();
+
+    for(set<int>::iterator it = R[t].begin(), limit = R[t].end();
+        it != limit; it++)
+    {
+      if(!isEmptyIntersection(Q_prima[*it], finals))
+      {
+	finals_prima.insert(*it);
+      }
+
+      map<int, set<int> > mymap;
+
+      for(set<int>::iterator it2 = Q_prima[*it].begin(),
+                             limit2 = Q_prima[*it].end();
+	  it2 != limit2; it2++)
+      {
+        for(multimap<int, int>::iterator it3 = transitions[*it2].begin(),
+                                         limit3 = transitions[*it2].end();
+	    it3 != limit3; it3++)
+	{
+	  if(it3->first != epsilon_tag)
+	  {
+	    set<int> c = closure(it3->second, epsilon_tag);
+
+	    for(set<int>::iterator it4 = c.begin(), limit4 = c.end();
+	        it4 != limit4; it4++)
+	    {
+	      mymap[it3->first].insert(*it4);
+	    }
+	  }
+	}
+      }
+
+      // adding new states
+      for(map<int, set<int> >::iterator it2 = mymap.begin(), limit2 = mymap.end();
+	  it2 != limit2; it2++)
+      {
+	if(Q_prima_inv.find(it2->second) == Q_prima_inv.end())
+	{
+	  int etiq = Q_prima.size();
+	  Q_prima[etiq] = it2->second;
+	  Q_prima_inv[it2->second] = etiq;
+	  R[(t+1)%2].insert(Q_prima_inv[it2->second]);
+          transitions_prima[etiq].clear();
+	}
+        transitions_prima[*it].insert(pair<int, int>(it2->first, Q_prima_inv[it2->second]));
+      }
+    }
+
+    t = (t+1)%2;
+  }
+
+  transitions = transitions_prima;
+  finals = finals_prima;
+  initial = initial_prima;
+}
+
+
+void
+Transducer::minimize(int const epsilon_tag)
+{
+  reverse(epsilon_tag);
+  determinize(epsilon_tag);
+  reverse(epsilon_tag);
+  determinize(epsilon_tag);
+}
+
+void
+Transducer::optional(int const epsilon_tag)
+{
+  joinFinals(epsilon_tag);
+  int state = newState();
+  linkStates(state, initial, epsilon_tag);
+  initial = state;
+
+  state = newState();
+  linkStates(*finals.begin(), state, epsilon_tag);
+  finals.clear();
+  finals.insert(state);
+  linkStates(initial, state, epsilon_tag);
+}
+
+void
+Transducer::oneOrMore(int const epsilon_tag)
+{
+  joinFinals(epsilon_tag);
+  int state = newState();
+  linkStates(state, initial, epsilon_tag);
+  initial = state;
+
+  state = newState();
+  linkStates(*finals.begin(), state, epsilon_tag);
+  finals.clear();
+  finals.insert(state);
+  linkStates(state, initial, epsilon_tag);
+}
+
+void
+Transducer::zeroOrMore(int const epsilon_tag)
+{
+  oneOrMore(epsilon_tag);
+  optional(epsilon_tag);
+}
+
+void
+Transducer::clear()
+{
+  finals.clear();
+  transitions.clear();
+  initial = newState();
+}
+
+bool
+Transducer::isEmpty() const
+{
+  return finals.size() == 0 && transitions.size() == 1;
+}
+
+bool
+Transducer::hasNoFinals() const
+{
+  return finals.size() == 0;
+}
+
+int
+Transducer::size() const
+{
+  return transitions.size();
+}
+
+int
+Transducer::numberOfTransitions() const
+{
+  int counter = 0;
+
+  for(map<int, multimap<int, int> >::const_iterator it = transitions.begin(),
+                                                    limit = transitions.end();
+      it != limit; it++)
+  {
+    counter += (it->second).size();
+  }
+
+  return counter;
+}
+
+bool
+Transducer::isEmpty(int const state) const
+{
+  map<int, multimap<int, int> >::const_iterator it;
+
+  it = transitions.find(state);
+  if(it != transitions.end())
+  {
+    if((it->second).size() > 0)
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+void
+Transducer::write(FILE *output, int const decalage)
+{
+  Compression::multibyte_write(initial, output);
+  Compression::multibyte_write(finals.size(), output);
+
+  int base = 0;
+  for(set<int>::iterator it = finals.begin(), limit = finals.end();
+      it != limit; it++)
+  {
+    Compression::multibyte_write(*it - base, output);
+    base = *it;
+  }
+
+  base = transitions.size();
+  Compression::multibyte_write(base, output);
+  for(map<int, multimap<int, int> >::iterator it = transitions.begin(),
+                                              limit = transitions.end();
+      it != limit; it++)
+  {
+    Compression::multibyte_write(it->second.size(), output);
+    int tagbase = 0;
+    for(multimap<int, int>::iterator it2 = it->second.begin(),
+                                     limit2 = it->second.end();
+        it2 != limit2; it2++)
+    {
+      Compression::multibyte_write(it2->first-tagbase+decalage, output);
+      tagbase = it2->first;
+
+      if(it2->second >= it->first)
+      {
+        Compression::multibyte_write(it2->second-it->first, output);
+      }
+      else
+      {
+        Compression::multibyte_write(it2->second+base-it->first, output);
+      }
+    }
+  }
+}
+
+void
+Transducer::read(FILE *input, int const decalage)
+{
+  Transducer new_t;
+
+  new_t.initial = Compression::multibyte_read(input);
+  int finals_size = Compression::multibyte_read(input);
+
+  int base = 0;
+  while(finals_size > 0)
+  {
+    finals_size--;
+
+    base += Compression::multibyte_read(input);
+    new_t.finals.insert(base);
+  }
+
+  base = Compression::multibyte_read(input);
+  int number_of_states = base;
+  int current_state = 0;
+  while(number_of_states > 0)
+  {
+    int number_of_local_transitions = Compression::multibyte_read(input);
+    int tagbase = 0;
+    while(number_of_local_transitions > 0)
+    {
+      number_of_local_transitions--;
+      tagbase += Compression::multibyte_read(input) - decalage;
+      int state = (current_state + Compression::multibyte_read(input)) % base;
+      if(new_t.transitions.find(state) == new_t.transitions.end())
+      {
+        new_t.transitions[state].clear(); // force create
+      }
+      new_t.transitions[current_state].insert(pair<int, int>(tagbase, state));
+    }
+    number_of_states--;
+    current_state++;
+  }
+
+  *this = new_t;
+}
+
+void
+Transducer::copy(Transducer const &t)
+{
+  initial = t.initial;
+  finals = t.finals;
+  transitions = t.transitions;
+}
+
+void
+Transducer::destroy()
+{
+}
+
+void
+Transducer::reverse(int const epsilon_tag)
+{
+  joinFinals(epsilon_tag);
+
+  map<int, multimap<int, int> > temporal;
+
+  for(map<int, multimap<int, int> >::reverse_iterator it = transitions.rbegin(); it != transitions.rend(); it++)
+  {
+    multimap<int, int> aux = it->second;
+    it->second.clear();
+    for(multimap<int, int>::iterator it2 = aux.begin(), limit2 = aux.end();
+        it2 != limit2; it2++)
+    {
+      if(it2->second >= it->first)
+      {
+        transitions[it2->second].insert(pair<int, int>(it2->first, it->first));
+      }
+      else
+      {
+        temporal[it2->second].insert(pair<int, int>(it2->first, it->first));
+      }
+    }
+    if(temporal.find(it->first) != temporal.end())
+    {
+      (it->second).insert(temporal[it->first].begin(), temporal[it->first].end());
+      temporal.erase(it->first);
+    }
+  }
+
+  for(map<int, multimap<int, int> >::reverse_iterator it = temporal.rbegin(),
+                                                      limit = temporal.rend();
+      it != limit; it++)
+  {
+    for(multimap<int, int>::iterator it2 = it->second.begin(),
+                                     limit2 = it->second.end();
+	it2 != limit2; it2++)
+    {
+      transitions[it->first].insert(pair<int, int>(it2->first, it2->second));
+    }
+  }
+
+  int tmp = initial;
+  initial = *(finals.begin());
+  finals.clear();
+  finals.insert(tmp);
+}
+
+void
+Transducer::show(Alphabet const &alphabet, FILE *output, int const epsilon_tag) const
+{
+  map<int, multimap<int, int> > temporal;
+
+  for(map<int, multimap<int, int> >::const_iterator it = transitions.begin(); it != transitions.end(); it++)
+  {
+    multimap<int, int> aux = it->second;
+
+    for(multimap<int, int>::const_iterator it2 = aux.begin(); it2 != aux.end(); it2++)
+    {
+      pair<int, int> t = alphabet.decode(it2->first);
+      fwprintf(output, L"%d\t", it->first);
+      fwprintf(output, L"%d\t", it2->second);
+      wstring l = L"";
+      alphabet.getSymbol(l, t.first);
+      if(l == L"")  // If we find an epsilon
+      {
+        fwprintf(output, L"ε\t", l.c_str());
+      }
+      else
+      {
+        fwprintf(output, L"%S\t", l.c_str());
+      }
+      wstring r = L"";
+      alphabet.getSymbol(r, t.second);
+      if(r == L"")  // If we find an epsilon
+      {
+        fwprintf(output, L"ε\t", r.c_str());
+      }
+      else
+      {
+        fwprintf(output, L"%S\t", r.c_str());
+      }
+      fwprintf(output, L"\n");
+    }
+  }
+
+  for(set<int>::const_iterator it3 = finals.begin(); it3 != finals.end(); it3++)
+  {
+    fwprintf(output, L"%d\n", *it3);
+  }
+}
+
+int
+Transducer::getStateSize(int const state)
+{
+ set<int> states;
+ set<int> myclosure1 = closure(state, 0);
+ states.insert(myclosure1.begin(), myclosure1.end());
+ int num_transitions = 0;
+
+ for(set<int>::iterator it2 = states.begin(); it2 != states.end(); it2++)
+ {
+   num_transitions += transitions[*it2].size();
+ }
+
+ return num_transitions;
+}
+
+bool
+Transducer::recognise(wstring patro, Alphabet &a, FILE *err)
+{
+  bool accepted = false;
+  set<int> states ;
+
+  set<int> myclosure1 = closure(getInitial(), 0);
+  states.insert(myclosure1.begin(), myclosure1.end());
+  // For each of the characters in the input string
+  for(wstring::iterator it = patro.begin(); it != patro.end(); it++)
+  {
+    set<int> new_state;        //Transducer::closure(int const state, int const epsilon_tag)
+    int sym = *it;
+    // For each of the current alive states
+    //fwprintf(err, L"step: %S %C (%d)\n", patro.c_str(), *it, sym);
+    for(set<int>::iterator it2 = states.begin(); it2 != states.end(); it2++)
+    {
+      multimap<int, int> p = transitions[*it2];
+      // For each of the transitions in the state
+
+      for(multimap<int, int>::iterator it3 = p.begin(); it3 != p.end(); it3++)
+      {
+
+	pair<int, int> t = a.decode(it3->first);
+        wstring l = L"";
+        a.getSymbol(l, t.first);
+        //wstring r = L"";
+        //a.getSymbol(r, t.second);
+
+        //fwprintf(err, L"  -> state: %d, trans: %S:%S, targ: %d\n", *it2, (l == L"") ?  L"ε" : l.c_str(),  (r == L"") ?  L"ε" : r.c_str(), it3->second);
+        //if(l.find(*it) != wstring::npos || l == L"" )
+        if(l.find(*it) != wstring::npos)
+        {
+          set<int> myclosure = closure(it3->second, 0);
+          //wcerr << L"Before closure alives: " <<new_state.size() << endl;
+          new_state.insert(myclosure.begin(), myclosure.end());
+          //wcerr << L"After closure alives: " <<new_state.size() << endl;
+        }
+      }
+    }
+    states = new_state;
+  }
+  for(set<int>::iterator it4 = states.begin(); it4 != states.end(); it4++)
+  {
+    if(isFinal(*it4))
+    {
+      accepted = true;
+    }
+  }
+
+  return accepted;
+}
+
+void
+Transducer::unionWith(Alphabet &my_a,
+  Transducer &t,
+  int const epsilon_tag)
+{
+  finals.insert(insertTransducer(initial, t, epsilon_tag));
+}
+
+Transducer
+Transducer::appendDotStar(set<int> const &loopback_symbols, int const epsilon_tag)
+{
+  Transducer prefix_transducer(*this);
+
+  for(set<int>::iterator prefix_it = prefix_transducer.finals.begin(),
+                           prefix_limit = prefix_transducer.finals.end();
+      prefix_it != prefix_limit;
+      prefix_it++)
+  {
+    for(set<int>::iterator loopback_it = loopback_symbols.begin(),
+                           loopback_limit = loopback_symbols.end();
+    loopback_it != loopback_limit;
+    loopback_it++)
+    {
+      if((*loopback_it) != epsilon_tag) // TODO: Necessary? Minimization should remove epsilon loopbacks anyway
+      {
+        prefix_transducer.linkStates(*prefix_it, *prefix_it, *loopback_it);
+      }
+    }
+  }
+
+  return prefix_transducer;
+}
+
+Transducer
+Transducer::copyWithTagsFirst(int start,
+                              int group_label,
+                              Alphabet const &alphabet,
+                              int const epsilon_tag)
+{
+  Transducer new_t;
+  Transducer lemq;
+
+  map<int, int> states_this_new;
+  states_this_new.insert(make_pair(start, new_t.initial));
+  map<int, int> states_this_lemq;
+  states_this_new.insert(make_pair(start, lemq.initial));
+
+  typedef std::pair<int, int> SearchState;
+  // Each searchstate in the stack is a transition in this FST, along
+  // with the last reached state of the lemq
+  std::list<SearchState> todo;
+  std::set<SearchState> seen;
+  std::set<SearchState> finally;
+  SearchState current;
+  todo.push_front(make_pair(start,start));
+
+  while(todo.size() > 0) {
+    current = todo.front();
+    todo.pop_front();
+    seen.insert(current);
+    int this_src = current.first, this_lemqlast = current.second;
+
+    for(multimap<int, int>::iterator trans_it = transitions[this_src].begin(),
+          trans_limit = transitions[this_src].end();
+        trans_it != trans_limit;
+        trans_it++)
+    {
+      int label = trans_it->first, this_trg = trans_it->second;
+      int left_symbol = alphabet.decode(label).first;
+
+      // Anything after the first tag goes before the lemq, whether
+      // epsilon or alphabetic (might be a hack to force trimming). If
+      // the lemqlast state is already set to something other than
+      // this_src, then we've seen the first tag (and are done reading
+      // lemq).
+      if(alphabet.isTag(left_symbol) || (this_src != this_lemqlast))
+      {
+        int new_src;
+        if(this_src == this_lemqlast)
+        {
+          // We've reached the first tag
+          new_src = states_this_new[start];
+          lemq.finals.insert(this_lemqlast);
+        }
+        else
+        {
+          if(states_this_new.find(this_src) == states_this_new.end())
+          {
+            states_this_new.insert(make_pair(this_src, new_t.newState()));
+          }
+          new_src = states_this_new[this_src];
+        }
+
+        if(states_this_new.find(this_trg) == states_this_new.end())
+        {
+          states_this_new.insert(make_pair(this_trg, new_t.newState()));
+        }
+        int new_trg = states_this_new[this_trg];
+        new_t.linkStates(new_src, new_trg, label);
+
+        if(isFinal(this_src))
+        {
+          finally.insert(make_pair(this_src, this_lemqlast));
+        }
+
+        if(seen.find(make_pair(this_trg, this_lemqlast)) == seen.end())
+        {
+          todo.push_front(make_pair(this_trg, this_lemqlast));
+        }
+      }
+      else
+      {
+        // We're still reading the lemq, append label to current one:
+        int lemq_src = states_this_lemq[this_src];
+        if(states_this_lemq.find(this_trg) == states_this_lemq.end())
+        {
+          states_this_lemq.insert(make_pair(this_trg, lemq.newState()));
+        }
+        int lemq_trg = states_this_lemq[this_trg];
+        lemq.linkStates(lemq_src, lemq_trg, label);
+        if(seen.find(make_pair(this_trg, this_trg)) == seen.end())
+        {
+          todo.push_front(make_pair(this_trg, this_trg));
+        }
+      }
+    } // end for transitions
+  } // end while todo
+
+  for(set<SearchState>::iterator it = finally.begin(), limit = finally.end();
+      it != limit;
+      it++)
+  {
+    int last_tag = it->first,
+      this_lemqlast = it->second;
+    // copy lemq, letting this_lemqlast be the only final state in newlemq
+    Transducer newlemq = Transducer(lemq);
+    newlemq.finals.clear();
+    newlemq.finals.insert(states_this_lemq[this_lemqlast]);
+    newlemq.minimize();
+
+    int group_start = new_t.newState();
+    new_t.linkStates(states_this_new[last_tag], group_start, group_label);
+
+    // append newlemq into the group after last_tag:
+    new_t.finals.insert(
+      new_t.insertTransducer(group_start,
+                             newlemq)
+      );
+  }
+
+  return new_t;
+}
+
+Transducer
+Transducer::moveLemqsLast(Alphabet const &alphabet,
+                          int const epsilon_tag)
+{
+  // TODO: These should be in file which is included by both
+  // fst_processor.cc and compiler.cc:
+  wstring COMPILER_GROUP_ELEM = L"#";
+
+  Transducer new_t;
+  typedef int SearchState;
+  std::set<SearchState> seen;
+  std::list<SearchState> todo;
+  todo.push_front(initial);
+
+  map<int, int> states_this_new;
+  states_this_new.insert(make_pair(initial, new_t.initial));
+
+  while(todo.size() > 0)
+  {
+    int this_src = todo.front();
+    todo.pop_front();
+    seen.insert(this_src);
+    for(multimap<int, int>::iterator trans_it = transitions[this_src].begin(),
+          trans_limit = transitions[this_src].end();
+        trans_it != trans_limit;
+        trans_it++)
+    {
+      int label = trans_it->first,
+       this_trg = trans_it->second;
+      wstring left = L"";
+      alphabet.getSymbol(left, alphabet.decode(label).first);
+      int new_src = states_this_new[this_src];
+
+      if(left == COMPILER_GROUP_ELEM)
+      {
+        Transducer tagsFirst = copyWithTagsFirst(this_trg, label, alphabet, epsilon_tag);
+        new_t.finals.insert(
+          new_t.insertTransducer(new_src, tagsFirst, epsilon_tag)
+          );
+      }
+      else
+      {
+        if(states_this_new.find(this_trg) == states_this_new.end())
+        {
+          states_this_new.insert(make_pair(this_trg, new_t.newState()));
+        }
+        int new_trg = states_this_new[this_trg];
+        new_t.linkStates(new_src, new_trg, label);
+        if(seen.find(this_trg) == seen.end())
+        {
+          todo.push_front(this_trg);
+        }
+      }
+    }
+  }
+
+  for(set<int>::iterator it = finals.begin(), limit = finals.end();
+      it != limit;
+      it++)
+   {
+     new_t.finals.insert(states_this_new[*it]);
+   }
+
+  return new_t;
+}
+
+
+Transducer
+Transducer::intersect(Transducer &trimmer,
+  Alphabet const &this_a,
+  Alphabet const &trimmer_a,
+  int const epsilon_tag)
+{
+  joinFinals(epsilon_tag);
+  /**
+   * this ∩ trimmer = trimmed
+   *
+   * The trimmer is typically a bidix passed through appendDotStar.
+   */
+
+  // TODO: These should be in file which is included by both
+  // fst_processor.cc and compiler.cc:
+  wstring compoundOnlyLSymbol = L"<compound-only-L>";
+  wstring compoundRSymbol = L"<compound-R>";
+  wstring COMPILER_JOIN_ELEM = L"+";
+  wstring COMPILER_GROUP_ELEM = L"#";
+
+  // State numbers may differ in thisXtrimmer transducers and the trimmed:
+  Transducer trimmed;
+  std::map<std::pair<int, int>, int> states_this_trimmed;
+  states_this_trimmed.insert(make_pair(make_pair(initial, trimmer.initial),
+                                       trimmed.initial));
+
+  typedef std::pair<int, std::pair<int, int > > SearchState;
+  // first: currently searched state in this;
+  // second.first: currently matched trimmer state;
+  // second.second: last matched trimmer state before a + restart (or the same second.first if no + is seen yet).
+  // When several trimmer-states match from one this-state, we just get several triplets.
+
+  std::list<SearchState> todo;
+  std::set<SearchState> seen;
+  SearchState current, next;
+  todo.push_front(make_pair(initial, make_pair(trimmer.initial, trimmer.initial)));
+
+  while(todo.size() > 0)
+  {
+    current = todo.front();
+    todo.pop_front();
+    seen.insert(current);
+    int this_src        = current.first,
+        trimmer_src     = current.second.first,
+        trimmer_preplus = current.second.second,
+        trimmer_preplus_next = trimmer_preplus;
+
+    if(states_this_trimmed.find(make_pair(this_src, trimmer_src)) == states_this_trimmed.end()) {
+      wcerr <<L"Error: couldn't find "<<this_src<<L","<<trimmer_src<<L" in state map"<<endl;
+      exit(EXIT_FAILURE);
+    }
+    int trimmed_src = states_this_trimmed[make_pair(this_src, trimmer_src)];
+
+    // First loop through _epsilon_ transitions of trimmer
+    for(multimap<int, int>::iterator trimmer_trans_it = trimmer.transitions.at(trimmer_src).begin(),
+          trimmer_trans_limit = trimmer.transitions.at(trimmer_src).end();
+        trimmer_trans_it != trimmer_trans_limit;
+        trimmer_trans_it++) {
+      int trimmer_label = trimmer_trans_it->first,
+          trimmer_trg   = trimmer_trans_it->second;
+      wstring trimmer_left = L"";
+      trimmer_a.getSymbol(trimmer_left, trimmer_a.decode(trimmer_label).first);
+
+      if(trimmer_preplus == trimmer_src) {
+        // Keep the old preplus state if it was set; equal to current trimmer state means unset:
+        trimmer_preplus_next = trimmer_trg;
+      }
+
+      if(trimmer_left == L"")
+      {
+        next = make_pair(this_src, make_pair(trimmer_trg, trimmer_preplus_next));
+        std::pair<int, int> states_trg = make_pair(this_src, trimmer_trg);
+        if(seen.find(next) == seen.end())
+        {
+          todo.push_front(next);
+          states_this_trimmed.insert(make_pair(states_trg, trimmed.newState()));
+        }
+        int trimmed_trg = states_this_trimmed[states_trg];
+        trimmed.linkStates(trimmed_src,
+                           trimmed_trg,
+                           epsilon_tag);
+      }
+    }
+
+    // Loop through arcs from this_src; when our arc matches an arc
+    // from live_trimmer_states, add that to (the front of) todo:
+    for(multimap<int, int>::iterator trans_it = transitions[this_src].begin(),
+                                     trans_limit = transitions[this_src].end();
+        trans_it != trans_limit;
+        trans_it++)
+    {
+      int this_label = trans_it->first,
+          this_trg   = trans_it->second;
+      wstring this_right = L"";
+      this_a.getSymbol(this_right, this_a.decode(this_label).second);
+
+      if(this_right == COMPILER_JOIN_ELEM)
+      {
+        if(trimmer_preplus == trimmer_src) {
+          // Keep the old preplus state if it was set; equal to current trimmer state means unset:
+          trimmer_preplus_next = trimmer_src; // not _trg when join!
+        }
+        // Go to the start in trimmer, but record where we restarted from in case we later see a #:
+        next = make_pair(this_trg, make_pair(trimmer.initial, trimmer_preplus_next));
+        if(seen.find(next) == seen.end())
+        {
+          todo.push_front(next);
+        }
+        std::pair<int, int> states_trg = make_pair(this_trg, trimmer.initial);
+        if(states_this_trimmed.find(states_trg) == states_this_trimmed.end())
+        {
+          states_this_trimmed.insert(make_pair(states_trg, trimmed.newState()));
+        }
+        int trimmed_trg = states_this_trimmed[states_trg];
+        trimmed.linkStates(trimmed_src, // fromState
+                           trimmed_trg, // toState
+                           this_label); // symbol-pair, using this alphabet
+      }
+      else if ( this_right == compoundOnlyLSymbol
+                || this_right == compoundRSymbol
+                || this_right == L"" )
+      {
+        // Stay put in the trimmer FST
+        int trimmer_trg = trimmer_src;
+
+        if(trimmer_preplus == trimmer_src) {
+          // Keep the old preplus state if it was set; equal to current trimmer state means unset:
+          trimmer_preplus_next = trimmer_trg;
+        }
+
+        next = make_pair(this_trg, make_pair(trimmer_trg, trimmer_preplus_next));
+        if(seen.find(next) == seen.end())
+        {
+          todo.push_front(next);
+        }
+        std::pair<int, int> states_trg = make_pair(this_trg, trimmer_trg);
+        if(states_this_trimmed.find(states_trg) == states_this_trimmed.end())
+        {
+          states_this_trimmed.insert(make_pair(states_trg, trimmed.newState()));
+        }
+        int trimmed_trg = states_this_trimmed[states_trg];
+        trimmed.linkStates(trimmed_src, // fromState
+                           trimmed_trg, // toState
+                           this_label); // symbol-pair, using this alphabet
+      }
+      else
+      {
+        // Loop through non-epsilon arcs from the live state of trimmer
+
+        // If we see a plus, we may have to rewind our trimmer state first:
+        if(this_right == COMPILER_GROUP_ELEM && trimmer_preplus != trimmer_src)
+        {
+          states_this_trimmed.insert(make_pair(make_pair(this_src, trimmer_preplus),
+                                               trimmed_src));
+          trimmer_src = trimmer_preplus;
+        }
+
+        for(multimap<int, int>::iterator trimmer_trans_it = trimmer.transitions.at(trimmer_src).begin(),
+              trimmer_trans_limit = trimmer.transitions.at(trimmer_src).end();
+            trimmer_trans_it != trimmer_trans_limit;
+            trimmer_trans_it++)
+        {
+          int trimmer_label = trimmer_trans_it->first,
+              trimmer_trg   = trimmer_trans_it->second;
+          wstring trimmer_left = L"";
+          trimmer_a.getSymbol(trimmer_left, trimmer_a.decode(trimmer_label).first);
+
+          if(trimmer_preplus == trimmer_src) {
+            // Keep the old preplus state if it was set; equal to current trimmer state means unset:
+            trimmer_preplus_next = trimmer_trg;
+          }
+
+          if(trimmer_left != L"" && this_right == trimmer_left) // we've already dealt with trimmer epsilons
+          {
+            next = make_pair(this_trg, make_pair(trimmer_trg, trimmer_preplus_next));
+            if(seen.find(next) == seen.end())
+            {
+              todo.push_front(next);
+            }
+            std::pair<int, int> states_trg = make_pair(this_trg, trimmer_trg);
+            if(states_this_trimmed.find(states_trg) == states_this_trimmed.end())
+            {
+              states_this_trimmed.insert(make_pair(states_trg, trimmed.newState()));
+            }
+            int trimmed_trg = states_this_trimmed[states_trg];
+            trimmed.linkStates(trimmed_src, // fromState
+                               trimmed_trg, // toState
+                               this_label); // symbol-pair, using this alphabet
+          }
+        } // end loop arcs from trimmer_src
+      } // end if JOIN else
+    } // end loop arcs from this_src
+  } // end while todo
+
+  for(map<std::pair<int, int>, int >::iterator it = states_this_trimmed.begin(),
+        limit = states_this_trimmed.end();
+      it != limit;
+      it++)
+  {
+    int s_this = it->first.first;
+    int s_trimmer = it->first.second;
+    int s_trimmed = it->second;
+    if(isFinal(s_this) && trimmer.isFinal(s_trimmer))
+    {
+      trimmed.finals.insert(s_trimmed);
+    }
+  }
+
+  // We do not minimize here, in order to let lt_trim print a warning
+  // (instead of exiting the whole program) if no finals.
+  return trimmed;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/Makefile.am	(revision 70339)
@@ -0,0 +1,75 @@
+
+h_sources = alphabet.h att_compiler.h buffer.h compiler.h compression.h  \
+            entry_token.h expander.h fst_processor.h lt_locale.h ltstr.h \
+            match_exe.h match_node.h match_state.h my_stdio.h node.h \
+            pattern_list.h regexp_compiler.h sorted_vector.h state.h \
+            transducer.h trans_exe.h xml_parse_util.h exception.h tmx_compiler.h
+cc_sources = alphabet.cc att_compiler.cc compiler.cc compression.cc entry_token.cc \
+             expander.cc fst_processor.cc lt_locale.cc match_exe.cc \
+             match_node.cc match_state.cc node.cc pattern_list.cc \
+             regexp_compiler.cc sorted_vector.cc state.cc transducer.cc \
+             trans_exe.cc xml_parse_util.cc tmx_compiler.cc
+
+library_includedir = $(includedir)/$(GENERIC_LIBRARY_NAME)-$(GENERIC_API_VERSION)/$(GENERIC_LIBRARY_NAME)
+library_include_HEADERS = $(h_sources)
+
+bin_PROGRAMS = lt-comp lt-proc lt-expand lt-tmxcomp lt-tmxproc lt-print lt-trim
+instdir = lttoolbox
+
+lib_LTLIBRARIES= liblttoolbox3.la
+liblttoolbox3_la_SOURCES= $(h_sources) $(cc_sources)
+liblttoolbox3_la_LDFLAGS= -version-info $(GENERIC_LIBRARY_VERSION) -release $(GENERIC_RELEASE)
+
+lttoolboxdir = $(prefix)/share/lttoolbox
+lttoolboxinclude = $(prefix)/include
+lttoolboxlib = $(prefix)/lib
+
+lttoolbox_DATA = dix.dtd dix.rng dix.rnc acx.rng xsd/dix.xsd xsd/acx.xsd
+
+lt_print_SOURCES = lt_print.cc
+lt_print_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_print_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+lt_trim_SOURCES = lt_trim.cc
+lt_trim_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_trim_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+lt_comp_SOURCES = lt_comp.cc
+lt_comp_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_comp_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+lt_proc_SOURCES = lt_proc.cc
+lt_proc_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_proc_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+lt_expand_SOURCES = lt_expand.cc
+lt_expand_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_expand_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+lt_tmxcomp_SOURCES = lt_tmxcomp.cc
+lt_tmxcomp_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_tmxcomp_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+lt_tmxproc_SOURCES = lt_tmxproc.cc
+lt_tmxproc_LDADD = liblttoolbox$(GENERIC_MAJOR_VERSION).la
+lt_tmxproc_LDFLAGS = -llttoolbox$(GENERIC_MAJOR_VERSION) $(LTTOOLBOX_LIBS)
+
+#lt-validate-dictionary: Makefile.am validate-header.sh
+#	@echo "Creating lt-validate-dictionary script"
+#	@echo "#!$(BASH)" > $@
+#	@cat validate-header.sh >> $@
+#	@echo "$(XMLLINT) --dtdvalid $(apertiumdir)/dix.dtd --noout \$$FILE1 && exit 0;" >> $@
+#	@echo "exit 1;" >> $@
+#	@chmod a+x $@
+
+
+
+man_MANS = lt-comp.1 lt-expand.1 lt-proc.1 lt-tmxcomp.1 lt-tmxproc.1 lt-print.1 lt-trim.1
+
+INCLUDES = -I$(top_srcdir) $(LTTOOLBOX_CFLAGS)
+if WINDOWS
+  INCLUDES += -I$(top_srcdir)/utf8
+endif
+CLEANFILES = *~
+
+EXTRA_DIST = dix.dtd dix.rng dix.rnc acx.rng xsd/dix.xsd xsd/acx.xsd CMakeLists.txt $(man_MANS)
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.rnc	(revision 70339)
@@ -0,0 +1,129 @@
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+# 
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+# 
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+# 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not <http://www.gnu.org/licenses/>.
+# 
+#    DTD for the format of dictionaries
+
+dictionary =
+  element dictionary {
+    attlist.dictionary, alphabet?, sdefs?, pardefs?, section+
+  }
+attlist.dictionary &= empty
+#  root element
+alphabet = element alphabet { attlist.alphabet, text }
+attlist.alphabet &= empty
+# alphabetic character list
+sdefs = element sdefs { attlist.sdefs, sdef+ }
+attlist.sdefs &= empty
+# symbol definition section
+sdef = element sdef { attlist.sdef, empty }
+# symbol definition
+attlist.sdef &= attribute n { xsd:ID }
+# n: symbol (tag) name
+attlist.sdef &= attribute c { text }?
+# c: symbol (tag) comment
+pardefs = element pardefs { attlist.pardefs, pardef+ }
+attlist.pardefs &= empty
+# paradigm definition section
+pardef = element pardef { attlist.pardef, e+ }
+# paradigm definition
+attlist.pardef &= attribute n { text }
+# n: paradigm name
+attlist.pardef &= attribute c { text }?
+# c: comment about paradigm
+section = element section { attlist.section, e+ }
+# dictionary section
+attlist.section &=
+  attribute id { xsd:ID },
+  attribute type {
+    "standard" | "inconditional" | "postblank" | "preblank"
+  }
+# id: dictionary section identifier
+
+# type: dictionary section type
+e = element e { attlist.e, (i | p | par | re)+ }
+# entry
+attlist.e &=
+  attribute r { "LR" | "RL" }?,
+  attribute lm { text }?,
+  attribute a { text }?,
+  attribute c { text }?,
+  attribute i { text }?,
+  attribute slr { text }?,
+  attribute srl { text }?,
+  attribute alt { text }?,
+  attribute v { text }?,
+  attribute vl { text }?,
+  attribute vr { text }?
+# r: restriction LR: left-to-right,
+# RL: right-to-left
+
+# lm: lemma
+
+# a: author
+
+# c: comment
+
+# i: ignore ('yes') means ignore, otherwise it is not ignored)
+
+# slr: translation sense when translating from left to right
+
+# srl: translation sense when translating from right to left
+
+# alt: alternative entries are omitted if not selected
+
+# v: variant sets (monodix) direction restrictions based on language variant
+
+# vl: variant left sets direction restrictions based on language variant for language on left of bidix
+
+# vr: variant right sets direction restrictions based on language variant for language on right of bidix
+par = element par { attlist.par, empty }
+# reference to paradigm
+attlist.par &= attribute n { text }
+# n: paradigm name
+i = element i { attlist.i, (text | b | s | g | j | a)* }
+attlist.i &= empty
+# identity
+re = element re { attlist.re, text }
+attlist.re &= empty
+# regular expression identification
+p = element p { attlist.p, l, r }
+attlist.p &= empty
+# pair of strings
+l = element l { attlist.l, (text | a | b | g | j | s)* }
+attlist.l &= empty
+# left part of p
+r = element r { attlist.r, (text | a | b | g | j | s)* }
+attlist.r &= empty
+# right part of p
+a = element a { attlist.a, empty }
+attlist.a &= empty
+# post-generator wake-up mark
+b = element b { attlist.b, empty }
+attlist.b &= empty
+# blank chars block mark
+g = element g { attlist.g, (text | a | b | j | s)* }
+# mark special groups in lemmas
+attlist.g &= attribute i { text }?
+# i is used to co-index groups in the left with those
+
+# on the right of a pair
+j = element j { attlist.j, empty }
+attlist.j &= empty
+# join lexical forms
+s = element s { attlist.s, empty }
+# reference to symbol (tag)
+attlist.s &= attribute n { xsd:IDREF }
+start = dictionary
+# n: symbol (tag) name
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.rng	(revision 70339)
@@ -0,0 +1,365 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+  Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+  This program is free software; you can redistribute it and/or
+  modify it under the terms of the GNU General Public License as
+  published by the Free Software Foundation; either version 2 of the
+  License, or (at your option) any later version.
+  
+  This program is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  General Public License for more details.
+  
+  You should have received a copy of the GNU General Public License
+  along with this program; if not <http://www.gnu.org/licenses/>.
+  
+     DTD for the format of dictionaries
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0" datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes">
+  <define name="dictionary">
+    <element name="dictionary">
+      <ref name="attlist.dictionary"/>
+      <optional>
+        <ref name="alphabet"/>
+      </optional>
+      <optional>
+        <ref name="sdefs"/>
+      </optional>
+      <optional>
+        <ref name="pardefs"/>
+      </optional>
+      <oneOrMore>
+        <ref name="section"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.dictionary" combine="interleave">
+    <empty/>
+  </define>
+  <!--  root element -->
+  <define name="alphabet">
+    <element name="alphabet">
+      <ref name="attlist.alphabet"/>
+      <text/>
+    </element>
+  </define>
+  <define name="attlist.alphabet" combine="interleave">
+    <empty/>
+  </define>
+  <!-- alphabetic character list -->
+  <define name="sdefs">
+    <element name="sdefs">
+      <ref name="attlist.sdefs"/>
+      <oneOrMore>
+        <ref name="sdef"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.sdefs" combine="interleave">
+    <empty/>
+  </define>
+  <!-- symbol definition section -->
+  <define name="sdef">
+    <element name="sdef">
+      <ref name="attlist.sdef"/>
+      <empty/>
+    </element>
+  </define>
+  <!-- symbol definition -->
+  <define name="attlist.sdef" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+  </define>
+  <!-- n: symbol (tag) name -->
+  <define name="attlist.sdef" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- c: symbol (tag) comment -->
+  <define name="pardefs">
+    <element name="pardefs">
+      <ref name="attlist.pardefs"/>
+      <oneOrMore>
+        <ref name="pardef"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.pardefs" combine="interleave">
+    <empty/>
+  </define>
+  <!-- paradigm definition section -->
+  <define name="pardef">
+    <element name="pardef">
+      <ref name="attlist.pardef"/>
+      <oneOrMore>
+        <ref name="e"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <!-- paradigm definition -->
+  <define name="attlist.pardef" combine="interleave">
+    <attribute name="n"/>
+  </define>
+  <!-- n: paradigm name -->
+  <define name="attlist.pardef" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- c: comment about paradigm -->
+  <define name="section">
+    <element name="section">
+      <ref name="attlist.section"/>
+      <oneOrMore>
+        <ref name="e"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <!-- dictionary section -->
+  <define name="attlist.section" combine="interleave">
+    <attribute name="id">
+      <data type="ID"/>
+    </attribute>
+    <attribute name="type">
+      <choice>
+        <value>standard</value>
+        <value>inconditional</value>
+        <value>postblank</value>
+        <value>preblank</value>
+      </choice>
+    </attribute>
+  </define>
+  <!-- id: dictionary section identifier -->
+  <!-- type: dictionary section type -->
+  <define name="e">
+    <element name="e">
+      <ref name="attlist.e"/>
+      <oneOrMore>
+        <choice>
+          <ref name="i"/>
+          <ref name="p"/>
+          <ref name="par"/>
+          <ref name="re"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <!-- entry -->
+  <define name="attlist.e" combine="interleave">
+    <optional>
+      <attribute name="r">
+        <choice>
+          <value>LR</value>
+          <value>RL</value>
+        </choice>
+      </attribute>
+    </optional>
+    <optional>
+      <attribute name="lm"/>
+    </optional>
+    <optional>
+      <attribute name="a"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+    <optional>
+      <attribute name="i"/>
+    </optional>
+    <optional>
+      <attribute name="slr"/>
+    </optional>
+    <optional>
+      <attribute name="srl"/>
+    </optional>
+    <optional>
+      <attribute name="alt"/>
+    </optional>
+    <optional>
+      <attribute name="v"/>
+    </optional>
+    <optional>
+      <attribute name="vl"/>
+    </optional>
+    <optional>
+      <attribute name="vr"/>
+    </optional>
+  </define>
+  <!--
+    r: restriction LR: left-to-right,
+    RL: right-to-left
+  -->
+  <!-- lm: lemma -->
+  <!-- a: author -->
+  <!-- c: comment -->
+  <!-- i: ignore ('yes') means ignore, otherwise it is not ignored) -->
+  <!-- slr: translation sense when translating from left to right -->
+  <!-- srl: translation sense when translating from right to left -->
+  <!-- alt: alternative entries are omitted if not selected -->
+  <!-- v: variant sets (monodix) direction restrictions based on language variant -->
+  <!-- vl: variant left sets direction restrictions based on language variant for language on left of bidix -->
+  <!-- vr: variant right sets direction restrictions based on language variant for language on right of bidix -->
+  <define name="par">
+    <element name="par">
+      <ref name="attlist.par"/>
+      <empty/>
+    </element>
+  </define>
+  <!-- reference to paradigm -->
+  <define name="attlist.par" combine="interleave">
+    <attribute name="n"/>
+  </define>
+  <!-- n: paradigm name -->
+  <define name="i">
+    <element name="i">
+      <ref name="attlist.i"/>
+      <zeroOrMore>
+        <choice>
+          <text/>
+          <ref name="b"/>
+          <ref name="s"/>
+          <ref name="g"/>
+          <ref name="j"/>
+          <ref name="a"/>
+        </choice>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.i" combine="interleave">
+    <empty/>
+  </define>
+  <!-- identity -->
+  <define name="re">
+    <element name="re">
+      <ref name="attlist.re"/>
+      <text/>
+    </element>
+  </define>
+  <define name="attlist.re" combine="interleave">
+    <empty/>
+  </define>
+  <!-- regular expression identification -->
+  <define name="p">
+    <element name="p">
+      <ref name="attlist.p"/>
+      <ref name="l"/>
+      <ref name="r"/>
+    </element>
+  </define>
+  <define name="attlist.p" combine="interleave">
+    <empty/>
+  </define>
+  <!-- pair of strings -->
+  <define name="l">
+    <element name="l">
+      <ref name="attlist.l"/>
+      <zeroOrMore>
+        <choice>
+          <text/>
+          <ref name="a"/>
+          <ref name="b"/>
+          <ref name="g"/>
+          <ref name="j"/>
+          <ref name="s"/>
+        </choice>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.l" combine="interleave">
+    <empty/>
+  </define>
+  <!-- left part of p -->
+  <define name="r">
+    <element name="r">
+      <ref name="attlist.r"/>
+      <zeroOrMore>
+        <choice>
+          <text/>
+          <ref name="a"/>
+          <ref name="b"/>
+          <ref name="g"/>
+          <ref name="j"/>
+          <ref name="s"/>
+        </choice>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.r" combine="interleave">
+    <empty/>
+  </define>
+  <!-- right part of p -->
+  <define name="a">
+    <element name="a">
+      <ref name="attlist.a"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.a" combine="interleave">
+    <empty/>
+  </define>
+  <!-- post-generator wake-up mark -->
+  <define name="b">
+    <element name="b">
+      <ref name="attlist.b"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.b" combine="interleave">
+    <empty/>
+  </define>
+  <!-- blank chars block mark -->
+  <define name="g">
+    <element name="g">
+      <ref name="attlist.g"/>
+      <zeroOrMore>
+        <choice>
+          <text/>
+          <ref name="a"/>
+          <ref name="b"/>
+          <ref name="j"/>
+          <ref name="s"/>
+        </choice>
+      </zeroOrMore>
+    </element>
+  </define>
+  <!-- mark special groups in lemmas -->
+  <define name="attlist.g" combine="interleave">
+    <optional>
+      <attribute name="i"/>
+    </optional>
+  </define>
+  <!-- i is used to co-index groups in the left with those -->
+  <!-- on the right of a pair -->
+  <define name="j">
+    <element name="j">
+      <ref name="attlist.j"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.j" combine="interleave">
+    <empty/>
+  </define>
+  <!-- join lexical forms -->
+  <define name="s">
+    <element name="s">
+      <ref name="attlist.s"/>
+      <empty/>
+    </element>
+  </define>
+  <!-- reference to symbol (tag) -->
+  <define name="attlist.s" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <start>
+    <choice>
+      <ref name="dictionary"/>
+    </choice>
+  </start>
+</grammar>
+<!-- n: symbol (tag) name -->
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_state.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_state.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_state.cc	(revision 70339)
@@ -0,0 +1,153 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/match_state.h>
+#include <lttoolbox/pattern_list.h>
+
+#include <climits>
+#include <cstring>
+
+int const MatchState::BUF_LIMIT = 1024;
+
+MatchState::MatchState()
+{
+  first = last = 0;
+  state = new MatchNode *[BUF_LIMIT];
+}
+
+MatchState::~MatchState()
+{
+  destroy();
+}
+
+MatchState::MatchState(MatchState const &s)
+{
+  copy(s);
+}
+
+MatchState &
+MatchState::operator =(MatchState const &s)
+{
+  if(this != &s)
+  {
+    destroy();
+    copy(s);
+  }
+
+  return *this;
+}
+
+void 
+MatchState::destroy()
+{
+  delete[] state;
+  state = 0;
+}
+
+void
+MatchState::copy(MatchState const &s)
+{
+  if (state == 0)
+  {
+    state = new MatchNode *[BUF_LIMIT];
+  }
+
+  for(int i = 0; i < BUF_LIMIT; i++)
+  {
+    state[i] = s.state[i];
+  }
+  first = s.first;
+  last = s.last;
+}
+
+int 
+MatchState::size() const
+{
+  return last >= first ? last - first: last + BUF_LIMIT -first;
+}
+
+void
+MatchState::init(MatchNode *initial)
+{
+  first = 0;
+  last = 1;
+  state[0] = initial;
+} 
+
+void
+MatchState::applySymbol(MatchNode *pnode, int const symbol)
+{
+  MatchNode *aux = pnode->transitions.search(symbol);
+  if(aux != NULL)
+  {
+    state[last] = aux;
+    last = (last + 1)%BUF_LIMIT;
+  }
+}
+
+void
+MatchState::step(int const input)
+{
+  int mylast = last;
+  for(int i = first; i != mylast; i=(i+1)%BUF_LIMIT)
+  {
+    applySymbol(state[i], input);
+  }
+  first = mylast;
+}
+
+void
+MatchState::step(int const input, int const alt)
+{
+  int mylast = last;
+  for(int i = first; i != mylast; i=(i+1)%BUF_LIMIT)
+  {
+    applySymbol(state[i], input);
+    applySymbol(state[i], alt);
+  }
+  first = mylast;
+}
+
+int
+MatchState::classifyFinals(map<MatchNode *, int> const &final_class) const
+{
+  set<int> empty_set;
+  return classifyFinals(final_class, empty_set);
+}
+
+int
+MatchState::classifyFinals(map<MatchNode *, int> const &final_class, set<int> const &banned_rules) const
+{
+  int result = INT_MAX;
+  for (int i = first; i != last; i = (i+1)%BUF_LIMIT)
+  {
+    map<MatchNode*, int>::const_iterator it2 = final_class.find(state[i]);
+    if(it2 != final_class.end())
+    {
+      if(it2->second < result && banned_rules.find(it2->second) == banned_rules.end())
+      {
+        result = it2->second;
+      }
+    }
+  }
+  return (result < INT_MAX)? result : (-1);
+}
+
+void
+MatchState::clear()
+{
+  first = last = 0;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_state.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_state.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_state.h	(revision 70339)
@@ -0,0 +1,117 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _MATCHSTATE_
+#define _MATCHSTATE_
+
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+#include <lttoolbox/match_node.h>
+
+using namespace std;
+
+/**
+ * Class to represent the current state of transducer processing 
+ */
+class MatchState
+{
+private:
+  static int const BUF_LIMIT;
+  MatchNode **state;
+  int first;
+  int last;
+
+  /**
+   * The current state of transducer processing
+   */
+//  slist<MatchNode *> state;
+
+  /**
+   * Copy function
+   * @param s the state to be copied
+   */
+  void copy(MatchState const &s);
+
+  /**
+   * Destroy function
+   */
+  void destroy();
+
+  
+  void applySymbol(MatchNode *pnode, int const symbol);
+public:
+  /**
+   * Constructor
+   */
+  MatchState();
+
+  /**
+   * Destructor
+   */
+  ~MatchState();
+
+  /**
+   * Copy constructor
+   * @param s the state to be copied
+   */
+  MatchState(MatchState const &s);
+
+  /**
+   * Assignment operator
+   * @param s the state to be assigned
+   * @return the object that results from the assignation
+   */
+  MatchState & operator =(MatchState const &s);
+  
+  /**
+   * Number of alive transductions
+   * @return the size
+   */
+  int size() const;
+
+  /**
+   * step = apply + epsilonClosure
+   * @param input the input symbol
+   */
+  void step(int const input);
+  
+  /**
+   * step = apply + epsilonClosure
+   * @param input the input symbol
+   * @param alt the alternative input symbol
+   */
+  void step(int const input, int const alt);
+
+  /**
+   * Init the state with the initial node and empty output
+   * @param initial the initial node of the transducer
+   */
+  void init(MatchNode *initial);
+
+  int classifyFinals(map<MatchNode *, int> const &final_class, set<int> const &banned_rules) const;
+  
+  int classifyFinals(map<MatchNode *, int> const &final_class) const;
+
+  void debug();
+  
+  void clear();
+  
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-print.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-print.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-print.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH lt-print 1 2006-03-08 "" ""
+.SH NAME
+lt-print \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B lt-print
+ bin_file
+.PP
+.SH DESCRIPTION
+.BR lt-print
+Is the application responsible for printing compiled dictionaries in
+ATT format.
+.PP
+.B bin_file 
+The compiled input file .
+.PP
+.B output_file
+The transducer in ATT format .  
+
+.SH SEE ALSO
+.I lt-comp\fR(1),
+.I lt-proc\fR(1),
+.I lt-expand\fR(1),
+.I apertium-tagger\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Currently requires a UTF-8 locale (and doesn't crash if it doesn't have one).
+.SH AUTHOR
+(c) 2005--2016 Universitat d'Alacant / Universidad de Alicante. 
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-trim.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-trim.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-trim.1	(revision 70339)
@@ -0,0 +1,65 @@
+.TH lt-trim 1 2014-02-07 "" ""
+.SH NAME
+lt-trim \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B lt-trim
+analyser_binary bidix_binary trimmed_analyser_binary
+.PP
+.SH DESCRIPTION
+.BR lt-trim
+is the application responsible for trimming compiled dictionaries. The
+analyses (right-side when compiling lr) of analyser_binary are trimmed
+to the input side of bidix_binary (left-side when compiling lr,
+right-side when compiling rl), such that only analyses which would
+pass through `lt-proc \-b bidix_binary' are kept.
+
+\fBWarning: this program is experimental!\fR It has been tested, but
+not deployed extensively yet.
+
+Both compund tags (`<compound-only-L>', `<compound-R>') and join
+elements (`<j/>' in XML, `+' in the stream) and the group element
+(`<g/>' in XML, `#' in the stream) should be handled correctly, even
+combinations of + followed by # in monodix are handled.
+
+Some minor caveats: If you have the capitalised lemma "Foo" in the
+monodix, but "foo" in the bidix, an analysis "^Foo<tag>$" would pass
+through bidix when doing lt-proc \-b, but will not make it through
+trimming. Make sure your lemmas have the same capitalisation in the
+different dictionaries. Also, you should not have literal `+' or `#'
+in your lemmas. Since lt-comp doesn't escape these, lt-trim cannot
+know that they are different from `<j/>' or `<g/>', and you may get
+@-marked output this way. You can analyse `+' or `#' by having the
+literal symbol in the `<l>' part and some other string (e.g. "plus")
+in the `<r>'.
+
+You should not trim a generator unless you have a \fBvery\fR simple
+translator pipeline, since the output of bidix seldom goes unchanged
+through transfer.
+.PP
+.SH FILES
+.B analyser_binary
+The untrimmed analyser dictionary (a finite state transducer).
+.PP
+.B bidix_binary
+The dictionary to use as trimmer (a finite state transducer).
+.PP
+.B trimmed_analyser_binary
+The trimmed analyser dictionary (a finite state transducer).
+
+.SH SEE ALSO
+.I lt-comp\fR(1),
+.I lt-proc\fR(1),
+.I lt-print\fR(1),
+.I lt-expand\fR(1),
+.I apertium-tagger\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2013--2014 Universitat d'Alacant / Universidad de Alicante.
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/entry_token.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/entry_token.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/entry_token.cc	(revision 70339)
@@ -0,0 +1,124 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/entry_token.h>
+
+
+EntryToken::EntryToken() :
+type(paradigm)
+{
+}
+
+EntryToken::~EntryToken()
+{
+  destroy();
+}
+
+EntryToken::EntryToken(EntryToken const &e)
+{
+  copy(e);
+}
+
+EntryToken &
+EntryToken::operator =(EntryToken const &e)
+{
+  if(this != &e)
+  {
+    destroy();
+    copy(e);
+  }
+ 
+  return *this;
+}
+
+void
+EntryToken::copy(EntryToken const &e)
+{
+  type = e.type;
+  leftSide = e.leftSide;
+  rightSide = e.rightSide;
+  parName = e.parName;
+  myregexp = e.myregexp;
+}  
+
+void
+EntryToken::destroy()
+{
+}
+
+void
+EntryToken::setParadigm(wstring const &np)
+{
+  parName = np;
+  type = paradigm;
+}
+
+void
+EntryToken::setSingleTransduction(list<int> const &pi, list<int> const &pd)
+{
+  leftSide = pi;
+  rightSide = pd;
+  type = single_transduction;
+}
+
+void
+EntryToken::setRegexp(wstring const &r)
+{
+  myregexp = r;
+  type = regexp;
+}
+
+bool
+EntryToken::isParadigm() const
+{
+  return type == paradigm;
+}
+
+bool
+EntryToken::isSingleTransduction() const
+{
+  return type == single_transduction;
+}
+
+bool
+EntryToken::isRegexp() const
+{
+  return type == regexp;
+}
+
+wstring const &
+EntryToken::paradigmName() const
+{
+  return parName;
+}
+
+list<int> const &
+EntryToken::left() const
+{
+  return leftSide;
+}
+
+list<int> const & 
+EntryToken::right() const
+{
+  return rightSide;
+}
+
+wstring const &
+EntryToken::regExp() const
+{
+  return myregexp;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/exception.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/exception.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/exception.h	(revision 70339)
@@ -0,0 +1,45 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __EXCEPTION_
+#define __EXCEPTION_
+
+#include <exception>
+#include <string>
+
+class Exception
+: public std::exception
+{
+public:
+  Exception(const char* _msg) throw ()
+  : std::exception(), msg(_msg)
+  {
+  }
+
+  virtual ~Exception() throw ()
+  {
+  }
+
+  const char* what() const throw ()
+  {
+    return msg.c_str();
+  }
+
+private:
+  std::string msg;
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/fst_processor.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/fst_processor.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/fst_processor.cc	(revision 70339)
@@ -0,0 +1,3062 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/fst_processor.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/exception.h>
+
+#include <iostream>
+#include <cerrno>
+
+#ifdef _WIN32
+#include <utf8_fwrap.hpp>
+#endif
+
+using namespace std;
+
+
+FSTProcessor::FSTProcessor() :
+outOfWord(false),
+isLastBlankTM(false)
+{
+  // escaped_chars chars
+  escaped_chars.insert(L'[');
+  escaped_chars.insert(L']');
+  escaped_chars.insert(L'{');
+  escaped_chars.insert(L'}');
+  escaped_chars.insert(L'^');
+  escaped_chars.insert(L'$');
+  escaped_chars.insert(L'/');
+  escaped_chars.insert(L'\\');
+  escaped_chars.insert(L'@');
+  escaped_chars.insert(L'<');
+  escaped_chars.insert(L'>');
+
+  caseSensitive = false;
+  dictionaryCase = false;
+  do_decomposition = false;
+  nullFlush = false;
+  nullFlushGeneration = false;
+  showControlSymbols = false;
+  biltransSurfaceForms = false;
+  compoundOnlyLSymbol = 0;
+  compoundRSymbol = 0;
+  compound_max_elements = 4;
+
+  initial_state = new State();
+  current_state = new State();
+}
+
+FSTProcessor::~FSTProcessor()
+{
+  delete current_state;
+  delete initial_state;
+}
+
+void
+FSTProcessor::streamError()
+{
+  throw Exception("Error: Malformed input stream.");
+}
+
+wchar_t
+FSTProcessor::readEscaped(FILE *input)
+{
+  if(feof(input))
+  {
+    streamError();
+  }
+
+  wchar_t val = static_cast<wchar_t>(fgetwc_unlocked(input));
+
+  if(feof(input) || escaped_chars.find(val) == escaped_chars.end())
+  {
+    streamError();
+  }
+
+  return val;
+}
+
+wstring
+FSTProcessor::readFullBlock(FILE *input, wchar_t const delim1, wchar_t const delim2)
+{
+  wstring result = L"";
+  result += delim1;
+  wchar_t c = delim1;
+
+  while(!feof(input) && c != delim2)
+  {
+    c = static_cast<wchar_t>(fgetwc_unlocked(input));
+    result += c;
+    if(c != L'\\')
+    {
+      continue;
+    }
+    else
+    {
+      result += static_cast<wchar_t>(readEscaped(input));
+    }
+  }
+
+  if(c != delim2)
+  {
+    streamError();
+  }
+
+  return result;
+}
+
+int
+FSTProcessor::readAnalysis(FILE *input)
+{
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wchar_t val = static_cast<wchar_t>(fgetwc_unlocked(input));
+  int altval = 0;
+  if(feof(input))
+  {
+    return 0;
+  }
+
+  if(escaped_chars.find(val) != escaped_chars.end())
+  {
+    switch(val)
+    {
+      case L'<':
+        altval = static_cast<int>(alphabet(readFullBlock(input, L'<', L'>')));
+	input_buffer.add(altval);
+        return altval;
+
+      case L'[':
+        blankqueue.push(readFullBlock(input, L'[', L']'));
+        input_buffer.add(static_cast<int>(L' '));
+        return static_cast<int>(L' ');
+
+      case L'\\':
+        val = static_cast<wchar_t>(fgetwc_unlocked(input));
+        if(escaped_chars.find(val) == escaped_chars.end())
+        {
+          streamError();
+        }
+        input_buffer.add(static_cast<int>(val));
+        return val;
+
+      default:
+        streamError();
+    }
+  }
+
+  input_buffer.add(val);
+  return val;
+}
+
+int
+FSTProcessor::readTMAnalysis(FILE *input)
+{
+  isLastBlankTM = false;
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wchar_t val = static_cast<wchar_t>(fgetwc_unlocked(input));
+  int altval = 0;
+  if(feof(input))
+  {
+    return 0;
+  }
+
+  if(escaped_chars.find(val) != escaped_chars.end() || iswdigit(val))
+  {
+    switch(val)
+    {
+      case L'<':
+        altval = static_cast<int>(alphabet(readFullBlock(input, L'<', L'>')));
+	input_buffer.add(altval);
+        return altval;
+
+      case L'[':
+        blankqueue.push(readFullBlock(input, L'[', L']'));
+        input_buffer.add(static_cast<int>(L' '));
+        isLastBlankTM = true;
+        return static_cast<int>(L' ');
+
+      case L'\\':
+        val = static_cast<wchar_t>(fgetwc_unlocked(input));
+        if(escaped_chars.find(val) == escaped_chars.end())
+        {
+          streamError();
+        }
+        input_buffer.add(static_cast<int>(val));
+        return val;
+      case L'0':
+      case L'1':
+      case L'2':
+      case L'3':
+      case L'4':
+      case L'5':
+      case L'6':
+      case L'7':
+      case L'8':
+      case L'9':
+        {
+          wstring ws = L"";
+          do
+          {
+            ws += val;
+            val = static_cast<wchar_t>(fgetwc_unlocked(input));
+          } while(iswdigit(val));
+          ungetwc(val, input);
+          input_buffer.add(alphabet(L"<n>"));
+          numbers.push_back(ws);
+          return alphabet(L"<n>");
+        }
+        break;
+
+      default:
+        streamError();
+    }
+  }
+
+  input_buffer.add(val);
+  return val;
+}
+
+int
+FSTProcessor::readPostgeneration(FILE *input)
+{
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wchar_t val = static_cast<wchar_t>(fgetwc_unlocked(input));
+  int altval = 0;
+  if(feof(input))
+  {
+    return 0;
+  }
+
+  switch(val)
+  {
+    case L'<':
+      altval = static_cast<int>(alphabet(readFullBlock(input, L'<', L'>')));
+      input_buffer.add(altval);
+      return altval;
+
+    case L'[':
+      blankqueue.push(readFullBlock(input, L'[', L']'));
+      input_buffer.add(static_cast<int>(L' '));
+      return static_cast<int>(L' ');
+
+    case L'\\':
+      val = static_cast<wchar_t>(fgetwc_unlocked(input));
+      if(escaped_chars.find(val) == escaped_chars.end())
+      {
+        streamError();
+      }
+      input_buffer.add(static_cast<int>(val));
+      return val;
+
+    default:
+      input_buffer.add(val);
+      return val;
+  }
+}
+
+void
+FSTProcessor::skipUntil(FILE *input, FILE *output, wint_t const character)
+{
+  while(true)
+  {
+    wint_t val = fgetwc_unlocked(input);
+    if(feof(input))
+    {
+      return;
+    }
+
+    switch(val)
+    {
+      case L'\\':
+        val = fgetwc_unlocked(input);
+        if(feof(input))
+        {
+	  return;
+        }
+        fputwc_unlocked(L'\\', output);
+        fputwc_unlocked(val, output);
+        break;
+
+      case L'\0':
+        fputwc_unlocked(val, output);
+        if(nullFlushGeneration)
+        {
+          fflush(output);
+        }
+        break;
+
+      default:
+        if(val == character)
+        {
+          return;
+        }
+        else
+        {
+          fputwc_unlocked(val, output);
+        }
+        break;
+    }
+  }
+}
+
+int
+FSTProcessor::readGeneration(FILE *input, FILE *output)
+{
+  wint_t val = fgetwc_unlocked(input);
+
+  if(feof(input))
+  {
+    return 0x7fffffff;
+  }
+
+  if(outOfWord)
+  {
+    if(val == L'^')
+    {
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return 0x7fffffff;
+      }
+    }
+    else if(val == L'\\')
+    {
+      fputwc_unlocked(val, output);
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return 0x7fffffff;
+      }
+      fputwc_unlocked(val,output);
+      skipUntil(input, output, L'^');
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return 0x7fffffff;
+      }
+    }
+    else
+    {
+      fputwc_unlocked(val, output);
+      skipUntil(input, output, L'^');
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return 0x7fffffff;
+      }
+    }
+    outOfWord = false;
+  }
+
+  if(val == L'\\')
+  {
+    val = fgetwc_unlocked(input);
+    return static_cast<int>(val);
+  }
+  else if(val == L'$')
+  {
+    outOfWord = true;
+    return static_cast<int>(L'$');
+  }
+  else if(val == L'<')
+  {
+    wstring cad = L"";
+    cad += static_cast<wchar_t>(val);
+    while((val = fgetwc_unlocked(input)) != L'>')
+    {
+      if(feof(input))
+      {
+	streamError();
+      }
+      cad += static_cast<wchar_t>(val);
+    }
+    cad += static_cast<wchar_t>(val);
+
+    return alphabet(cad);
+  }
+  else if(val == L'[')
+  {
+    fputws_unlocked(readFullBlock(input, L'[', L']').c_str(), output);
+    return readGeneration(input, output);
+  }
+  else
+  {
+    return static_cast<int>(val);
+  }
+
+  return 0x7fffffff;
+}
+
+pair<wstring, int>
+FSTProcessor::readBilingual(FILE *input, FILE *output)
+{
+  wint_t val = fgetwc_unlocked(input);
+  wstring symbol = L"";
+
+  if(feof(input))
+  {
+    return pair<wstring, int>(symbol, 0x7fffffff);
+  }
+
+  if(outOfWord)
+  {
+    if(val == L'^')
+    {
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return pair<wstring, int>(symbol, 0x7fffffff);
+      }
+    }
+    else if(val == L'\\')
+    {
+      fputwc_unlocked(val, output);
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return pair<wstring, int>(symbol, 0x7fffffff);
+      }
+      fputwc_unlocked(val,output);
+      skipUntil(input, output, L'^');
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return pair<wstring, int>(symbol, 0x7fffffff);
+      }
+    }
+    else
+    {
+      fputwc_unlocked(val, output);
+      skipUntil(input, output, L'^');
+      val = fgetwc_unlocked(input);
+      if(feof(input))
+      {
+        return pair<wstring, int>(symbol, 0x7fffffff);
+      }
+    }
+    outOfWord = false;
+  }
+
+  if(val == L'\\')
+  {
+    val = fgetwc_unlocked(input);
+    return pair<wstring, int>(symbol, val);
+  }
+  else if(val == L'$')
+  {
+    outOfWord = true;
+    return pair<wstring, int>(symbol, static_cast<int>(L'$'));
+  }
+  else if(val == L'<')
+  {
+    wstring cad = L"";
+    cad += static_cast<wchar_t>(val);
+    while((val = fgetwc_unlocked(input)) != L'>')
+    {
+      if(feof(input))
+      {
+	streamError();
+      }
+      cad += static_cast<wchar_t>(val);
+    }
+    cad += static_cast<wchar_t>(val);
+
+    int res = alphabet(cad);
+
+    if (res == 0) {
+	    symbol = cad;
+    }
+    return pair<wstring, int>(symbol, res);
+  }
+  else if(val == L'[')
+  {
+    fputws_unlocked(readFullBlock(input, L'[', L']').c_str(), output);
+    return readBilingual(input, output);
+  }
+
+  return pair<wstring, int>(symbol, val);
+}
+
+void
+FSTProcessor::flushBlanks(FILE *output)
+{
+  for(unsigned int i = blankqueue.size(); i > 0; i--)
+  {
+    fputws_unlocked(blankqueue.front().c_str(), output);
+    blankqueue.pop();
+  }
+}
+
+void
+FSTProcessor::calcInitial()
+{
+  for(map<wstring, TransExe, Ltstr>::iterator it = transducers.begin(),
+                                             limit = transducers.end();
+      it != limit; it++)
+  {
+    root.addTransition(0, 0, it->second.getInitial());
+  }
+
+  initial_state->init(&root);
+}
+
+bool
+FSTProcessor::endsWith(wstring const &str, wstring const &suffix)
+{
+  if(str.size() < suffix.size())
+  {
+    return false;
+  }
+  else
+  {
+    return str.substr(str.size()-suffix.size()) == suffix;
+  }
+}
+
+void
+FSTProcessor::classifyFinals()
+{
+  for(map<wstring, TransExe, Ltstr>::iterator it = transducers.begin(),
+                                             limit = transducers.end();
+      it != limit; it++)
+  {
+    if(endsWith(it->first, L"@inconditional"))
+    {
+      inconditional.insert(it->second.getFinals().begin(),
+                           it->second.getFinals().end());
+    }
+    else if(endsWith(it->first, L"@standard"))
+    {
+      standard.insert(it->second.getFinals().begin(),
+                      it->second.getFinals().end());
+    }
+    else if(endsWith(it->first, L"@postblank"))
+    {
+      postblank.insert(it->second.getFinals().begin(),
+                       it->second.getFinals().end());
+    }
+    else if(endsWith(it->first, L"@preblank"))
+    {
+      preblank.insert(it->second.getFinals().begin(),
+                       it->second.getFinals().end());
+    }
+    else
+    {
+      wcerr << L"Error: Unsupported transducer type for '";
+      wcerr << it->first << L"'." << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+}
+
+void
+FSTProcessor::writeEscaped(wstring const &str, FILE *output)
+{
+  for(unsigned int i = 0, limit = str.size(); i < limit; i++)
+  {
+    if(escaped_chars.find(str[i]) != escaped_chars.end())
+    {
+      fputwc_unlocked(L'\\', output);
+    }
+    fputwc_unlocked(str[i], output);
+  }
+}
+
+void
+FSTProcessor::writeEscapedWithTags(wstring const &str, FILE *output)
+{
+  for(unsigned int i = 0, limit = str.size(); i < limit; i++)
+  {
+    if(str[i] == L'<' && i >=1 && str[i-1] != L'\\')
+    {
+      fputws_unlocked(str.substr(i).c_str(), output);
+      return;
+    }
+
+    if(escaped_chars.find(str[i]) != escaped_chars.end())
+    {
+      fputwc_unlocked(L'\\', output);
+    }
+    fputwc_unlocked(str[i], output);
+  }
+}
+
+
+
+void
+FSTProcessor::printWord(wstring const &sf, wstring const &lf, FILE *output)
+{
+  fputwc_unlocked(L'^', output);
+  writeEscaped(sf, output);
+  fputws_unlocked(lf.c_str(), output);
+  fputwc_unlocked(L'$', output);
+}
+
+void
+FSTProcessor::printWordBilingual(wstring const &sf, wstring const &lf, FILE *output)
+{
+  fputwc_unlocked(L'^', output);
+  fputws_unlocked(sf.c_str(), output);
+  fputws_unlocked(lf.c_str(), output);
+  fputwc_unlocked(L'$', output);
+}
+
+void
+FSTProcessor::printUnknownWord(wstring const &sf, FILE *output)
+{
+  fputwc_unlocked(L'^', output);
+  writeEscaped(sf, output);
+  fputwc_unlocked(L'/', output);
+  fputwc_unlocked(L'*', output);
+  writeEscaped(sf, output);
+  fputwc_unlocked(L'$', output);
+}
+
+unsigned int
+FSTProcessor::lastBlank(wstring const &str)
+{
+  for(int i = static_cast<int>(str.size())-1; i >= 0; i--)
+  {
+    if(alphabetic_chars.find(str[i]) == alphabetic_chars.end())
+    {
+      return static_cast<unsigned int>(i);
+    }
+  }
+
+  return 0;
+}
+
+void
+FSTProcessor::printSpace(wchar_t const val, FILE *output)
+{
+  if(blankqueue.size() > 0)
+  {
+    flushBlanks(output);
+  }
+  else
+  {
+    fputwc_unlocked(val, output);
+  }
+}
+
+bool
+FSTProcessor::isEscaped(wchar_t const c) const
+{
+  return escaped_chars.find(c) != escaped_chars.end();
+}
+
+bool
+FSTProcessor::isAlphabetic(wchar_t const c) const
+{
+  return alphabetic_chars.find(c) != alphabetic_chars.end();
+}
+
+void
+FSTProcessor::load(FILE *input)
+{
+  // letters
+  int len = Compression::multibyte_read(input);
+  while(len > 0)
+  {
+    alphabetic_chars.insert(static_cast<wchar_t>(Compression::multibyte_read(input)));
+    len--;
+  }
+
+  // symbols
+  alphabet.read(input);
+
+  len = Compression::multibyte_read(input);
+
+  while(len > 0)
+  {
+    int len2 = Compression::multibyte_read(input);
+    wstring name = L"";
+    while(len2 > 0)
+    {
+      name += static_cast<wchar_t>(Compression::multibyte_read(input));
+      len2--;
+    }
+    transducers[name].read(input, alphabet);
+    len--;
+  }
+
+}
+
+void
+FSTProcessor::initAnalysis()
+{
+  calcInitial();
+  classifyFinals();
+  all_finals = standard;
+  all_finals.insert(inconditional.begin(), inconditional.end());
+  all_finals.insert(postblank.begin(), postblank.end());
+  all_finals.insert(preblank.begin(), preblank.end());
+}
+
+void
+FSTProcessor::initTMAnalysis()
+{
+  calcInitial();
+
+  for(map<wstring, TransExe, Ltstr>::iterator it = transducers.begin(),
+                                             limit = transducers.end();
+      it != limit; it++)
+  {
+    all_finals.insert(it->second.getFinals().begin(),
+                      it->second.getFinals().end());
+  }
+}
+
+void
+FSTProcessor::initGeneration()
+{
+  calcInitial();
+  for(map<wstring, TransExe, Ltstr>::iterator it = transducers.begin(),
+                                             limit = transducers.end();
+      it != limit; it++)
+  {
+    all_finals.insert(it->second.getFinals().begin(),
+                      it->second.getFinals().end());
+  }
+}
+
+void
+FSTProcessor::initPostgeneration()
+{
+  initGeneration();
+}
+
+void
+FSTProcessor::initBiltrans()
+{
+  initGeneration();
+}
+
+
+wstring
+FSTProcessor::compoundAnalysis(wstring input_word, bool uppercase, bool firstupper) {
+    const int MAX_COMBINATIONS = 500;
+    //wcerr << L"compoundAnalysis(input_word = " << input_word << L")" << endl;
+
+    State current_state = *initial_state;
+
+    for(unsigned int i=0; i<input_word.size(); i++) {
+        wchar_t val=input_word.at(i);
+
+        //wcerr << val << L" før step " << i << L" current_state = " << current_state.getReadableString(alphabet) << endl;
+        current_state.step_case(val, caseSensitive);
+
+        if(current_state.size() > MAX_COMBINATIONS) {
+            wcerr << L"Warning: compoundAnalysis's MAX_COMBINATIONS exceeded for '" << input_word << L"'" << endl;
+            wcerr << L"         gave up at char " << i << L" '" << val << L"'." << endl;
+
+            wstring nullString = L"";
+            return  nullString;
+        }
+
+        //wcerr << val << L" eft step " << i << L" current_state = " << current_state.getReadableString(alphabet) << endl;
+
+        if(i < input_word.size()-1)
+            current_state.restartFinals(all_finals, compoundOnlyLSymbol, initial_state, '+');
+
+        //wcerr << val << " eft rest " << i << " current_state = " << current_state.getReadableString(alphabet) << endl;
+        //wcerr << i << " result = "  << current_state.filterFinals(all_finals, alphabet, escaped_chars, uppercase, firstupper) << endl;
+        //wcerr << i << " -- size = " << current_state.size() << endl;
+
+        if(current_state.size()==0) {
+            wstring nullString = L"";
+            return nullString;
+        }
+    }
+
+    current_state.pruneCompounds(compoundRSymbol, '+', compound_max_elements);
+    wstring result = current_state.filterFinals(all_finals, alphabet, escaped_chars, uppercase, firstupper);
+    //wcerr << L"rrresult = " << result << endl;
+
+    return result;
+}
+
+
+
+void
+FSTProcessor::initDecompositionSymbols() {
+  if ((compoundOnlyLSymbol=alphabet(L"<:co:only-L>")) == 0
+     && (compoundOnlyLSymbol=alphabet(L"<:compound:only-L>")) == 0
+     && (compoundOnlyLSymbol=alphabet(L"<@co:only-L>")) == 0
+     && (compoundOnlyLSymbol=alphabet(L"<@compound:only-L>")) == 0
+     && (compoundOnlyLSymbol=alphabet(L"<compound-only-L>")) == 0)
+  {
+    wcerr << L"Warning: Decomposition symbol <:compound:only-L> not found" << endl;
+  }
+  else if (!showControlSymbols)
+      alphabet.setSymbol(compoundOnlyLSymbol, L"");
+
+  if ((compoundRSymbol=alphabet(L"<:co:R>")) == 0
+     && (compoundRSymbol=alphabet(L"<:compound:R>")) == 0
+     && (compoundRSymbol=alphabet(L"<@co:R>")) == 0
+     && (compoundRSymbol=alphabet(L"<@compound:R>")) == 0
+     && (compoundRSymbol=alphabet(L"<compound-R>")) == 0)
+  {
+    wcerr << L"Warning: Decomposition symbol <:compound:R> not found" << endl;
+  }
+  else if (!showControlSymbols)
+      alphabet.setSymbol(compoundRSymbol, L"");
+}
+
+
+void
+FSTProcessor::initDecomposition() {
+  do_decomposition = true;
+  initAnalysis();
+  initDecompositionSymbols();
+}
+
+/*wstring
+FSTProcessor::decompose(wstring w)
+{
+        State current_state = *initial_state;
+
+        vector<vector<wstring> > elements;
+        bool firstupper = false, uppercase = false, last = false;
+        unsigned int index = 0;
+
+        if(w.length() < 7) // Heuristic: Do not try and decompound short words
+        {
+          return L"";
+        }
+        //wcerr << L"+ decompose: " << w << endl;
+
+        for (unsigned int i = 0; i < w.length(); i++)
+        {
+          //if(i == (w.length() - 1))
+          if(i == (w.length()))
+          {
+            last = true;
+          }
+
+          State previous_state = current_state;
+
+          unsigned int val = w.at(i);
+
+          //wcerr << L"++ [" << last << L"][" << current_state.size() << L"] decompose: " << w.at(i) << endl;
+
+          if(last)
+          {
+            previous_state = current_state;
+          }
+          else
+          {
+            previous_state = current_state;
+
+            if (current_state.size() != 0)
+            {
+              if (!isAlphabetic(val) && iswupper(val) && !caseSensitive)
+              {
+                current_state.step(val, towlower(val));
+              }
+              else
+              {
+                //wcerr << L"+++ step: " << w.at(i) << endl;
+                current_state.step(val);
+              }
+            }
+          }
+          if(i == (w.length())-1)
+          {
+            last = true;
+          }
+
+          if (current_state.size() == 0 || last)
+          {
+            //wcerr << L"+++ [" << last << L"][" << current_state.size() << L"]" << endl;
+            if(current_state.isFinal(all_finals))
+            {
+              previous_state = current_state;
+            }
+
+            if(previous_state.isFinal(all_finals))
+            {
+              firstupper = iswupper(w.at(0));
+              wstring result = previous_state.filterFinals(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+
+              result = result.substr(1, result.size());
+              //wcerr << L"++++ result[" << index << L"]: " <<  result << endl;
+              vector<wstring> lfs;
+              wstring::size_type pos;
+
+              pos = result.find(L'/');
+              if(pos == wstring::npos)
+              {
+                lfs.push_back(result);
+              }
+              else
+              {
+                while(pos != wstring::npos)
+                {
+                  lfs.push_back(result.substr(0, pos));
+                  result.erase(0, pos + 1);
+                  pos = result.find(L'/');
+                }
+                lfs.push_back(result.substr(0, pos));
+              }
+              elements.push_back(lfs); // Add final analysis
+              index++;
+            }
+            else
+            {
+              return L"";
+            }
+
+            if (!last)
+            {
+              current_state = *initial_state;
+              i--;
+            }
+          }
+        }
+
+        //wcerr << L"+++ index: " << index << endl;
+        if(index > 3 || index < 2)  // Heuristic: Only permit binary/trinary compounds
+        {
+          return L"";
+        }
+
+        wstring lf = L"";
+
+        if(index != elements.size())
+        {
+          //wcerr << L"++ index != elements.size(): " << index << L" != " << elements.size() << endl;
+          return L"";
+        }
+
+        vector<wstring> first_elements = elements.at(0);
+        vector<wstring> second_elements = elements.at(1);
+
+        if(first_elements.size() == 0 || second_elements.size() == 0)
+        {
+          //wcerr << L"++ first or second empty" << endl;
+          return L"";
+        }
+
+        if(index == 2)
+        {
+          for(unsigned int j = 0; j < first_elements.size(); j++)
+          {
+            for(unsigned int y = 0; y < second_elements.size(); y++)
+            {
+              wstring analysis = first_elements.at(j) + L"+" + second_elements.at(y);
+              lf = lf + L"/" + analysis;
+              //wcerr << L"++++++ [" << j << L"][" << y << L"] compound_analysis: " << analysis << endl;
+            }
+          }
+        }
+        else if(index == 3)
+        {
+          vector<wstring> third_elements = elements.at(2);
+
+          for(unsigned int j = 0; j < first_elements.size(); j++)
+          {
+            for(unsigned int k = 0; k < second_elements.size(); k++)
+            {
+              for(unsigned int y = 0; y < third_elements.size(); y++)
+              {
+                wstring analysis = first_elements.at(j) + L"+" + second_elements.at(k) + L"+" + third_elements.at(y);
+                lf = lf + L"/" + analysis;
+                //wcerr << L"++++++ [" << j << L"][" << y << L"] compound_analysis: " << analysis << endl;
+              }
+            }
+          }
+
+        }
+        else
+        {
+          return L"";
+        }
+        //wcerr << L"+ decompose: " << lf << endl;
+        return lf;
+}*/
+
+void
+FSTProcessor::analysis(FILE *input, FILE *output)
+{
+  if(getNullFlush())
+  {
+    analysis_wrapper_null_flush(input, output);
+  }
+
+  bool last_incond = false;
+  bool last_postblank = false;
+  bool last_preblank = false;
+  State current_state = *initial_state;
+  wstring lf = L"";
+  wstring sf = L"";
+  int last = 0;
+  bool firstupper = false, uppercase = false;
+
+  while(wchar_t val = readAnalysis(input))
+  {
+    // test for final states
+    if(current_state.isFinal(all_finals))
+    {
+      if(current_state.isFinal(inconditional))
+      {
+        if(!dictionaryCase)
+        {
+          firstupper = iswupper(sf[0]);
+          uppercase = firstupper && iswupper(sf[sf.size()-1]);
+        }
+
+        if(do_decomposition && compoundOnlyLSymbol != 0)
+        {
+          current_state.pruneStatesWithForbiddenSymbol(compoundOnlyLSymbol);
+        }
+        lf = current_state.filterFinals(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_incond = true;
+        last = input_buffer.getPos();
+      }
+      else if(current_state.isFinal(postblank))
+      {
+        if(!dictionaryCase)
+        {
+          firstupper = iswupper(sf[0]);
+          uppercase = firstupper && iswupper(sf[sf.size()-1]);
+        }
+
+        if(do_decomposition && compoundOnlyLSymbol != 0)
+        {
+          current_state.pruneStatesWithForbiddenSymbol(compoundOnlyLSymbol);
+        }
+        lf = current_state.filterFinals(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_postblank = true;
+        last = input_buffer.getPos();
+      }
+      else if(current_state.isFinal(preblank))
+      {
+        if(!dictionaryCase)
+        {
+          firstupper = iswupper(sf[0]);
+          uppercase = firstupper && iswupper(sf[sf.size()-1]);
+        }
+
+        if(do_decomposition && compoundOnlyLSymbol != 0)
+        {
+          current_state.pruneStatesWithForbiddenSymbol(compoundOnlyLSymbol);
+        }
+        lf = current_state.filterFinals(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_preblank = true;
+        last = input_buffer.getPos();
+      }
+      else if(!isAlphabetic(val))
+      {
+        if(!dictionaryCase)
+        {
+          firstupper = iswupper(sf[0]);
+          uppercase = firstupper && iswupper(sf[sf.size()-1]);
+        }
+
+        if(do_decomposition && compoundOnlyLSymbol != 0)
+        {
+          current_state.pruneStatesWithForbiddenSymbol(compoundOnlyLSymbol);
+        }
+        lf = current_state.filterFinals(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_postblank = false;
+        last_preblank = false;
+        last_incond = false;
+        last = input_buffer.getPos();
+      }
+    }
+    else if(sf == L"" && iswspace(val))
+    {
+      lf = L"/*";
+      lf.append(sf);
+      last_postblank = false;
+      last_preblank = false;
+      last_incond = false;
+      last = input_buffer.getPos();
+    }
+
+    if(!iswupper(val) || caseSensitive)
+    {
+      current_state.step(val);
+    }
+    else
+    {
+      current_state.step(val, towlower(val));
+    }
+
+    if(current_state.size() != 0)
+    {
+      alphabet.getSymbol(sf, val);
+    }
+    else
+    {
+      if(!isAlphabetic(val) && sf == L"")
+      {
+        if(iswspace(val))
+        {
+          printSpace(val, output);
+        }
+        else
+        {
+          if(isEscaped(val))
+          {
+            fputwc_unlocked(L'\\', output);
+          }
+          fputwc_unlocked(val, output);
+        }
+      }
+      else if(last_postblank)
+      {
+        printWord(sf.substr(0, sf.size()-input_buffer.diffPrevPos(last)),
+		  lf, output);
+	fputwc_unlocked(L' ', output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+      else if(last_preblank)
+      {
+	fputwc_unlocked(L' ', output);
+        printWord(sf.substr(0, sf.size()-input_buffer.diffPrevPos(last)),
+		  lf, output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+      else if(last_incond)
+      {
+        printWord(sf.substr(0, sf.size()-input_buffer.diffPrevPos(last)),
+		  lf, output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+      else if(isAlphabetic(val) &&
+              ((sf.size()-input_buffer.diffPrevPos(last)) > lastBlank(sf) ||
+               lf == L""))
+      {
+        do
+        {
+          alphabet.getSymbol(sf, val);
+        }
+        while((val = readAnalysis(input)) && isAlphabetic(val));
+
+        unsigned int limit = firstNotAlpha(sf);
+        unsigned int size = sf.size();
+        limit = (limit == static_cast<unsigned int>(wstring::npos)?size:limit);
+        if(limit == 0)
+        {
+          input_buffer.back(sf.size());
+          writeEscaped(sf.substr(0,1), output);
+        }
+        else
+        {
+          input_buffer.back(1+(size-limit));
+          wstring unknown_word = sf.substr(0, limit);
+          if(do_decomposition)
+          {
+            if(!dictionaryCase)
+            {
+              firstupper = iswupper(sf[0]);
+              uppercase = firstupper && iswupper(sf[sf.size()-1]);
+            }
+
+            wstring compound = L"";
+            compound = compoundAnalysis(unknown_word, uppercase, firstupper);
+            if(compound != L"")
+            {
+              printWord(unknown_word, compound, output);
+            }
+            else
+            {
+              printUnknownWord(unknown_word, output);
+            }
+          }
+          else
+          {
+            printUnknownWord(unknown_word, output);
+          }
+        }
+      }
+      else if(lf == L"")
+      {
+        unsigned int limit = firstNotAlpha(sf);
+        unsigned int size = sf.size();
+        limit = (limit == static_cast<unsigned int >(wstring::npos)?size:limit);
+        if(limit == 0)
+        {
+          input_buffer.back(sf.size());
+          writeEscaped(sf.substr(0,1), output);
+        }
+        else
+        {
+          input_buffer.back(1+(size-limit));
+          wstring unknown_word = sf.substr(0, limit);
+          if(do_decomposition)
+          {
+            if(!dictionaryCase)
+            {
+              firstupper = iswupper(sf[0]);
+              uppercase = firstupper && iswupper(sf[sf.size()-1]);
+            }
+
+            wstring compound = L"";
+            compound = compoundAnalysis(unknown_word, uppercase, firstupper);
+            if(compound != L"")
+            {
+              printWord(unknown_word, compound, output);
+            }
+            else
+            {
+              printUnknownWord(unknown_word, output);
+            }
+          }
+          else
+          {
+            printUnknownWord(unknown_word, output);
+          }
+
+        }
+      }
+      else
+      {
+        printWord(sf.substr(0, sf.size()-input_buffer.diffPrevPos(last)),
+                  lf, output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+
+      current_state = *initial_state;
+      lf = L"";
+      sf = L"";
+      last_incond = false;
+      last_postblank = false;
+      last_preblank = false;
+    }
+  }
+
+  // print remaining blanks
+  flushBlanks(output);
+}
+
+void
+FSTProcessor::analysis_wrapper_null_flush(FILE *input, FILE *output)
+{
+  setNullFlush(false);
+  while(!feof(input))
+  {
+    analysis(input, output);
+    fputwc_unlocked(L'\0', output);
+    int code = fflush(output);
+    if(code != 0)
+    {
+        wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+}
+
+void
+FSTProcessor::generation_wrapper_null_flush(FILE *input, FILE *output,
+                                            GenerationMode mode)
+{
+  setNullFlush(false);
+  nullFlushGeneration = true;
+
+  while(!feof(input))
+  {
+    generation(input, output, mode);
+    fputwc_unlocked(L'\0', output);
+    int code = fflush(output);
+    if(code != 0)
+    {
+        wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+}
+
+void
+FSTProcessor::postgeneration_wrapper_null_flush(FILE *input, FILE *output)
+{
+  setNullFlush(false);
+  while(!feof(input))
+  {
+    postgeneration(input, output);
+    fputwc_unlocked(L'\0', output);
+    int code = fflush(output);
+    if(code != 0)
+    {
+        wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+}
+
+void
+FSTProcessor::transliteration_wrapper_null_flush(FILE *input, FILE *output)
+{
+  setNullFlush(false);
+  while(!feof(input))
+  {
+    transliteration(input, output);
+    fputwc_unlocked(L'\0', output);
+    int code = fflush(output);
+    if(code != 0)
+    {
+        wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+}
+
+void
+FSTProcessor::tm_analysis(FILE *input, FILE *output)
+{
+  State current_state = *initial_state;
+  wstring lf = L"";
+  wstring sf = L"";
+  int last = 0;
+
+  while(wchar_t val = readTMAnalysis(input))
+  {
+    // test for final states
+    if(current_state.isFinal(all_finals))
+    {
+      if(iswpunct(val))
+      {
+        lf = current_state.filterFinalsTM(all_finals, alphabet,
+					  escaped_chars,
+                                          blankqueue, numbers).substr(1);
+        last = input_buffer.getPos();
+        numbers.clear();
+      }
+    }
+    else if(sf == L"" && iswspace(val))
+    {
+      lf.append(sf);
+      last = input_buffer.getPos();
+    }
+
+    if(!iswupper(val))
+    {
+      current_state.step(val);
+    }
+    else
+    {
+      current_state.step(val, towlower(val));
+    }
+
+    if(current_state.size() != 0)
+    {
+      if(val == -1)
+      {
+        sf.append(numbers[numbers.size()-1]);
+      }
+      else if(isLastBlankTM && val == L' ')
+      {
+        sf.append(blankqueue.back());
+      }
+      else
+      {
+        alphabet.getSymbol(sf, val);
+      }
+    }
+    else
+    {
+      if((iswspace(val) || iswpunct(val)) && sf == L"")
+      {
+        if(iswspace(val))
+        {
+          printSpace(val, output);
+        }
+        else
+        {
+          if(isEscaped(val))
+          {
+            fputwc_unlocked(L'\\', output);
+          }
+          fputwc_unlocked(val, output);
+        }
+      }
+      else if(!iswspace(val) && !iswpunct(val) &&
+              ((sf.size()-input_buffer.diffPrevPos(last)) > lastBlank(sf) ||
+               lf == L""))
+      {
+
+        do
+        {
+          if(val == -1)
+          {
+            sf.append(numbers[numbers.size()-1]);
+          }
+          else if(isLastBlankTM && val == L' ')
+          {
+            sf.append(blankqueue.back());
+          }
+          else
+          {
+            alphabet.getSymbol(sf, val);
+          }
+        }
+        while((val = readTMAnalysis(input)) && !iswspace(val) && !iswpunct(val));
+
+        if(val == 0)
+        {
+          fputws_unlocked(sf.c_str(), output);
+          return;
+        }
+
+        input_buffer.back(1);
+        fputws_unlocked(sf.c_str(), output);
+
+        while(blankqueue.size() > 0)
+        {
+          if(blankqueue.size() == 1 && isLastBlankTM)
+          {
+            break;
+          }
+          blankqueue.pop();
+        }
+
+/*
+        unsigned int limit = sf.find(L' ');
+        unsigned int size = sf.size();
+        limit = (limit == static_cast<unsigned int>(wstring::npos)?size:limit);
+        input_buffer.back(1+(size-limit));
+        fputws_unlocked(sf.substr(0, limit).c_str(), output);
+*/      }
+      else if(lf == L"")
+      {
+/*        unsigned int limit = sf.find(L' ');
+        unsigned int size = sf.size();
+        limit = (limit == static_cast<unsigned int >(wstring::npos)?size:limit);
+        input_buffer.back(1+(size-limit));
+        fputws_unlocked(sf.substr(0, limit).c_str(), output);
+*/
+        input_buffer.back(1);
+        fputws_unlocked(sf.c_str(), output);
+
+        while(blankqueue.size() > 0)
+        {
+          if(blankqueue.size() == 1 && isLastBlankTM)
+          {
+            break;
+          }
+          blankqueue.pop();
+        }
+
+      }
+      else
+      {
+        fputwc_unlocked(L'[', output);
+        fputws_unlocked(lf.c_str(), output);
+        fputwc_unlocked(L']', output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+
+      current_state = *initial_state;
+      lf = L"";
+      sf = L"";
+    }
+  }
+
+  // print remaining blanks
+  flushBlanks(output);
+}
+
+
+void
+FSTProcessor::generation(FILE *input, FILE *output, GenerationMode mode)
+{
+  if(getNullFlush())
+  {
+    generation_wrapper_null_flush(input, output, mode);
+  }
+
+  State current_state = *initial_state;
+  wstring sf = L"";
+
+  outOfWord = false;
+
+  skipUntil(input, output, L'^');
+  int val;
+
+  while((val = readGeneration(input, output)) != 0x7fffffff)
+  {
+    if(sf == L"" && val == L'=')
+    {
+      fputwc(L'=', output);
+      val = readGeneration(input, output);
+    }
+
+    if(val == L'$' && outOfWord)
+    {
+      if(sf[0] == L'*' || sf[0] == L'%')
+      {
+	if(mode != gm_clean && mode != gm_tagged_nm)
+        {
+	  writeEscaped(sf, output);
+	}
+	else if (mode == gm_clean)
+	{
+	  writeEscaped(sf.substr(1), output);
+	}
+	else if(mode == gm_tagged_nm)
+	{
+	  fputwc_unlocked(L'^', output);
+	  writeEscaped(removeTags(sf.substr(1)), output);
+	  fputwc_unlocked(L'/', output);
+          writeEscapedWithTags(sf, output);
+	  fputwc_unlocked(L'$', output);
+	}
+      }
+      else if(sf[0] == L'@')
+      {
+        if(mode == gm_all)
+        {
+          writeEscaped(sf, output);
+        }
+        else if(mode == gm_clean)
+        {
+          writeEscaped(removeTags(sf.substr(1)), output);
+        }
+        else if(mode == gm_unknown)
+        {
+          writeEscaped(removeTags(sf), output);
+        }
+        else if(mode == gm_tagged)
+        {
+          writeEscaped(removeTags(sf), output);
+        }
+        else if(mode == gm_tagged_nm)
+        {
+	  fputwc_unlocked(L'^', output);
+	  writeEscaped(removeTags(sf.substr(1)), output);
+	  fputwc_unlocked(L'/', output);
+          writeEscapedWithTags(sf, output);
+	  fputwc_unlocked(L'$', output);
+        }
+      }
+      else if(current_state.isFinal(all_finals))
+      {
+        bool uppercase = sf.size() > 1 && iswupper(sf[1]);
+        bool firstupper= iswupper(sf[0]);
+
+        if(mode == gm_tagged || mode == gm_tagged_nm)
+        {
+	  fputwc_unlocked(L'^', output);
+        }
+
+        fputws_unlocked(current_state.filterFinals(all_finals, alphabet,
+                                                  escaped_chars,
+                                                  uppercase, firstupper).substr(1).c_str(),
+						  output);
+        if(mode == gm_tagged || mode == gm_tagged_nm)
+        {
+	  fputwc_unlocked(L'/', output);
+	  writeEscapedWithTags(sf, output);
+	  fputwc_unlocked(L'$', output);
+        }
+
+      }
+      else
+      {
+        if(mode == gm_all)
+        {
+	  fputwc_unlocked(L'#', output);
+	  writeEscaped(sf, output);
+        }
+        else if(mode == gm_clean)
+        {
+          writeEscaped(removeTags(sf), output);
+        }
+        else if(mode == gm_unknown)
+        {
+          if(sf != L"")
+          {
+            fputwc_unlocked(L'#', output);
+            writeEscaped(removeTags(sf), output);
+          }
+        }
+        else if(mode == gm_tagged)
+        {
+          fputwc_unlocked(L'#', output);
+          writeEscaped(removeTags(sf), output);
+        }
+        else if(mode == gm_tagged_nm)
+        {
+	  fputwc_unlocked(L'^', output);
+	  writeEscaped(removeTags(sf), output);
+	  fputwc_unlocked(L'/', output);
+	  fputwc_unlocked(L'#', output);
+          writeEscapedWithTags(sf, output);
+	  fputwc_unlocked(L'$', output);
+        }
+      }
+
+      current_state = *initial_state;
+      sf = L"";
+    }
+    else if(iswspace(val) && sf.size() == 0)
+    {
+      // do nothing
+    }
+    else if(sf.size() > 0 && (sf[0] == L'*' || sf[0] == L'%' ))
+    {
+      alphabet.getSymbol(sf, val);
+    }
+    else
+    {
+      alphabet.getSymbol(sf,val);
+      if(current_state.size() > 0)
+      {
+	if(!alphabet.isTag(val) && iswupper(val) && !caseSensitive)
+	{
+	  current_state.step(val, towlower(val));
+	}
+	else
+	{
+	  current_state.step(val);
+	}
+      }
+    }
+  }
+}
+
+void
+FSTProcessor::postgeneration(FILE *input, FILE *output)
+{
+  if(getNullFlush())
+  {
+    postgeneration_wrapper_null_flush(input, output);
+  }
+
+  bool skip_mode = true;
+  State current_state = *initial_state;
+  wstring lf = L"";
+  wstring sf = L"";
+  int last = 0;
+  set<wchar_t> empty_escaped_chars;
+
+  while(wchar_t val = readPostgeneration(input))
+  {
+    if(val == L'~')
+    {
+      skip_mode = false;
+    }
+
+    if(skip_mode)
+    {
+      if(iswspace(val))
+      {
+	printSpace(val, output);
+      }
+      else
+      {
+        if(isEscaped(val))
+        {
+          fputwc_unlocked(L'\\', output);
+        }
+      	fputwc_unlocked(val, output);
+      }
+    }
+    else
+    {
+      // test for final states
+      if(current_state.isFinal(all_finals))
+      {
+        bool firstupper = iswupper(sf[1]);
+        bool uppercase = sf.size() > 1 && firstupper && iswupper(sf[2]);
+        lf = current_state.filterFinals(all_finals, alphabet,
+					empty_escaped_chars,
+					uppercase, firstupper, 0);
+
+        // case of the beggining of the next word
+
+        wstring mybuf = L"";
+        for(size_t i = sf.size(); i > 0; --i)
+        {
+          if(!isalpha(sf[i-1]))
+          {
+            break;
+          }
+          else
+          {
+            mybuf = sf[i-1] + mybuf;
+          }
+        }
+
+        if(mybuf.size() > 0)
+        {
+          bool myfirstupper = iswupper(mybuf[0]);
+          bool myuppercase = mybuf.size() > 1 && iswupper(mybuf[1]);
+
+          for(size_t i = lf.size(); i > 0; --i)
+          {
+            if(!isalpha(lf[i-1]))
+            {
+              if(myfirstupper && i != lf.size())
+              {
+                lf[i] = towupper(lf[i]);
+              }
+              else
+              {
+                lf[i] = towlower(lf[i]);
+              }
+              break;
+            }
+            else
+            {
+              if(myuppercase)
+              {
+                lf[i-1] = towupper(lf[i-1]);
+              }
+              else
+              {
+                lf[i-1] = towlower(lf[i-1]);
+              }
+            }
+          }
+        }
+
+        last = input_buffer.getPos();
+      }
+
+      if(!iswupper(val) || caseSensitive)
+      {
+        current_state.step(val);
+      }
+      else
+      {
+        current_state.step(val, towlower(val));
+      }
+
+      if(current_state.size() != 0)
+      {
+        alphabet.getSymbol(sf, val);
+      }
+      else
+      {
+        if(lf == L"")
+	{
+          unsigned int mark = sf.size();
+          for(unsigned int i = 1, limit = sf.size(); i < limit; i++)
+          {
+            if(sf[i] == L'~')
+            {
+              mark = i;
+              break;
+            }
+          }
+	  fputws_unlocked(sf.substr(1, mark-1).c_str(), output);
+          if(mark == sf.size())
+          {
+	    input_buffer.back(1);
+          }
+          else
+          {
+            input_buffer.back(sf.size()-mark);
+	  }
+	}
+	else
+	{
+	  fputws_unlocked(lf.substr(1,lf.size()-3).c_str(), output);
+	  input_buffer.setPos(last);
+          input_buffer.back(2);
+          val = lf[lf.size()-2];
+	  if(iswspace(val))
+	  {
+	    printSpace(val, output);
+	  }
+	  else
+	  {
+	    if(isEscaped(val))
+	    {
+	      fputwc_unlocked(L'\\', output);
+	    }
+	    fputwc_unlocked(val, output);
+	  }
+	}
+
+	current_state = *initial_state;
+	lf = L"";
+	sf = L"";
+	skip_mode = true;
+      }
+    }
+  }
+
+  // print remaining blanks
+  flushBlanks(output);
+}
+
+void
+FSTProcessor::transliteration(FILE *input, FILE *output)
+{
+  if(getNullFlush())
+  {
+    transliteration_wrapper_null_flush(input, output);
+  }
+
+  State current_state = *initial_state;
+  wstring lf = L"";
+  wstring sf = L"";
+  int last = 0;
+
+  while(wchar_t val = readPostgeneration(input))
+  {
+    if(iswpunct(val) || iswspace(val))
+    {
+      bool firstupper = iswupper(sf[1]);
+      bool uppercase = sf.size() > 1 && firstupper && iswupper(sf[2]);
+      lf = current_state.filterFinals(all_finals, alphabet, escaped_chars,
+                                      uppercase, firstupper, 0);
+      if(!lf.empty())
+      {
+        fputws_unlocked(lf.substr(1).c_str(), output);
+        current_state = *initial_state;
+        lf = L"";
+        sf = L"";
+      }
+      if(iswspace(val))
+      {
+        printSpace(val, output);
+      }
+      else
+      {
+        if(isEscaped(val))
+        {
+          fputwc_unlocked(L'\\', output);
+        }
+        fputwc_unlocked(val, output);
+      }
+    }
+    else
+    {
+      if(current_state.isFinal(all_finals))
+      {
+        bool firstupper = iswupper(sf[1]);
+        bool uppercase = sf.size() > 1 && firstupper && iswupper(sf[2]);
+        lf = current_state.filterFinals(all_finals, alphabet, escaped_chars,
+                                        uppercase, firstupper, 0);
+        last = input_buffer.getPos();
+      }
+
+      current_state.step(val);
+      if(current_state.size() != 0)
+      {
+        alphabet.getSymbol(sf, val);
+      }
+      else
+      {
+        if(!lf.empty())
+        {
+          fputws_unlocked(lf.substr(1).c_str(), output);
+          input_buffer.setPos(last);
+          input_buffer.back(1);
+          val = lf[lf.size()-1];
+        }
+        else
+        {
+          if(iswspace(val))
+          {
+            printSpace(val, output);
+          }
+          else
+          {
+            if(isEscaped(val))
+            {
+              fputwc_unlocked(L'\\', output);
+            }
+            fputwc_unlocked(val, output);
+          }
+        }
+        current_state = *initial_state;
+        lf = L"";
+        sf = L"";
+      }
+    }
+  }
+  // print remaining blanks
+  flushBlanks(output);
+}
+
+wstring
+FSTProcessor::biltransfull(wstring const &input_word, bool with_delim)
+{
+  State current_state = *initial_state;
+  wstring result = L"";
+  unsigned int start_point = 1;
+  unsigned int end_point = input_word.size()-2;
+  wstring queue = L"";
+  bool mark = false;
+
+  if(with_delim == false)
+  {
+    start_point = 0;
+    end_point = input_word.size()-1;
+  }
+
+  if(input_word[start_point] == L'*')
+  {
+    return input_word;
+  }
+
+  if(input_word[start_point] == L'=')
+  {
+    start_point++;
+    mark = true;
+  }
+
+  bool firstupper = iswupper(input_word[start_point]);
+  bool uppercase = firstupper && iswupper(input_word[start_point+1]);
+
+  for(unsigned int i = start_point; i <= end_point; i++)
+  {
+    int val;
+    wstring symbol = L"";
+
+    if(input_word[i] == L'\\')
+    {
+      i++;
+      val = static_cast<int>(input_word[i]);
+    }
+    else if(input_word[i] == L'<')
+    {
+      symbol = L'<';
+      for(unsigned int j = i + 1; j <= end_point; j++)
+      {
+	symbol += input_word[j];
+	if(input_word[j] == L'>')
+	{
+	  i = j;
+	  break;
+	}
+      }
+      val = alphabet(symbol);
+    }
+    else
+    {
+      val = static_cast<int>(input_word[i]);
+    }
+    if(current_state.size() != 0)
+    {
+      if(!alphabet.isTag(val) && iswupper(val) && !caseSensitive)
+      {
+	current_state.step(val, towlower(val));
+      }
+      else
+      {
+	current_state.step(val);
+      }
+    }
+    if(current_state.isFinal(all_finals))
+    {
+      result = current_state.filterFinals(all_finals, alphabet,
+                                         escaped_chars,
+                                         uppercase, firstupper, 0);
+      if(with_delim)
+      {
+        if(mark)
+        {
+          result = L"^="+result.substr(1);
+        }
+        else
+        {
+          result[0] = L'^';
+        }
+      }
+      else
+      {
+        if(mark)
+        {
+          result = L"=" + result.substr(1);
+        }
+        else
+        {
+          result = result.substr(1);
+        }
+      }
+    }
+
+    if(current_state.size() == 0)
+    {
+      if(symbol != L"" && result != L"")
+      {
+        queue.append(symbol);
+      }
+      else
+      {
+	// word is not present
+        if(with_delim)
+	{
+          result = L"^@" + input_word.substr(1);
+	}
+        else
+	{
+          result = L"@" + input_word;
+	}
+        return result;
+      }
+    }
+  }
+
+  if(start_point < (end_point - 3))
+  {
+    return L"^$";
+  }
+  // attach unmatched queue automatically
+
+  if(queue != L"")
+  {
+    wstring result_with_queue = L"";
+    for(unsigned int i = 0, limit = result.size(); i != limit; i++)
+    {
+      switch(result[i])
+      {
+        case L'\\':
+          result_with_queue += L'\\';
+	  i++;
+          break;
+
+        case L'/':
+          result_with_queue.append(queue);
+	  break;
+
+        default:
+          break;
+      }
+      result_with_queue += result[i];
+    }
+    result_with_queue.append(queue);
+
+    if(with_delim)
+    {
+      result_with_queue += L'$';
+    }
+    return result_with_queue;
+  }
+  else
+  {
+    if(with_delim)
+    {
+      result += L'$';
+    }
+    return result;
+  }
+}
+
+
+
+wstring
+FSTProcessor::biltrans(wstring const &input_word, bool with_delim)
+{
+  State current_state = *initial_state;
+  wstring result = L"";
+  unsigned int start_point = 1;
+  unsigned int end_point = input_word.size()-2;
+  wstring queue = L"";
+  bool mark = false;
+
+  if(with_delim == false)
+  {
+    start_point = 0;
+    end_point = input_word.size()-1;
+  }
+
+  if(input_word[start_point] == L'*')
+  {
+    return input_word;
+  }
+
+  if(input_word[start_point] == L'=')
+  {
+    start_point++;
+    mark = true;
+  }
+
+  bool firstupper = iswupper(input_word[start_point]);
+  bool uppercase = firstupper && iswupper(input_word[start_point+1]);
+
+  for(unsigned int i = start_point; i <= end_point; i++)
+  {
+    int val;
+    wstring symbol = L"";
+
+    if(input_word[i] == L'\\')
+    {
+      i++;
+      val = static_cast<int>(input_word[i]);
+    }
+    else if(input_word[i] == L'<')
+    {
+      symbol = L'<';
+      for(unsigned int j = i + 1; j <= end_point; j++)
+      {
+	symbol += input_word[j];
+	if(input_word[j] == L'>')
+	{
+	  i = j;
+	  break;
+	}
+      }
+      val = alphabet(symbol);
+    }
+    else
+    {
+      val = static_cast<int>(input_word[i]);
+    }
+    if(current_state.size() != 0)
+    {
+      if(!alphabet.isTag(val) && iswupper(val) && !caseSensitive)
+      {
+	current_state.step(val, towlower(val));
+      }
+      else
+      {
+	current_state.step(val);
+      }
+    }
+    if(current_state.isFinal(all_finals))
+    {
+      result = current_state.filterFinals(all_finals, alphabet,
+                                         escaped_chars,
+                                         uppercase, firstupper, 0);
+      if(with_delim)
+      {
+        if(mark)
+        {
+          result = L"^="+result.substr(1);
+        }
+        else
+        {
+          result[0] = L'^';
+        }
+      }
+      else
+      {
+        if(mark)
+        {
+          result = L"=" + result.substr(1);
+        }
+        else
+        {
+          result = result.substr(1);
+        }
+      }
+    }
+
+    if(current_state.size() == 0)
+    {
+      if(symbol != L"" && result != L"")
+      {
+        queue.append(symbol);
+      }
+      else
+      {
+	// word is not present
+        if(with_delim)
+	{
+          result = L"^@" + input_word.substr(1);
+	}
+        else
+	{
+          result = L"@" + input_word;
+	}
+        return result;
+      }
+    }
+  }
+
+  // attach unmatched queue automatically
+
+  if(queue != L"")
+  {
+    wstring result_with_queue = L"";
+    for(unsigned int i = 0, limit = result.size(); i != limit; i++)
+    {
+      switch(result[i])
+      {
+        case L'\\':
+          result_with_queue += L'\\';
+	  i++;
+          break;
+
+        case L'/':
+          result_with_queue.append(queue);
+	  break;
+
+        default:
+          break;
+      }
+      result_with_queue += result[i];
+    }
+    result_with_queue.append(queue);
+
+    if(with_delim)
+    {
+      result_with_queue += L'$';
+    }
+    return result_with_queue;
+  }
+  else
+  {
+    if(with_delim)
+    {
+      result += L'$';
+    }
+    return result;
+  }
+}
+
+void
+FSTProcessor::bilingual_wrapper_null_flush(FILE *input, FILE *output)
+{
+  setNullFlush(false);
+  nullFlushGeneration = true;
+
+  while(!feof(input))
+  {
+    bilingual(input, output);
+    fputwc_unlocked(L'\0', output);
+    int code = fflush(output);
+    if(code != 0)
+    {
+        wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+}
+
+wstring
+FSTProcessor::compose(wstring const &lexforms, wstring const &queue) const
+{
+  wstring result = L"";
+
+  for(unsigned int i = 1; i< lexforms.size(); i++)
+  {
+    if(lexforms[i] == L'\\')
+    {
+      result += L'\\';
+      i++;
+    }
+    else if(lexforms[i] == L'/')
+    {
+      result.append(queue);
+    }
+    result += lexforms[i];
+  }
+
+  return L"/" + result + queue;
+}
+
+void
+FSTProcessor::bilingual(FILE *input, FILE *output)
+{
+  if(getNullFlush())
+  {
+    bilingual_wrapper_null_flush(input, output);
+  }
+
+  State current_state = *initial_state;
+  wstring sf = L"";		// source language analysis
+  wstring queue = L"";		// symbols to be added to each target
+  wstring result = L"";		// result of looking up analysis in bidix
+
+  outOfWord = false;
+
+  skipUntil(input, output, L'^');
+  pair<wstring,int> tr;		// readBilingual return value, containing:
+  int val;			// the alphabet value of current symbol, and
+  wstring symbol = L"";		// the current symbol as a string
+  bool seentags = false;  // have we seen any tags at all in the analysis?
+
+  bool seensurface = false;
+  wstring surface = L"";
+
+  while(true)			// ie. while(val != 0x7fffffff)
+  {
+    tr = readBilingual(input, output);
+    symbol = tr.first;
+    val = tr.second;
+
+    //fwprintf(stderr, L"> %S : %C : %d\n", tr.first.c_str(), tr.second, tr.second);
+    if(biltransSurfaceForms && !seensurface && !outOfWord)
+    {
+      while(val != L'/' && val != 0x7fffffff)
+      {
+        surface = surface + symbol;
+        alphabet.getSymbol(surface, val);
+        tr = readBilingual(input, output);
+        symbol = tr.first;
+        val = tr.second;
+        //fwprintf(stderr, L" == %S : %C : %d => %S\n", symbol.c_str(), val, val, surface.c_str());
+      }
+      seensurface = true;
+      tr = readBilingual(input, output);
+      symbol = tr.first;
+      val = tr.second;
+    }
+
+    if (val == 0x7fffffff)
+    {
+      break;
+    }
+
+    if(val == L'$' && outOfWord)
+    {
+      if(!seentags)        // if no tags: only return complete matches
+      {
+        bool uppercase = sf.size() > 1 && iswupper(sf[1]);
+        bool firstupper= iswupper(sf[0]);
+
+        result = current_state.filterFinals(all_finals, alphabet,
+                                            escaped_chars,
+                                            uppercase, firstupper, 0);
+      }
+
+      if(sf[0] == L'*')
+      {
+        printWordBilingual(sf, L"/"+sf, output);
+      }
+      else if(result != L"")
+      {
+        printWordBilingual(sf, compose(result, queue), output);
+      }
+      else
+      { //xxx
+        if(biltransSurfaceForms)
+        {
+          printWordBilingual(surface, L"/@"+surface, output);
+        }
+        else
+        {
+          printWordBilingual(sf, L"/@"+sf, output);
+        }
+      }
+      seensurface = false;
+      surface = L"";
+      queue = L"";
+      result = L"";
+      current_state = *initial_state;
+      sf = L"";
+      seentags = false;
+    }
+    else if(iswspace(val) && sf.size() == 0)
+    {
+      // do nothing
+    }
+    else if(sf.size() > 0 && sf[0] == L'*')
+    {
+      if(escaped_chars.find(val) != escaped_chars.end())
+      {
+        sf += L'\\';
+      }
+      alphabet.getSymbol(sf, val); // add symbol to sf iff alphabetic
+      if(val == 0)  // non-alphabetic, possibly unknown tag; add to sf
+      {
+        sf += symbol;
+      }
+    }
+    else
+    {
+      if(escaped_chars.find(val) != escaped_chars.end())
+      {
+        sf += L'\\';
+      }
+      alphabet.getSymbol(sf, val); // add symbol to sf iff alphabetic
+      if(val == 0)  // non-alphabetic, possibly unknown tag; add to sf
+      {
+        sf += symbol;
+      }
+      if(alphabet.isTag(val) || val == 0)
+      {
+        seentags = true;
+      }
+      if(current_state.size() != 0)
+      {
+        if(!alphabet.isTag(val) && iswupper(val) && !caseSensitive)
+        {
+          current_state.step(val, towlower(val));
+        }
+        else
+        {
+          current_state.step(val);
+        }
+      }
+      if(current_state.isFinal(all_finals))
+      {
+        bool uppercase = sf.size() > 1 && iswupper(sf[1]);
+        bool firstupper= iswupper(sf[0]);
+
+        queue = L""; // the intervening tags were matched
+        result = current_state.filterFinals(all_finals, alphabet,
+                                            escaped_chars,
+                                            uppercase, firstupper, 0);
+      }
+      else if(result != L"")
+      {
+        // We already have a result, but there is still more to read
+        // of the analysis; following tags are not consumed, but
+        // output as target language tags (added to result on
+        // end-of-word). This queue is reset if result is changed.
+        if(alphabet.isTag(val)) // known tag
+        {
+          alphabet.getSymbol(queue, val);
+        }
+        else if (val == 0) // non-alphabetic, possibly unknown tag
+        {
+          queue += symbol;
+        }
+        else if(current_state.size() == 0)
+        {
+          // There are no more alive transductions and the current symbol is not a tag -- unknown word!
+          result = L"";
+        }
+      }
+    }
+  }
+}
+
+pair<wstring, int>
+FSTProcessor::biltransWithQueue(wstring const &input_word, bool with_delim)
+{
+  State current_state = *initial_state;
+  wstring result = L"";
+  unsigned int start_point = 1;
+  unsigned int end_point = input_word.size()-2;
+  wstring queue = L"";
+  bool mark = false;
+  bool seentags = false;  // have we seen any tags at all in the analysis?
+
+  if(with_delim == false)
+  {
+    start_point = 0;
+    end_point = input_word.size()-1;
+  }
+
+  if(input_word[start_point] == L'*')
+  {
+    return pair<wstring, int>(input_word, 0);
+  }
+
+  if(input_word[start_point] == L'=')
+  {
+    start_point++;
+    mark = true;
+  }
+
+  bool firstupper = iswupper(input_word[start_point]);
+  bool uppercase = firstupper && iswupper(input_word[start_point+1]);
+
+  for(unsigned int i = start_point; i <= end_point; i++)
+  {
+    int val = 0;
+    wstring symbol = L"";
+
+    if(input_word[i] == L'\\')
+    {
+      i++;
+      val = input_word[i];
+    }
+    else if(input_word[i] == L'<')
+    {
+      seentags = true;
+      symbol = L'<';
+      for(unsigned int j = i + 1; j <= end_point; j++)
+      {
+	symbol += input_word[j];
+	if(input_word[j] == L'>')
+	{
+	  i = j;
+	  break;
+	}
+      }
+      val = alphabet(symbol);
+    }
+    else
+    {
+      val = input_word[i];
+    }
+    if(current_state.size() != 0)
+    {
+      if(!alphabet.isTag(val) && iswupper(val) && !caseSensitive)
+      {
+	current_state.step(val, towlower(val));
+      }
+      else
+      {
+	current_state.step(val);
+      }
+    }
+    if(current_state.isFinal(all_finals))
+    {
+      result = current_state.filterFinals(all_finals, alphabet,
+                                         escaped_chars,
+                                         uppercase, firstupper, 0);
+      if(with_delim)
+      {
+        if(mark)
+        {
+          result = L"^=" + result.substr(1);
+        }
+        else
+        {
+          result[0] = L'^';
+        }
+      }
+      else
+      {
+        if(mark)
+        {
+          result = L"=" + result.substr(1);
+        }
+        else
+        {
+          result = result.substr(1);
+        }
+      }
+    }
+
+    if(current_state.size() == 0)
+    {
+      if(symbol != L"" && result != L"")
+      {
+        queue.append(symbol);
+      }
+      else
+      {
+        // word is not present
+        if(with_delim)
+        {
+          result = L"^@" + input_word.substr(1);
+        }
+        else
+        {
+          result = L"@" + input_word;
+        }
+        return pair<wstring, int>(result, 0);
+      }
+    }
+  }
+
+  if (!seentags
+      && L"" == current_state.filterFinals(all_finals, alphabet,
+                                           escaped_chars,
+                                           uppercase, firstupper, 0))
+  {
+    // word is not present
+    if(with_delim)
+    {
+      result = L"^@" + input_word.substr(1);
+    }
+    else
+    {
+      result = L"@" + input_word;
+    }
+    return pair<wstring, int>(result, 0);
+  }
+
+
+
+  // attach unmatched queue automatically
+
+  if(queue != L"")
+  {
+    wstring result_with_queue = L"";
+    for(unsigned int i = 0, limit = result.size(); i != limit; i++)
+    {
+      switch(result[i])
+      {
+        case L'\\':
+          result_with_queue += L'\\';
+	  i++;
+          break;
+
+        case L'/':
+          result_with_queue.append(queue);
+	  break;
+
+        default:
+          break;
+      }
+      result_with_queue += result[i];
+    }
+    result_with_queue.append(queue);
+
+    if(with_delim)
+    {
+      result_with_queue += L'$';
+    }
+    return pair<wstring, int>(result_with_queue, queue.size());
+  }
+  else
+  {
+    if(with_delim)
+    {
+      result += L'$';
+    }
+    return pair<wstring, int>(result, 0);
+  }
+}
+
+wstring
+FSTProcessor::biltransWithoutQueue(wstring const &input_word, bool with_delim)
+{
+  State current_state = *initial_state;
+  wstring result = L"";
+  unsigned int start_point = 1;
+  unsigned int end_point = input_word.size()-2;
+  bool mark = false;
+
+  if(with_delim == false)
+  {
+    start_point = 0;
+    end_point = input_word.size()-1;
+  }
+
+  if(input_word[start_point] == L'*')
+  {
+    return input_word;
+  }
+
+  if(input_word[start_point] == L'=')
+  {
+    start_point++;
+    mark = true;
+  }
+
+  bool firstupper = iswupper(input_word[start_point]);
+  bool uppercase = firstupper && iswupper(input_word[start_point+1]);
+
+  for(unsigned int i = start_point; i <= end_point; i++)
+  {
+    int val;
+    wstring symbol = L"";
+
+    if(input_word[i] == L'\\')
+    {
+      i++;
+      val = static_cast<int>(input_word[i]);
+    }
+    else if(input_word[i] == L'<')
+    {
+      symbol = L'<';
+      for(unsigned int j = i + 1; j <= end_point; j++)
+      {
+	symbol += input_word[j];
+	if(input_word[j] == L'>')
+	{
+	  i = j;
+	  break;
+	}
+      }
+      val = alphabet(symbol);
+    }
+    else
+    {
+      val = static_cast<int>(input_word[i]);
+    }
+    if(current_state.size() != 0)
+    {
+      if(!alphabet.isTag(val) && iswupper(val) && !caseSensitive)
+      {
+	current_state.step(val, towlower(val));
+      }
+      else
+      {
+	current_state.step(val);
+      }
+    }
+    if(current_state.isFinal(all_finals))
+    {
+      result = current_state.filterFinals(all_finals, alphabet,
+                                         escaped_chars,
+                                         uppercase, firstupper, 0);
+      if(with_delim)
+      {
+        if(mark)
+        {
+          result = L"^=" + result.substr(1);
+        }
+        else
+        {
+          result[0] = L'^';
+        }
+      }
+      else
+      {
+        if(mark)
+        {
+          result = L"=" + result.substr(1);
+        }
+        else
+        {
+          result = result.substr(1);
+        }
+      }
+    }
+
+    if(current_state.size() == 0)
+    {
+      if(symbol == L"")
+      {
+	// word is not present
+        if(with_delim)
+	{
+          result = L"^@" + input_word.substr(1);
+	}
+        else
+	{
+          result = L"@" + input_word;
+	}
+        return result;
+      }
+    }
+  }
+
+  if(with_delim)
+  {
+    result += L'$';
+  }
+  return result;
+}
+
+
+bool
+FSTProcessor::valid() const
+{
+  if(initial_state->isFinal(all_finals))
+  {
+    wcerr << L"Error: Invalid dictionary (hint: the left side of an entry is empty)" << endl;
+    return false;
+  }
+  else
+  {
+    State s = *initial_state;
+    s.step(L' ');
+    if(s.size() != 0)
+    {
+      wcerr << L"Error: Invalid dictionary (hint: entry beginning with whitespace)" << endl;
+      return false;
+    }
+  }
+
+  return true;
+}
+
+int
+FSTProcessor::readSAO(FILE *input)
+{
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wchar_t val = static_cast<wchar_t>(fgetwc_unlocked(input));
+  if(feof(input))
+  {
+    return 0;
+  }
+
+  if(escaped_chars.find(val) != escaped_chars.end())
+  {
+    if(val == L'<')
+    {
+      wstring str = readFullBlock(input, L'<', L'>');
+      if(str.substr(0, 9) == L"<![CDATA[")
+      {
+        while(str.substr(str.size()-3) != L"]]>")
+        {
+          str.append(readFullBlock(input, L'<', L'>').substr(1));
+        }
+        blankqueue.push(str);
+        input_buffer.add(static_cast<int>(L' '));
+        return static_cast<int>(L' ');
+      }
+      else
+      {
+        streamError();
+      }
+    }
+    else if (val == L'\\') {
+      val = static_cast<wchar_t>(fgetwc_unlocked(input));
+      if(isEscaped(val))
+      {
+        input_buffer.add(val);
+        return static_cast<int>(val);
+      }
+      else
+        streamError();
+    }
+    else
+    {
+      streamError();
+    }
+  }
+
+  input_buffer.add(val);
+  return static_cast<int>(val);
+}
+
+void
+FSTProcessor::printSAOWord(wstring const &lf, FILE *output)
+{
+  for(unsigned int i = 1, limit = lf.size(); i != limit; i++)
+  {
+    if(lf[i] == L'/')
+    {
+      break;
+    }
+    fputwc_unlocked(lf[i], output);
+  }
+}
+
+void
+FSTProcessor::SAO(FILE *input, FILE *output)
+{
+  bool last_incond = false;
+  bool last_postblank = false;
+  State current_state = *initial_state;
+  wstring lf = L"";
+  wstring sf = L"";
+  int last = 0;
+
+  escaped_chars.clear();
+  escaped_chars.insert(static_cast<wchar_t>(L'\\'));
+  escaped_chars.insert(static_cast<wchar_t>(L'<'));
+  escaped_chars.insert(static_cast<wchar_t>(L'>'));
+
+  while(wchar_t val = readSAO(input))
+  {
+    // test for final states
+    if(current_state.isFinal(all_finals))
+    {
+      if(current_state.isFinal(inconditional))
+      {
+        bool firstupper = iswupper(sf[0]);
+        bool uppercase = firstupper && iswupper(sf[sf.size()-1]);
+
+        lf = current_state.filterFinalsSAO(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_incond = true;
+        last = input_buffer.getPos();
+      }
+      else if(current_state.isFinal(postblank))
+      {
+        bool firstupper = iswupper(sf[0]);
+        bool uppercase = firstupper && iswupper(sf[sf.size()-1]);
+
+        lf = current_state.filterFinalsSAO(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_postblank = true;
+        last = input_buffer.getPos();
+      }
+      else if(!isAlphabetic(val))
+      {
+        bool firstupper = iswupper(sf[0]);
+        bool uppercase = firstupper && iswupper(sf[sf.size()-1]);
+
+        lf = current_state.filterFinalsSAO(all_finals, alphabet,
+                                        escaped_chars,
+                                        uppercase, firstupper);
+        last_postblank = false;
+        last_incond = false;
+        last = input_buffer.getPos();
+      }
+    }
+    else if(sf == L"" && iswspace(val))
+    {
+      lf = L"/*";
+      lf.append(sf);
+      last_postblank = false;
+      last_incond = false;
+      last = input_buffer.getPos();
+    }
+
+    if(!iswupper(val) || caseSensitive)
+    {
+      current_state.step(val);
+    }
+    else
+    {
+      current_state.step(val, towlower(val));
+    }
+
+    if(current_state.size() != 0)
+    {
+      alphabet.getSymbol(sf, val);
+    }
+    else
+    {
+      if(!isAlphabetic(val) && sf == L"")
+      {
+        if(iswspace(val))
+        {
+          printSpace(val, output);
+        }
+        else
+        {
+          if(isEscaped(val))
+          {
+            fputwc_unlocked(L'\\', output);
+          }
+          fputwc_unlocked(val, output);
+        }
+      }
+      else if(last_incond)
+      {
+        printSAOWord(lf, output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+      else if(last_postblank)
+      {
+        printSAOWord(lf, output);
+	fputwc_unlocked(L' ', output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+      else if(isAlphabetic(val) &&
+              ((sf.size()-input_buffer.diffPrevPos(last)) > lastBlank(sf) ||
+               lf == L""))
+      {
+        do
+        {
+          alphabet.getSymbol(sf, val);
+        }
+        while((val = readSAO(input)) && isAlphabetic(val));
+
+        unsigned int limit = firstNotAlpha(sf);
+        unsigned int size = sf.size();
+        limit = (limit == static_cast<unsigned int>(wstring::npos)?size:limit);
+        input_buffer.back(1+(size-limit));
+        fputws_unlocked(L"<d>", output);
+        fputws_unlocked(sf.c_str(), output);
+        fputws_unlocked(L"</d>", output);
+      }
+      else if(lf == L"")
+      {
+        unsigned int limit = firstNotAlpha(sf);
+        unsigned int size = sf.size();
+        limit = (limit == static_cast<unsigned int>(wstring::npos)?size:limit);
+        input_buffer.back(1+(size-limit));
+        fputws_unlocked(L"<d>", output);
+        fputws_unlocked(sf.c_str(), output);
+        fputws_unlocked(L"</d>", output);
+      }
+      else
+      {
+        printSAOWord(lf, output);
+        input_buffer.setPos(last);
+        input_buffer.back(1);
+      }
+
+      current_state = *initial_state;
+      lf = L"";
+      sf = L"";
+      last_incond = false;
+      last_postblank = false;
+    }
+  }
+
+  // print remaining blanks
+  flushBlanks(output);
+}
+
+wstring
+FSTProcessor::removeTags(wstring const &str)
+{
+  for(unsigned int i = 0; i < str.size(); i++)
+  {
+    if(str[i] == L'<' && i >=1 && str[i-1] != L'\\')
+    {
+      return str.substr(0, i);
+    }
+  }
+
+  return str;
+}
+
+
+void
+FSTProcessor::setBiltransSurfaceForms(bool const value)
+{
+  biltransSurfaceForms = value;
+}
+
+void
+FSTProcessor::setCaseSensitiveMode(bool const value)
+{
+  caseSensitive = value;
+}
+
+void
+FSTProcessor::setDictionaryCaseMode(bool const value)
+{
+  dictionaryCase = value;
+}
+
+void
+FSTProcessor::setNullFlush(bool const value)
+{
+  nullFlush = value;
+}
+
+bool
+FSTProcessor::getDecompoundingMode()
+{
+  return do_decomposition;
+}
+
+bool
+FSTProcessor::getNullFlush()
+{
+  return nullFlush;
+}
+
+size_t
+FSTProcessor::firstNotAlpha(wstring const &sf)
+{
+  for(size_t i = 0, limit = sf.size(); i < limit; i++)
+  {
+    if(!isAlphabetic(sf[i]))
+    {
+      return i;
+    }
+  }
+
+  return wstring::npos;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_exe.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_exe.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_exe.cc	(revision 70339)
@@ -0,0 +1,108 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/compression.h>
+
+MatchExe::MatchExe() :
+initial_id(0)
+{
+}
+
+MatchExe::~MatchExe()
+{
+  destroy();
+}
+
+MatchExe::MatchExe(MatchExe const &te)
+{
+  copy(te);
+}
+
+MatchExe::MatchExe(Transducer const &t, map<int, int > const &final_type)
+{
+  // memory allocation
+  node_list.reserve(t.transitions.size());
+
+  for(map<int, multimap<int, int> >::const_iterator it = t.transitions.begin(),
+        limit = t.transitions.end(); it != limit; it++)
+  {
+    MatchNode mynode(it->second.size());
+    node_list.push_back(mynode);
+  }
+  
+  // set up finals
+  for(map<int, int>::const_iterator it = final_type.begin(), limit = final_type.end();
+      it != limit; it++)
+  {
+    finals[&node_list[it->first]] = it->second;
+  }  
+ 
+  // set up initial node
+  initial_id = t.initial;
+ 
+  // set up the transitions
+  for(map<int, multimap<int, int> >::const_iterator it = t.transitions.begin(),
+        limit = t.transitions.end(); it != limit; it++)
+  {
+    MatchNode &mynode = node_list[it->first];
+    int i = 0;
+    for(multimap<int, int>::const_iterator it2 = it->second.begin(),
+          limit2 = it->second.end(); it2 != limit2; it2++)
+    {
+      mynode.addTransition(it2->first, &node_list[it2->second], i++);
+    }
+  }
+}
+
+MatchExe &
+MatchExe::operator =(MatchExe const &te)
+{
+  if(this != &te)
+  {
+    destroy();
+    copy(te);
+  }
+  return *this;
+}
+
+void
+MatchExe::copy(MatchExe const &te)
+{
+  initial_id = te.initial_id;
+  node_list = te.node_list;
+  finals = te.finals;
+}
+
+void
+MatchExe::destroy()
+{
+}
+
+MatchNode *
+MatchExe::getInitial()
+{
+  return &node_list[initial_id];
+}
+
+map<MatchNode *, int> &
+MatchExe::getFinals()
+{
+  return finals;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pattern_list.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pattern_list.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pattern_list.cc	(revision 70339)
@@ -0,0 +1,412 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/pattern_list.h>
+#include <lttoolbox/compression.h>
+
+#include <cstdlib>
+#include <iostream>
+
+wstring const PatternList::ANY_CHAR  = L"<ANY_CHAR>";
+wstring const PatternList::ANY_TAG   = L"<ANY_TAG>";
+wstring const PatternList::QUEUE = L"<QUEUE>";
+
+void
+PatternList::copy(PatternList const &o)
+{
+  sequence = o.sequence;
+  sequence_data = o.sequence_data;
+  patterns = o.patterns;
+  alphabet = o.alphabet;
+  transducer = o.transducer;
+  final_type = o.final_type;
+  sequence_id = o.sequence_id;
+}
+
+void
+PatternList::destroy()
+{
+}
+
+PatternList::PatternList() :
+sequence_id(0)
+{
+  sequence = false;
+  alphabet.includeSymbol(ANY_TAG);
+  alphabet.includeSymbol(ANY_CHAR);
+  alphabet.includeSymbol(QUEUE);
+}
+
+PatternList::~PatternList()
+{
+  destroy();
+}
+
+PatternList::PatternList(PatternList const &o)
+{
+  copy(o);
+}
+
+PatternList &
+PatternList::operator =(PatternList const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+void
+PatternList::beginSequence()
+{
+  if(sequence)
+  {
+    wcerr << L"Error: opening an unended sequence" << endl;
+    exit(EXIT_FAILURE);
+  }
+  sequence = true;
+  sequence_data.clear();
+}
+
+void
+PatternList::endSequence()
+{
+  if(!sequence)
+  {
+    wcerr << L"Error: ending an unopened sequence" << endl;
+    exit(EXIT_FAILURE);
+  }
+  sequence = false;
+  
+  for(list<vector<int> >::iterator it = sequence_data.begin(),
+	limit = sequence_data.end();
+      it != limit; it++)
+  {
+    it->push_back(alphabet(QUEUE));
+    patterns.insert(pair<int, vector<int> >(sequence_id, *it));
+  }
+}
+
+void
+PatternList::insertOutOfSequence(wstring const &lemma, wstring const &tags,
+				 vector<int> &result)
+{
+  if(lemma == L"")
+  {
+    result.push_back(alphabet(ANY_CHAR));
+  }
+  else
+  {
+    for(unsigned int i = 0, limit = lemma.size(); i < limit; i++)
+    {
+      if(lemma[i] == L'*')
+      {
+        result.push_back(alphabet(ANY_CHAR));
+      }
+      else
+      { 
+        result.push_back(int((unsigned char) lemma[i]));
+      }
+    }
+  }
+  if(tags == L"")
+  {
+    result.push_back(alphabet(ANY_TAG));
+  }
+  else
+  {
+    for(unsigned int i = 0, limit = tagCount(tags); i < limit; i++)
+    {
+      wstring tag = L"<" + tagAt(tags, i) + L">";
+      
+      if(tag == L"<*>")
+      {
+	result.push_back(alphabet(ANY_TAG));
+      }
+      else
+      {
+	alphabet.includeSymbol(tag);
+	result.push_back(alphabet(tag));
+      }
+    } 
+  }
+}
+
+void
+PatternList::insertIntoSequence(int const id, wstring const &lemma, 
+				wstring const &tags)
+{
+  sequence_id = id;
+
+  if(sequence_data.size() == 0)
+  {
+    vector<int> new_vector;
+    insertOutOfSequence(lemma, tags, new_vector);
+    sequence_data.push_back(new_vector);
+  }
+  else
+  {
+    list<vector<int> >::iterator it    = sequence_data.begin();
+    list<vector<int> >::iterator limit = sequence_data.end();
+    for(; it != limit; it++)
+    {
+      it->push_back(L'+');
+      insertOutOfSequence(lemma, tags, *it);
+    }
+  }
+}
+
+void
+PatternList::insert(int const id, wstring const &lemma, wstring const &tags)
+{
+  if(!sequence)
+  {
+    vector<int> local;
+    insertOutOfSequence(lemma, tags, local);
+    local.push_back(alphabet(QUEUE));
+    patterns.insert(pair<int, vector<int> >(id, local));
+  }
+  else
+  {
+    insertIntoSequence(id, lemma, tags);
+  }
+}
+
+void
+PatternList::insert(int const id, int const otherid)
+{
+  if(!sequence)
+  {
+    wcerr << L"Error: using labels outside of a sequence" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  sequence_id = id;
+
+  if(sequence_data.size() == 0)
+  {
+    PatternRange p = patterns.equal_range(otherid);
+    for(; p.first != p.second; p.first++)
+    {
+      sequence_data.push_back(p.first->second);
+    }
+  }
+  else
+  {
+    list<vector<int> > new_sequence_data;
+
+    for(list<vector<int> >::iterator it = sequence_data.begin(),
+	  limit = sequence_data.end(); it != limit; it++)
+    {
+      for(PatternRange p = patterns.equal_range(otherid);
+	  p.first != p.second; p.first++)
+      {
+	vector<int> temp = *it;
+	temp.push_back(L'+');
+        temp.insert(temp.end(), (p.first->second).begin(),
+		    (p.first->second).end());
+	new_sequence_data.push_back(temp);
+      }
+    }
+
+    sequence_data = new_sequence_data;
+  }
+}
+
+int
+PatternList::tagCount(wstring const &tags)
+{
+  int count = 0;
+
+  for(unsigned int i = 0, limit = tags.size(); i < limit; i++)
+  {
+    if(i == 0)
+    {
+      count++;
+    }
+    else if(tags[i] == L'.')
+    {
+      count++;
+    }
+  }
+
+  return count;
+}
+
+wstring
+PatternList::tagAt(wstring const &tags, int const index)
+{
+  int start = 0;
+  int end = 0;
+  int count = 0;
+
+  for(unsigned int i = 0, limit = tags.size(); i < limit; i++)
+  {
+    if(tags[i] == L'.')
+    {
+      count++;
+      if(end == 0)
+      {
+	start = 0;
+      }
+      else
+      {
+	start = end + 1;
+      }
+      end = i;
+    }
+    if(count == index + 1)
+    {
+      return tags.substr(start, end - start);
+    }
+  }
+
+  if(index > count)
+  {
+    return L"";
+  }
+  if(end != 0)
+  {
+    return tags.substr(end + 1);
+  }
+  else
+  {
+    return tags.substr(end);
+  }
+}
+
+PatternStore const &
+PatternList::getPatterns()
+{
+  return patterns;
+}
+
+void
+PatternList::buildTransducer()
+{
+  for(PatternStore::const_iterator it = patterns.begin(), limit = patterns.end();
+      it != limit; it++)
+  {
+    int state = transducer.getInitial();
+    int prevstate = -1;
+    for(unsigned int i = 0, limit2 = it->second.size(); i != limit2; i++)
+    {
+      int const val = it->second[i];
+      if(alphabet(ANY_CHAR) == val || alphabet(ANY_TAG) == val)
+      {
+        state = transducer.insertSingleTransduction(val, state);
+        if(prevstate != -1)
+        {
+          transducer.linkStates(prevstate, state, val);
+          prevstate = -1;
+        }
+        transducer.linkStates(state, state, val);
+      }
+      else if(alphabet(QUEUE) == val)
+      {
+        if(prevstate != -1)
+        {
+          // ignore second (and next) possible consecutive queues
+          continue;
+        }
+        
+	// optional queue
+        prevstate = state;
+        state = transducer.insertSingleTransduction(static_cast<int>(L'_'), state);
+        transducer.linkStates(prevstate, state, static_cast<int>(L' '));
+        transducer.linkStates(prevstate, state, static_cast<int>(L'#'));
+        transducer.linkStates(state, state, alphabet(ANY_CHAR));
+      }
+      else
+      {
+        state = transducer.insertSingleTransduction(val, state);
+        if(prevstate != -1)
+        {
+          transducer.linkStates(prevstate, state, val);
+          prevstate = -1;
+        }
+      }
+    }
+    if(prevstate != -1)
+    {
+      if(!transducer.isFinal(prevstate))
+      {
+        transducer.setFinal(prevstate);
+        final_type[prevstate] = it->first;
+      }
+    }
+    if(!transducer.isFinal(state))
+    {
+      transducer.setFinal(state);
+      final_type[state] = it->first;
+    }
+  }
+}  
+
+void
+PatternList::write(FILE *output)
+{
+  alphabet.write(output);
+  wstring const tagger_name = L"tagger";
+
+  Compression::multibyte_write(1, output);
+  Compression::wstring_write(tagger_name, output);
+  transducer.write(output, alphabet.size());
+
+  Compression::multibyte_write(final_type.size(), output);
+
+  for(map<int, int>::const_iterator it = final_type.begin(), limit = final_type.end();
+      it != limit; it++)
+  {
+    Compression::multibyte_write(it->first, output);
+    Compression::multibyte_write(it->second, output);
+  }
+}
+
+void
+PatternList::read(FILE *input)
+{
+  sequence = false;
+  final_type.clear();
+  
+  alphabet.read(input);
+  if(Compression::multibyte_read(input) == 1)
+  {
+    wstring mystr = Compression::wstring_read(input);
+    transducer.read(input, alphabet.size());
+    
+    int finalsize = Compression::multibyte_read(input);
+    for(; finalsize != 0; finalsize--)
+    {
+      int key = Compression::multibyte_read(input);
+      final_type[key] = Compression::multibyte_read(input);
+    }
+  }
+}
+
+MatchExe *
+PatternList::newMatchExe()
+{
+  return new MatchExe(transducer, final_type);
+}
+
+Alphabet &
+PatternList::getAlphabet()
+{
+  return alphabet;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/regexp_compiler.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/regexp_compiler.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/regexp_compiler.cc	(revision 70339)
@@ -0,0 +1,480 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/regexp_compiler.h>
+
+#include <cstdlib>
+#include <iostream>
+
+RegexpCompiler::RegexpCompiler() :
+token(0),
+alphabet(0),
+state(0),
+letter(0)
+{
+}
+
+RegexpCompiler::~RegexpCompiler()
+{
+  destroy();
+}
+
+RegexpCompiler::RegexpCompiler(RegexpCompiler const &rec)
+{
+  copy(rec);
+}
+
+RegexpCompiler &
+RegexpCompiler::operator =(RegexpCompiler const &rec)
+{
+  if(this != &rec)
+  {
+    destroy();
+    copy(rec);
+  }
+
+  return *this;
+}
+
+void
+RegexpCompiler::copy(RegexpCompiler const &rec)
+{
+  token = rec.token;
+  input = rec.input;
+  transducer = rec.transducer;
+  letter = rec.letter;
+  alphabet = rec.alphabet;
+  state = rec.state;
+  letter = rec.letter;
+  postop = rec.postop;
+}
+
+void
+RegexpCompiler::destroy()
+{
+}
+
+bool 
+RegexpCompiler::isReserved(int const t)
+{
+  switch(t) 
+  {
+    case L'(':
+    case L')':
+    case L'[':
+    case L']':
+    case L'*':
+    case L'?':
+    case L'+':
+    case L'-':
+    case L'^':
+    case L'\\':
+    case L'|':
+    case FIN_FICHERO:
+      return true;
+ 
+    default:
+      return false;
+  }
+}
+
+void
+RegexpCompiler::error()
+{
+  wcerr << L"Error parsing regexp" <<endl;
+  exit(EXIT_FAILURE);
+}
+
+void 
+RegexpCompiler::errorConsuming(int const t)
+{
+  wcerr << L"Error parsing regexp" << endl;
+  exit(EXIT_FAILURE);
+}
+
+void 
+RegexpCompiler::consume(int const t)
+{
+  if(token == t)
+  {
+    input = input.substr(1);
+    if(input ==  L"")
+    {
+      token = FIN_FICHERO;
+    }
+    else
+    {
+      token = input[0];
+    }
+  }
+  else
+  {
+    errorConsuming(t);
+  }
+}
+
+void 
+RegexpCompiler::compile(wstring const &er)
+{
+  input = er;
+  token = static_cast<int>(input[0]);
+  state = transducer.getInitial();
+  S();
+  transducer.setFinal(state);
+}
+
+void 
+RegexpCompiler::S()
+{
+  if(token == L'(' || token == L'[' || !isReserved(token) || token == L'\\')
+  {
+    RExpr();
+    Cola();
+  }
+  else
+  {
+    error();
+  }
+}
+
+void 
+RegexpCompiler::RExpr()
+{
+  if(token == L'(' || token == L'[' || !isReserved(token) || token == L'\\')
+  {
+    Term();
+    RExprp();
+  }
+  else
+  {
+    error();
+  }
+}
+
+void 
+RegexpCompiler::Cola()
+{
+  if(token == FIN_FICHERO || token == L')')
+  {
+  }
+  else if(token == L'|')
+  {
+    int e = state;
+    state = transducer.getInitial();
+    consume(L'|');
+    RExpr();
+    Cola();
+   
+    state = transducer.insertNewSingleTransduction((*alphabet)(0, 0), state);
+    transducer.linkStates(e, state, (*alphabet)(0, 0));
+  }
+  else
+  {
+    error();
+  }
+}
+
+void 
+RegexpCompiler::Term()
+{
+  if(!isReserved(token) || token == L'\\')
+  {
+    Transducer t;
+    int e = t.getInitial();
+    Letra();
+    e = t.insertNewSingleTransduction((*alphabet)(letter, letter), e);
+    t.setFinal(e);
+    Postop();
+    if(postop == L"*")
+    {
+      t.zeroOrMore((*alphabet)(0, 0));
+    }
+    else if(postop == L"+")
+    {
+      t.oneOrMore((*alphabet)(0, 0));
+    }
+    else if(postop == L"?")
+    {
+      t.optional((*alphabet)(0, 0));
+    }
+
+    postop = L"";
+    state = transducer.insertTransducer(state, t, (*alphabet)(0, 0));
+  }
+  else if(token == L'(')
+  {
+    Transducer t = transducer;
+    int e = state;
+    transducer.clear();
+    state = transducer.getInitial();
+    consume(L'(');
+    S();
+    consume(L')');
+    transducer.setFinal(state);
+    Postop();
+    if(postop == L"*")
+    {
+      transducer.zeroOrMore((*alphabet)(0, 0));
+    }
+    else if(postop == L"+")
+    {
+      transducer.oneOrMore((*alphabet)(0, 0));
+    }
+    else if(postop == L"?")
+    {
+      transducer.optional((*alphabet)(0, 0));
+    }
+
+    postop = L"";
+    state = t.insertTransducer(e, transducer, (*alphabet)(0, 0));
+    transducer = t;
+  }
+  else if(token == L'[')
+  {
+    consume(L'[');
+    Esp();
+  }
+  else
+  {
+    error();
+  }
+}
+
+void 
+RegexpCompiler::RExprp()
+{
+  if(token == L'(' || token == L'[' || !isReserved(token) || token == L'\\')
+  {
+    Term();
+    RExprp();
+  }
+  else if(token == L'|' || token == FIN_FICHERO || token == L')')
+  {
+  }
+  else
+  {
+    error();
+  }
+}
+
+void
+RegexpCompiler::Letra()
+{
+  if(!isReserved(token))
+  {
+    letter = token;
+    consume(token);
+  }
+  else if(token == L'\\')
+  {
+    consume(L'\\');
+    letter = token;
+    Reservado();
+  }
+  else
+  {
+    error();
+  }
+}
+
+void
+RegexpCompiler::Postop()
+{
+  if(token == L'*')
+  {
+    consume(L'*');
+    postop = L"*";
+  }
+  else if(token == L'?')
+  {
+    consume(L'?');
+    postop = L"?";
+  }
+  else if(token == L'+')
+  {
+    consume(L'+');
+    postop = L"+";
+  }
+  else if(token == L'(' || token == L'[' || !isReserved(token) || 
+          token == L'\\' || token == L'|' ||  token == FIN_FICHERO || 
+	  token == L')')
+  {
+  }
+  else
+  {
+    error();
+  }
+}
+
+void
+RegexpCompiler::Esp()
+{
+  Transducer t;
+  if(!isReserved(token) || token == L'\\' || token == L']')
+  {
+    Lista();
+    consume(L']');
+    Postop();
+
+    for(set<int>::iterator it = brackets.begin(); 
+        it != brackets.end(); it++)
+    {
+      int mystate = t.getInitial();
+      mystate = t.insertNewSingleTransduction((*alphabet)(0, 0), mystate);
+      mystate = t.insertNewSingleTransduction((*alphabet)(*it, *it), mystate);
+      t.setFinal(mystate);
+    }
+
+    t.joinFinals((*alphabet)(0, 0));
+  }
+  else if(token == L'^')
+  {
+    consume(L'^');
+    Lista();
+    consume(L']');
+    Postop();
+   
+    for(int i = 0; i < 256 ;i++)
+    {
+      if(brackets.find(i) == brackets.end())
+      {
+        int mystate = t.getInitial();
+        mystate = t.insertNewSingleTransduction((*alphabet)(0, 0), mystate);
+        mystate = t.insertNewSingleTransduction((*alphabet)(i, i), mystate);
+	t.setFinal(mystate);
+      }
+    }
+    
+    t.joinFinals((*alphabet)(0, 0));
+  }
+  else
+  {
+    error();
+  }
+
+  if(postop == L"+")
+  {
+    t.oneOrMore((*alphabet)(0, 0));     
+  }
+  else if(postop == L"*")
+  {
+    t.zeroOrMore((*alphabet)(0, 0));
+  }
+  else if(postop == L"?")
+  {
+    t.optional((*alphabet)(0, 0));
+  }
+  brackets.clear();
+  postop = L"";
+
+  state = transducer.insertTransducer(state, t, (*alphabet)(0, 0));
+}
+
+void 
+RegexpCompiler::Lista()
+{
+  if(!isReserved(token) || token == L'\\')
+  {
+    Elem();
+    Lista();
+  }
+  else if(token == L']')
+  {
+  }
+  else
+  {
+    error();
+  }
+}
+
+void 
+RegexpCompiler::Reservado()
+{
+  if(isReserved(token))
+  {
+    consume(token);
+  }
+  else
+  {
+    error();
+  }
+}
+
+void 
+RegexpCompiler::Elem()
+{
+  if(!isReserved(token) || token == L'\\')
+  {
+    Letra();
+    int rango1 = letter;
+    ColaLetra();
+    int rango2 = letter;
+
+    if(rango1 > rango2)
+    {
+      error();
+    }
+    else
+    {
+      for(int i = rango1; i <= rango2; i++)
+      {
+        brackets.insert(i);
+      }
+    }
+  }
+  else
+  {
+    error();
+  }
+}
+
+void
+RegexpCompiler::ColaLetra()
+{
+  if(token == L'-')
+  {
+    consume(L'-');
+    Letra();
+  }
+  else if(!isReserved(token) || token == L'\\' || token == L']')
+  {
+  }
+  else
+  {
+    error();
+  }
+}
+
+void
+RegexpCompiler::setAlphabet(Alphabet *a)
+{
+  alphabet = a;
+}
+
+Transducer &
+RegexpCompiler::getTransducer()
+{
+  return transducer;
+}
+
+void
+RegexpCompiler::initialize(Alphabet *a)
+{
+  setAlphabet(a);
+  transducer.clear();
+  brackets.clear();
+  postop = L"";
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/trans_exe.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/trans_exe.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/trans_exe.cc	(revision 70339)
@@ -0,0 +1,146 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <lttoolbox/trans_exe.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/my_stdio.h>
+
+TransExe::TransExe() :
+initial_id(0)
+{
+}
+
+TransExe::~TransExe()
+{
+  destroy();
+}
+
+TransExe::TransExe(TransExe const &te)
+{
+  copy(te);
+}
+
+TransExe &
+TransExe::operator =(TransExe const &te)
+{
+  if(this != &te)
+  {
+    destroy();
+    copy(te);
+  }
+  return *this;
+}
+
+void
+TransExe::copy(TransExe const &te)
+{
+  initial_id = te.initial_id;
+  node_list = te.node_list;
+  finals = te.finals;
+}
+
+void
+TransExe::destroy()
+{
+}
+
+#include <iostream>
+
+void
+TransExe::read(FILE *input, Alphabet const &alphabet)
+{
+  TransExe &new_t = *this;
+  new_t.destroy();
+  new_t.initial_id = Compression::multibyte_read(input);
+  int finals_size = Compression::multibyte_read(input);
+
+  int base = 0;
+
+  set<int> myfinals;
+
+
+  while(finals_size > 0)
+  {
+    finals_size--;
+
+    base += Compression::multibyte_read(input);
+    myfinals.insert(base);
+  }
+  
+
+  base = Compression::multibyte_read(input);
+
+  int number_of_states = base;
+  int current_state = 0;   
+  new_t.node_list.resize(number_of_states);
+
+  for(set<int>::iterator it = myfinals.begin(), limit = myfinals.end(); 
+      it != limit; it++)
+  {
+    new_t.finals.insert(&new_t.node_list[*it]);
+  }
+
+  while(number_of_states > 0)
+  {
+    int number_of_local_transitions = Compression::multibyte_read(input);
+    int tagbase = 0;
+    Node &mynode = new_t.node_list[current_state];
+
+    while(number_of_local_transitions > 0)
+    {
+      number_of_local_transitions--;
+      tagbase += Compression::multibyte_read(input);
+      int state = (current_state + Compression::multibyte_read(input)) % base;
+      int i_symbol = alphabet.decode(tagbase).first;
+      int o_symbol = alphabet.decode(tagbase).second;
+      
+      mynode.addTransition(i_symbol, o_symbol, &new_t.node_list[state]);
+    }   
+    number_of_states--;
+    current_state++;
+  }
+}
+
+void
+TransExe::unifyFinals()
+{
+  node_list.resize(node_list.size()+1);
+
+  Node *newfinal = &node_list[node_list.size()-1];
+
+  for(set<Node *>::iterator it = finals.begin(), limit = finals.end(); 
+      it != limit; it++)
+  {
+    (*it)->addTransition(0, 0, newfinal);
+  }
+  
+  finals.clear();
+  finals.insert(newfinal);
+}
+
+Node *
+TransExe::getInitial()
+{
+  return &node_list[initial_id];
+}
+
+set<Node *> &
+TransExe::getFinals()
+{
+  return finals;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/fst_processor.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/fst_processor.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/fst_processor.h	(revision 70339)
@@ -0,0 +1,390 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _FSTPROCESSOR_
+#define _FSTPROCESSOR_
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/buffer.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/state.h>
+#include <lttoolbox/trans_exe.h>
+
+#include <cwchar>
+#include <map>
+#include <queue>
+#include <set>
+#include <string>
+
+using namespace std;
+
+/**
+ * Kind of output of the generator module
+ */
+enum GenerationMode
+{
+  gm_clean,      // clear all
+  gm_unknown,    // display unknown words, clear transfer and generation tags
+  gm_all,        // display all
+  gm_tagged,     // tagged generation
+  gm_tagged_nm   // clean tagged generation
+};
+
+/**
+ * Class that implements the FST-based modules of the system
+ */
+class FSTProcessor
+{
+private:
+  /**
+   * Transducers in FSTP
+   */
+  map<wstring, TransExe, Ltstr> transducers;
+
+  /**
+   * Current state of lexical analysis
+   */
+  State *current_state;
+
+  /**
+   * Initial state of every token
+   */
+  State *initial_state;
+
+  /**
+   * Set of final states of inconditional sections in the dictionaries
+   */
+  set<Node *> inconditional;
+
+  /**
+   * Set of final states of standard sections in the dictionaries
+   */
+  set<Node *> standard;
+
+  /**
+   * Set of final states of postblank sections in the dictionaries
+   */
+  set<Node *> postblank;
+
+  /**
+   * Set of final states of preblank sections in the dictionaries
+   */
+  set<Node *> preblank;
+
+  /**
+   * Merge of 'inconditional', 'standard', 'postblank' and 'preblank' sets
+   */
+  set<Node *> all_finals;
+
+  /**
+   * Queue of blanks, used in reading methods
+   */
+  queue<wstring> blankqueue;
+
+  /**
+   * Set of characters being considered alphabetics
+   */
+  set<wchar_t> alphabetic_chars;
+
+  /**
+   * Set of characters to escape with a backslash
+   */
+  set<wchar_t> escaped_chars;
+
+  /**
+   * Alphabet
+   */
+  Alphabet alphabet;
+
+  /**
+   * Input buffer
+   */
+  Buffer<int> input_buffer;
+
+  /**
+   * Begin of the transducer
+   */
+  Node root;
+
+  /**
+   * true if the position of input stream is out of a word
+   */
+  bool outOfWord;
+
+  /**
+   * true if we're automatically removing surface forms.
+   */
+  bool biltransSurfaceForms;
+
+
+  /**
+   * if true, makes always difference between uppercase and lowercase
+   * characters
+   */
+  bool caseSensitive;
+
+  /**
+   * if true, uses the dictionary case, discarding surface case
+   * information
+   */
+  bool dictionaryCase;
+
+  /**
+   * if true, flush the output when the null character is found
+   */
+  bool nullFlush;
+
+  /**
+   * nullFlush property for the skipUntil function
+   */
+  bool nullFlushGeneration;
+
+  /**
+   * try analysing unknown words as compounds
+   */
+  bool do_decomposition;
+
+  /**
+   * Symbol of CompoundOnlyL
+   */
+  int compoundOnlyLSymbol;
+
+  /**
+   * Symbol of CompoundR
+   */
+  int compoundRSymbol;
+
+  /**
+   * Show or not the controls symbols (as compoundRSymbol)
+   */
+   bool showControlSymbols;
+
+  /**
+   * Max compound elements
+   * Hard coded for now, but there might come a switch one day
+   */
+  int compound_max_elements;
+
+  /**
+   * Prints an error of input stream and exits
+   */
+  void streamError();
+
+  /**
+   * Reads a character that is defined in the set of escaped_chars
+   * @param input the stream to read from
+   * @return code of the character
+   */
+  wchar_t readEscaped(FILE *input);
+
+  /**
+   * Reads a block from the stream input, enclosed by delim1 and delim2
+   * @param input the stream being read
+   * @param delim1 the delimiter of the beginning of the sequence
+   * @param delim1 the delimiter of the end of the sequence
+   */
+  wstring readFullBlock(FILE *input, wchar_t const delim1, wchar_t const delim2);
+
+  /**
+   * Returns true if the character code is identified as alphabetic
+   * @param c the code provided by the user
+   * @return true if it's alphabetic
+   */
+  bool isAlphabetic(wchar_t const c) const;
+
+  /**
+   * Tests if a character is in the set of escaped_chars
+   * @param c the character code provided by the user
+   * @return true if it is in the set
+   */
+  bool isEscaped(wchar_t const c) const;
+
+  /**
+   * Read text from stream (analysis version, also used in postgeneration)
+   * @param input the stream to read
+   * @return the next symbol in the stream
+   */
+  int readAnalysis(FILE *input);
+
+  /**
+   * Read text from stream (generation version, also used in generation)
+   * @param input the stream to read
+   * @return the next symbol in the stream
+   */
+  int readDecomposition(FILE *input, FILE *output);
+
+  /**
+   * Read text from stream (postgeneration version)
+   * @param input the stream to read
+   * @return the next symbol in the stream
+   */
+  int readPostgeneration(FILE *input);
+
+  /**
+   * Read text from stream (generation version)
+   * @param input the stream to read
+   * @return the next symbol in the stream
+   */
+  int readGeneration(FILE *input, FILE *output);
+
+  /**
+   * Read text from stream (biltrans version)
+   * @param input the stream to read
+   * @return the queue of 0-symbols, and the next symbol in the stream
+   */
+  pair<wstring, int> readBilingual(FILE *input, FILE *output);
+
+  /**
+   * Read text from stream (SAO version)
+   * @param input the stream to read
+   * @return the next symbol in the stream
+   */
+  int readSAO(FILE *input);
+
+  /**
+   * Flush all the blanks remaining in the current process
+   * @param output stream to write blanks
+   */
+  void flushBlanks(FILE *output);
+
+  /**
+   * Calculate the initial state of parsing
+   */
+  void calcInitial();
+
+  /**
+   * Calculate all the results of the word being parsed
+   */
+  void classifyFinals();
+
+  /**
+   * Write a string to an output stream,
+   * @param str the string to write, escaping characters
+   * @param output the stream to write in
+   */
+  void writeEscaped(wstring const &str, FILE *output);
+
+
+  /**
+   * Write a string to an output stream, escaping all escapable characters
+   * but keeping symbols without escaping
+   * @param str the string to write, escaping characters
+   * @param output the stream to write in
+   */
+  void writeEscapedWithTags(wstring const &str, FILE *output);
+
+
+  /**
+   * Checks if an string ends with a particular suffix
+   * @param str the string to test
+   * @param the searched suffix
+   * @returns true if 'str' has the suffix 'suffix'
+   */
+  static bool endsWith(wstring const &str, wstring const &suffix);
+
+  /**
+   * Prints a word
+   * @param sf surface form of the word
+   * @param lf lexical form of the word
+   * @param output stream where the word is written
+   */
+  void printWord(wstring const &sf, wstring const &lf, FILE *output);
+
+  /**
+   * Prints a word (Bilingual version)
+   * @param sf surface form of the word
+   * @param lf lexical form of the word
+   * @param output stream where the word is written
+   */
+  void printWordBilingual(wstring const &sf, wstring const &lf, FILE *output);
+
+
+  /**
+   * Prints a word, SAO version
+   * @param lf lexical form
+   * @param output stream where the word is written
+   */
+  void printSAOWord(wstring const &lf, FILE *output);
+
+  /**
+   * Prints an unknown word
+   * @param sf surface form of the word
+   * @param output stream where the word is written
+   */
+  void printUnknownWord(wstring const &sf, FILE *output);
+
+  void initDecompositionSymbols();
+
+  vector<wstring> numbers;
+  int readTMAnalysis(FILE *input);
+
+  unsigned int lastBlank(wstring const &str);
+  void printSpace(wchar_t const val, FILE *output);
+  void skipUntil(FILE *input, FILE *output, wint_t const character);
+  static wstring removeTags(wstring const &str);
+  wstring compoundAnalysis(wstring str, bool uppercase, bool firstupper);
+  size_t firstNotAlpha(wstring const &sf);
+
+  void analysis_wrapper_null_flush(FILE *input, FILE *output);
+  void bilingual_wrapper_null_flush(FILE *input, FILE *output);
+  void generation_wrapper_null_flush(FILE *input, FILE *output,
+                                     GenerationMode mode);
+  void postgeneration_wrapper_null_flush(FILE *input, FILE *output);
+  void transliteration_wrapper_null_flush(FILE *input, FILE *output);
+
+  wstring compose(wstring const &lexforms, wstring const &queue) const;
+
+  bool isLastBlankTM;
+public:
+  FSTProcessor();
+  ~FSTProcessor();
+
+  void initAnalysis();
+  void initTMAnalysis();
+  void initSAO(){initAnalysis();};
+  void initGeneration();
+  void initPostgeneration();
+  void initBiltrans();
+  void initDecomposition();
+
+  void analysis(FILE *input = stdin, FILE *output = stdout);
+  void tm_analysis(FILE *input = stdin, FILE *output = stdout);
+  void generation(FILE *input = stdin, FILE *output = stdout, GenerationMode mode = gm_unknown);
+  void postgeneration(FILE *input = stdin, FILE *output = stdout);
+  void transliteration(FILE *input = stdin, FILE *output = stdout);
+  void decomposition(FILE *input = stdin, FILE *output = stdout);
+  wstring biltrans(wstring const &input_word, bool with_delim = true);
+  wstring biltransfull(wstring const &input_word, bool with_delim = true);
+  void bilingual(FILE *input = stdin, FILE *output = stdout);
+  pair<wstring, int> biltransWithQueue(wstring const &input_word, bool with_delim = true);
+  wstring biltransWithoutQueue(wstring const &input_word, bool with_delim = true);
+  void SAO(FILE *input = stdin, FILE *output = stdout);
+
+  void load(FILE *input);
+
+  bool valid() const;
+
+  void setCaseSensitiveMode(bool const value);
+  void setDictionaryCaseMode(bool const value);
+  void setBiltransSurfaceForms(bool const value);
+  void setNullFlush(bool const value);
+  bool getNullFlush();
+  bool getDecompoundingMode();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/transducer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/transducer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/transducer.h	(revision 70339)
@@ -0,0 +1,356 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSDUCTOR_
+#define _TRANSDUCTOR_
+
+#include <cstdio>
+#include <map>
+#include <set>
+
+#include <lttoolbox/alphabet.h>
+
+using namespace std;
+
+class MatchExe;
+
+/**
+ * Class to represent a letter transducer during the dictionary compilation
+ */
+class Transducer
+{
+private:
+  friend class MatchExe;
+
+  /**
+   * Initial state
+   */
+  int initial;
+
+  /**
+   * Final state set
+   */
+  set<int> finals;
+
+  /**
+   * Transitions of the transducer
+   */
+  map<int, multimap<int, int> > transitions;
+
+  /**
+   * New state creator
+   * @return the new state number
+   */
+  int newState();
+
+  /**
+   * Test if the intersection of two sets is empty
+   * @param s1 first set
+   * @param s2 second set
+   * @return true if the intersection is empty
+   */
+  static bool isEmptyIntersection(set<int> const &s1, set<int> const &s2);
+
+  /**
+   * Copy function
+   * @param t the transducer to be copied
+   */
+  void copy(Transducer const &t);
+
+  /**
+   * Empty transducer
+   */
+  void destroy();
+public:
+
+  /**
+   * Constructor
+   */
+  Transducer();
+
+  /**
+   * Destructor
+   */
+  ~Transducer();
+
+  /**
+   * Copy constructor
+   * @param t transducer to be copied
+   */
+  Transducer(Transducer const &t);
+
+  /**
+   * Assignment operator
+   * @param t transducer to be assigned
+   * @return the object result of the assignment
+   */
+  Transducer & operator =(Transducer const &t);
+
+  /**
+   * Insertion of a single transduction, creating a new target state
+   * if needed
+   * @param tag the tag of the transduction being inserted
+   * @param source the source state of the new transduction
+   * @return the target state
+   */
+  int insertSingleTransduction(int const tag, int const source);
+
+  /**
+   * Insertion of a single transduction, forcing create a new target
+   * state
+   * @param tag the tag of the transduction being inserted
+   * @param source the source state of the new transduction
+   * @return the target state
+   */
+  int insertNewSingleTransduction(int const tag, int const source);
+
+  /**
+   * Insertion of a transducer in a given source state, unifying their
+   * final states using a optionally given epsilon tag
+   * @param source the source state
+   * @param t the transducer being inserted
+   * @param epsilon_tag the epsilon tag
+   * @return the new target state
+   */
+  int insertTransducer(int const source, Transducer &t,
+		       int const epsilon_tag = 0);
+
+  /**
+   * Link two existing states by a transduction
+   * @param source the source state
+   * @param target the target state
+   * @param tag the tag of the transduction
+   */
+  void linkStates(int const source, int const target, int const tag);
+
+  /**
+   * Test if the state is a final state
+   * @param state the state
+   * @return true if is a final state
+   */
+  bool isFinal(int const state) const;
+
+  /**
+   * Test if a pattern is recognised by the FST
+   * @param a widestring of the pattern to be recognised
+   * @return true if the pattern is recognised by the transducer
+   */
+  bool recognise(wstring patro, Alphabet &a, FILE *err = stderr);
+
+  /**
+   * Set the state as a final or not, yes by default
+   * @param state the state
+   * @param value if true, the state is set as final state
+   */
+  void setFinal(int const state, bool value = true);
+
+  /**
+   * Returns the initial state of a transducer
+   * @return the initial state identifier
+   */
+  int getInitial() const;
+
+  /**
+   * Returns the epsilon closure of a given state
+   * @param state the state
+   * @param epsilon_tag the tag to take as epsilon
+   * @return the epsilon-connected states
+   */
+  set<int> closure(int const state, int const epsilon_tag = 0);
+
+  /**
+   * Join all finals in one using epsilon transductions
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void joinFinals(int const epsilon_tag = 0);
+
+  /**
+   * Reverse all the transductions of a transducer
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void reverse(int const epsilon_tag = 0);
+
+  /**
+   * Print all the transductions of a transducer in ATT format
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void show(Alphabet const &a, FILE *output = stdout, int const epsilon_tag = 0) const;
+
+  /**
+   * Determinize the transducer
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void determinize(int const epsilon_tag = 0);
+
+  /**
+   * Minimize = reverse + determinize + reverse + determinize
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void minimize(int const epsilon_tag = 0);
+
+
+  /**
+   * Make a transducer optional (link initial state with final states with
+   * empty transductions)
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void optional(int const epsilon_tag = 0);
+
+  /**
+   * Make a transducer cyclic (link final states with initial state with
+   * empty transductions)
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void oneOrMore(int const epsilon_tag = 0);
+
+  /**
+   * zeroOrMore = oneOrMore + optional
+   * @param epsilon_tag the tag to take as epsilon
+   */
+  void zeroOrMore(int const epsilon_tag = 0);
+
+  /**
+   * Clear transducer
+   */
+  void clear();
+
+  /**
+   * Check if the transducer is empty
+   * @return true if the transducer is empty
+   */
+  bool isEmpty() const;
+
+  /**
+   * Check if the transducer has no final state(s)
+   * @return true if the set of final states is empty
+   */
+  bool hasNoFinals() const;
+
+  /**
+   * Returns the number of states of the transducer
+   * @return the number of states
+   */
+  int size() const;
+
+  /**
+   * Returns the number of transitions of the transducer
+   * @return the number of transitions
+   */
+  int numberOfTransitions() const;
+
+  /**
+   * Checks if a state is empty (not outgoing transductions)
+   * @param state the state to check
+   * @return true if the state is empty
+   */
+  bool isEmpty(int const state) const;
+
+  /**
+   * Returns the number of transitions from a given state
+   * @return the number of transitions
+   */
+  int getStateSize(int const state);
+
+  /**
+   * Write method
+   * @param output the stream to write to
+   * @param decalage offset to sum to the tags
+   */
+  void write(FILE *output, int const decalage = 0);
+
+  /**
+   * Read method
+   * @param input the stream to read from
+   * @param decalage offset to sum to the tags
+   */
+  void read(FILE *input, int const decalage = 0);
+
+  /**
+   * Insert another transducer into this, unifying source and targets.
+   * Does not minimize.
+   *
+   * @param t the transducer being inserted
+   * @param epsilon_tag the epsilon tag
+   */
+  void unionWith(Alphabet &my_a,
+    Transducer &t,
+    int const epsilon_tag = 0);
+
+  /**
+   * Converts this class into a "prefix transducer", ie. for any final
+   * state, appends a transition to itself for all of the loopback
+   * symbols (typically all tags). So if the original transducer
+   * accepts "foo<tag1>" and loopback_symbols includes <tag2>, the
+   * prefix transducer will accept "foo<tag1><tag2>" as well as
+   * "foo<tag1>".
+   *
+   * @param loopback_symbols a set of symbols of the alphabet for this class,
+   *   all of the input and output tags of which are set equal
+   * @param epsilon_tag the tag to take as epsilon
+   * @return the prefix transducer
+   */
+  Transducer appendDotStar(set<int> const &loopback_symbols,
+                           int const epsilon_tag = 0);
+
+
+  /**
+   * Turn "foo# bar<tag1><tag2>" into "foo<tag1><tag2># bar". Only
+   * regards the input (left) side, output side will be in wrong
+   * order. Used on bidixes when trimming.
+   *
+   * @param alphabet the alphabet of this transducer, also used for returned Transducer
+   * @param epsilon_tag the tag to take as epsilon
+   * @return the prefix transducer
+   */
+  Transducer moveLemqsLast(Alphabet const &alphabet,
+                           int const epsilon_tag = 0);
+  /**
+   * Helper for moveLemqsLast. Starting from a certain state, make all
+   * the tags go before the non-tags, so if " bar<tag1><tag2>" is a
+   * posible path, we get "<tag1><tag2> bar" in the returned
+   * transducer.
+   *
+   * @param start the state (in this Transducer) to start from
+   * @param group_label the label of the "#" symbol we saw
+   * @param alphabet the alphabet of this transducer
+   * @param epsilon_tag the tag to take as epsilon
+   * @return a transducer of all paths going from start, but with tags first.
+   */
+  Transducer copyWithTagsFirst(int start,
+                               int group_label,
+                               Alphabet const &alphabet,
+                               int const epsilon_tag = 0);
+
+  /**
+   * Intersects two finite-state transducers
+   *
+   * The returned transducer is not minimized! Minimization will exit
+   * with failure if there are no finals, but we might want to
+   * continue with intersecting the other sections.
+   *
+   * @param t the Transducer with which this class is intersected
+   * @param my_a the alphabet of this transducer
+   * @param t_a the alphabet of the transducer t
+   * @return the trimmed transducer
+   */
+  Transducer intersect(Transducer &t,
+                       Alphabet const &my_a,
+                       Alphabet const &t_a,
+                       int const epsilon_tag = 0);
+
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/alphabet.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/alphabet.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/alphabet.cc	(revision 70339)
@@ -0,0 +1,277 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/my_stdio.h>
+
+#include <cctype>
+#include <cstdlib>
+#include <set>
+#include <cwchar>
+#include <cwctype>
+
+#ifdef _WIN32
+#include <utf8_fwrap.hpp>
+#endif
+
+using namespace std;
+
+Alphabet::Alphabet()
+{
+  spair[pair<int, int>(0,0)] = 0;
+  spairinv.push_back(pair<int, int>(0,0));
+}
+
+Alphabet::~Alphabet()
+{
+  destroy();
+}
+
+Alphabet::Alphabet(Alphabet const &a)
+{
+  copy(a);
+}
+
+Alphabet &
+Alphabet::operator =(Alphabet const &a)
+{
+  if(this != &a)
+  { 
+    destroy();
+    copy(a);
+  }
+  return *this;
+}
+
+void
+Alphabet::destroy()
+{
+}
+
+void 
+Alphabet::copy(Alphabet const &a)
+{
+  slexic = a.slexic;
+  slexicinv = a.slexicinv;
+  spair = a.spair;
+  spairinv = a.spairinv;
+}
+
+void
+Alphabet::includeSymbol(wstring const &s)
+{
+  if(slexic.find(s) == slexic.end())
+  {
+    int slexic_size = slexic.size();
+    slexic[s] = -(slexic_size+1);
+    slexicinv.push_back(s);
+  }
+}
+
+int
+Alphabet::operator()(int const c1, int const c2)
+{
+  pair<int, int> tmp = pair<int, int>(c1, c2);
+  if(spair.find(tmp) == spair.end())
+  {
+    int spair_size = spair.size();
+    spair[tmp] = spair_size;
+    spairinv.push_back(tmp);
+  }
+  
+  return spair[tmp];
+}
+
+int
+Alphabet::operator()(wstring const &s)
+{
+  return slexic[s];
+}
+
+bool
+Alphabet::isSymbolDefined(wstring const &s)
+{
+  return slexic.find(s) != slexic.end();
+}
+
+int
+Alphabet::size() const
+{
+  return slexic.size();
+}
+
+void
+Alphabet::write(FILE *output)
+{
+  // First, we write the taglist
+  Compression::multibyte_write(slexicinv.size(), output);  // taglist size
+  for(unsigned int i = 0, limit = slexicinv.size(); i < limit; i++)
+  {
+    Compression::wstring_write(slexicinv[i].substr(1, slexicinv[i].size()-2), output);
+  }
+
+  // Then we write the list of pairs
+  // All numbers are biased + slexicinv.size() to be positive or zero
+  unsigned int bias = slexicinv.size();
+  Compression::multibyte_write(spairinv.size(), output);
+  for(unsigned int i = 0, limit = spairinv.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(spairinv[i].first + bias, output);
+    Compression::multibyte_write(spairinv[i].second + bias, output);
+  }
+}
+
+void
+Alphabet::read(FILE *input)
+{
+  Alphabet a_new;
+  a_new.spairinv.clear();
+  a_new.spair.clear();
+  
+  // Reading of taglist
+  int tam = Compression::multibyte_read(input);
+  map<int, string> tmp;
+  while(tam > 0)
+  {
+    tam--;
+    wstring mytag = L"<" + Compression::wstring_read(input) + L">";
+    a_new.slexicinv.push_back(mytag);
+    a_new.slexic[mytag]= -a_new.slexicinv.size();
+  }
+
+  // Reading of pairlist
+  unsigned int bias = a_new.slexicinv.size();
+  tam = Compression::multibyte_read(input);
+  while(tam > 0)
+  {
+    tam--;
+    int first = Compression::multibyte_read(input);
+    int second = Compression::multibyte_read(input);
+    pair<int, int> tmp(first - bias, second - bias);
+	int spair_size = a_new.spair.size();
+    a_new.spair[tmp] = spair_size;
+    a_new.spairinv.push_back(tmp);
+  }
+  
+  *this = a_new;
+}
+
+void
+Alphabet::writeSymbol(int const symbol, FILE *output) const
+{
+  if(symbol < 0)
+  {
+    fputws_unlocked(slexicinv[-symbol-1].c_str(), output);
+  }
+  else
+  {
+    fputwc_unlocked(static_cast<wchar_t>(symbol), output);
+  }
+}
+
+void
+Alphabet::getSymbol(wstring &result, int const symbol, bool uppercase) const
+{
+  if(symbol == 0)
+  {
+    return;
+  }
+  
+  if(!uppercase)
+  {
+    if(symbol >= 0)
+    {
+      result += static_cast<wchar_t>(symbol);
+    }
+    else
+    {
+      result.append(slexicinv[-symbol-1]);
+    }
+  }
+  else if(symbol >= 0)
+  {
+    result += static_cast<wchar_t>(towupper(static_cast<wint_t>(symbol)));
+  }
+  else
+  {
+    result.append(slexicinv[-symbol-1]);
+  }
+}
+
+bool
+Alphabet::isTag(int const symbol) const
+{
+  return symbol < 0;
+}
+
+pair<int, int> const &
+Alphabet::decode(int const code) const
+{
+  return spairinv[code];
+}
+
+void Alphabet::setSymbol(int symbol, wstring newSymbolString) {
+  //Should be a special character!
+  if (symbol < 0) slexicinv[-symbol-1] = newSymbolString;
+}
+
+void
+Alphabet::createLoopbackSymbols(set<int> &symbols, Alphabet &basis, Side s, bool nonTagsToo)
+{
+  // Non-tag letters get the same int in spairinv across alphabets,
+  // but tags may differ, so do those separately afterwards.
+  set<int> tags;
+  for(vector<pair<int, int> >::iterator it = basis.spairinv.begin(),
+                                        limit = basis.spairinv.end();
+      it != limit;
+      it++)
+  {
+    if(s == left) {
+      if(basis.isTag(it->first)) 
+      {
+        tags.insert(it->first);
+      }
+      else if(nonTagsToo)
+      {
+        symbols.insert(operator()(it->first, it->first));
+      }
+    }
+    else {
+      if(basis.isTag(it->second)) 
+      {
+        tags.insert(it->second);
+      }
+      else if(nonTagsToo)
+      {
+        symbols.insert(operator()(it->second, it->second));
+      }
+    }
+  }
+  for(map<wstring, int, Ltstr>::iterator it = basis.slexic.begin(),
+                                         limit = basis.slexic.end();
+      it != limit;
+      it++)
+  {
+    // Only include tags that were actually seen on the correct side
+    if(tags.find(it->second) != tags.end()) 
+    {
+      includeSymbol(it->first);
+      symbols.insert(operator()(operator()(it->first),
+                                operator()(it->first)));
+    }
+  }
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/alphabet.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/alphabet.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/alphabet.h	(revision 70339)
@@ -0,0 +1,192 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _ALPHABET_
+#define _ALPHABET_
+
+#include <cstdio>
+#include <list>
+#include <map>
+#include <set>
+#include <vector>
+
+#include <lttoolbox/ltstr.h>
+
+using namespace std;
+
+/**
+ * Alphabet class.
+ * Encodes pairs of symbols into an integer.
+ */
+class Alphabet
+{
+private:
+  /**
+   * Symbol-identifier relationship. Only contains <tags>.
+   * @see slexicinv
+   */
+  map<wstring, int, Ltstr> slexic;  
+
+  /**
+   * Identifier-symbol relationship. Only contains <tags>.
+   * @see slexic
+   */
+  vector<wstring> slexicinv;
+
+
+  /**
+   * Map from symbol-pairs to symbols; tags get negative numbers,
+   * other characters are wchar_t's casted to ints.
+   * @see spairinv
+   */
+  map<pair<int,int>, int> spair;
+
+  /**
+   * All symbol-pairs (both <tags> and letters).
+   * @see spair
+   */
+  vector<pair<int, int> > spairinv;
+  
+
+  void copy(Alphabet const &a);
+  void destroy();
+
+public:
+
+  /**
+   * Constructor.
+   */
+  Alphabet();
+  
+  /**
+   * Destructor.
+   */
+  ~Alphabet();
+  
+  /**
+   * Copy constructor.
+   */
+  Alphabet(Alphabet const &a);
+  
+  /**
+   * Assign operator.
+   */
+  Alphabet & operator = (Alphabet const &a);
+
+  /**
+   * Include a symbol into the alphabet.
+   */
+  void includeSymbol(wstring const &s);  
+
+  /**
+   * Get an unique code for every symbol pair.  This flavour is for
+   * character pairs. Creates the code if it does not already exist.
+   * @param c1 left symbol.
+   * @param c2 right symbol.
+   * @return code for (c1, c2).
+   */
+  int operator()(int const c1, int const c2);
+  
+  /**
+   * Gets the individual symbol identifier. Assumes it already exists!
+   * @see isSymbolDefined to check if it exists first.
+   * @param s symbol to be identified.
+   * @return symbol identifier.
+   */
+  int operator()(wstring const &s);
+
+  /**
+   * Check wether the symbol is defined in the alphabet.
+   * @param s symbol
+   * @return true if defined
+   */
+  bool isSymbolDefined(wstring const &s);
+
+  /**
+   * Returns the size of the alphabet (number of symbols).
+   * @return number of symbols.
+   */
+  int size() const;
+
+  /**
+   * Write method.
+   * @param output output stream.
+   */
+  void write(FILE *output);
+  
+  /**
+   * Read method.
+   * @param input input stream.
+   */
+  void read(FILE *input);
+
+  /**
+   * Write a symbol enclosed by angle brackets in the output stream.
+   * @param symbol symbol code.
+   * @param output output stream.
+   */
+  void writeSymbol(int const symbol, FILE *output) const;
+  
+  /**
+   * Concat a symbol in the string that is passed by reference.
+   * @param result string where the symbol should be concatenated
+   * @param symbol code of the symbol
+   * @param uppercase true if we want an uppercase symbol
+   */  
+  void getSymbol(wstring &result, int const symbol, 
+		 bool uppercase = false) const;
+		 
+  /**
+   * Checks whether a symbol is a tag or not.
+   * @param symbol the code of the symbol
+   * @return true if the symbol is a tag
+   */
+  bool isTag(int const symbol) const;
+
+  /**
+   * Sets an already existing symbol to represent a new value.
+   * @param symbol the code of the symbol to set
+   * @param newSymbolString the new string for this symbol
+   */
+  void setSymbol(int symbol, wstring newSymbolString);
+
+  /**
+   * Note: both the symbol int and int-pair are specific to this alphabet instance.
+   * @see operator() to go from general wstrings to alphabet-specific ints.
+   * @param code a symbol
+   * @return the pair which code represents in this alphabet
+   */
+  pair<int, int> const & decode(int const code) const;
+
+  enum Side
+  {
+    left,
+    right
+  };
+
+  /**
+   * For every symbol a:b in basis, create a pair of the form b:b (or
+   * a:a if s==left), inserting the symbol into symbols, and ensuring
+   * it exists in this alphabet.
+   * @param basis use the symbols from this alphabet
+   * @param symbols all the loopback symbols, referenced with this alphabet
+   * @param s whether to loopback on the left or right side of the symbol-pair
+   * @param nonTagsToo by default only tags are included, but if this is true we include all symbols
+   */
+  void createLoopbackSymbols(set<int> &symbols, Alphabet &basis, Side s = right, bool nonTagsToo = false);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/att_compiler.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/att_compiler.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/att_compiler.h	(revision 70339)
@@ -0,0 +1,211 @@
+/*
+ * Copyright (C) 2013 Dávid Márk Nemeskey
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _MYATT_COMPILER_
+#define _MYATT_COMPILER_
+
+#include <string>
+#include <fstream>
+#include <sstream>
+#include <map>
+#include <set>
+#include <vector>
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/transducer.h>
+#include <lttoolbox/compression.h>
+
+#include <cstdlib>
+
+#define UNDECIDED 0
+#define WORD      1
+#define PUNCT     2
+#define BOTH      3
+
+using namespace std;
+
+/** Bitmask; 1 = WORD, 2 = PUNCT, 3 = BOTH. */
+typedef unsigned int TransducerType;
+
+namespace 
+{
+  /** Splits a string into fields. */
+  vector<wstring>& split(const wstring& s, wchar_t delim, vector<wstring> &out) 
+  {
+      wistringstream ss(s);
+      wstring item;
+      while (getline(ss, item, delim)) 
+      {
+        out.push_back(item);
+      }
+      return out;
+  }
+  
+  /** Converts a string to a number. Slow, but at this point I don't care. */
+  int convert(const wstring& s) 
+  {
+    int ret;
+    wistringstream ss(s);
+    ss >> ret;
+    return ret;
+  }
+};
+
+/**
+ * Converts transducers from AT&T text format to lt binary format.
+ *
+ * @note To ensure that the AT&T file is read correctly, set std::locale to an
+ *       appropriate value. If your current locale is compatible with the
+ *       encoding of the file, just set it by adding
+ *       <tt>std::locale::global(locale(""));</tt> to your code.
+ */
+class AttCompiler 
+{
+public:
+  /**
+   * Constructor
+   */
+  AttCompiler();
+
+  /**
+   * Destructor
+   */
+  ~AttCompiler();
+
+  /** Extracts the sub-transducer made of states of type @p type. */
+  Transducer extract_transducer(TransducerType type);
+
+  /**
+   * Recursively fills @p transducer (and @p corr) -- helper method called by
+   * extract_transducer().
+   */
+  void _extract_transducer(TransducerType type, int from,
+                           Transducer& transducer, map<int, int>& corr,
+                           set<int>& visited) ;
+
+  /**
+   * Classifies the edges of the transducer graphs recursively. It works like
+   * this:
+   * - the type of the starting state is BOTH (already set)
+   * - in case of an epsilon move, the type of the target state is the same as
+   *   that of the source
+   * - the first non-epsilon transition determines the type of the whole path
+   * - it is also the time from which we begin filling the @p visited set.
+   *
+   * @param from the id of the source state.
+   * @param visited the ids of states visited by this path.
+   * @param path are we in a path?
+   */
+  void classify(int from, map<int, TransducerType>& visited, bool path,
+                TransducerType type) ;
+
+
+
+  /**
+   * Reads the AT&T format file @p file_name. The transducer and the alphabet
+   * are both cleared before reading the new file.
+   */
+  void parse(string const &file_name, wstring const &dir);
+
+  /** Writes the transducer to @p file_name in lt binary format. */
+
+  void write(FILE *fd) ;
+
+private:
+
+  /** The final state(s). */
+  set<int> finals;
+  /**
+   * Id of the starting state. We assume it is the source state of the first
+   * transduction in the file.
+   */
+  int starting_state;
+
+  Alphabet alphabet;
+  /** All non-multicharacter symbols. */
+  set<wchar_t> letters;
+
+  /** Used in AttNode. */
+  struct Transduction 
+  {
+    int            to;
+    wstring        upper;
+    wstring        lower;
+    int            tag;
+    TransducerType type;
+
+    Transduction(int to, wstring upper, wstring lower, int tag,
+                 TransducerType type=UNDECIDED) :
+      to(to), upper(upper), lower(lower), tag(tag), type(type) {}
+  };
+
+  /** A node in the transducer graph. */
+  struct AttNode 
+  {
+    int                  id;
+    vector<Transduction> transductions;
+
+    AttNode(int id) : id(id) {}
+  };
+
+  /** Stores the transducer graph. */
+  map<int, AttNode*> graph;
+
+  /** Clears the data associated with the current transducer. */
+  void clear();
+
+  /**
+   * Returns the Node that represents the state @id. If it does not exist,
+   * creates it and inserts it into @c graph.
+   */
+
+  AttNode* get_node(int id)
+  {
+    AttNode* state;
+  
+    if (graph.find(id) != graph.end())
+    {
+      state = graph[id];
+    }
+    else
+    {
+      state = new AttNode(id);
+      graph[id] = state;
+    }
+    return state;
+  }
+
+
+  /** 
+   * Converts symbols like @0@ to epsilon, @_SPACE_@ to space, etc.
+   * @todo Are there other special symbols? If so, add them, and maybe use a map
+   *       for conversion?
+   */
+  void convert_hfst(wstring& symbol);
+
+  /**
+   * Returns the code of the symbol in the alphabet. Run after convert_hfst has
+   * run.
+   *
+   * Also adds all non-multicharacter symbols (letters) to the @p letters set.
+   *
+   * @return the code of the symbol, if @p symbol is multichar; its first (and
+   *         only) character otherwise.
+   */
+  int symbol_code(const wstring& symbol);
+};
+
+#endif /* _MYATT_COMPILER_ */
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compiler.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compiler.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compiler.h	(revision 70339)
@@ -0,0 +1,367 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _MYCOMPILER_
+#define _MYCOMPILER_
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/regexp_compiler.h>
+#include <lttoolbox/entry_token.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/transducer.h>
+
+#include <map>
+#include <string>
+#include <set>
+#include <libxml/xmlreader.h>
+
+using namespace std;
+
+/**
+ * A compiler of dictionaries to letter transducers
+ */
+class Compiler
+{
+private:
+  /**
+   * The libxml2's XML reader
+   */
+  xmlTextReaderPtr reader;
+  
+  /**
+   * The alt value
+   */
+  wstring alt;
+
+  /**
+   * The variant value (monodix)
+   */
+  wstring variant;
+  
+  /**
+   * The variant value (left side of bidix)
+   */
+  wstring variant_left;
+  
+  /**
+   * The variant value (right side of bidix)
+   */
+  wstring variant_right;
+    
+  /**
+   * The paradigm being compiled
+   */
+  wstring current_paradigm;
+  
+  /**
+   * The dictionary section being compiled
+   */
+  wstring current_section;
+  
+  /**
+   * The direction of the compilation, 'lr' (left-to-right) or 'rl'
+   * (right-to-left)
+   */
+  wstring direction;
+  
+  /**
+   * List of characters to be considered alphabetic
+   */
+  wstring letters;
+  
+  /**
+   * Set verbose mode: warnings which may or may not be correct
+   */
+  bool verbose;
+
+  /**
+   * First element (of an entry)
+   */
+  bool first_element;
+
+  /**
+   * Identifier of all the symbols during the compilation
+   */
+  Alphabet alphabet;  
+  
+  /**
+   * List of named transducers-paradigms
+   */
+  map<wstring, Transducer, Ltstr> paradigms;
+  
+  /**
+   * List of named dictionary sections
+   */
+  map<wstring, Transducer, Ltstr> sections;
+  
+  /**
+   * List of named prefix copy of a paradigm
+   */
+  map<wstring, map<wstring, int, Ltstr>, Ltstr> prefix_paradigms;
+  
+  /**
+   * List of named suffix copy of a paradigm
+   */
+  map<wstring, map<wstring, int, Ltstr>, Ltstr> suffix_paradigms;
+
+  /**
+   * List of named endings of a suffix copy of a paradgim
+   */
+  map<wstring, map<wstring, int, Ltstr>, Ltstr> postsuffix_paradigms;
+
+  /**
+   * Mapping of aliases of characters specified in ACX files
+   */
+  map<int, set<int> > acx_map;
+  
+  /**
+   * Original char being mapped
+   */
+  int acx_current_char; 
+
+  /*    
+  static string range(char const a, char const b);
+  string readAlphabet();
+  */
+
+  /**
+   * Method to parse an XML Node
+   */
+  void procNode();
+
+  /**
+   * Method to parse an XML Node in ACX files
+   */
+  void procNodeACX();
+
+
+  /**
+   * Parse the &lt;alphabet&gt; element
+   */
+  void procAlphabet();
+
+  /**
+   * Parse the &lt;sdef&lt; element
+   */
+  void procSDef();
+
+  /**
+   * Parse the &lt;pardef&gt; element
+   */
+  void procParDef();
+  
+  /**
+   * Parse the &lt;e&gt; element
+   */
+  void procEntry();
+
+  /**
+   * Parse the &lt;re&gt; element
+   * @return a list of tokens from the dictionary's entry
+   */
+  EntryToken procRegexp();
+
+  /**
+   * Parse the &lt;section&gt; element
+   */
+  void procSection();
+
+  /**
+   * Gets an attribute value with their name and the current context
+   * @param name the name of the attribute
+   * @return the value of the attribute
+   */
+  wstring attrib(wstring const &name);
+
+  /**
+   * Construct symbol pairs by align left side of both parts and insert
+   * them into a transducer
+   * @param lp left part of the transduction
+   * @param rp right part of the transduction
+   * @param state the state from wich insert the new transduction
+   * @param t the transducer
+   * @return the last state of the inserted transduction
+   */
+  int matchTransduction(list<int> const &lp, list<int> const &rp,
+			    int state, Transducer &t);
+  /**
+   * Parse the &lt;p&lt; element
+   * @return a list of tokens from the dictionary's entry
+   */
+  EntryToken procTransduction();
+
+  /**
+   * Parse the &lt;i&lt; element
+   * @return a list of tokens from the dictionary's entry
+   */
+  EntryToken procIdentity();
+
+  /**
+   * Parse the &lt;par&gt; element
+   * @return a list of tokens from the dictionary's entry
+   */
+  EntryToken procPar();
+
+  /**
+   * Insert a list of tokens into the paradigm / section being processed
+   * @param elements the list
+   */
+  void insertEntryTokens(vector<EntryToken> const &elements);
+
+  /**
+   * Skip all document #text nodes before "elem"
+   * @param name the name of the node
+   * @param elem the name of the expected node
+   */
+  void skip(wstring &name, wstring const &elem);
+
+  /**
+   * Skip all document #text nodes before "elem"
+   * @param name the name of the node
+   * @param elem the name of the expected node
+   * @param open true for open element, false for closed
+   */
+  void skip(wstring &name, wstring const &elem, bool open);
+
+  /**
+   * Skip all blank #text nodes before "name"
+   * @param name the name of the node
+   */
+  void skipBlanks(wstring &name);
+  
+  
+  void readString(list<int> &result, wstring const &name);
+  
+  /**
+   * Force an element to be empty, and check for it
+   * @param name the element 
+   */
+  void requireEmptyError(wstring const &name);
+
+  /**
+   * Force an attribute to be specified, amd check for it
+   * @param value the value of the attribute
+   * @param attrname the name of the attribute
+   * @param elemname the parent of the attribute
+   */
+  void requireAttribute(wstring const &value, wstring const &attrname,
+                        wstring const &elemname);
+
+  /**
+   * True if all the elements in the current node are blanks
+   * @return true if all are blanks
+   */
+  bool allBlanks();
+
+public:
+
+  /*
+   * Constants to represent the element and the attributes of
+   * dictionaries
+   */
+  static wstring const COMPILER_DICTIONARY_ELEM;
+  static wstring const COMPILER_ALPHABET_ELEM;
+  static wstring const COMPILER_SDEFS_ELEM;
+  static wstring const COMPILER_SDEF_ELEM;
+  static wstring const COMPILER_N_ATTR;
+  static wstring const COMPILER_PARDEFS_ELEM;
+  static wstring const COMPILER_PARDEF_ELEM;
+  static wstring const COMPILER_PAR_ELEM;
+  static wstring const COMPILER_ENTRY_ELEM;
+  static wstring const COMPILER_RESTRICTION_ATTR;
+  static wstring const COMPILER_RESTRICTION_LR_VAL;
+  static wstring const COMPILER_RESTRICTION_RL_VAL;
+  static wstring const COMPILER_PAIR_ELEM;
+  static wstring const COMPILER_LEFT_ELEM;
+  static wstring const COMPILER_RIGHT_ELEM;
+  static wstring const COMPILER_S_ELEM;
+  static wstring const COMPILER_REGEXP_ELEM;
+  static wstring const COMPILER_SECTION_ELEM;
+  static wstring const COMPILER_ID_ATTR;
+  static wstring const COMPILER_TYPE_ATTR;
+  static wstring const COMPILER_IDENTITY_ELEM;
+  static wstring const COMPILER_JOIN_ELEM;
+  static wstring const COMPILER_BLANK_ELEM;
+  static wstring const COMPILER_POSTGENERATOR_ELEM;
+  static wstring const COMPILER_GROUP_ELEM;
+  static wstring const COMPILER_LEMMA_ATTR;
+  static wstring const COMPILER_IGNORE_ATTR;
+  static wstring const COMPILER_IGNORE_YES_VAL;
+  static wstring const COMPILER_ALT_ATTR;
+  static wstring const COMPILER_V_ATTR;
+  static wstring const COMPILER_VL_ATTR;
+  static wstring const COMPILER_VR_ATTR;
+
+
+  /**
+   * Constructor
+   */
+  Compiler();
+
+  /**
+   * Destructor
+   */
+  ~Compiler();
+
+  /**
+   * Compile dictionary to letter transducers
+   */
+  void parse(string const &fichero, wstring const &dir);
+
+  /**
+   * Read ACX file
+   */
+  void parseACX(string const &fichero, wstring const &dir);
+
+  
+  /**
+   * Write the result of compilation 
+   * @param fd the stream where write the result
+   */
+  void write(FILE *fd);
+
+  /**
+   * Set verbose output
+   */
+  void setVerbose(bool verbosity = false);
+
+  /**
+   * Set the alt value to use in compilation
+   * @param a the value
+   */
+  void setAltValue(string const &a);
+
+  /**
+   * Set the variant value to use in compilation
+   * @param v the value
+   */
+  void setVariantValue(string const &v);
+
+  /**
+   * Set the variant_left value to use in compilation
+   * @param v the value
+   */
+  void setVariantLeftValue(string const &v);
+
+  /**
+   * Set the variant_right value to use in compilation
+   * @param v the value
+   */
+  void setVariantRightValue(string const &v);
+};
+
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compression.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compression.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/compression.h	(revision 70339)
@@ -0,0 +1,115 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _COMPRESSION_
+#define _COMPRESSION_
+
+#include <cstdio>
+#include <string>
+#include <iostream>
+
+using namespace std;
+
+/**
+ * Clase "Compression".
+ * Class methods to access compressed data by the byte-aligned method
+ */
+class Compression
+{
+private:
+  /**
+   * Writing a byte
+   * @param byte char to write.
+   * @param output output stream.
+   */
+  static void writeByte(unsigned char byte, FILE *output);
+
+  /**
+   * Readinging a byte
+   * @param input input stream
+   * @return the value of the next byte in the input
+   */
+  static unsigned char readByte(FILE *input);
+
+public:
+  /**
+   * Encodes an integer value and writes it into the output stream
+   * @see multibyte_read()
+   * @param value integer to write.
+   * @param output output stream.
+   */
+  static void multibyte_write(unsigned int value, FILE *output);
+
+  /**
+   * Encodes an integer value and writes it into the output stream
+   * @see multibyte_read()
+   * @param value integer to write.
+   * @param output output stream.
+   */
+  static void multibyte_write(unsigned int value, ostream &os);
+  
+  /**
+   * Read and decode an integer from the input stream.
+   * @see multibyte_read()
+   * @param input input stream.
+   * @return the integer value readed.
+   */
+  static unsigned int multibyte_read(FILE *input);
+
+  /**
+   * Read and decode an integer from the input stream.
+   * @see multibyte_read()
+   * @param input input stream.
+   * @return the integer value readed.
+   */
+  static unsigned int multibyte_read(istream &is);
+
+  /**
+   * This method allows to write a wide string to an output stream
+   * using its UCSencoding as integer.
+   * @see wstring_read()
+   * @param str the string to write.
+   * @param output the output stream.
+   */
+  static void wstring_write(wstring const &str, FILE *output);
+  
+  /**
+   * This method reads a wide string from the input stream.
+   * @see wstring_write()
+   * @param input the input stream.
+   * @return the wide string read.
+   */
+  static wstring wstring_read(FILE *input);
+
+  /**
+   * This method allows to write a plain string to an output stream
+   * using its UCSencoding as integer.
+   * @see string_read()
+   * @param str the string to write.
+   * @param output the output stream.
+   */
+  static void string_write(string const &str, FILE *output);
+
+  /**
+   * This method reads a plain string from the input stream.
+   * @see string_write()
+   * @param input the input stream.
+   * @return the string read.
+   */
+  static string string_read(FILE *input);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/dix.dtd	(revision 70339)
@@ -0,0 +1,138 @@
+<!--
+   Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not <http://www.gnu.org/licenses/>.
+
+      DTD for the format of dictionaries
+-->
+<!ELEMENT dictionary (alphabet?, sdefs?,
+		      pardefs?, section+)>
+	<!-- root element-->
+
+<!ELEMENT alphabet (#PCDATA)>
+	<!-- alphabetic character list -->
+	
+<!ELEMENT sdefs (sdef+)>
+	<!-- symbol definition section -->
+	
+<!ELEMENT sdef EMPTY>
+	<!-- symbol definition -->
+<!ATTLIST sdef
+	n ID #REQUIRED
+>
+	<!-- n: symbol (tag) name -->
+<!ATTLIST sdef
+        c CDATA  #IMPLIED
+>
+        <!-- c: symbol (tag) comment -->
+	
+<!ELEMENT pardefs (pardef+)>
+	<!-- paradigm definition section -->
+	
+<!ELEMENT pardef (e+)>
+	<!-- paradigm definition -->
+<!ATTLIST pardef
+	n CDATA #REQUIRED
+>
+	<!-- n: paradigm name -->
+<!ATTLIST pardef
+        c CDATA  #IMPLIED
+>
+        <!-- c: comment about paradigm -->
+
+	
+<!ELEMENT section (e+)>
+	<!-- dictionary section -->
+<!ATTLIST section
+	id ID #REQUIRED
+	type (standard|inconditional|postblank|preblank) #REQUIRED
+	
+>
+	<!-- id: dictionary section identifier -->
+	<!-- type: dictionary section type -->
+	
+<!ELEMENT e (i | p | par | re)+>
+	<!-- entry -->
+<!ATTLIST e
+	r (LR|RL) #IMPLIED
+	lm CDATA #IMPLIED
+	a CDATA #IMPLIED
+	c CDATA #IMPLIED
+	i CDATA #IMPLIED
+	slr CDATA #IMPLIED
+	srl CDATA #IMPLIED
+	alt CDATA #IMPLIED
+	v CDATA #IMPLIED
+	vl CDATA #IMPLIED
+	vr CDATA #IMPLIED
+>
+	<!-- r: restriction LR: left-to-right,
+			    RL: right-to-left -->
+	<!-- lm: lemma -->
+	<!-- a: author -->
+	<!-- c: comment -->
+	<!-- i: ignore ('yes') means ignore, otherwise it is not ignored) -->
+	<!-- slr: translation sense when translating from left to right -->
+	<!-- srl: translation sense when translating from right to left --> 
+	<!-- alt: alternative entries are omitted if not selected -->
+	<!-- v: variant sets (monodix) direction restrictions based on language variant -->
+	<!-- vl: variant left sets direction restrictions based on language variant for language on left of bidix -->
+	<!-- vr: variant right sets direction restrictions based on language variant for language on right of bidix -->
+<!ELEMENT par EMPTY>
+	<!-- reference to paradigm -->
+<!ATTLIST par
+	n CDATA #REQUIRED
+	
+>
+	<!-- n: paradigm name -->
+	
+<!ELEMENT i (#PCDATA | b | s | g | j | a)*>
+	<!-- identity -->
+	
+<!ELEMENT re (#PCDATA)>
+	<!-- regular expression identification -->
+	
+<!ELEMENT p (l, r)>
+	<!-- pair of strings -->
+	
+<!ELEMENT l (#PCDATA | a | b | g | j | s)*>
+	<!-- left part of p -->
+	
+<!ELEMENT r (#PCDATA | a | b | g | j | s)*>
+	<!-- right part of p -->
+	
+<!ELEMENT a EMPTY>
+	<!-- post-generator wake-up mark -->
+	
+<!ELEMENT b EMPTY>
+	<!-- blank chars block mark -->
+	
+<!ELEMENT g (#PCDATA | a | b | j | s)*>
+	<!-- mark special groups in lemmas -->
+<!ATTLIST g
+	i CDATA #IMPLIED
+>
+	<!-- i is used to co-index groups in the left with those -->
+	<!-- on the right of a pair -->
+	
+<!ELEMENT j EMPTY>
+	<!-- join lexical forms -->
+	
+<!ELEMENT s EMPTY>
+	<!-- reference to symbol (tag) -->
+<!ATTLIST s
+	n IDREF #REQUIRED
+	
+>
+	<!-- n: symbol (tag) name -->
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/entry_token.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/entry_token.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/entry_token.h	(revision 70339)
@@ -0,0 +1,155 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _ENTRYTOKEN_
+#define _ENTRYTOKEN_
+
+
+#include <list>
+#include <string>
+
+using namespace std;
+
+/**
+ * This is a "Compiler" helper class, to store the parts of each entry
+ * before combining it to build the transducer being "compiled".
+ */
+class EntryToken
+{
+  /**
+   * Type of tokens, inner enum.
+   */
+  enum Type {paradigm, single_transduction, regexp};
+private:
+  /**
+   * Type of this token
+   */
+  Type type;
+  
+  /**
+   * Name of the paradigm (if it is of 'paradigm' 'type')
+   */
+  wstring parName;
+  
+  /**
+   * Left side of transduction (if 'single_transduction')
+   */
+  list<int> leftSide;
+  
+  /**
+   * Right side of transduction (if 'single_transduction')
+   */
+  list<int> rightSide;
+  
+  /**
+   * Regular expression (if 'regexp')
+   */
+  wstring myregexp;
+
+  /**
+   * copy method
+   */
+  void copy(EntryToken const &e);
+  
+  /**
+   * destroy method
+   */
+  void destroy();
+public:
+
+  /**
+   * Non-parametric constructor
+   */
+  EntryToken();
+  
+  /**
+   * Destructor
+   */
+  ~EntryToken();
+  
+  /**
+   * Copy constructor
+   */
+  EntryToken(EntryToken const &e);
+  
+  /**
+   * Operator assignment
+   */
+  EntryToken & operator = (EntryToken const &e);
+  
+  /**
+   * Sets the name of the paradigm.
+   * @param np the paradigm name
+   */
+  void setParadigm(wstring const &np);
+  
+  /**
+   * Set both parts of a single transduction.
+   * @param pi left part
+   * @param pd right part
+   */
+  void setSingleTransduction(list<int> const &pi, list<int> const &pd);
+  
+  /**
+   * Set regular expression.
+   * @param r the regular expression specification.
+   */
+  void setRegexp(wstring const &r);
+  
+  /**
+   * eTest EntryToken to detect if is a paradigm.
+   * @return true if it is a paradigm.
+   */
+  bool isParadigm() const;
+  
+  /**
+   * Test EntryToken to check if it is a single transduction.
+   * @return true if it is a single transduction.
+   */
+  bool isSingleTransduction() const;
+
+  /**
+   * Test EntryToken to check if it is a single regular expression.
+   * @return true if it is a regular expression.
+   */
+  bool isRegexp() const;
+ 
+  /**
+   * Retrieve the name of the paradigm.
+   * @return the name of the paradigm.
+   */
+  wstring const & paradigmName() const;
+  
+  /**
+   * Retrieve the left part of the paradigm.
+   * @return the left part of the paradigm.
+   */
+  list<int> const & left() const;
+  
+  /**
+   * Retrieve the right part of the paradigm.
+   * @return the right part of the paradigm.
+   */
+  list<int> const & right() const;
+  
+  /**
+   * Retrieve the regular expression specification.
+   * @return the regular expression specification.
+   */
+  wstring const & regExp() const;
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_locale.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_locale.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_locale.h	(revision 70339)
@@ -0,0 +1,31 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _MYLOCALE_
+#define _MYLOCALE_
+
+#include <cstdlib>
+
+using namespace std;
+
+class LtLocale
+{
+public:
+  static void tryToSetLocale();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_tmxproc.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_tmxproc.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt_tmxproc.cc	(revision 70339)
@@ -0,0 +1,88 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/fst_processor.h>
+#include <lttoolbox/lttoolbox_config.h>
+#include <lttoolbox/my_stdio.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include <getopt.h>
+#include <iostream>
+#include <libgen.h>
+
+using namespace std;
+
+void endProgram(char *name)
+{
+  cout << basename(name) << ": process a stream with a letter transducer" << endl;
+  cout << "USAGE: " << basename(name) << " fst_file [input_file [output_file]]" << endl;
+  exit(EXIT_FAILURE);
+}
+
+void checkValidity(FSTProcessor const &fstp)
+{
+  if(!fstp.valid())
+  {
+    exit(EXIT_FAILURE);
+  }
+}
+
+int main(int argc, char *argv[])
+{
+  FILE *input = stdin, *output = stdout;
+  LtLocale::tryToSetLocale();
+  FSTProcessor fstp;
+  FILE *aux;
+  
+  switch(argc)
+  {
+    case 4:
+      output = fopen(argv[3], "w");
+      if(!output)
+      {
+        endProgram(argv[0]);
+      }
+      // follow
+    case 3:
+      input = fopen(argv[2], "r");
+      if(!input)
+      {
+        endProgram(argv[0]);
+      }
+      // follow
+    case 2:
+      aux = fopen(argv[1], "r");
+      if(!aux)
+      {
+        endProgram(argv[0]);
+      }
+      fstp.load(aux);
+      fclose(aux);
+      break;
+    default:
+      endProgram(argv[0]);
+      break;
+  }
+    
+  fstp.initTMAnalysis(); 
+  checkValidity(fstp);
+  fstp.tm_analysis(input, output);
+
+  fclose(input);
+  fclose(output); 
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/ltstr.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/ltstr.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/ltstr.h	(revision 70339)
@@ -0,0 +1,49 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _Ltstr_
+#define _Ltstr_
+
+#include <string>
+#include <cwchar>
+#include <cstring>
+
+using namespace std;
+
+struct Ltstr
+{
+  bool operator()(string const &s1, string const &s2) const
+  {
+    return strcmp(s1.c_str(), s2.c_str()) < 0;
+  }
+
+  bool operator()(wchar_t const *s1, wchar_t const *s2) const
+  {
+    return wcscmp(s1, s2) < 0;
+  }
+
+  bool operator()(char const *s1, char const *s2) const
+  {
+    return strcmp(s1, s2) < 0;
+  }
+
+  bool operator()(wstring const &s1, wstring const &s2) const
+  {
+    return wcscmp(s1.c_str(), s2.c_str()) < 0;
+  }
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_exe.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_exe.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_exe.h	(revision 70339)
@@ -0,0 +1,109 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+	
+#ifndef _MATCHEXE_
+#define _MATCHEXE_
+
+#include <cstdio>
+#include <cstdlib>
+#include <map>
+#include <set>
+#include <vector>
+
+#include <lttoolbox/match_node.h>
+#include <lttoolbox/transducer.h>
+
+using namespace std;
+
+/**
+ * Matcher class for execution of lexical recognizing algorithms
+ */
+class MatchExe
+{
+private:
+  /**
+   * Initial state
+   */
+  int initial_id;
+
+  /**
+   * MatchNode list
+   */
+  vector<MatchNode> node_list;
+
+  /**
+   * Set of final nodes
+   */
+  map<MatchNode *, int> finals;
+
+  /**
+   * Copy function
+   * @param te the transducer to be copied
+   */
+  void copy(MatchExe const &te);
+
+  /**
+   * Destroy function
+   */
+  void destroy();
+
+public:
+  
+  /**
+   * Constructor
+   */
+  MatchExe();
+
+  /**
+   * From transducer constructor
+   * @param t the transducer
+   * @param final_type the final types
+   */
+   MatchExe(Transducer const &t, map<int, int> const &final_type);
+
+  /**
+   * Destructor
+   */
+  ~MatchExe();
+
+  /**
+   * Copy constructor
+   * @param te the transducer to be copied
+   */
+  MatchExe(MatchExe const &te);
+
+  /**
+   * Assignment operator
+   * @param te the transducer to be assigned
+   * @return the assigned object
+   */
+  MatchExe & operator =(MatchExe const &te);
+
+  /**
+   * Gets the initial node of the transducer
+   * @return the initial node
+   */
+  MatchNode * getInitial();
+
+  /**
+   * Gets the set of final nodes
+   * @return the set of final nodes
+   */
+  map<MatchNode *, int> & getFinals();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_node.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_node.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_node.cc	(revision 70339)
@@ -0,0 +1,62 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/match_node.h>
+
+MatchNode::MatchNode(int const svsize) :
+transitions(svsize)
+{
+}
+ 
+MatchNode::~MatchNode()
+{
+  destroy();
+}
+
+MatchNode::MatchNode(MatchNode const &n) :
+transitions(1)
+{
+  copy(n);  
+}
+
+MatchNode &
+MatchNode::operator =(MatchNode const &n)
+{
+  if(this != &n)
+  {
+    destroy();
+    copy(n);
+  }
+  return *this; 
+}
+
+void
+MatchNode::copy(MatchNode const &n)
+{
+  transitions = n.transitions;  
+}
+
+void
+MatchNode::destroy()
+{
+}
+
+void
+MatchNode::addTransition(int const i, MatchNode * const d, int pos)
+{
+//  transitions[i] = d;
+  transitions.add(i, d, pos);
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_node.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_node.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/match_node.h	(revision 70339)
@@ -0,0 +1,94 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _MATCHNODE_
+#define _MATCHNODE_
+
+#include <cstdlib>
+#include <list>
+#include <map>
+#include <lttoolbox/sorted_vector.h>
+
+class MatchState;
+
+using namespace std;
+
+//class MatchNode;
+//typedef map<int, MatchNode *> MNode;
+
+typedef SortedVector MNode;
+
+/**
+ * Node class of TransExe.  State is a friend class since the
+ * algorithms are implemented in MatchState
+ */
+class MatchNode
+{
+private:
+  friend class MatchState;
+  
+  /**
+   * The outgoing transitions from this node. 
+   * Schema: (input symbol, destination)
+   */
+  MNode transitions;
+
+  /**
+   * Copy method
+   * @param n the node to be copied
+   */
+  void copy(MatchNode const &n);
+
+  /**
+   * Destroy method
+   */
+  void destroy();
+
+public:
+
+  /**
+   * Constructor
+   */
+  MatchNode(int const svsize);
+
+  /**
+   * Destructor
+   */
+  ~MatchNode();
+
+  /**
+   * Copy constructor 
+   * @param n the node to be copied
+   */
+  MatchNode(MatchNode const &n);
+
+  /**
+   * Assignment operator
+   * @param n the node to be assigned
+   * @return the assigned object
+   */
+  MatchNode & operator=(MatchNode const &n);
+
+  /**
+   * Making a link between this node and another
+   * @param i input symbol
+   * @param d destination
+   */
+  void addTransition(int const i, MatchNode * const d, int pos);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/my_stdio.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/my_stdio.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/my_stdio.h	(revision 70339)
@@ -0,0 +1,63 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+// cstdio wrapper for backwards compatibility
+
+#ifndef _IOHEADER_
+#define _IOHEADER_
+
+#include <cstdio>
+
+// Check individually all '_unlocked' functions because using
+// g++-2.95 fgetc_unlocked and fputc_unlocked compile perfectly but
+// fputs_unlocked is not defined in their C headers.
+
+#if !HAVE_DECL_FPUTS_UNLOCKED
+#define fputs_unlocked fputs
+#endif
+
+#if !HAVE_DECL_FGETC_UNLOCKED 
+#define fgetc_unlocked fgetc
+#endif
+
+#if !HAVE_DECL_FPUTC_UNLOCKED
+#define fputc_unlocked fputc
+#endif
+
+#if !HAVE_DECL_FWRITE_UNLOCKED
+#define fwrite_unlocked fwrite
+#endif
+
+#if !HAVE_DECL_FREAD_UNLOCKED
+#define fread_unlocked fread
+#endif
+
+#if !HAVE_DECL_FGETWC_UNLOCKED
+#define fgetwc_unlocked fgetwc
+#endif
+
+#if !HAVE_DECL_FPUTWC_UNLOCKED
+#define fputwc_unlocked fputwc
+#endif
+
+#if !HAVE_DECL_FPUTWS_UNLOCKED
+#define fputws_unlocked fputws
+#endif
+
+
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/node.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/node.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/node.cc	(revision 70339)
@@ -0,0 +1,79 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/node.h>
+
+Node::Node()
+{
+}
+
+Node::~Node()
+{
+  destroy();
+}
+
+Node::Node(Node const &n)
+{
+  copy(n);  
+}
+
+Node &
+Node::operator =(Node const &n)
+{
+  if(this != &n)
+  {
+    destroy();
+    copy(n);
+  }
+  return *this; 
+}
+
+void
+Node::copy(Node const &n)
+{
+  transitions = n.transitions;  
+}
+
+void
+Node::destroy()
+{
+}
+
+void
+Node::addTransition(int const i, int const o, Node * const d)
+{
+  Dest &aux = transitions[i];
+  aux.size++;
+  int *out_tag = new int[aux.size];
+  Node **dest = new Node*[aux.size];
+ 
+  for(int i = 0; i<aux.size-1; i++)
+  {
+    out_tag[i] = aux.out_tag[i];
+    dest[i] = aux.dest[i];
+  }
+  
+  if(aux.size > 1)
+  {
+    delete[] aux.out_tag;
+    delete[] aux.dest;
+  }
+
+  out_tag[aux.size-1] = o;
+  dest[aux.size-1] = d;
+  aux.out_tag = out_tag;
+  aux.dest = dest;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/node.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/node.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/node.h	(revision 70339)
@@ -0,0 +1,161 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _NODE_
+#define _NODE_
+
+#include <cstdlib>
+#include <list>
+#include <map>
+
+class State;
+class Node;
+
+using namespace std;
+
+class Dest
+{
+private: 
+  int size;
+  int *out_tag;
+  Node **dest;
+  
+  friend class State;
+  friend class Node;
+  
+  void copy(Dest const &d)
+  {
+    destroy();
+    size = d.size;
+    out_tag = new int[size];
+    dest = new Node*[size];
+  }
+  
+  void destroy()
+  {
+    if(size != 0)
+    {
+      size = 0;
+      if(out_tag)
+      {
+        delete[] out_tag;
+      }
+      if(dest)
+      {
+        delete[] dest;
+      }
+    }
+  }
+
+  void init()
+  {
+    size = 0;
+    out_tag = NULL;
+    dest = NULL;  
+  }
+
+public:
+  Dest()
+  {
+    init();
+  }
+  
+  ~Dest()
+  {
+    destroy();
+  }
+  
+  Dest(Dest const &d)
+  {
+    init();
+    copy(d);
+  }
+
+  Dest & operator=(Dest const &d)
+  {
+    if(this != &d)
+    {
+      destroy();
+      copy(d);
+    }
+    return *this;
+  }
+};
+
+
+
+/**
+ * Node class of TransExe.  State is a friend class since the
+ * algorithms are implemented in State
+ */
+class Node
+{
+private:
+  friend class State;
+
+  /**
+   * The outgoing transitions of this node. 
+   * Schema: (input symbol, (output symbol, destination))
+   */
+  map<int, Dest> transitions;
+
+  /**
+   * Copy method
+   * @param n the node to be copied
+   */
+  void copy(Node const &n);
+
+  /**
+   * Destroy method
+   */
+  void destroy();
+
+public:
+
+  /**
+   * Constructor
+   */
+  Node();
+
+  /**
+   * Destructor
+   */
+  ~Node();
+
+  /**
+   * Copy constructor 
+   * @param n the node to be copied
+   */
+  Node(Node const &n);
+
+  /**
+   * Assignment operator
+   * @param n the node to be assigned
+   * @return the assigned object
+   */
+  Node & operator=(Node const &n);
+
+  /**
+   * Making a link between this node and another
+   * @param i input symbol
+   * @param o output symbol
+   * @param d destination
+   */
+  void addTransition(int i, int o, Node * const d);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pattern_list.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pattern_list.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pattern_list.h	(revision 70339)
@@ -0,0 +1,153 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _PATTERNLIST_
+#define _PATTERNLIST_
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/transducer.h>
+
+#include <list>
+#include <map>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+typedef multimap<int, vector<int> > PatternStore;
+typedef pair<PatternStore::iterator, PatternStore::iterator> PatternRange;
+
+class PatternList
+{
+private:
+  Alphabet alphabet;  
+  PatternStore patterns;
+  bool sequence;
+  list<vector<int> > sequence_data;
+  Transducer transducer;
+  map<int, int> final_type;
+  int sequence_id;
+
+  void copy(PatternList const &o);
+  void destroy();
+  void insertOutOfSequence(wstring const &lemma, wstring const &tags,
+			   vector<int> &result);
+  void insertIntoSequence(int const id, wstring const &lemma, 
+			  wstring const &tags);
+
+  static int tagCount(wstring const &tags);
+  static wstring tagAt(wstring const &tags, int const index);
+  
+public:
+  /**
+   * This symbol stands for any char
+   */
+  static wstring const ANY_CHAR;
+
+  /**
+   * This symbol stands for any tag
+   */
+  static wstring const ANY_TAG;
+
+  /**
+   * This symbol marks a word queue
+   */
+  static wstring const QUEUE;
+
+  /**
+   * Constructor
+   */
+  PatternList();
+  
+  /**
+   * Destructor
+   */
+  ~PatternList();
+  
+  /**
+   * Copy constructor
+   */
+  PatternList(PatternList const &o);
+  
+  /**
+   * Assignment operator
+   * @param o the object to be assigned
+   */
+  PatternList & operator =(PatternList const &o);
+
+  /**
+   * Marks the start of a multiple word sequence
+   */
+  void beginSequence();
+  
+  /**
+   * Ends the multiple word sequence 
+   */
+  void endSequence();
+  
+  /**
+   * Insertion method
+   * @param id
+   * @param lemma
+   * @param tags
+   */
+  void insert(int const id, wstring const &lemma, wstring const &tags);
+
+  /**
+   * Insertion method
+   * @param id
+   * @param otherid
+   */
+  void insert(int const id, int const otherid);
+  
+  /**
+   * Get the PatternStore
+   * @returns a PatternStore object
+   */
+  PatternStore const & getPatterns();
+  
+  /**
+   * Build the FSM
+   */
+  void buildTransducer();
+  
+  /**
+   * Read PatternList from a file
+   * @param input the input stream
+   */
+  void read(FILE *input);
+  
+  /**
+   * Write PatternList to a file
+   * @param output the output stream
+   */
+  void write(FILE *output);
+  
+  /**
+   * Create a new MatchExe from PatternList, must be freed with 'delete'
+   * @return the new MatchExe object
+   */
+  MatchExe * newMatchExe();
+  
+  /**
+   * Get the alphabet of this PatternList object
+   * @return the alphabet
+   */
+  Alphabet & getAlphabet();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/regexp_compiler.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/regexp_compiler.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/regexp_compiler.h	(revision 70339)
@@ -0,0 +1,219 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _REGEXP_COMPILER_
+#define _REGEXP_COMPILER_
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/transducer.h>
+
+#include <set>
+
+using namespace std;
+
+#define FIN_FICHERO - 1
+
+/**
+ * Compiler that builds a transducer to identify regular expressions.  This 
+ * compiler is a recursive descendent parser (RDP).
+ */
+class RegexpCompiler
+{
+private:
+  /**
+   * Last token
+   */
+  int token;
+ 
+  /**
+   * Input string
+   */
+  wstring input;
+ 
+  /**
+   * Alphabet to encode symbols
+   */
+  Alphabet *alphabet;
+
+  /**
+   * Transducer to store analysis
+   */
+  Transducer transducer;
+  
+  /**
+   * Current state
+   */
+  int state;
+ 
+  /**
+   * Current letter
+   */
+  int letter;
+
+  /**
+   * Post-operator: '+', '?', '*'
+   */
+  wstring postop;
+
+  /**
+   *
+   */
+  set<int> brackets;
+
+  /**
+   * Copy method
+   * @param rec the regular expresion compiler to be copied
+   */
+  void copy(RegexpCompiler const &rec);
+
+  /**
+   * Destroy method
+   */
+  void destroy();
+
+  /**
+   * RDP top function
+   */  
+  void S();
+  
+  /**
+   * RDP function
+   */
+  void RExpr();
+  
+  /**
+   * RDP function
+   */
+  void Cola();
+  
+  /**
+   * RDP function
+   */
+  void Term();
+  
+  /**
+   * RDP function
+   */
+  void RExprp();
+  
+  /**
+   * RDP function
+   */
+  void Letra();
+  
+  /**
+   * RDP function
+   */
+  void Postop();
+  
+  /**
+   * RDP function
+   */
+  void Esp();
+  
+  /**
+   * RDP function
+   */
+  void Lista();
+  
+  /**
+   * RDP function
+   */
+  void Reservado();
+  
+  /**
+   * RDP function
+   */
+  void Elem();
+  
+  /**
+   * RDP function
+   */
+  void ColaLetra();
+
+  /**
+   * Consume the input
+   * @param t the input to be consumed
+   */
+  void consume(int t);
+
+  /**
+   * Error message function
+   */
+  void error();
+
+  /**
+   * Error message function
+   * @param t the token being consumed
+   */
+  void errorConsuming(int const t);
+  
+  /**
+   * Detect if it is a reserved token
+   * @param t the token
+   * @return true if the token is reserved
+   */
+  bool isReserved(int const t);
+public:
+  /**
+   * Constructor
+   */
+  RegexpCompiler();
+  
+  /**
+   * Destructor
+   */
+  ~RegexpCompiler();
+
+  /**
+   * Copy constructor
+   * @param rec the regexp compiler to be copied
+   */
+  RegexpCompiler(RegexpCompiler const &rec);
+
+  /**
+   * Assignment operator
+   * @param rec the regexp compiler to assign
+   * @return the object result of the assignment
+   */
+  RegexpCompiler & operator = (RegexpCompiler const &rec);
+
+  /**
+   * Function that parses a regular expression and produces a transducer
+   * @param er the regular expression
+   */
+  void compile(wstring const &er);
+
+  /**
+   * Set the decoder of symbols
+   * @param a the alphabet
+   */
+  void setAlphabet(Alphabet *a);
+
+  /**
+   * Gets the transducer built
+   * @return the transducer
+   */
+  Transducer & getTransducer();
+
+  /**
+   * Initializes the compiler
+   * @param a the alphabet
+   */
+  void initialize(Alphabet *a); 
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/sorted_vector.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/sorted_vector.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/sorted_vector.cc	(revision 70339)
@@ -0,0 +1,97 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/sorted_vector.h>
+#include <cstdlib>
+
+using namespace std;
+
+void
+SortedVector::copy(SortedVector const &o)
+{
+  sv = new SVNode[o.size];
+  size = o.size;
+  
+  for(int i = 0; i != size; i++)
+  {
+    sv[i].tag = o.sv[i].tag;
+    sv[i].dest = o.sv[i].dest;
+  }
+}
+
+void
+SortedVector::destroy()
+{
+  delete[] sv;
+}
+
+SortedVector::SortedVector(int const fixed_size)
+{
+  sv = new SVNode[fixed_size];
+  size = fixed_size;
+}
+
+SortedVector::~SortedVector()
+{
+  destroy();
+}
+
+SortedVector::SortedVector(SortedVector const &o)
+{
+  copy(o);
+}
+
+SortedVector &
+SortedVector::operator =(SortedVector const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+void
+SortedVector::add(int tag, MatchNode *dest, int pos)
+{
+  sv[pos].tag = tag;
+  sv[pos].dest = dest; 
+}
+
+MatchNode *
+SortedVector::search(int tag)
+{
+  int left = 0, right = size-1;
+  while(left <= right)
+  {
+    int mid = (left+right)/2;
+    if(sv[mid].tag == tag)
+    {  
+      return sv[mid].dest;
+    }
+    if(sv[mid].tag > tag)
+    {
+      right = mid - 1;
+    }
+    else
+    {
+      left = mid + 1;
+    }
+  }
+  
+  return NULL;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/sorted_vector.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/sorted_vector.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/sorted_vector.h	(revision 70339)
@@ -0,0 +1,91 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _SORTEDVECTOR_
+#define _SORTEDVECTOR_
+
+class MatchNode;
+
+/**
+ * Class representing the sorted vector of destinations for a given
+ * MatchNode.  Destinations are also MatchNode pointers.
+ */
+class SortedVector
+{
+private:
+
+  /**
+   * Pair tag-destination
+   */
+  struct SVNode
+  {
+    int tag;
+    MatchNode *dest;
+  };
+  
+  /**
+   * Array of sorted SVNodes
+   */
+  SVNode *sv;
+  
+  /**
+   * Size of the array
+   */
+  int size;
+  
+  void copy(SortedVector const &o);
+  void destroy();
+public:
+  /**
+   * Constructor
+   * @param fixed_size size of the SortedVector
+   */
+  SortedVector(int const fixed_size);
+  
+  /**
+   * Destructor
+   */
+  ~SortedVector();
+  
+  /**
+   * Copy constructor
+   * @param o the item to be copied
+   */
+  SortedVector(SortedVector const &o);
+  
+  /**
+   * Assignment operator
+   * @param o the item to be assigned
+   */
+  SortedVector & operator =(SortedVector const &o);
+  
+  /**
+   * Method to adding an item into a specified position in the array
+   * @param tag the tag of the item
+   * @param the destination MatchNode of the item
+   * @param pos the position to do the insertion
+   */
+  void add(int tag, MatchNode *dest, int pos);
+  
+  /**
+   * Searching method (classic binary search)
+   * @param tag to search
+   * @returns the destination MatchNode pointer
+   */ 
+  MatchNode * search(int tag);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/state.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/state.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/state.cc	(revision 70339)
@@ -0,0 +1,735 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/state.h>
+
+#include <cstring>
+#include <cwctype>
+#include <climits>
+
+//debug//
+//#include <iostream>
+//using namespace std;
+//debug//
+
+State::State()
+{
+}
+ 
+State::~State()
+{
+  destroy();
+}
+
+State::State(State const &s)
+{
+  copy(s);
+}
+
+State &
+State::operator =(State const &s)
+{
+  if(this != &s)
+  {
+    destroy();
+    copy(s);
+  }
+
+  return *this;
+}
+
+void 
+State::destroy()
+{
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    delete state[i].sequence;
+  }
+
+  state.clear();
+}
+
+void
+State::copy(State const &s)
+{
+  // release references
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    delete state[i].sequence;
+  }
+
+  state = s.state;
+
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    vector<int> *tmp = new vector<int>();
+    *tmp = *(state[i].sequence);
+    state[i].sequence = tmp;
+  }
+}
+
+int 
+State::size() const
+{
+  return state.size();
+}
+
+void
+State::init(Node *initial)
+{
+  state.clear();
+  state.push_back(TNodeState(initial, new vector<int>(), false));
+  state[0].sequence->clear();
+  epsilonClosure();  
+}  
+
+void
+State::apply(int const input)
+{
+  vector<TNodeState> new_state;
+  if(input == 0)
+  {
+    state = new_state;
+    return;
+  }
+  
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    map<int, Dest>::const_iterator it;
+    it = state[i].where->transitions.find(input);
+    if(it != state[i].where->transitions.end())
+    {
+      for(int j = 0; j != it->second.size; j++)
+      {
+        vector<int> *new_v = new vector<int>();
+        *new_v = *(state[i].sequence);
+        if(it->first != 0)
+        {
+          new_v->push_back(it->second.out_tag[j]);
+        }
+        new_state.push_back(TNodeState(it->second.dest[j], new_v, state[i].dirty||false));
+      }
+    }
+    delete state[i].sequence;
+  }
+  
+  state = new_state;
+}
+
+void 
+State::apply(int const input, int const alt)
+{
+  vector<TNodeState> new_state;
+  if(input == 0 || alt == 0)
+  {
+    state = new_state;
+    return;
+  }
+
+  
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    map<int, Dest>::const_iterator it;
+    it = state[i].where->transitions.find(input);
+    if(it != state[i].where->transitions.end())
+    {
+      for(int j = 0; j != it->second.size; j++)
+      {
+        vector<int> *new_v = new vector<int>();
+	*new_v = *(state[i].sequence);
+        if(it->first != 0)
+        {
+          new_v->push_back(it->second.out_tag[j]);
+        }
+        new_state.push_back(TNodeState(it->second.dest[j], new_v, state[i].dirty||false));
+      }
+    }
+    it = state[i].where->transitions.find(alt);
+    if(it != state[i].where->transitions.end())
+    {
+      for(int j = 0; j != it->second.size; j++)
+      {
+        vector<int> *new_v = new vector<int>();
+        *new_v = *(state[i].sequence);
+        if(it->first != 0)
+        {
+          new_v->push_back(it->second.out_tag[j]);
+        }
+        new_state.push_back(TNodeState(it->second.dest[j], new_v, true));
+      }
+    }
+    delete state[i].sequence;
+  }
+
+  state = new_state;
+}
+
+void
+State::epsilonClosure()
+{
+  for(size_t i = 0; i != state.size(); i++)
+  {
+    map<int, Dest>::iterator it2;
+    it2 = state[i].where->transitions.find(0);
+    if(it2 != state[i].where->transitions.end())
+    {
+      for(int j = 0 ; j != it2->second.size; j++)
+      {
+        vector<int> *tmp = new vector<int>();
+        *tmp = *(state[i].sequence);
+        if(it2->second.out_tag[j] != 0)
+        {
+	  tmp->push_back(it2->second.out_tag[j]);
+        }
+        state.push_back(TNodeState(it2->second.dest[j], tmp, state[i].dirty));
+      }          
+    }
+  }
+}
+
+void 
+State::apply(int const input, int const alt1, int const alt2)
+{
+  vector<TNodeState> new_state;
+  if(input == 0 || alt1 == 0 || alt2 == 0)
+  {
+    state = new_state;
+    return;
+  }
+  
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    map<int, Dest>::const_iterator it;
+    it = state[i].where->transitions.find(input);
+    if(it != state[i].where->transitions.end())
+    {
+      for(int j = 0; j != it->second.size; j++)
+      {
+        vector<int> *new_v = new vector<int>();
+	*new_v = *(state[i].sequence);
+        if(it->first != 0)
+        {
+          new_v->push_back(it->second.out_tag[j]);
+        }
+        new_state.push_back(TNodeState(it->second.dest[j], new_v, state[i].dirty||false));
+      }
+    }
+    it = state[i].where->transitions.find(alt1);
+    if(it != state[i].where->transitions.end())
+    {
+      for(int j = 0; j != it->second.size; j++)
+      {
+        vector<int> *new_v = new vector<int>();
+        *new_v = *(state[i].sequence);
+        if(it->first != 0)
+        {
+          new_v->push_back(it->second.out_tag[j]);
+        }
+        new_state.push_back(TNodeState(it->second.dest[j], new_v, true));
+      }
+    }
+    it = state[i].where->transitions.find(alt2);
+    if(it != state[i].where->transitions.end())
+    {
+      for(int j = 0; j != it->second.size; j++)
+      {
+        vector<int> *new_v = new vector<int>();
+        *new_v = *(state[i].sequence);
+        if(it->first != 0)
+        {
+          new_v->push_back(it->second.out_tag[j]);
+        }
+        new_state.push_back(TNodeState(it->second.dest[j], new_v, true));
+      }
+    }
+
+    delete state[i].sequence;
+  }
+
+  state = new_state;
+}
+
+
+void
+State::step(int const input)
+{
+  apply(input);
+  epsilonClosure();
+}
+
+void
+State::step(int const input, int const alt)
+{
+  apply(input, alt);
+  epsilonClosure();
+}
+
+void
+State::step(int const input, int const alt1, int const alt2)
+{
+  apply(input, alt1, alt2);
+  epsilonClosure();
+}
+
+void 
+State::step_case(wchar_t val, wchar_t val2, bool caseSensitive) 
+{
+  if (!iswupper(val) || caseSensitive) {
+    step(val, val2);
+  } else if(val != towlower(val)) {
+    step(val, towlower(val), val2);
+  } else {
+    step(val, val2);
+  }
+}
+
+
+void 
+State::step_case(wchar_t val, bool caseSensitive) 
+{
+  if (!iswupper(val) || caseSensitive) {
+    step(val);
+  } else {
+    step(val, towlower(val));
+  }
+}
+
+
+bool
+State::isFinal(set<Node *> const &finals) const
+{
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    if(finals.find(state[i].where) != finals.end())
+    {
+      return true;
+    }
+  }
+  
+  return false;
+}
+
+wstring
+State::filterFinals(set<Node *> const &finals, 
+		    Alphabet const &alphabet,
+		    set<wchar_t> const &escaped_chars,
+		    bool uppercase, bool firstupper, int firstchar) const
+{
+  wstring result = L"";
+
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    if(finals.find(state[i].where) != finals.end())
+    {
+      if(state[i].dirty)
+      {
+        result += L'/';
+        unsigned int const first_char = result.size() + firstchar;
+        for(size_t j = 0, limit2 = state[i].sequence->size(); j != limit2; j++)
+        {
+          if(escaped_chars.find((*(state[i].sequence))[j]) != escaped_chars.end())
+          {
+            result += L'\\';
+          }
+          alphabet.getSymbol(result, (*(state[i].sequence))[j], uppercase);
+        }
+        if(firstupper)
+        {
+  	  if(result[first_char] == L'~')
+	  {
+	    // skip post-generation mark
+	    result[first_char+1] = towupper(result[first_char+1]);
+	  }
+	  else
+	  {
+            result[first_char] = towupper(result[first_char]);
+	  }
+        }
+      }
+      else
+      {
+        result += L'/';
+        for(size_t j = 0, limit2 = state[i].sequence->size(); j != limit2; j++)
+        {
+          if(escaped_chars.find((*(state[i].sequence))[j]) != escaped_chars.end())
+          {
+            result += L'\\';
+          }
+          alphabet.getSymbol(result, (*(state[i].sequence))[j]);
+        }
+      }
+    }
+  }
+  
+  return result;
+}
+
+
+set<pair<wstring, vector<wstring> > >
+State::filterFinalsLRX(set<Node *> const &finals, 
+		    Alphabet const &alphabet,
+		    set<wchar_t> const &escaped_chars,
+		    bool uppercase, bool firstupper, int firstchar) const
+{
+  set<pair<wstring, vector<wstring> > > results;
+
+  vector<wstring> current_result;
+  wstring rule_id = L""; 
+
+  // /<$><select>station<n><ANY_TAG><$><skip><6>/<$><select>station<n><ANY_TAG><$><skip><6>
+
+  // if <$> current_result.push_back(current_word)
+  // if /   results.insert(current_result)
+
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    if(finals.find(state[i].where) != finals.end())
+    {
+      current_result.clear();
+      rule_id = L"";
+      wstring current_word = L"";
+      for(size_t j = 0, limit2 = state[i].sequence->size(); j != limit2; j++)
+      {
+        if(escaped_chars.find((*(state[i].sequence))[j]) != escaped_chars.end())
+        {
+          current_word += L'\\';
+        }
+        wstring sym = L"";
+        alphabet.getSymbol(sym, (*(state[i].sequence))[j], uppercase);
+        if(sym == L"<$>") 
+        { 
+          if(current_word != L"")  
+          {
+            current_result.push_back(current_word); 
+          }
+          current_word = L"";
+        }
+        else 
+        {
+          current_word += sym; 
+        }
+      }
+      rule_id = current_word;
+      results.insert(make_pair(rule_id, current_result)); 
+    }
+  }
+    
+  return results;
+}
+
+
+wstring
+State::filterFinalsSAO(set<Node *> const &finals, 
+		       Alphabet const &alphabet,
+		       set<wchar_t> const &escaped_chars,
+		       bool uppercase, bool firstupper, int firstchar) const
+{
+  wstring result = L"";
+  wstring annot = L"";
+  
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    if(finals.find(state[i].where) != finals.end())
+    {
+      result += L'/';
+      unsigned int const first_char = result.size() + firstchar;
+      for(size_t j = 0, limit2 = state[i].sequence->size(); j != limit2; j++)
+      {
+        if(escaped_chars.find((*(state[i].sequence))[j]) != escaped_chars.end())
+        {
+          result += L'\\';
+        }
+        if(alphabet.isTag((*(state[i].sequence))[j]))
+        {
+          annot = L"";
+          alphabet.getSymbol(annot, (*(state[i].sequence))[j]);
+          result += L'&'+annot.substr(1,annot.length()-2)+L';';
+        }
+        else
+        {
+          alphabet.getSymbol(result, (*(state[i].sequence))[j], uppercase);
+        }
+      }
+      if(firstupper)
+      {
+	if(result[first_char] == L'~')
+	{
+	  // skip post-generation mark
+	  result[first_char+1] = towupper(result[first_char+1]);
+	}
+	else
+	{
+          result[first_char] = towupper(result[first_char]);
+	}
+      }
+    }
+  }
+  
+  return result;
+}
+
+wstring
+State::filterFinalsTM(set<Node *> const &finals, 
+		      Alphabet const &alphabet,
+                      set<wchar_t> const &escaped_chars,
+                      queue<wstring> &blankqueue, vector<wstring> &numbers) const
+{
+  wstring result = L"";
+
+  for(size_t i = 0, limit = state.size(); i != limit; i++)
+  {
+    if(finals.find(state[i].where) != finals.end())
+    {
+      result += L'/';
+      for(size_t j = 0, limit2 = state[i].sequence->size(); j != limit2; j++)
+      {
+        if(escaped_chars.find((*(state[i].sequence))[j]) != escaped_chars.end())
+        {
+          result += L'\\';
+        }
+        alphabet.getSymbol(result, (*(state[i].sequence))[j]);
+      }
+    }
+  }
+
+
+  wstring result2 = L"";
+  vector<wstring> fragmentos;
+  fragmentos.push_back(L"");
+ 
+  for(unsigned int i = 0, limit = result.size(); i != limit ; i++)
+  {
+    if(result[i] == L')')
+    {
+      fragmentos.push_back(L"");
+    }
+    else
+    {
+      fragmentos[fragmentos.size()-1] += result[i];
+    }
+  }
+  
+  for(unsigned int i = 0, limit = fragmentos.size(); i != limit; i++)
+  {
+    if(i != limit -1)
+    {
+      if(fragmentos[i].size() >=2 && fragmentos[i].substr(fragmentos[i].size()-2) == L"(#")
+      {
+        wstring whitespace = L" ";
+        if(blankqueue.size() != 0)
+	{
+          whitespace = blankqueue.front().substr(1);
+	  blankqueue.pop();
+	  whitespace = whitespace.substr(0, whitespace.size() - 1);
+        }  
+        fragmentos[i] = fragmentos[i].substr(0, fragmentos[i].size()-2) +
+	                whitespace;
+      }
+      else
+      {
+        bool sustituido = false;
+	for(int j = fragmentos[i].size() - 1; j >= 0; j--)
+	{
+	  if(fragmentos[i].size()-j > 3 && fragmentos[i][j] == L'\\' && 
+	     fragmentos[i][j+1] == L'@' && fragmentos[i][j+2] == L'(')
+	  {
+	    int num = 0;
+	    bool correcto = true;
+	    for(unsigned int k = (unsigned int) j+3, limit2 = fragmentos[i].size();
+		k != limit2; k++)
+	    {
+	      if(iswdigit(fragmentos[i][k]))
+	      {
+		num = num * 10;
+		num += (int) fragmentos[i][k] - 48;	
+	      }
+	      else
+	      {
+		correcto = false;
+		break;
+	      }
+	    }
+	    if(correcto)
+	    {
+	      fragmentos[i] = fragmentos[i].substr(0, j) + numbers[num - 1];
+	      sustituido = true;
+	      break;
+	    }
+	  }
+	}
+	if(sustituido == false)
+	{
+	  fragmentos[i] += L')';
+	}
+      }
+    }    
+  }
+  
+  result = L"";
+
+  for(unsigned int i = 0, limit = fragmentos.size(); i != limit; i++)
+  {
+    result += fragmentos[i];
+  }
+  
+  return result;
+}
+
+
+
+void
+State::pruneCompounds(int requiredSymbol, int separationSymbol, int compound_max_elements) 
+{
+  int minNoOfCompoundElements = compound_max_elements;
+  int *noOfCompoundElements = new int[state.size()];
+
+  //wcerr << L"pruneCompounds..." << endl;
+
+  for (unsigned int i = 0;  i<state.size(); i++) {
+    vector<int> seq = *state.at(i).sequence;
+
+    if (lastPartHasRequiredSymbol(seq, requiredSymbol, separationSymbol)) {
+      int this_noOfCompoundElements = 0;
+      for (int j = seq.size()-2; j>0; j--) if (seq.at(j)==separationSymbol) this_noOfCompoundElements++;
+      noOfCompoundElements[i] = this_noOfCompoundElements;
+      minNoOfCompoundElements = (minNoOfCompoundElements < this_noOfCompoundElements) ? 
+                        minNoOfCompoundElements : this_noOfCompoundElements;
+    }
+    else {
+      noOfCompoundElements[i] = INT_MAX;
+		  //wcerr << L"Prune - No requiered symbol in state number " << i << endl;
+    }
+  }
+
+  // remove states with more than minimum number of compounds (or without the requiered symbol in the last part)
+  vector<TNodeState>::iterator it = state.begin();
+  int i=0;
+  while(it != state.end()) {
+    if (noOfCompoundElements[i] > minNoOfCompoundElements) {
+      delete (*it).sequence;
+      it = state.erase(it);
+      //wcerr << L"Prune - State number " << i << L" removed!" << endl;
+    }
+    else it++;
+    i++;
+  }
+
+ delete[] noOfCompoundElements;
+}
+
+
+
+void
+State::pruneStatesWithForbiddenSymbol(int forbiddenSymbol) 
+{
+  vector<TNodeState>::iterator it = state.begin();
+  while(it != state.end()) {
+    vector<int> *seq = (*it).sequence;
+    bool found = false;
+    for(int i = seq->size()-1; i>=0; i--) {
+      if(seq->at(i) == forbiddenSymbol) {
+        i=-1;
+        delete (*it).sequence;
+        it = state.erase(it);
+        found = true;
+      }
+    }
+    if (!found) it++;
+  }
+}
+
+
+
+bool
+State::lastPartHasRequiredSymbol(const vector<int> &seq, int requiredSymbol, int separationSymbol) 
+{
+  // state is final - it should be restarted it with all elements in stateset restart_state, with old symbols conserved
+  bool restart=false;
+  for (int n=seq.size()-1; n>=0; n--) {
+    int symbol=seq.at(n);
+    if (symbol==requiredSymbol) {
+      restart=true;
+      break;
+    }
+    if (symbol==separationSymbol) {
+      break;
+    }
+  }
+  return restart;
+}
+
+
+void
+State::restartFinals(const set<Node *> &finals, int requiredSymbol, State *restart_state, int separationSymbol) 
+{
+
+  for (unsigned int i=0;  i<state.size(); i++) {
+    TNodeState state_i = state.at(i);
+    // A state can be a possible final state and still have transitions
+
+    if (finals.count(state_i.where) > 0) {
+      bool restart = lastPartHasRequiredSymbol(*(state_i.sequence), requiredSymbol, separationSymbol);
+      if (restart) {
+        if (restart_state != NULL) {
+          for (unsigned int j=0; j<restart_state->state.size(); j++) {
+            TNodeState initst = restart_state->state.at(j);
+            vector<int> *tnvec = new vector<int>;
+
+            for(unsigned int k=0; k < state_i.sequence->size(); k++) tnvec->push_back(state_i.sequence->at(k));
+            TNodeState tn(initst.where, tnvec, state_i.dirty);
+            tn.sequence->push_back(separationSymbol);
+            state.push_back(tn);
+            }
+          }
+        }
+      }
+    }
+}
+
+
+
+wstring
+State::getReadableString(const Alphabet &a) 
+{
+  wstring retval = L"[";
+
+  for(unsigned int i=0; i<state.size(); i++) {
+    vector<int>* seq = state.at(i).sequence;
+    if(seq != NULL) for (unsigned int j=0; j<seq->size(); j++) {
+      wstring ws = L"";
+      a.getSymbol(ws, seq->at(j));
+      //if(ws == L"") ws = L"?";
+      retval.append(ws);
+    }
+
+    /*Node *where = state.at(i).where;
+    if(where == NULL) retval.append(L"→@null");
+    else {
+      retval.append(L"→");
+      map<int, Dest>::iterator it;
+      wstring ws;
+      for (it = where->transitions.begin(); it != where->transitions.end(); it++) {
+        int symbol = (*it).first;
+        a.getSymbol(ws, symbol);
+        retval.append(ws);
+      }
+    }*/
+    if (i+1 < state.size()) retval.append(L", ");
+  }
+  retval.append(L"]");
+  return retval;
+}
+
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/state.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/state.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/state.h	(revision 70339)
@@ -0,0 +1,258 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _STATE_
+#define _STATE_
+
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+#include <queue>
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/node.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/match_state.h>
+#include <lttoolbox/transducer.h>
+
+using namespace std;
+
+/**
+ * Class to represent the current state of transducer processing 
+ */
+class State
+{
+private:
+  /**
+   * The current state of transducer processing
+   */
+  struct TNodeState
+  {
+    Node *where;
+    vector<int> *sequence;
+    // a state is "dirty" if it was introduced at runtime (case variants, etc.)
+    bool dirty;
+    
+    TNodeState(Node * const &w, vector<int> * const &s, bool const &d): where(w), sequence(s), dirty(d){}
+    TNodeState & operator=(TNodeState const &other)
+    {
+      where = other.where;
+      sequence = other.sequence;
+      dirty = other.dirty;
+      return *this;
+    }
+  };
+  
+  vector<TNodeState> state;
+
+  /**
+   * Destroy function
+   */
+  void destroy();
+
+  /**
+   * Make a transition, version for lowercase letters and symbols
+   * @param input the input symbol
+   */
+  void apply(int const input);
+
+  /**
+   * Make a transition, version for lowercase and uppercase letters
+   * @param input the input symbol
+   * @param alt the alternative input symbol
+   */
+  void apply(int const input, int const alt);
+
+  void apply(int const input, int const alt1, int const alt2);
+
+  /**
+   * Calculate the epsilon closure over the current state, replacing
+   * its content.
+   */
+  void epsilonClosure();
+
+  bool lastPartHasRequiredSymbol(const vector<int> &seq, int requiredSymbol, int separationSymbol);
+
+public:
+
+  /**
+   * Copy function
+   * @param s the state to be copied
+   */
+  void copy(State const &s);
+
+
+  /**
+   * Constructor
+   */
+  State();
+
+  /**
+   * Destructor
+   */
+  ~State();
+
+  /**
+   * Copy constructor
+   * @param s the state to be copied
+   */
+  State(State const &s);
+
+  /**
+   * Assignment operator
+   * @param s the state to be assigned
+   * @return the object that results from the assignation
+   */
+  State & operator =(State const &s);
+  
+  /**
+   * Number of alive transductions
+   * @return the size
+   */
+  int size() const;
+
+  /**
+   * step = apply + epsilonClosure
+   * @param input the input symbol
+   */
+  void step(int const input);
+
+  /**
+   * step = apply + epsilonClosure
+   * @param input the input symbol
+   * @param alt the alternative input symbol
+   */
+  void step(int const input, int const alt);
+
+  void step(int const input, int const alt1, int const alt2);
+
+  void step_case(wchar_t val, bool caseSensitive);
+
+  void step_case(wchar_t val, wchar_t val2, bool caseSensitive);
+
+
+  /**
+   * Init the state with the initial node and empty output
+   * @param initial the initial node of the transducer
+   */
+  void init(Node *initial);
+
+  /**
+    * Remove states not containing a specific symbol in their last 'part', and states 
+    * with more than a number of 'parts'
+    * @param requieredSymbol the symbol requiered in the last part
+    * @param separationSymbol the symbol that represent the separation between two parts
+    * @param compound_max_elements the maximum part number allowed
+    */
+  void pruneCompounds(int requiredSymbol, int separationSymbol, int compound_max_elements);
+
+  /**
+    * Remove states containing a forbidden symbol
+    * @param forbiddenSymbol the symbol forbidden
+    */
+  void pruneStatesWithForbiddenSymbol(int forbiddenSymbol);
+
+  /**
+   * Print all outputs of current parsing, preceded by a bar '/',
+   * from the final nodes of the state
+   * @param finals the set of final nodes
+   * @param a the alphabet to decode strings
+   * @param escaped_chars the set of chars to be preceded with one 
+   *                      backslash
+   * @param uppercase true if the word is uppercase
+   * @param firstupper true if the first letter of a word is uppercase
+   * @param firstchar first character of the word
+   * @return the result of the transduction
+   */
+  wstring filterFinals(set<Node *> const &finals, Alphabet const &a,
+                      set<wchar_t> const &escaped_chars,
+                      bool uppercase = false,
+                      bool firstupper = false,
+                      int firstchar = 0) const;
+
+  /**
+   * Same as previous one, but  the output is adapted to the SAO system
+   * @param finals the set of final nodes
+   * @param a the alphabet to decode strings
+   * @param escaped_chars the set of chars to be preceded with one 
+   *                      backslash
+   * @param uppercase true if the word is uppercase
+   * @param firstupper true if the first letter of a word is uppercase
+   * @param firstchar first character of the word
+   * @return the result of the transduction
+   */
+  wstring filterFinalsSAO(set<Node *> const &finals, Alphabet const &a,
+                      set<wchar_t> const &escaped_chars,
+                      bool uppercase = false,
+                      bool firstupper = false,
+                      int firstchar = 0) const;
+
+
+  /**
+   * Same as previous one, but  the output is adapted to the LRX system
+   * @param finals the set of final nodes
+   * @param a the alphabet to decode strings
+   * @param escaped_chars the set of chars to be preceded with one 
+   *                      backslash
+   * @param uppercase true if the word is uppercase
+   * @param firstupper true if the first letter of a word is uppercase
+   * @param firstchar first character of the word
+   * @return the result of the transduction
+   */
+
+  set<pair<wstring, vector<wstring> > > filterFinalsLRX(set<Node *> const &finals, Alphabet const &a,
+                      set<wchar_t> const &escaped_chars,
+                      bool uppercase = false,
+                      bool firstupper = false,
+                      int firstchar = 0) const;
+
+
+
+
+
+  /**
+   * Find final states, remove those that not has a requiredSymbol and 'restart' each of them as the 
+   * set of initial states, but remembering the sequence and adding a separationSymbol
+   * @param finals
+   * @param requiredSymbol
+   * @param restart_state
+   * @param separationSymbol
+   */
+    void restartFinals(const set<Node *> &finals, int requiredSymbol, State *restart_state, int separationSymbol);
+
+
+  /**
+   * Returns true if at least one record of the state references a
+   * final node of the set
+   * @param finals set of final nodes @return
+   * @true if the state is final
+   */
+  bool isFinal(set<Node *> const &finals) const;
+
+  /**
+   * Return the full states string (to allow debuging...) using a Java ArrayList.toString style
+   */
+  wstring getReadableString(const Alphabet &a);
+
+  wstring filterFinalsTM(set<Node *> const &finals, 
+			 Alphabet const &alphabet,
+                         set<wchar_t> const &escaped_chars,
+			 queue<wstring> &blanks, 
+                         vector<wstring> &numbers) const;
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/tmx_compiler.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/tmx_compiler.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/tmx_compiler.h	(revision 70339)
@@ -0,0 +1,201 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TMXCOMPILER_
+#define _TMXCOMPILER_
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/regexp_compiler.h>
+#include <lttoolbox/entry_token.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/transducer.h>
+
+#include <map>
+#include <string>
+#include <set>
+#include <libxml/xmlreader.h>
+#include <iostream>
+
+using namespace std;
+
+/**
+ * A compiler of dictionaries to letter transducers
+ */
+class TMXCompiler
+{
+private:
+  /**
+   * The libxml2's XML reader
+   */
+  xmlTextReaderPtr reader;
+  
+  /**
+   * Identifier of all the symbols during the compilation
+   */
+  Alphabet alphabet;
+
+  /**
+   * Main transducer representing the TM
+   */  
+  Transducer transducer;  
+
+  /**
+   * Origin language
+   */
+  wstring origin_language;
+
+  /**
+   * Meta language
+   */
+  wstring meta_language;
+  
+  /**
+   * Origin language code in the TMX
+   */
+  wstring origin_language_inner_code;
+
+  /**
+   * Origin language code in the TMX
+   */
+  wstring meta_language_inner_code;
+
+
+  /**
+   * Method to parse an XML Node
+   */
+  void procNode();
+
+  /**
+   * Parse the &lt;tu&gt; element
+   */
+  void procTU();
+
+  /**
+   * Insert a tu into the transducer
+   * @param origin left part
+   * @param meta right part
+   */
+  void insertTU(vector<int> const &origin, vector<int> const &meta);
+
+  /**
+   * Gets an attribute value with their name and the current context
+   * @param name the name of the attribute
+   * @return the value of the attribute
+   */
+  wstring attrib(wstring const &name);
+
+  /**
+   * Skip all document #text nodes before "elem"
+   * @param name the name of the node
+   * @param elem the name of the expected node
+   */
+  void skip(wstring &name, wstring const &elem);
+
+  /**
+   * Skip all blank #text nodes before "name"
+   * @param name the name of the node
+   */
+  void skipBlanks(wstring &name);
+  
+  /**
+   * Force an element to be empty, and check for it
+   * @param name the element 
+   */
+  void requireEmptyError(wstring const &name);
+
+  /**
+   * Force an attribute to be specified, amd check for it
+   * @param value the value of the attribute
+   * @param attrname the name of the attribute
+   * @param elemname the parent of the attribute
+   */
+  void requireAttribute(wstring const &value, wstring const &attrname,
+                        wstring const &elemname);
+
+  /**
+   * True if all the elements in the current node are blanks
+   * @return true if all are blanks
+   */
+  bool allBlanks();
+
+  wstring getTag(size_t const &val) const;
+  void trim(vector<int> &v) const;
+  void align(vector<int> &origin, vector<int> &meta);
+  unsigned int numberLength(vector<int> &v, unsigned int const position) const;
+  bool vectorcmp(vector<int> const &orig, unsigned int const begin_orig,
+                       vector<int> const &meta, unsigned int const begin_meta,
+                       unsigned const int length) const;
+  void split(vector<int> const &v, vector<vector<int> > &sv, int const symbol) const;
+  void align_blanks(vector<int> &o, vector<int> &m);
+  vector<int> join(vector<vector<int> > const &v, int const s) const;
+
+  static void printvector(vector<int> const &v, wostream &wos = std::wcout);  //eliminar este método
+  
+public:
+
+  /*
+   * Constants to represent the element and the attributes of
+   * translation memories in TMX format
+   */
+  static wstring const TMX_COMPILER_TMX_ELEM;
+  static wstring const TMX_COMPILER_HEADER_ELEM;
+  static wstring const TMX_COMPILER_BODY_ELEM;
+  static wstring const TMX_COMPILER_TU_ELEM;
+  static wstring const TMX_COMPILER_TUV_ELEM;
+  static wstring const TMX_COMPILER_HI_ELEM;
+  static wstring const TMX_COMPILER_PH_ELEM;
+  static wstring const TMX_COMPILER_XMLLANG_ATTR;
+  static wstring const TMX_COMPILER_LANG_ATTR;  
+  static wstring const TMX_COMPILER_SEG_ELEM;
+  static wstring const TMX_COMPILER_PROP_ELEM;
+
+
+  /**
+   * Constructor
+   */
+  TMXCompiler();
+
+  /**
+   * Destructor
+   */
+  ~TMXCompiler();
+
+  /**
+   * Compile dictionary to letter transducers
+   */
+  void parse(string const &fichero, wstring const &lo, wstring const &lm);
+  
+  /**
+   * Write the result of compilation 
+   * @param fd the stream where write the result
+   */
+  void write(FILE *fd);
+
+  /**
+   * Set origin language inner code
+   * @param code the code of the origin language into the TMX file being compiled
+   */
+  void setOriginLanguageCode(wstring const &code);
+
+  /**
+   * Set meta language inner code
+   * @param code the code of the meta language into the TMX file being compiled
+   */
+  void setMetaLanguageCode(wstring const &code);
+ 
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/trans_exe.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/trans_exe.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/trans_exe.h	(revision 70339)
@@ -0,0 +1,114 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+	
+#ifndef _TRANSEXE_
+#define _TRANSEXE_
+
+#include <cstdio>
+#include <cstdlib>
+#include <map>
+#include <set>
+#include <vector>
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/node.h>
+
+using namespace std;
+
+/**
+ * Transducer class for execution of lexical processing algorithms
+ */
+class TransExe
+{
+private:
+  /**
+   * Initial state
+   */
+  int initial_id;
+
+  /**
+   * Node list
+   */
+  vector<Node> node_list;
+
+  /**
+   * Set of final nodes
+   */
+  set<Node *> finals;
+
+  /**
+   * Copy function
+   * @param te the transducer to be copied
+   */
+  void copy(TransExe const &te);
+
+  /**
+   * Destroy function
+   */
+  void destroy();
+
+public:
+  
+  /**
+   * Constructor
+   */
+  TransExe();
+
+  /**
+   * Destructor
+   */
+  ~TransExe();
+
+  /**
+   * Copy constructor
+   * @param te the transducer to be copied
+   */
+  TransExe(TransExe const &te);
+
+  /**
+   * Assignment operator
+   * @param te the transducer to be assigned
+   * @return the assigned object
+   */
+  TransExe & operator =(TransExe const &te);
+
+  /**
+   * Read method with an encoding base
+   * @param input the stream
+   * @param alphabet the alphabet object to decode the symbols
+   */
+  void read(FILE *input, Alphabet const &alphabet);
+
+  /**
+   * Reduces all the final states to one
+   */
+  void unifyFinals();
+  
+  /**
+   * Gets the initial node of the transducer
+   * @return the initial node
+   */
+  Node * getInitial();
+
+  /**
+   * Gets the set of final nodes
+   * @return the set of final nodes
+   */
+  set<Node *> & getFinals();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xml_parse_util.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xml_parse_util.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xml_parse_util.cc	(revision 70339)
@@ -0,0 +1,123 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/xml_parse_util.h>
+
+#include <cstdlib>
+#include <iostream>
+
+using namespace std;
+
+wstring
+XMLParseUtil::attrib(xmlTextReaderPtr reader, wstring const &name)
+{
+  string mystr = "";
+  for(int i = 0, limit = name.size(); i != limit; i++)
+  {
+    mystr += static_cast<char>(name[i]);
+  }
+ 
+  xmlChar *attrname = xmlCharStrdup(mystr.c_str());
+  xmlChar *myattr = xmlTextReaderGetAttribute(reader, attrname);
+  wstring result = towstring(myattr);
+  xmlFree(myattr);
+  xmlFree(attrname);
+  return result;
+}
+
+string
+XMLParseUtil::latin1(xmlChar const *input)
+{
+ if(input == NULL)
+  {
+    return "";
+  }
+
+  int outputlen = xmlStrlen(input) + 1;
+  int inputlen = xmlStrlen(input);
+
+  unsigned char* output = new unsigned char[outputlen];
+  
+  if(UTF8Toisolat1(output, &outputlen, input, &inputlen) != 0)
+  {
+  }
+
+  output[outputlen] = 0;
+  string result = reinterpret_cast<char *>(output);
+  delete[] output;
+  return result;  
+}
+
+wstring
+XMLParseUtil::towstring(xmlChar const * input)
+{ 
+  wstring result = L"";
+  
+  for(int i = 0, limit = xmlStrlen(input); i != limit; i++)
+  {
+    int val = 0;
+    if(((unsigned char) input[i] & 0x80) == 0x0)
+    {
+      val = static_cast<wchar_t>(input[i]);
+    }
+    else if(((unsigned char) input[i] & 0xE0) == 0xC0)
+    {
+      val = (input[i] & 0x1F) << 6;
+      i++;
+      val += input[i] & 0x7F;  
+    }
+    else if(((unsigned char) input[i] & 0xF0) == 0xE0)
+    {
+      val = (input[i] & 0x0F) << 6;
+      i++;
+      val += input[i] & 0x7F;
+      val = val << 6;
+      i++;
+      val += input[i] & 0x7F;
+    }
+    else if(((unsigned char) input[i] & 0xF8) == 0xF0)
+    {
+      val = (input[i] & 0x07) << 6;
+      i++;
+      val += input[i] & 0x7F;
+      val = val << 6;
+      i++;
+      val += input[i] & 0x7F;
+      val = val << 6;
+      i++;
+      val += input[i] & 0x7F;
+    }
+    else
+    {
+      wcerr << L"UTF-8 invalid string" << endl;
+      exit(EXIT_FAILURE);  
+    }
+    
+    result += static_cast<wchar_t>(val);
+  }
+  return result;
+}
+
+wstring 
+XMLParseUtil::stows(string const &str)
+{
+  wchar_t* result = new wchar_t[str.size()+1];
+  size_t retval = mbstowcs(result, str.c_str(), str.size());
+  result[retval] = L'\0';
+  wstring result2 = result;
+  delete[] result;
+  return result2;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xml_parse_util.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xml_parse_util.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xml_parse_util.h	(revision 70339)
@@ -0,0 +1,36 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _XMLPARSEUTIL_
+#define _XMLPARSEUTIL_
+
+#include <libxml/encoding.h>
+#include <libxml/xmlreader.h>
+#include <string>
+#include <cwchar>
+
+using namespace std;
+
+class XMLParseUtil
+{
+public:
+  static wstring attrib(xmlTextReaderPtr reader, wstring const &name);
+  static string latin1(xmlChar const * input); // mark for deletion
+  static wstring towstring(xmlChar const * input);
+  static wstring stows(string const &str);
+};  
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xsd/dix.xsd
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xsd/dix.xsd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xsd/dix.xsd	(revision 70339)
@@ -0,0 +1,243 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!-- DTD for the format of dictionaries -->
+<xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" elementFormDefault="qualified">
+  <xs:element name="dictionary">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element minOccurs="0" ref="alphabet"/>
+        <xs:element minOccurs="0" ref="sdefs"/>
+        <xs:element minOccurs="0" ref="pardefs"/>
+        <xs:element maxOccurs="unbounded" ref="section"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:keyref name="symbolNameRef" refer="symbol_name">
+      <xs:selector xpath=".//s" />
+      <xs:field xpath="@n" />
+    </xs:keyref>
+    <xs:key name="symbol_name">
+      <xs:selector xpath=".//sdef" />
+      <xs:field xpath="@n" />
+    </xs:key>
+    <!--
+	Commented out since it reports an error on entries having the
+	ignore attribute (@i) set to 'yes'.
+	Though, we should perhaps consider to differentiate ignoring a dictionary
+	in compilation vs. dictionary consistency.
+	<xs:keyref name="parNameRef" refer="paradigm_name">
+	  <xs:selector xpath=".//par" />
+	  <xs:field xpath="@n" />
+	</xs:keyref>
+	<xs:key name="paradigm_name">
+	  <xs:selector xpath=".//pardef" />
+	  <xs:field xpath="@n" />
+	</xs:key>
+    -->
+  </xs:element>
+  <!--  root element -->
+  <xs:element name="alphabet" type="xs:string"/>
+  <!-- alphabetic character list -->
+  <xs:element name="sdefs">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element maxOccurs="unbounded" ref="sdef"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  <!-- symbol definition section -->
+  <xs:element name="sdef">
+    <xs:complexType>
+      <xs:attribute name="n" use="required"/>
+      <xs:attribute name="c"/>
+    </xs:complexType>
+    <xs:unique name="sdef-unique">
+      <xs:selector xpath="sdef"/>
+      <xs:field xpath="@n" />
+    </xs:unique>
+  </xs:element>
+  <!-- symbol definition -->
+  <!-- n: symbol (tag) name -->
+  <!-- c: symbol (tag) comment -->
+  <xs:element name="pardefs">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element maxOccurs="unbounded" ref="pardef"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:unique name="pardef-unique">
+      <xs:selector xpath="pardef"/>
+      <xs:field xpath="@n" />
+    </xs:unique>
+  </xs:element>
+  <!-- paradigm definition section -->
+  <xs:element name="pardef">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element maxOccurs="unbounded" ref="e"/>
+      </xs:sequence>
+      <xs:attribute name="n" use="required"/>
+      <xs:attribute name="c"/>
+    </xs:complexType>
+  </xs:element>
+  <!-- paradigm definition -->
+  <!-- n: paradigm name -->
+  <!-- c: comment about paradigm -->
+  <xs:element name="section">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element maxOccurs="unbounded" ref="e"/>
+      </xs:sequence>
+      <xs:attribute name="id" use="required" type="xs:ID"/>
+      <xs:attribute name="type" use="required">
+        <xs:simpleType>
+          <xs:restriction base="xs:token">
+            <xs:enumeration value="standard"/>
+            <xs:enumeration value="inconditional"/>
+            <xs:enumeration value="postblank"/>
+            <xs:enumeration value="preblank"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+  <!-- dictionary section -->
+  <!-- id: dictionary section identifier -->
+  <!-- type: dictionary section type -->
+  <xs:element name="e">
+    <xs:complexType>
+      <xs:choice maxOccurs="unbounded">
+        <xs:element ref="f"/>
+        <xs:element ref="i"/>
+        <xs:element ref="p"/>
+        <xs:element ref="par"/>
+        <xs:element ref="re"/>
+      </xs:choice>
+      <xs:attribute name="r">
+        <xs:simpleType>
+          <xs:restriction base="xs:token">
+            <xs:enumeration value="LR"/>
+            <xs:enumeration value="RL"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+      <xs:attribute name="lm"/>
+      <xs:attribute name="a"/>
+      <xs:attribute name="c"/>
+      <xs:attribute name="i"/>
+      <xs:attribute name="slr"/>
+      <xs:attribute name="srl"/>
+      <xs:attribute name="alt"/>
+      <xs:attribute name="v"/>
+      <xs:attribute name="vl"/>
+      <xs:attribute name="vr"/>
+    </xs:complexType>
+  </xs:element>
+  <!-- entry -->
+  <!--
+      r: restriction LR: left-to-right,
+      RL: right-to-left
+  -->
+  <!-- lm: lemma -->
+  <!-- a: author -->
+  <!-- c: comment -->
+  <!-- i: ignore ('yes') means ignore, otherwise it is not ignored) -->
+  <!-- slr: translation sense when translating from left to right -->
+  <!-- srl: translation sense when translating from right to left -->
+  <xs:element name="par">
+    <xs:complexType>
+      <xs:attribute name="n" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  <!-- reference to paradigm -->
+  <!-- n: paradigm name -->
+  <xs:element name="i">
+    <xs:complexType mixed="true">
+      <xs:choice minOccurs="0" maxOccurs="unbounded">
+        <xs:element ref="b"/>
+        <xs:element ref="s"/>
+        <xs:element ref="g"/>
+        <xs:element ref="j"/>
+        <xs:element ref="a"/>
+      </xs:choice>
+    </xs:complexType>
+  </xs:element>
+  <xs:element name="f">
+    <xs:complexType mixed="true">
+      <xs:choice minOccurs="0" maxOccurs="unbounded">
+        <xs:element ref="b"/>
+        <xs:element ref="s"/>
+        <xs:element ref="g"/>
+        <xs:element ref="j"/>
+        <xs:element ref="a"/>
+      </xs:choice>
+    </xs:complexType>
+  </xs:element>
+  <!-- identity -->
+  <xs:element name="re" type="xs:string"/>
+  <!-- regular expression identification -->
+  <xs:element name="p">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="l"/>
+        <xs:element ref="r"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  <!-- pair of strings -->
+  <xs:element name="l">
+    <xs:complexType mixed="true">
+      <xs:choice minOccurs="0" maxOccurs="unbounded">
+        <xs:element ref="a"/>
+        <xs:element ref="b"/>
+        <xs:element ref="g"/>
+        <xs:element ref="j"/>
+        <xs:element ref="s"/>
+      </xs:choice>
+    </xs:complexType>
+  </xs:element>
+  <!-- left part of p -->
+  <xs:element name="r">
+    <xs:complexType mixed="true">
+      <xs:choice minOccurs="0" maxOccurs="unbounded">
+        <xs:element ref="a"/>
+        <xs:element ref="b"/>
+        <xs:element ref="g"/>
+        <xs:element ref="j"/>
+        <xs:element ref="s"/>
+      </xs:choice>
+    </xs:complexType>
+  </xs:element>
+  <!-- right part of p -->
+  <xs:element name="a">
+    <xs:complexType/>
+  </xs:element>
+  <!-- post-generator wake-up mark -->
+  <xs:element name="b">
+    <xs:complexType/>
+  </xs:element>
+  <!-- blank chars block mark -->
+  <xs:element name="g">
+    <xs:complexType mixed="true">
+      <xs:choice minOccurs="0" maxOccurs="unbounded">
+        <xs:element ref="a"/>
+        <xs:element ref="b"/>
+        <xs:element ref="j"/>
+        <xs:element ref="s"/>
+      </xs:choice>
+      <xs:attribute name="i"/>
+    </xs:complexType>
+  </xs:element>
+  <!-- mark special groups in lemmas -->
+  <!-- i is used to co-index groups in the left with those -->
+  <!-- on the right of a pair -->
+  <xs:element name="j">
+    <xs:complexType/>
+  </xs:element>
+  <!-- join lexical forms -->
+  <xs:element name="s">
+    <xs:complexType>
+      <xs:attribute name="n" use="required"/>
+    </xs:complexType>
+  </xs:element>
+</xs:schema>
+<!-- reference to symbol (tag) -->
+<!-- n: symbol (tag) name -->
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xsd/acx.xsd
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xsd/acx.xsd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/xsd/acx.xsd	(revision 70339)
@@ -0,0 +1,35 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema" elementFormDefault="qualified">
+  <xs:element name="analysis-chars">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element maxOccurs="unbounded" ref="char"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  <xs:element name="char">
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element maxOccurs="unbounded" ref="equiv-char"/>
+      </xs:sequence>
+      <xs:attribute name="value" use="required">
+        <xs:simpleType>
+          <xs:restriction base="xs:token">
+            <xs:length value="1"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+  <xs:element name="equiv-char">
+    <xs:complexType>
+      <xs:attribute name="value" use="required">
+        <xs:simpleType>
+          <xs:restriction base="xs:token">
+            <xs:length value="1"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+</xs:schema>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-comp.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-comp.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-comp.1	(revision 70339)
@@ -0,0 +1,97 @@
+.TH lt-comp 1 2006-03-08 "" ""
+.SH NAME
+lt-comp \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B lt-comp
+[
+.B \-a \fR| 
+.B \-v \fR| 
+.B \-l \fR| 
+.B \-r \fR| 
+.B \-h
+]
+[
+.B lr \fR| 
+.B rl
+] dictionary_file output_file [acx_file]
+.PP
+.B lt-comp
+[
+.B \-\-alt \fR| 
+.B \-\-var \fR| 
+.B \-\-var\-left \fR| 
+.B \-\-var\-right \fR| 
+.B \-\-help
+]
+[
+.B lr \fR| 
+.B rl
+] dictionary_file output_file [acx_file]
+.PP
+.SH DESCRIPTION
+.BR lt-comp 
+Is the application responsible of compiling dictionaries used by
+\fBlt-proc\fR in \fIApertium\fR into a compact and efficient
+representation (a class of finite-state transducers called augmented
+letter transducers).
+.PP
+.SH OPTIONS
+.TP
+.B \-a, \-\-alt
+Sets the value of the \fIalt\fR attribute to use in compilation.
+
+Note that if no value is set, all entries containing an \fIalt\fR
+attribute are omitted.
+.TP
+.B \-v, \-\-var
+Sets the value of the \fIv\fR attribute to use in compilation. 
+This should only be used with monodixes; for bidixes, see \-l and \-r.
+
+Note that if no value is set, all entries containing a \fIv\fR
+attribute are considered to be \fIleft-to-right\fR.
+.TP
+.B \-l, \-\-var\-left
+Sets the value of the \fIvl\fR attribute for use in compilation of bidixes.
+"Left" here refers to the side of the dictionary, so this option is only valid
+in \fIrl\fR mode.
+.TP
+.B \-r, \-\-var\-right
+Sets the value of the \fIvr\fR attribute for use in compilation of bidixes.
+"Right" here refers to the side of the dictionary, so this option is only valid
+in \fIlr\fR mode.
+.TP
+.B \-h, \-\-help
+Prints a short help message
+.TP
+.B lr
+The resulting transducer will process dictionary entries
+\fIleft-to-right\fR.
+.TP
+.B rl
+The resulting transducer will process dictionary entries
+\fIright-to-left\fR.
+.SH FILES
+.B dictionary_file
+The input dictionary.
+.PP
+.B output_file
+The compiled dictionary (a finite state transducer).
+.PP
+.B acx_file
+Optional XML file of equivalent characters in monodices.
+
+.SH SEE ALSO
+.I lt-proc\fR(1),
+.I lt-expand\fR(1),
+.I apertium-tagger\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. 
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-expand.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-expand.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-expand.1	(revision 70339)
@@ -0,0 +1,71 @@
+.TH lt-expand 1 2006-03-08 "" ""
+.SH NAME
+lt-expand \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B lt-expand
+[
+.B \-a \fR| 
+.B \-v \fR| 
+.B \-l \fR| 
+.B \-r \fR| 
+.B \-h
+]
+dictionary_file [output_file]
+.PP
+.B lt-expand
+[
+.B \-\-alt \fR| 
+.B \-\-var \fR| 
+.B \-\-var\-left \fR| 
+.B \-\-var\-right \fR| 
+.B \-\-help
+]
+dictionary_file [output_file]
+.PP
+.SH DESCRIPTION
+.BR lt-expand 
+Is the application responsible for expanding a dictionary into a
+simple list of input string-output string pairs by eliminating
+paradigms through substitution and unfolding.
+.PP
+The output goes to \fIoutput_file\fR if it is present or to standard
+output if it is missing.
+.PP
+.SH OPTIONS
+.TP
+.B \-a, \-\-alt
+Sets the value of the \fIalt\fR attribute to use in expansion
+.TP
+.B \-v, \-\-var
+Sets the value of the \fIv\fR attribute to use in expansion of monodixes
+.TP
+.B \-l, \-\-var\-left
+Sets the value of the \fIvl\fR attribute to use in expansion of bidixes
+.TP
+.B \-r, \-\-var\-right
+Sets the value of the \fIvr\fR attribute to use in expansion of bidixes
+.TP
+.B \-h, \-\-help
+Prints a short help message
+.PP
+.SH FILES
+.B dictionary_file
+The input dictionary to expand.
+.PP
+.B output_file
+Text containing the expanded dictionary information.
+.SH SEE ALSO
+.I lt-proc\fR(1),
+.I lt-comp\fR(1),
+.I apertium-tagger\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. 
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-proc.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-proc.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-proc.1	(revision 70339)
@@ -0,0 +1,171 @@
+.TH lt-proc 1 2006-03-23 "" ""
+.SH NAME
+lt-proc \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B lt-proc
+[
+.B \-a \fR| 
+.B \-b \fR| 
+.B \-o \fR| 
+.B \-c \fR| 
+.B \-d \fR| 
+.B \-e \fR| 
+.B \-g \fR|
+.B \-n \fR|
+.B \-p \fR|
+.B \-s \fR|
+.B \-t \fR| 
+.B \-v \fR|
+.B \-h
+.B \-z
+.B \-w
+] fst_file [input_file [output_file]]
+.PP
+.B lt-proc
+[
+.B \-\-analysis \fR| 
+.B \-\-bilingual \fR|
+.B \-\-surf-bilingual \fR|
+.B \-\-case-sensitive \fR|
+.B \-\-debugged-gen \fR|
+.B \-\-decompose-nouns \fR|
+.B \-\-generation \fR|
+.B \-\-non-marked-gen \fR|
+.B \-\-tagged-gen \fR|
+.B \-\-post-generation \fR|
+.B \-\-sao \fR|
+.B \-\-transliteration \fR|
+.B \-\-null-flush
+.B \-\-dictionary-case
+.B \-\-decompose-compounds \fR|
+.B \-\-version \fR|
+.B \-\-help
+] fst_file [input_file [output_file]]
+.SH DESCRIPTION
+.BR lt-proc 
+is the application responsible for providing the four lexical
+processing functionalities
+
+.RS
+\(bu \fImorphological analyser\fR  ( option \fB\-a\fR )
+.PP
+\(bu \fIlexical transfer\fR  ( option \fB\-n\fR )
+.PP
+\(bu \fImorphological generator\fR  ( option \fB\-g\fR )
+.PP
+\(bu \fIpost-generator\fR  ( option \fB\-p\fR )
+.RE
+\fR
+.PP
+It accomplishes these tasks by reading binary files containing a
+compact and efficient representation of dictionaries (a class of
+finite-state transducers called augmented letter transducers). These
+files are generated by \fBlt\-comp(1)\fR.
+.PP
+It is worth to mention that some characters
+(`\fB[\fR', `\fB]\fR', `\fB$\fR', `\fB^\fR', `\fB/\fR', `\fB+\fR') are
+\fIspecial\fR chars used for format and encapsulation. They should be
+escaped if they have to be used literally, for
+instance: `\fB[\fR'...`\fB]\fR' are ignored and the format of a
+\fIlinefeed\fR is `\fB^\fR...\fB$\fR'.
+.SH OPTIONS
+.TP
+.B \-a, \-\-analysis
+Tokenizes the text in surface forms (lexical units as they appear in
+texts) and delivers, for each surface form, one or more lexical forms
+consisting of lemma, lexical category and morphological inflection
+information. Tokenization is not straightforward due to the existence,
+on the one hand, of contractions, and, on the other hand, of
+multi-word lexical units. For contractions, the system reads in a
+single surface form and delivers the corresponding sequence of lexical
+forms. Multi-word surface forms are analysed in a left-to-right,
+longest-match fashion. Multi-word surface forms may be invariable
+(such as a multi-word preposition or conjunction) or inflected (for
+example, in es, \fI"echaban de menos"\fR, \(dqthey missed\(dq, is a
+form of the imperfect indicative tense of the verb \fI"echar de
+menos"\fR, \(dqto miss\(dq). Limited support for some kinds of
+discontinuous multi-word units is also available. Single-word surface
+forms analysis produces output like the one in these examples:
+\ \fI"cantar"\fR \-> `\fI^cantar/cantar<vblex><inf>$\fR' or
+\ `\fI"daba"\fR \->
+\ `\fI^daba/dar<vblex><pii><p1><sg>/dar<vblex><pii><p3><sg>$\fR'.
+.TP
+.B \-b, \-\-bilingual
+Does lexical transference, attaching queues of morphological symbols
+not specified in the dictionaries. As the analysis mode, supports
+multiple lexical forms in the target language for a given lexical
+form in the source language. Works tipically with the output of
+apertium-pretransfer.
+.TP
+.B \-o, \-\-surf-bilingual
+As with \-b, but takes input from apertium\-tagger \-p , with
+surface forms, and if the lexical form is not found in the bilingual
+dictionary, it outputs the surface form of the word. 
+.TP
+
+.B \-c, \-\-case-sensitive
+Use the literal case of the incoming characters
+.TP
+.B \-d, \-\-debugged-gen
+Morph. generation with all the stuff
+.TP
+.B \-e, \-\-decompose-compounds
+Try to treat unknown words as compounds, and decompose them.
+.TP
+.B \-w, \-\-dictionary-case
+Use the case information contained in the lexicon, instead of the surface
+case (only applied in analysis mode).
+.TP
+.B \-g, \-\-generation
+Delivers a target-language surface form for each target-language
+lexical form, by suitably inflecting it.
+.TP
+.B \-n, \-\-non-marked-gen
+Morphological generation (like \fB-g\fR) but without unknown word
+marks (asterisk `*').
+.TP
+.B \-b, \-\-tagged-gen
+Morphological generation (like \fB-g\fR) but retaining part-of-speech
+tags.
+.TP
+.B \-p, \-\-post-generation
+Performs orthographical operations such as contractions and
+apostrophations. The post-generator is usually \fIdormant\fR (just
+copies the input to the output) until a special \fIalarm\fR symbol
+contained in some target-language surface forms \fIwakes\fR it up to
+perform a particular string transformation if necessary; then it goes
+back to sleep.
+.TP
+.B \-s, \-\-sao
+Input processing is in \fIorthoepikon\fR (previously `\fIsao\fR')
+annotation system format: \fBhttp://orthoepikon.sf.net\fR.
+.TP
+.B \-t, \-\-transliteration
+Apply a transliteration dictionary
+.TP
+.B \-z, \-\-null-flush
+Flush output on the null character
+.TP
+.B \-v, \-\-version
+Display the version number.
+.TP
+.B \-h, \-\-help
+Display this help.
+.SH FILES
+.B input_file
+The input compiled dictionary.
+.SH SEE ALSO
+.I lt-expand\fR(1),
+.I lt-comp\fR(1),
+.I apertium-tagger\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante.
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/pool.h
===================================================================
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-tmxcomp.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-tmxcomp.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-tmxcomp.1	(revision 70339)
@@ -0,0 +1,41 @@
+.TH lt-comp 1 2006-03-08 "" ""
+.SH NAME
+lt-tmxcomp \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B lt-tmxcomp
+lang1-lang2 tmx_file output_file
+.PP
+.SH DESCRIPTION
+.BR lt-comp 
+Is the application responsible for compiling translation memories in 
+the TMX format used by \fBlt-tmxproc\fR in \fIApertium\fR into a compact  
+and efficient representation (a class of finite-state transducers called 
+augmented letter transducers).
+.PP
+.SH OPTIONS
+.TP
+.B lang1
+Input language
+.TP
+.B lang2
+Output language
+.SH FILES
+.B tmx_file
+The input translation memory, in TMX format.
+.PP
+.B output_file
+The compiled translation memory (a finite state transducer).
+
+.SH SEE ALSO
+.I lt-tmxproc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. 
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-tmxproc.1
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-tmxproc.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lt-tmxproc.1	(revision 70339)
@@ -0,0 +1,33 @@
+.TH lt-proc 1 2006-03-23 "" ""
+.SH NAME
+lt-tmxproc \- This application is part of the lexical processing modules
+and tools (
+.B lttoolbox
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B lt-tmxproc
+fst_file [input_file [output_file]]
+.PP
+.SH DESCRIPTION
+.BR lt-tmxproc 
+is the application responsible for preprocessing the translation
+stream in Apertium using a compiled translation memory.
+
+.PP
+It accomplishes these tasks by reading binary files containing a
+compact and efficient representation of dictionaries (a class of
+finite-state transducers called augmented letter transducers). These
+files are generated by \fBlt\-tmxcomp(1)\fR.
+.SH FILES
+.B input_file
+The input compiled dictionary.
+.SH SEE ALSO
+.I lt-tmxcomp\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. 
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lttoolbox_config.h.cmake_in
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lttoolbox_config.h.cmake_in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lttoolbox_config.h.cmake_in	(revision 70339)
@@ -0,0 +1,57 @@
+/* Define to the address where bug reports for this package should be sent. */
+#define PACKAGE_BUGREPORT "${PACKAGE_BUGREPORT}"
+
+/* Define to the full name of this package. */
+#define PACKAGE_NAME "${PACKAGE_NAME}"
+
+/* Define to the full name and version of this package. */
+#define PACKAGE_STRING "${PACKAGE_STRING}"
+
+/* Define to the one symbol short name of this package. */
+#define PACKAGE_TARNAME "${PACKAGE_TARNAME}"
+
+/* Define to the version of this package. */
+#define PACKAGE_VERSION "${PACKAGE_VERSION}"
+
+#define HAVE_DECL_FPUTS_UNLOCKED   ${HAVE_DECL_FPUTS_UNLOCKED}
+#define HAVE_DECL_FGETC_UNLOCKED   ${HAVE_DECL_FGETC_UNLOCKED}
+#define HAVE_DECL_FPUTC_UNLOCKED   ${HAVE_DECL_FPUTC_UNLOCKED}
+#define HAVE_DECL_FWRITE_UNLOCKED  ${HAVE_DECL_FWRITE_UNLOCKED}
+#define HAVE_DECL_FREAD_UNLOCKED   ${HAVE_DECL_FREAD_UNLOCKED}
+#define HAVE_DECL_FGETWC_UNLOCKED  ${HAVE_DECL_FGETWC_UNLOCKED}
+#define HAVE_DECL_FPUTWC_UNLOCKED  ${HAVE_DECL_FPUTWC_UNLOCKED}
+#define HAVE_DECL_FPUTWS_UNLOCKED  ${HAVE_DECL_FPUTWS_UNLOCKED}
+
+#define HAVE_DECL_FPUTS_NOLOCK   ${HAVE_DECL_FPUTS_NOLOCK}
+#define HAVE_DECL_FGETC_NOLOCK   ${HAVE_DECL_FGETC_NOLOCK}
+#define HAVE_DECL_FPUTC_NOLOCK   ${HAVE_DECL_FPUTC_NOLOCK}
+#define HAVE_DECL_FWRITE_NOLOCK  ${HAVE_DECL_FWRITE_NOLOCK}
+#define HAVE_DECL_FREAD_NOLOCK   ${HAVE_DECL_FREAD_NOLOCK}
+#define HAVE_DECL_FGETWC_NOLOCK  ${HAVE_DECL_FGETWC_NOLOCK}
+#define HAVE_DECL_FPUTWC_NOLOCK  ${HAVE_DECL_FPUTWC_NOLOCK}
+#define HAVE_DECL_FPUTWS_NOLOCK  ${HAVE_DECL_FPUTWS_NOLOCK}
+
+#if !defined(HAVE_DECL_FPUTS_UNLOCKED) && defined (HAVE_DECL_FPUTS_NOLOCK)
+#define fputs_unlocked _fputs_nolock
+#endif
+#if !defined(HAVE_DECL_FGETC_UNLOCKED) && defined (HAVE_DECL_FGETC_NOLOCK)
+#define fgetc_unlocked _fgetc_nolock
+#endif
+#if !defined(HAVE_DECL_FPUTC_UNLOCKED) && defined (HAVE_DECL_FPUTC_NOLOCK)
+#define fputc_unlocked _fputc_nolock
+#endif
+#if !defined(HAVE_DECL_FWRITE_UNLOCKED) && defined (HAVE_DECL_FWRITE_NOLOCK)
+#define fwrite_unlocked _fwrite_nolock
+#endif
+#if !defined(HAVE_DECL_FREAD_UNLOCKED) && defined (HAVE_DECL_FREAD_NOLOCK)
+#define fread_unlocked _fread_nolock
+#endif
+#if !defined(HAVE_DECL_FPUTWS_UNLOCKED) && defined (HAVE_DECL_FPUTWS_NOLOCK)
+#define fputws_unlocked _fputws_nolock
+#endif
+#if !defined(HAVE_DECL_FGETWC_UNLOCKED) && defined (HAVE_DECL_FGETWC_NOLOCK)
+#define fgetwc_unlocked _fgetwc_nolock
+#endif
+#if !defined(HAVE_DECL_FPUTWC_UNLOCKED) && defined (HAVE_DECL_FPUTWC_NOLOCK)
+#define fputwc_unlocked _fputwc_nolock
+#endif

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/lttoolbox_config.h.cmake_in
___________________________________________________________________
Added: svn:mergeinfo
## -0,0 +0,0 ##
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/getopt.c
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/getopt.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/getopt.c	(revision 70339)
@@ -0,0 +1,81 @@
+/*
+Newsgroups: mod.std.unix
+Subject: public domain AT&T getopt source
+Date: 3 Nov 85 19:34:15 GMT
+
+Here's something you've all been waiting for:  the AT&T public domain
+source for getopt(3).  It is the code which was given out at the 1985
+UNIFORUM conference in Dallas.  I obtained it by electronic mail
+directly from AT&T.  The people there assure me that it is indeed
+in the public domain.
+*/
+
+#include "getopt.h"
+
+/*LINTLIBRARY*/
+
+extern unsigned int strlen();
+extern int strcmp();
+extern char *strchr();
+extern int write();
+
+#define NULL	0
+#define EOF	(-1)
+#define ERR(s, c)	if(opterr){\
+	char errbuf[2];\
+	errbuf[0] = c; errbuf[1] = '\n';\
+	(void) write(2, argv[0], (unsigned)strlen(argv[0]));\
+	(void) write(2, s, (unsigned)strlen(s));\
+	(void) write(2, errbuf, 2);}
+
+
+int	opterr = 1;
+int	optind = 1;
+int	optopt;
+char	*optarg;
+
+int
+getopt(argc, argv, opts)
+int	argc;
+char	**argv, *opts;
+{
+	static int sp = 1;
+	register int c;
+	register char *cp;
+
+	if(sp == 1)
+		if(optind >= argc ||
+		   argv[optind][0] != '-' || argv[optind][1] == '\0')
+			return(EOF);
+		else if(strcmp(argv[optind], "--") == NULL) {
+			optind++;
+			return(EOF);
+		}
+	optopt = c = argv[optind][sp];
+	if(c == ':' || (cp=strchr(opts, c)) == NULL) {
+		ERR(": illegal option -- ", c);
+		if(argv[optind][++sp] == '\0') {
+			optind++;
+			sp = 1;
+		}
+		return('?');
+	}
+	if(*++cp == ':') {
+		if(argv[optind][sp+1] != '\0')
+			optarg = &argv[optind++][sp+1];
+		else if(++optind >= argc) {
+			ERR(": option requires an argument -- ", c);
+			sp = 1;
+			return('?');
+		} else
+			optarg = argv[optind++];
+		sp = 1;
+	} else {
+		if(argv[optind][++sp] == '\0') {
+			sp = 1;
+			optind++;
+		}
+		optarg = NULL;
+	}
+	return(c);
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/Makefile.am	(revision 70339)
@@ -0,0 +1 @@
+EXTRA_DIST =  getopt.c getopt.h libgen.c libgen.h regex.c regex.h unistd.h
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/regex.c
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/regex.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/regex.c	(revision 70339)
@@ -0,0 +1,4948 @@
+/* Extended regular expression matching and search library,
+   version 0.12.
+   (Implements POSIX draft P10003.2/D11.2, except for
+   internationalization features.)
+
+   Copyright (C) 1993 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
+
+/* AIX requires this to be the first thing in the file. */
+#if defined (_AIX) && !defined (REGEX_MALLOC)
+  #pragma alloca
+#endif
+
+#define _GNU_SOURCE
+
+/* We need this for `regex.h', and perhaps for the Emacs include files.  */
+#include <sys/types.h>
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+/* The `emacs' switch turns on certain matching commands
+   that make sense only in Emacs. */
+#ifdef emacs
+
+#include "lisp.h"
+#include "buffer.h"
+#include "syntax.h"
+
+/* Emacs uses `NULL' as a predicate.  */
+#undef NULL
+
+#else  /* not emacs */
+
+/* We used to test for `BSTRING' here, but only GCC and Emacs define
+   `BSTRING', as far as I know, and neither of them use this code.  */
+#if HAVE_STRING_H || STDC_HEADERS
+#include <string.h>
+#ifndef bcmp
+#define bcmp(s1, s2, n)	memcmp ((s1), (s2), (n))
+#endif
+#ifndef bcopy
+#define bcopy(s, d, n)	memcpy ((d), (s), (n))
+#endif
+#ifndef bzero
+#define bzero(s, n)	memset ((s), 0, (n))
+#endif
+#else
+#include <strings.h>
+#endif
+
+#ifdef STDC_HEADERS
+#include <stdlib.h>
+#else
+char *malloc ();
+char *realloc ();
+#endif
+
+
+/* Define the syntax stuff for \<, \>, etc.  */
+
+/* This must be nonzero for the wordchar and notwordchar pattern
+   commands in re_match_2.  */
+#ifndef Sword
+#define Sword 1
+#endif
+
+#ifdef SYNTAX_TABLE
+
+extern char *re_syntax_table;
+
+#else /* not SYNTAX_TABLE */
+
+/* How many characters in the character set.  */
+#define CHAR_SET_SIZE 256
+
+static char re_syntax_table[CHAR_SET_SIZE];
+
+static void
+init_syntax_once ()
+{
+   register int c;
+   static int done = 0;
+
+   if (done)
+     return;
+
+   bzero (re_syntax_table, sizeof re_syntax_table);
+
+   for (c = 'a'; c <= 'z'; c++)
+     re_syntax_table[c] = Sword;
+
+   for (c = 'A'; c <= 'Z'; c++)
+     re_syntax_table[c] = Sword;
+
+   for (c = '0'; c <= '9'; c++)
+     re_syntax_table[c] = Sword;
+
+   re_syntax_table['_'] = Sword;
+
+   done = 1;
+}
+
+#endif /* not SYNTAX_TABLE */
+
+#define SYNTAX(c) re_syntax_table[c]
+
+#endif /* not emacs */
+
+/* Get the interface, including the syntax bits.  */
+#include "regex.h"
+
+/* isalpha etc. are used for the character classes.  */
+#include <ctype.h>
+
+#ifndef isascii
+#define isascii(c) 1
+#endif
+
+#ifdef isblank
+#define ISBLANK(c) (isascii (c) && isblank (c))
+#else
+#define ISBLANK(c) ((c) == ' ' || (c) == '\t')
+#endif
+#ifdef isgraph
+#define ISGRAPH(c) (isascii (c) && isgraph (c))
+#else
+#define ISGRAPH(c) (isascii (c) && isprint (c) && !isspace (c))
+#endif
+
+#define ISPRINT(c) (isascii (c) && isprint (c))
+#define ISDIGIT(c) (isascii (c) && isdigit (c))
+#define ISALNUM(c) (isascii (c) && isalnum (c))
+#define ISALPHA(c) (isascii (c) && isalpha (c))
+#define ISCNTRL(c) (isascii (c) && iscntrl (c))
+#define ISLOWER(c) (isascii (c) && islower (c))
+#define ISPUNCT(c) (isascii (c) && ispunct (c))
+#define ISSPACE(c) (isascii (c) && isspace (c))
+#define ISUPPER(c) (isascii (c) && isupper (c))
+#define ISXDIGIT(c) (isascii (c) && isxdigit (c))
+
+#ifndef NULL
+#define NULL 0
+#endif
+
+/* We remove any previous definition of `SIGN_EXTEND_CHAR',
+   since ours (we hope) works properly with all combinations of
+   machines, compilers, `char' and `unsigned char' argument types.
+   (Per Bothner suggested the basic approach.)  */
+#undef SIGN_EXTEND_CHAR
+#if __STDC__
+#define SIGN_EXTEND_CHAR(c) ((signed char) (c))
+#else  /* not __STDC__ */
+/* As in Harbison and Steele.  */
+#define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
+#endif
+
+/* Should we use malloc or alloca?  If REGEX_MALLOC is not defined, we
+   use `alloca' instead of `malloc'.  This is because using malloc in
+   re_search* or re_match* could cause memory leaks when C-g is used in
+   Emacs; also, malloc is slower and causes storage fragmentation.  On
+   the other hand, malloc is more portable, and easier to debug.
+
+   Because we sometimes use alloca, some routines have to be macros,
+   not functions -- `alloca'-allocated space disappears at the end of the
+   function it is called in.  */
+
+#ifdef REGEX_MALLOC
+
+#define REGEX_ALLOCATE malloc
+#define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize)
+
+#else /* not REGEX_MALLOC  */
+
+/* Emacs already defines alloca, sometimes.  */
+#ifndef alloca
+
+/* Make alloca work the best possible way.  */
+#ifdef __GNUC__
+#define alloca __builtin_alloca
+#else /* not __GNUC__ */
+#if HAVE_ALLOCA_H
+#include <alloca.h>
+#else /* not __GNUC__ or HAVE_ALLOCA_H */
+#ifndef _AIX /* Already did AIX, up at the top.  */
+char *alloca ();
+#endif /* not _AIX */
+#endif /* not HAVE_ALLOCA_H */
+#endif /* not __GNUC__ */
+
+#endif /* not alloca */
+
+#define REGEX_ALLOCATE alloca
+
+/* Assumes a `char *destination' variable.  */
+#define REGEX_REALLOCATE(source, osize, nsize)				\
+  (destination = (char *) alloca (nsize),				\
+   bcopy (source, destination, osize),					\
+   destination)
+
+#endif /* not REGEX_MALLOC */
+
+
+/* True if `size1' is non-NULL and PTR is pointing anywhere inside
+   `string1' or just past its end.  This works if PTR is NULL, which is
+   a good thing.  */
+#define FIRST_STRING_P(ptr) 					\
+  (size1 && string1 <= (ptr) && (ptr) <= string1 + size1)
+
+/* (Re)Allocate N items of type T using malloc, or fail.  */
+#define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t)))
+#define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t)))
+#define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t)))
+
+#define BYTEWIDTH 8 /* In bits.  */
+
+#define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
+
+#define MAX(a, b) ((a) > (b) ? (a) : (b))
+#define MIN(a, b) ((a) < (b) ? (a) : (b))
+
+typedef char boolean;
+#define false 0
+#define true 1
+
+/* These are the command codes that appear in compiled regular
+   expressions.  Some opcodes are followed by argument bytes.  A
+   command code can specify any interpretation whatsoever for its
+   arguments.  Zero bytes may appear in the compiled regular expression.
+
+   The value of `exactn' is needed in search.c (search_buffer) in Emacs.
+   So regex.h defines a symbol `RE_EXACTN_VALUE' to be 1; the value of
+   `exactn' we use here must also be 1.  */
+
+typedef enum
+{
+  no_op = 0,
+
+        /* Followed by one byte giving n, then by n literal bytes.  */
+  exactn = 1,
+
+        /* Matches any (more or less) character.  */
+  anychar,
+
+        /* Matches any one char belonging to specified set.  First
+           following byte is number of bitmap bytes.  Then come bytes
+           for a bitmap saying which chars are in.  Bits in each byte
+           are ordered low-bit-first.  A character is in the set if its
+           bit is 1.  A character too large to have a bit in the map is
+           automatically not in the set.  */
+  charset,
+
+        /* Same parameters as charset, but match any character that is
+           not one of those specified.  */
+  charset_not,
+
+        /* Start remembering the text that is matched, for storing in a
+           register.  Followed by one byte with the register number, in
+           the range 0 to one less than the pattern buffer's re_nsub
+           field.  Then followed by one byte with the number of groups
+           inner to this one.  (This last has to be part of the
+           start_memory only because we need it in the on_failure_jump
+           of re_match_2.)  */
+  start_memory,
+
+        /* Stop remembering the text that is matched and store it in a
+           memory register.  Followed by one byte with the register
+           number, in the range 0 to one less than `re_nsub' in the
+           pattern buffer, and one byte with the number of inner groups,
+           just like `start_memory'.  (We need the number of inner
+           groups here because we don't have any easy way of finding the
+           corresponding start_memory when we're at a stop_memory.)  */
+  stop_memory,
+
+        /* Match a duplicate of something remembered. Followed by one
+           byte containing the register number.  */
+  duplicate,
+
+        /* Fail unless at beginning of line.  */
+  begline,
+
+        /* Fail unless at end of line.  */
+  endline,
+
+        /* Succeeds if at beginning of buffer (if emacs) or at beginning
+           of string to be matched (if not).  */
+  begbuf,
+
+        /* Analogously, for end of buffer/string.  */
+  endbuf,
+
+        /* Followed by two byte relative address to which to jump.  */
+  jump,
+
+    /* Same as jump, but marks the end of an alternative.  */
+  jump_past_alt,
+
+        /* Followed by two-byte relative address of place to resume at
+           in case of failure.  */
+  on_failure_jump,
+
+        /* Like on_failure_jump, but pushes a placeholder instead of the
+           current string position when executed.  */
+  on_failure_keep_string_jump,
+
+        /* Throw away latest failure point and then jump to following
+           two-byte relative address.  */
+  pop_failure_jump,
+
+        /* Change to pop_failure_jump if know won't have to backtrack to
+           match; otherwise change to jump.  This is used to jump
+           back to the beginning of a repeat.  If what follows this jump
+           clearly won't match what the repeat does, such that we can be
+           sure that there is no use backtracking out of repetitions
+           already matched, then we change it to a pop_failure_jump.
+           Followed by two-byte address.  */
+  maybe_pop_jump,
+
+        /* Jump to following two-byte address, and push a dummy failure
+           point. This failure point will be thrown away if an attempt
+           is made to use it for a failure.  A `+' construct makes this
+           before the first repeat.  Also used as an intermediary kind
+           of jump when compiling an alternative.  */
+  dummy_failure_jump,
+
+    /* Push a dummy failure point and continue.  Used at the end of
+       alternatives.  */
+  push_dummy_failure,
+
+        /* Followed by two-byte relative address and two-byte number n.
+           After matching N times, jump to the address upon failure.  */
+  succeed_n,
+
+        /* Followed by two-byte relative address, and two-byte number n.
+           Jump to the address N times, then fail.  */
+  jump_n,
+
+        /* Set the following two-byte relative address to the
+           subsequent two-byte number.  The address *includes* the two
+           bytes of number.  */
+  set_number_at,
+
+  wordchar,	/* Matches any word-constituent character.  */
+  notwordchar,	/* Matches any char that is not a word-constituent.  */
+
+  wordbeg,	/* Succeeds if at word beginning.  */
+  wordend,	/* Succeeds if at word end.  */
+
+  wordbound,	/* Succeeds if at a word boundary.  */
+  notwordbound	/* Succeeds if not at a word boundary.  */
+
+#ifdef emacs
+  ,before_dot,	/* Succeeds if before point.  */
+  at_dot,	/* Succeeds if at point.  */
+  after_dot,	/* Succeeds if after point.  */
+
+    /* Matches any character whose syntax is specified.  Followed by
+           a byte which contains a syntax code, e.g., Sword.  */
+  syntaxspec,
+
+    /* Matches any character whose syntax is not that specified.  */
+  notsyntaxspec
+#endif /* emacs */
+} re_opcode_t;
+
+/* Common operations on the compiled pattern.  */
+
+/* Store NUMBER in two contiguous bytes starting at DESTINATION.  */
+
+#define STORE_NUMBER(destination, number)				\
+  do {									\
+    (destination)[0] = (number) & 0377;					\
+    (destination)[1] = (number) >> 8;					\
+  } while (0)
+
+/* Same as STORE_NUMBER, except increment DESTINATION to
+   the byte after where the number is stored.  Therefore, DESTINATION
+   must be an lvalue.  */
+
+#define STORE_NUMBER_AND_INCR(destination, number)			\
+  do {									\
+    STORE_NUMBER (destination, number);					\
+    (destination) += 2;							\
+  } while (0)
+
+/* Put into DESTINATION a number stored in two contiguous bytes starting
+   at SOURCE.  */
+
+#define EXTRACT_NUMBER(destination, source)				\
+  do {									\
+    (destination) = *(source) & 0377;					\
+    (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8;		\
+  } while (0)
+
+#ifdef DEBUG
+static void
+extract_number (dest, source)
+    int *dest;
+    unsigned char *source;
+{
+  int temp = SIGN_EXTEND_CHAR (*(source + 1));
+  *dest = *source & 0377;
+  *dest += temp << 8;
+}
+
+#ifndef EXTRACT_MACROS /* To debug the macros.  */
+#undef EXTRACT_NUMBER
+#define EXTRACT_NUMBER(dest, src) extract_number (&dest, src)
+#endif /* not EXTRACT_MACROS */
+
+#endif /* DEBUG */
+
+/* Same as EXTRACT_NUMBER, except increment SOURCE to after the number.
+   SOURCE must be an lvalue.  */
+
+#define EXTRACT_NUMBER_AND_INCR(destination, source)			\
+  do {									\
+    EXTRACT_NUMBER (destination, source);				\
+    (source) += 2; 							\
+  } while (0)
+
+#ifdef DEBUG
+static void
+extract_number_and_incr (destination, source)
+    int *destination;
+    unsigned char **source;
+{
+  extract_number (destination, *source);
+  *source += 2;
+}
+
+#ifndef EXTRACT_MACROS
+#undef EXTRACT_NUMBER_AND_INCR
+#define EXTRACT_NUMBER_AND_INCR(dest, src) \
+  extract_number_and_incr (&dest, &src)
+#endif /* not EXTRACT_MACROS */
+
+#endif /* DEBUG */
+
+/* If DEBUG is defined, Regex prints many voluminous messages about what
+   it is doing (if the variable `debug' is nonzero).  If linked with the
+   main program in `iregex.c', you can enter patterns and strings
+   interactively.  And if linked with the main program in `main.c' and
+   the other test files, you can run the already-written tests.  */
+
+#ifdef DEBUG
+
+/* We use standard I/O for debugging.  */
+#include <stdio.h>
+
+/* It is useful to test things that ``must'' be true when debugging.  */
+#include <assert.h>
+
+static int debug = 0;
+
+#define DEBUG_STATEMENT(e) e
+#define DEBUG_PRINT1(x) if (debug) printf (x)
+#define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2)
+#define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3)
+#define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4)
+#define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) 				\
+  if (debug) print_partial_compiled_pattern (s, e)
+#define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)			\
+  if (debug) print_double_string (w, s1, sz1, s2, sz2)
+
+
+extern void printchar ();
+
+/* Print the fastmap in human-readable form.  */
+
+void
+print_fastmap (fastmap)
+    char *fastmap;
+{
+  unsigned was_a_range = 0;
+  unsigned i = 0;
+
+  while (i < (1 << BYTEWIDTH))
+    {
+      if (fastmap[i++])
+    {
+      was_a_range = 0;
+          printchar (i - 1);
+          while (i < (1 << BYTEWIDTH)  &&  fastmap[i])
+            {
+              was_a_range = 1;
+              i++;
+            }
+      if (was_a_range)
+            {
+              printf ("-");
+              printchar (i - 1);
+            }
+        }
+    }
+  putchar ('\n');
+}
+
+
+/* Print a compiled pattern string in human-readable form, starting at
+   the START pointer into it and ending just before the pointer END.  */
+
+void
+print_partial_compiled_pattern (start, end)
+    unsigned char *start;
+    unsigned char *end;
+{
+  int mcnt, mcnt2;
+  unsigned char *p = start;
+  unsigned char *pend = end;
+
+  if (start == NULL)
+    {
+      printf ("(null)\n");
+      return;
+    }
+
+  /* Loop over pattern commands.  */
+  while (p < pend)
+    {
+      switch ((re_opcode_t) *p++)
+    {
+        case no_op:
+          printf ("/no_op");
+          break;
+
+    case exactn:
+      mcnt = *p++;
+          printf ("/exactn/%d", mcnt);
+          do
+        {
+              putchar ('/');
+          printchar (*p++);
+            }
+          while (--mcnt);
+          break;
+
+    case start_memory:
+          mcnt = *p++;
+          printf ("/start_memory/%d/%d", mcnt, *p++);
+          break;
+
+    case stop_memory:
+          mcnt = *p++;
+      printf ("/stop_memory/%d/%d", mcnt, *p++);
+          break;
+
+    case duplicate:
+      printf ("/duplicate/%d", *p++);
+      break;
+
+    case anychar:
+      printf ("/anychar");
+      break;
+
+    case charset:
+        case charset_not:
+          {
+            register int c;
+
+            printf ("/charset%s",
+                (re_opcode_t) *(p - 1) == charset_not ? "_not" : "");
+
+            assert (p + *p < pend);
+
+            for (c = 0; c < *p; c++)
+              {
+                unsigned bit;
+                unsigned char map_byte = p[1 + c];
+
+                putchar ('/');
+
+        for (bit = 0; bit < BYTEWIDTH; bit++)
+                  if (map_byte & (1 << bit))
+                    printchar (c * BYTEWIDTH + bit);
+              }
+        p += 1 + *p;
+        break;
+      }
+
+    case begline:
+      printf ("/begline");
+          break;
+
+    case endline:
+          printf ("/endline");
+          break;
+
+    case on_failure_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/on_failure_jump/0/%d", mcnt);
+          break;
+
+    case on_failure_keep_string_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/on_failure_keep_string_jump/0/%d", mcnt);
+          break;
+
+    case dummy_failure_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/dummy_failure_jump/0/%d", mcnt);
+          break;
+
+    case push_dummy_failure:
+          printf ("/push_dummy_failure");
+          break;
+
+        case maybe_pop_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/maybe_pop_jump/0/%d", mcnt);
+      break;
+
+        case pop_failure_jump:
+      extract_number_and_incr (&mcnt, &p);
+      printf ("/pop_failure_jump/0/%d", mcnt);
+      break;
+
+        case jump_past_alt:
+      extract_number_and_incr (&mcnt, &p);
+      printf ("/jump_past_alt/0/%d", mcnt);
+      break;
+
+        case jump:
+      extract_number_and_incr (&mcnt, &p);
+      printf ("/jump/0/%d", mcnt);
+      break;
+
+        case succeed_n:
+          extract_number_and_incr (&mcnt, &p);
+          extract_number_and_incr (&mcnt2, &p);
+      printf ("/succeed_n/0/%d/0/%d", mcnt, mcnt2);
+          break;
+
+        case jump_n:
+          extract_number_and_incr (&mcnt, &p);
+          extract_number_and_incr (&mcnt2, &p);
+      printf ("/jump_n/0/%d/0/%d", mcnt, mcnt2);
+          break;
+
+        case set_number_at:
+          extract_number_and_incr (&mcnt, &p);
+          extract_number_and_incr (&mcnt2, &p);
+      printf ("/set_number_at/0/%d/0/%d", mcnt, mcnt2);
+          break;
+
+        case wordbound:
+      printf ("/wordbound");
+      break;
+
+    case notwordbound:
+      printf ("/notwordbound");
+          break;
+
+    case wordbeg:
+      printf ("/wordbeg");
+      break;
+
+    case wordend:
+      printf ("/wordend");
+
+#ifdef emacs
+    case before_dot:
+      printf ("/before_dot");
+          break;
+
+    case at_dot:
+      printf ("/at_dot");
+          break;
+
+    case after_dot:
+      printf ("/after_dot");
+          break;
+
+    case syntaxspec:
+          printf ("/syntaxspec");
+      mcnt = *p++;
+      printf ("/%d", mcnt);
+          break;
+
+    case notsyntaxspec:
+          printf ("/notsyntaxspec");
+      mcnt = *p++;
+      printf ("/%d", mcnt);
+      break;
+#endif /* emacs */
+
+    case wordchar:
+      printf ("/wordchar");
+          break;
+
+    case notwordchar:
+      printf ("/notwordchar");
+          break;
+
+    case begbuf:
+      printf ("/begbuf");
+          break;
+
+    case endbuf:
+      printf ("/endbuf");
+          break;
+
+        default:
+          printf ("?%d", *(p-1));
+    }
+    }
+  printf ("/\n");
+}
+
+
+void
+print_compiled_pattern (bufp)
+    struct re_pattern_buffer *bufp;
+{
+  unsigned char *buffer = bufp->buffer;
+
+  print_partial_compiled_pattern (buffer, buffer + bufp->used);
+  printf ("%d bytes used/%d bytes allocated.\n", bufp->used, bufp->allocated);
+
+  if (bufp->fastmap_accurate && bufp->fastmap)
+    {
+      printf ("fastmap: ");
+      print_fastmap (bufp->fastmap);
+    }
+
+  printf ("re_nsub: %d\t", bufp->re_nsub);
+  printf ("regs_alloc: %d\t", bufp->regs_allocated);
+  printf ("can_be_null: %d\t", bufp->can_be_null);
+  printf ("newline_anchor: %d\n", bufp->newline_anchor);
+  printf ("no_sub: %d\t", bufp->no_sub);
+  printf ("not_bol: %d\t", bufp->not_bol);
+  printf ("not_eol: %d\t", bufp->not_eol);
+  printf ("syntax: %d\n", bufp->syntax);
+  /* Perhaps we should print the translate table?  */
+}
+
+
+void
+print_double_string (where, string1, size1, string2, size2)
+    const char *where;
+    const char *string1;
+    const char *string2;
+    int size1;
+    int size2;
+{
+  unsigned this_char;
+
+  if (where == NULL)
+    printf ("(null)");
+  else
+    {
+      if (FIRST_STRING_P (where))
+        {
+          for (this_char = where - string1; this_char < size1; this_char++)
+            printchar (string1[this_char]);
+
+          where = string2;
+        }
+
+      for (this_char = where - string2; this_char < size2; this_char++)
+        printchar (string2[this_char]);
+    }
+}
+
+#else /* not DEBUG */
+
+#undef assert
+#define assert(e)
+
+#define DEBUG_STATEMENT(e)
+#define DEBUG_PRINT1(x)
+#define DEBUG_PRINT2(x1, x2)
+#define DEBUG_PRINT3(x1, x2, x3)
+#define DEBUG_PRINT4(x1, x2, x3, x4)
+#define DEBUG_PRINT_COMPILED_PATTERN(p, s, e)
+#define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
+
+#endif /* not DEBUG */
+
+/* Set by `re_set_syntax' to the current regexp syntax to recognize.  Can
+   also be assigned to arbitrarily: each pattern buffer stores its own
+   syntax, so it can be changed between regex compilations.  */
+reg_syntax_t re_syntax_options = RE_SYNTAX_EMACS;
+
+
+/* Specify the precise syntax of regexps for compilation.  This provides
+   for compatibility for various utilities which historically have
+   different, incompatible syntaxes.
+
+   The argument SYNTAX is a bit mask comprised of the various bits
+   defined in regex.h.  We return the old syntax.  */
+
+reg_syntax_t
+re_set_syntax (syntax)
+    reg_syntax_t syntax;
+{
+  reg_syntax_t ret = re_syntax_options;
+
+  re_syntax_options = syntax;
+  return ret;
+}
+
+/* This table gives an error message for each of the error codes listed
+   in regex.h.  Obviously the order here has to be same as there.  */
+
+static const char *re_error_msg[] =
+  { NULL,					/* REG_NOERROR */
+    "No match",					/* REG_NOMATCH */
+    "Invalid regular expression",		/* REG_BADPAT */
+    "Invalid collation character",		/* REG_ECOLLATE */
+    "Invalid character class name",		/* REG_ECTYPE */
+    "Trailing backslash",			/* REG_EESCAPE */
+    "Invalid back reference",			/* REG_ESUBREG */
+    "Unmatched [ or [^",			/* REG_EBRACK */
+    "Unmatched ( or \\(",			/* REG_EPAREN */
+    "Unmatched \\{",				/* REG_EBRACE */
+    "Invalid content of \\{\\}",		/* REG_BADBR */
+    "Invalid range end",			/* REG_ERANGE */
+    "Memory exhausted",				/* REG_ESPACE */
+    "Invalid preceding regular expression",	/* REG_BADRPT */
+    "Premature end of regular expression",	/* REG_EEND */
+    "Regular expression too big",		/* REG_ESIZE */
+    "Unmatched ) or \\)",			/* REG_ERPAREN */
+  };
+
+/* Subroutine declarations and macros for regex_compile.  */
+
+static void store_op1 (), store_op2 ();
+static void insert_op1 (), insert_op2 ();
+static boolean at_begline_loc_p (), at_endline_loc_p ();
+static boolean group_in_compile_stack ();
+static reg_errcode_t compile_range ();
+
+/* Fetch the next character in the uncompiled pattern---translating it
+   if necessary.  Also cast from a signed character in the constant
+   string passed to us by the user to an unsigned char that we can use
+   as an array index (in, e.g., `translate').  */
+#define PATFETCH(c)							\
+  do {if (p == pend) return REG_EEND;					\
+    c = (unsigned char) *p++;						\
+    if (translate) c = translate[c]; 					\
+  } while (0)
+
+/* Fetch the next character in the uncompiled pattern, with no
+   translation.  */
+#define PATFETCH_RAW(c)							\
+  do {if (p == pend) return REG_EEND;					\
+    c = (unsigned char) *p++; 						\
+  } while (0)
+
+/* Go backwards one character in the pattern.  */
+#define PATUNFETCH p--
+
+
+/* If `translate' is non-null, return translate[D], else just D.  We
+   cast the subscript to translate because some data is declared as
+   `char *', to avoid warnings when a string constant is passed.  But
+   when we use a character as a subscript we must make it unsigned.  */
+#define TRANSLATE(d) (translate ? translate[(unsigned char) (d)] : (d))
+
+
+/* Macros for outputting the compiled pattern into `buffer'.  */
+
+/* If the buffer isn't allocated when it comes in, use this.  */
+#define INIT_BUF_SIZE  32
+
+/* Make sure we have at least N more bytes of space in buffer.  */
+#define GET_BUFFER_SPACE(n)						\
+    while (b - bufp->buffer + (n) > bufp->allocated)			\
+      EXTEND_BUFFER ()
+
+/* Make sure we have one more byte of buffer space and then add C to it.  */
+#define BUF_PUSH(c)							\
+  do {									\
+    GET_BUFFER_SPACE (1);						\
+    *b++ = (unsigned char) (c);						\
+  } while (0)
+
+
+/* Ensure we have two more bytes of buffer space and then append C1 and C2.  */
+#define BUF_PUSH_2(c1, c2)						\
+  do {									\
+    GET_BUFFER_SPACE (2);						\
+    *b++ = (unsigned char) (c1);					\
+    *b++ = (unsigned char) (c2);					\
+  } while (0)
+
+
+/* As with BUF_PUSH_2, except for three bytes.  */
+#define BUF_PUSH_3(c1, c2, c3)						\
+  do {									\
+    GET_BUFFER_SPACE (3);						\
+    *b++ = (unsigned char) (c1);					\
+    *b++ = (unsigned char) (c2);					\
+    *b++ = (unsigned char) (c3);					\
+  } while (0)
+
+
+/* Store a jump with opcode OP at LOC to location TO.  We store a
+   relative address offset by the three bytes the jump itself occupies.  */
+#define STORE_JUMP(op, loc, to) \
+  store_op1 (op, loc, (to) - (loc) - 3)
+
+/* Likewise, for a two-argument jump.  */
+#define STORE_JUMP2(op, loc, to, arg) \
+  store_op2 (op, loc, (to) - (loc) - 3, arg)
+
+/* Like `STORE_JUMP', but for inserting.  Assume `b' is the buffer end.  */
+#define INSERT_JUMP(op, loc, to) \
+  insert_op1 (op, loc, (to) - (loc) - 3, b)
+
+/* Like `STORE_JUMP2', but for inserting.  Assume `b' is the buffer end.  */
+#define INSERT_JUMP2(op, loc, to, arg) \
+  insert_op2 (op, loc, (to) - (loc) - 3, arg, b)
+
+
+/* This is not an arbitrary limit: the arguments which represent offsets
+   into the pattern are two bytes long.  So if 2^16 bytes turns out to
+   be too small, many things would have to change.  */
+#define MAX_BUF_SIZE (1L << 16)
+
+
+/* Extend the buffer by twice its current size via realloc and
+   reset the pointers that pointed into the old block to point to the
+   correct places in the new one.  If extending the buffer results in it
+   being larger than MAX_BUF_SIZE, then flag memory exhausted.  */
+#define EXTEND_BUFFER()							\
+  do { 									\
+    unsigned char *old_buffer = bufp->buffer;				\
+    if (bufp->allocated == MAX_BUF_SIZE) 				\
+      return REG_ESIZE;							\
+    bufp->allocated <<= 1;						\
+    if (bufp->allocated > MAX_BUF_SIZE)					\
+      bufp->allocated = MAX_BUF_SIZE; 					\
+    bufp->buffer = (unsigned char *) realloc (bufp->buffer, bufp->allocated);\
+    if (bufp->buffer == NULL)						\
+      return REG_ESPACE;						\
+    /* If the buffer moved, move all the pointers into it.  */		\
+    if (old_buffer != bufp->buffer)					\
+      {									\
+        b = (b - old_buffer) + bufp->buffer;				\
+        begalt = (begalt - old_buffer) + bufp->buffer;			\
+        if (fixup_alt_jump)						\
+          fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer;\
+        if (laststart)							\
+          laststart = (laststart - old_buffer) + bufp->buffer;		\
+        if (pending_exact)						\
+          pending_exact = (pending_exact - old_buffer) + bufp->buffer;	\
+      }									\
+  } while (0)
+
+
+/* Since we have one byte reserved for the register number argument to
+   {start,stop}_memory, the maximum number of groups we can report
+   things about is what fits in that byte.  */
+#define MAX_REGNUM 255
+
+/* But patterns can have more than `MAX_REGNUM' registers.  We just
+   ignore the excess.  */
+typedef unsigned regnum_t;
+
+
+/* Macros for the compile stack.  */
+
+/* Since offsets can go either forwards or backwards, this type needs to
+   be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1.  */
+typedef int pattern_offset_t;
+
+typedef struct
+{
+  pattern_offset_t begalt_offset;
+  pattern_offset_t fixup_alt_jump;
+  pattern_offset_t inner_group_offset;
+  pattern_offset_t laststart_offset;
+  regnum_t regnum;
+} compile_stack_elt_t;
+
+
+typedef struct
+{
+  compile_stack_elt_t *stack;
+  unsigned size;
+  unsigned avail;			/* Offset of next open position.  */
+} compile_stack_type;
+
+
+#define INIT_COMPILE_STACK_SIZE 32
+
+#define COMPILE_STACK_EMPTY  (compile_stack.avail == 0)
+#define COMPILE_STACK_FULL  (compile_stack.avail == compile_stack.size)
+
+/* The next available element.  */
+#define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
+
+
+/* Set the bit for character C in a list.  */
+#define SET_LIST_BIT(c)                               \
+  (b[((unsigned char) (c)) / BYTEWIDTH]               \
+   |= 1 << (((unsigned char) c) % BYTEWIDTH))
+
+
+/* Get the next unsigned number in the uncompiled pattern.  */
+#define GET_UNSIGNED_NUMBER(num) 					\
+  { if (p != pend)							\
+     {									\
+       PATFETCH (c); 							\
+       while (ISDIGIT (c)) 						\
+         { 								\
+           if (num < 0)							\
+              num = 0;							\
+           num = num * 10 + c - '0'; 					\
+           if (p == pend) 						\
+              break; 							\
+           PATFETCH (c);						\
+         } 								\
+       } 								\
+    }
+
+#define CHAR_CLASS_MAX_LENGTH  6 /* Namely, `xdigit'.  */
+
+#define IS_CHAR_CLASS(string)						\
+   (STREQ (string, "alpha") || STREQ (string, "upper")			\
+    || STREQ (string, "lower") || STREQ (string, "digit")		\
+    || STREQ (string, "alnum") || STREQ (string, "xdigit")		\
+    || STREQ (string, "space") || STREQ (string, "print")		\
+    || STREQ (string, "punct") || STREQ (string, "graph")		\
+    || STREQ (string, "cntrl") || STREQ (string, "blank"))
+
+/* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX.
+   Returns one of error codes defined in `regex.h', or zero for success.
+
+   Assumes the `allocated' (and perhaps `buffer') and `translate'
+   fields are set in BUFP on entry.
+
+   If it succeeds, results are put in BUFP (if it returns an error, the
+   contents of BUFP are undefined):
+     `buffer' is the compiled pattern;
+     `syntax' is set to SYNTAX;
+     `used' is set to the length of the compiled pattern;
+     `fastmap_accurate' is zero;
+     `re_nsub' is the number of subexpressions in PATTERN;
+     `not_bol' and `not_eol' are zero;
+
+   The `fastmap' and `newline_anchor' fields are neither
+   examined nor set.  */
+
+static reg_errcode_t
+regex_compile (pattern, size, syntax, bufp)
+     const char *pattern;
+     int size;
+     reg_syntax_t syntax;
+     struct re_pattern_buffer *bufp;
+{
+  /* We fetch characters from PATTERN here.  Even though PATTERN is
+     `char *' (i.e., signed), we declare these variables as unsigned, so
+     they can be reliably used as array indices.  */
+  register unsigned char c, c1;
+
+  /* A random tempory spot in PATTERN.  */
+  const char *p1;
+
+  /* Points to the end of the buffer, where we should append.  */
+  register unsigned char *b;
+
+  /* Keeps track of unclosed groups.  */
+  compile_stack_type compile_stack;
+
+  /* Points to the current (ending) position in the pattern.  */
+  const char *p = pattern;
+  const char *pend = pattern + size;
+
+  /* How to translate the characters in the pattern.  */
+  char *translate = bufp->translate;
+
+  /* Address of the count-byte of the most recently inserted `exactn'
+     command.  This makes it possible to tell if a new exact-match
+     character can be added to that command or if the character requires
+     a new `exactn' command.  */
+  unsigned char *pending_exact = 0;
+
+  /* Address of start of the most recently finished expression.
+     This tells, e.g., postfix * where to find the start of its
+     operand.  Reset at the beginning of groups and alternatives.  */
+  unsigned char *laststart = 0;
+
+  /* Address of beginning of regexp, or inside of last group.  */
+  unsigned char *begalt;
+
+  /* Place in the uncompiled pattern (i.e., the {) to
+     which to go back if the interval is invalid.  */
+  const char *beg_interval;
+
+  /* Address of the place where a forward jump should go to the end of
+     the containing expression.  Each alternative of an `or' -- except the
+     last -- ends with a forward jump of this sort.  */
+  unsigned char *fixup_alt_jump = 0;
+
+  /* Counts open-groups as they are encountered.  Remembered for the
+     matching close-group on the compile stack, so the same register
+     number is put in the stop_memory as the start_memory.  */
+  regnum_t regnum = 0;
+
+#ifdef DEBUG
+  DEBUG_PRINT1 ("\nCompiling pattern: ");
+  if (debug)
+    {
+      unsigned debug_count;
+
+      for (debug_count = 0; debug_count < size; debug_count++)
+        printchar (pattern[debug_count]);
+      putchar ('\n');
+    }
+#endif /* DEBUG */
+
+  /* Initialize the compile stack.  */
+  compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t);
+  if (compile_stack.stack == NULL)
+    return REG_ESPACE;
+
+  compile_stack.size = INIT_COMPILE_STACK_SIZE;
+  compile_stack.avail = 0;
+
+  /* Initialize the pattern buffer.  */
+  bufp->syntax = syntax;
+  bufp->fastmap_accurate = 0;
+  bufp->not_bol = bufp->not_eol = 0;
+
+  /* Set `used' to zero, so that if we return an error, the pattern
+     printer (for debugging) will think there's no pattern.  We reset it
+     at the end.  */
+  bufp->used = 0;
+
+  /* Always count groups, whether or not bufp->no_sub is set.  */
+  bufp->re_nsub = 0;
+
+#if !defined (emacs) && !defined (SYNTAX_TABLE)
+  /* Initialize the syntax table.  */
+   init_syntax_once ();
+#endif
+
+  if (bufp->allocated == 0)
+    {
+      if (bufp->buffer)
+    { /* If zero allocated, but buffer is non-null, try to realloc
+             enough space.  This loses if buffer's address is bogus, but
+             that is the user's responsibility.  */
+          RETALLOC (bufp->buffer, INIT_BUF_SIZE, unsigned char);
+        }
+      else
+        { /* Caller did not allocate a buffer.  Do it for them.  */
+          bufp->buffer = TALLOC (INIT_BUF_SIZE, unsigned char);
+        }
+      if (!bufp->buffer) return REG_ESPACE;
+
+      bufp->allocated = INIT_BUF_SIZE;
+    }
+
+  begalt = b = bufp->buffer;
+
+  /* Loop through the uncompiled pattern until we're at the end.  */
+  while (p != pend)
+    {
+      PATFETCH (c);
+
+      switch (c)
+        {
+        case '^':
+          {
+            if (   /* If at start of pattern, it's an operator.  */
+                   p == pattern + 1
+                   /* If context independent, it's an operator.  */
+                || syntax & RE_CONTEXT_INDEP_ANCHORS
+                   /* Otherwise, depends on what's come before.  */
+                || at_begline_loc_p (pattern, p, syntax))
+              BUF_PUSH (begline);
+            else
+              goto normal_char;
+          }
+          break;
+
+
+        case '$':
+          {
+            if (   /* If at end of pattern, it's an operator.  */
+                   p == pend
+                   /* If context independent, it's an operator.  */
+                || syntax & RE_CONTEXT_INDEP_ANCHORS
+                   /* Otherwise, depends on what's next.  */
+                || at_endline_loc_p (p, pend, syntax))
+               BUF_PUSH (endline);
+             else
+               goto normal_char;
+           }
+           break;
+
+
+    case '+':
+        case '?':
+          if ((syntax & RE_BK_PLUS_QM)
+              || (syntax & RE_LIMITED_OPS))
+            goto normal_char;
+        handle_plus:
+        case '*':
+          /* If there is no previous pattern... */
+          if (!laststart)
+            {
+              if (syntax & RE_CONTEXT_INVALID_OPS)
+                return REG_BADRPT;
+              else if (!(syntax & RE_CONTEXT_INDEP_OPS))
+                goto normal_char;
+            }
+
+          {
+            /* Are we optimizing this jump?  */
+            boolean keep_string_p = false;
+
+            /* 1 means zero (many) matches is allowed.  */
+            char zero_times_ok = 0, many_times_ok = 0;
+
+            /* If there is a sequence of repetition chars, collapse it
+               down to just one (the right one).  We can't combine
+               interval operators with these because of, e.g., `a{2}*',
+               which should only match an even number of `a's.  */
+
+            for (;;)
+              {
+                zero_times_ok |= c != '+';
+                many_times_ok |= c != '?';
+
+                if (p == pend)
+                  break;
+
+                PATFETCH (c);
+
+                if (c == '*'
+                    || (!(syntax & RE_BK_PLUS_QM) && (c == '+' || c == '?')))
+                  ;
+
+                else if (syntax & RE_BK_PLUS_QM  &&  c == '\\')
+                  {
+                    if (p == pend) return REG_EESCAPE;
+
+                    PATFETCH (c1);
+                    if (!(c1 == '+' || c1 == '?'))
+                      {
+                        PATUNFETCH;
+                        PATUNFETCH;
+                        break;
+                      }
+
+                    c = c1;
+                  }
+                else
+                  {
+                    PATUNFETCH;
+                    break;
+                  }
+
+                /* If we get here, we found another repeat character.  */
+               }
+
+            /* Star, etc. applied to an empty pattern is equivalent
+               to an empty pattern.  */
+            if (!laststart)
+              break;
+
+            /* Now we know whether or not zero matches is allowed
+               and also whether or not two or more matches is allowed.  */
+            if (many_times_ok)
+              { /* More than one repetition is allowed, so put in at the
+                   end a backward relative jump from `b' to before the next
+                   jump we're going to put in below (which jumps from
+                   laststart to after this jump).
+
+                   But if we are at the `*' in the exact sequence `.*\n',
+                   insert an unconditional jump backwards to the .,
+                   instead of the beginning of the loop.  This way we only
+                   push a failure point once, instead of every time
+                   through the loop.  */
+                assert (p - 1 > pattern);
+
+                /* Allocate the space for the jump.  */
+                GET_BUFFER_SPACE (3);
+
+                /* We know we are not at the first character of the pattern,
+                   because laststart was nonzero.  And we've already
+                   incremented `p', by the way, to be the character after
+                   the `*'.  Do we have to do something analogous here
+                   for null bytes, because of RE_DOT_NOT_NULL?  */
+                if (TRANSLATE (*(p - 2)) == TRANSLATE ('.')
+            && zero_times_ok
+                    && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
+                    && !(syntax & RE_DOT_NEWLINE))
+                  { /* We have .*\n.  */
+                    STORE_JUMP (jump, b, laststart);
+                    keep_string_p = true;
+                  }
+                else
+                  /* Anything else.  */
+                  STORE_JUMP (maybe_pop_jump, b, laststart - 3);
+
+                /* We've added more stuff to the buffer.  */
+                b += 3;
+              }
+
+            /* On failure, jump from laststart to b + 3, which will be the
+               end of the buffer after this jump is inserted.  */
+            GET_BUFFER_SPACE (3);
+            INSERT_JUMP (keep_string_p ? on_failure_keep_string_jump
+                                       : on_failure_jump,
+                         laststart, b + 3);
+            pending_exact = 0;
+            b += 3;
+
+            if (!zero_times_ok)
+              {
+                /* At least one repetition is required, so insert a
+                   `dummy_failure_jump' before the initial
+                   `on_failure_jump' instruction of the loop. This
+                   effects a skip over that instruction the first time
+                   we hit that loop.  */
+                GET_BUFFER_SPACE (3);
+                INSERT_JUMP (dummy_failure_jump, laststart, laststart + 6);
+                b += 3;
+              }
+            }
+      break;
+
+
+    case '.':
+          laststart = b;
+          BUF_PUSH (anychar);
+          break;
+
+
+        case '[':
+          {
+            boolean had_char_class = false;
+
+            if (p == pend) return REG_EBRACK;
+
+            /* Ensure that we have enough space to push a charset: the
+               opcode, the length count, and the bitset; 34 bytes in all.  */
+        GET_BUFFER_SPACE (34);
+
+            laststart = b;
+
+            /* We test `*p == '^' twice, instead of using an if
+               statement, so we only need one BUF_PUSH.  */
+            BUF_PUSH (*p == '^' ? charset_not : charset);
+            if (*p == '^')
+              p++;
+
+            /* Remember the first position in the bracket expression.  */
+            p1 = p;
+
+            /* Push the number of bytes in the bitmap.  */
+            BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH);
+
+            /* Clear the whole map.  */
+            bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH);
+
+            /* charset_not matches newline according to a syntax bit.  */
+            if ((re_opcode_t) b[-2] == charset_not
+                && (syntax & RE_HAT_LISTS_NOT_NEWLINE))
+              SET_LIST_BIT ('\n');
+
+            /* Read in characters and ranges, setting map bits.  */
+            for (;;)
+              {
+                if (p == pend) return REG_EBRACK;
+
+                PATFETCH (c);
+
+                /* \ might escape characters inside [...] and [^...].  */
+                if ((syntax & RE_BACKSLASH_ESCAPE_IN_LISTS) && c == '\\')
+                  {
+                    if (p == pend) return REG_EESCAPE;
+
+                    PATFETCH (c1);
+                    SET_LIST_BIT (c1);
+                    continue;
+                  }
+
+                /* Could be the end of the bracket expression.  If it's
+                   not (i.e., when the bracket expression is `[]' so
+                   far), the ']' character bit gets set way below.  */
+                if (c == ']' && p != p1 + 1)
+                  break;
+
+                /* Look ahead to see if it's a range when the last thing
+                   was a character class.  */
+                if (had_char_class && c == '-' && *p != ']')
+                  return REG_ERANGE;
+
+                /* Look ahead to see if it's a range when the last thing
+                   was a character: if this is a hyphen not at the
+                   beginning or the end of a list, then it's the range
+                   operator.  */
+                if (c == '-'
+                    && !(p - 2 >= pattern && p[-2] == '[')
+                    && !(p - 3 >= pattern && p[-3] == '[' && p[-2] == '^')
+                    && *p != ']')
+                  {
+                    reg_errcode_t ret
+                      = compile_range (&p, pend, translate, syntax, b);
+                    if (ret != REG_NOERROR) return ret;
+                  }
+
+                else if (p[0] == '-' && p[1] != ']')
+                  { /* This handles ranges made up of characters only.  */
+                    reg_errcode_t ret;
+
+            /* Move past the `-'.  */
+                    PATFETCH (c1);
+
+                    ret = compile_range (&p, pend, translate, syntax, b);
+                    if (ret != REG_NOERROR) return ret;
+                  }
+
+                /* See if we're at the beginning of a possible character
+                   class.  */
+
+                else if (syntax & RE_CHAR_CLASSES && c == '[' && *p == ':')
+                  { /* Leave room for the null.  */
+                    char str[CHAR_CLASS_MAX_LENGTH + 1];
+
+                    PATFETCH (c);
+                    c1 = 0;
+
+                    /* If pattern is `[[:'.  */
+                    if (p == pend) return REG_EBRACK;
+
+                    for (;;)
+                      {
+                        PATFETCH (c);
+                        if (c == ':' || c == ']' || p == pend
+                            || c1 == CHAR_CLASS_MAX_LENGTH)
+                          break;
+                        str[c1++] = c;
+                      }
+                    str[c1] = '\0';
+
+                    /* If isn't a word bracketed by `[:' and:`]':
+                       undo the ending character, the letters, and leave
+                       the leading `:' and `[' (but set bits for them).  */
+                    if (c == ':' && *p == ']')
+                      {
+                        int ch;
+                        boolean is_alnum = STREQ (str, "alnum");
+                        boolean is_alpha = STREQ (str, "alpha");
+                        boolean is_blank = STREQ (str, "blank");
+                        boolean is_cntrl = STREQ (str, "cntrl");
+                        boolean is_digit = STREQ (str, "digit");
+                        boolean is_graph = STREQ (str, "graph");
+                        boolean is_lower = STREQ (str, "lower");
+                        boolean is_print = STREQ (str, "print");
+                        boolean is_punct = STREQ (str, "punct");
+                        boolean is_space = STREQ (str, "space");
+                        boolean is_upper = STREQ (str, "upper");
+                        boolean is_xdigit = STREQ (str, "xdigit");
+
+                        if (!IS_CHAR_CLASS (str)) return REG_ECTYPE;
+
+                        /* Throw away the ] at the end of the character
+                           class.  */
+                        PATFETCH (c);
+
+                        if (p == pend) return REG_EBRACK;
+
+                        for (ch = 0; ch < 1 << BYTEWIDTH; ch++)
+                          {
+                            if (   (is_alnum  && ISALNUM (ch))
+                                || (is_alpha  && ISALPHA (ch))
+                                || (is_blank  && ISBLANK (ch))
+                                || (is_cntrl  && ISCNTRL (ch))
+                                || (is_digit  && ISDIGIT (ch))
+                                || (is_graph  && ISGRAPH (ch))
+                                || (is_lower  && ISLOWER (ch))
+                                || (is_print  && ISPRINT (ch))
+                                || (is_punct  && ISPUNCT (ch))
+                                || (is_space  && ISSPACE (ch))
+                                || (is_upper  && ISUPPER (ch))
+                                || (is_xdigit && ISXDIGIT (ch)))
+                            SET_LIST_BIT (ch);
+                          }
+                        had_char_class = true;
+                      }
+                    else
+                      {
+                        c1++;
+                        while (c1--)
+                          PATUNFETCH;
+                        SET_LIST_BIT ('[');
+                        SET_LIST_BIT (':');
+                        had_char_class = false;
+                      }
+                  }
+                else
+                  {
+                    had_char_class = false;
+                    SET_LIST_BIT (c);
+                  }
+              }
+
+            /* Discard any (non)matching list bytes that are all 0 at the
+               end of the map.  Decrease the map-length byte too.  */
+            while ((int) b[-1] > 0 && b[b[-1] - 1] == 0)
+              b[-1]--;
+            b += b[-1];
+          }
+          break;
+
+
+    case '(':
+          if (syntax & RE_NO_BK_PARENS)
+            goto handle_open;
+          else
+            goto normal_char;
+
+
+        case ')':
+          if (syntax & RE_NO_BK_PARENS)
+            goto handle_close;
+          else
+            goto normal_char;
+
+
+        case '\n':
+          if (syntax & RE_NEWLINE_ALT)
+            goto handle_alt;
+          else
+            goto normal_char;
+
+
+    case '|':
+          if (syntax & RE_NO_BK_VBAR)
+            goto handle_alt;
+          else
+            goto normal_char;
+
+
+        case '{':
+           if (syntax & RE_INTERVALS && syntax & RE_NO_BK_BRACES)
+             goto handle_interval;
+           else
+             goto normal_char;
+
+
+        case '\\':
+          if (p == pend) return REG_EESCAPE;
+
+          /* Do not translate the character after the \, so that we can
+             distinguish, e.g., \B from \b, even if we normally would
+             translate, e.g., B to b.  */
+          PATFETCH_RAW (c);
+
+          switch (c)
+            {
+            case '(':
+              if (syntax & RE_NO_BK_PARENS)
+                goto normal_backslash;
+
+            handle_open:
+              bufp->re_nsub++;
+              regnum++;
+
+              if (COMPILE_STACK_FULL)
+                {
+                  RETALLOC (compile_stack.stack, compile_stack.size << 1,
+                            compile_stack_elt_t);
+                  if (compile_stack.stack == NULL) return REG_ESPACE;
+
+                  compile_stack.size <<= 1;
+                }
+
+              /* These are the values to restore when we hit end of this
+                 group.  They are all relative offsets, so that if the
+                 whole pattern moves because of realloc, they will still
+                 be valid.  */
+              COMPILE_STACK_TOP.begalt_offset = begalt - bufp->buffer;
+              COMPILE_STACK_TOP.fixup_alt_jump
+                = fixup_alt_jump ? fixup_alt_jump - bufp->buffer + 1 : 0;
+              COMPILE_STACK_TOP.laststart_offset = b - bufp->buffer;
+              COMPILE_STACK_TOP.regnum = regnum;
+
+              /* We will eventually replace the 0 with the number of
+                 groups inner to this one.  But do not push a
+                 start_memory for groups beyond the last one we can
+                 represent in the compiled pattern.  */
+              if (regnum <= MAX_REGNUM)
+                {
+                  COMPILE_STACK_TOP.inner_group_offset = b - bufp->buffer + 2;
+                  BUF_PUSH_3 (start_memory, regnum, 0);
+                }
+
+              compile_stack.avail++;
+
+              fixup_alt_jump = 0;
+              laststart = 0;
+              begalt = b;
+          /* If we've reached MAX_REGNUM groups, then this open
+         won't actually generate any code, so we'll have to
+         clear pending_exact explicitly.  */
+          pending_exact = 0;
+              break;
+
+
+            case ')':
+              if (syntax & RE_NO_BK_PARENS) goto normal_backslash;
+
+              if (COMPILE_STACK_EMPTY)
+                if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD)
+                  goto normal_backslash;
+                else
+                  return REG_ERPAREN;
+
+            handle_close:
+              if (fixup_alt_jump)
+                { /* Push a dummy failure point at the end of the
+                     alternative for a possible future
+                     `pop_failure_jump' to pop.  See comments at
+                     `push_dummy_failure' in `re_match_2'.  */
+                  BUF_PUSH (push_dummy_failure);
+
+                  /* We allocated space for this jump when we assigned
+                     to `fixup_alt_jump', in the `handle_alt' case below.  */
+                  STORE_JUMP (jump_past_alt, fixup_alt_jump, b - 1);
+                }
+
+              /* See similar code for backslashed left paren above.  */
+              if (COMPILE_STACK_EMPTY)
+                if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD)
+                  goto normal_char;
+                else
+                  return REG_ERPAREN;
+
+              /* Since we just checked for an empty stack above, this
+                 ``can't happen''.  */
+              assert (compile_stack.avail != 0);
+              {
+                /* We don't just want to restore into `regnum', because
+                   later groups should continue to be numbered higher,
+                   as in `(ab)c(de)' -- the second group is #2.  */
+                regnum_t this_group_regnum;
+
+                compile_stack.avail--;
+                begalt = bufp->buffer + COMPILE_STACK_TOP.begalt_offset;
+                fixup_alt_jump
+                  = COMPILE_STACK_TOP.fixup_alt_jump
+                    ? bufp->buffer + COMPILE_STACK_TOP.fixup_alt_jump - 1
+                    : 0;
+                laststart = bufp->buffer + COMPILE_STACK_TOP.laststart_offset;
+                this_group_regnum = COMPILE_STACK_TOP.regnum;
+        /* If we've reached MAX_REGNUM groups, then this open
+           won't actually generate any code, so we'll have to
+           clear pending_exact explicitly.  */
+        pending_exact = 0;
+
+                /* We're at the end of the group, so now we know how many
+                   groups were inside this one.  */
+                if (this_group_regnum <= MAX_REGNUM)
+                  {
+                    unsigned char *inner_group_loc
+                      = bufp->buffer + COMPILE_STACK_TOP.inner_group_offset;
+
+                    *inner_group_loc = regnum - this_group_regnum;
+                    BUF_PUSH_3 (stop_memory, this_group_regnum,
+                                regnum - this_group_regnum);
+                  }
+              }
+              break;
+
+
+            case '|':					/* `\|'.  */
+              if (syntax & RE_LIMITED_OPS || syntax & RE_NO_BK_VBAR)
+                goto normal_backslash;
+            handle_alt:
+              if (syntax & RE_LIMITED_OPS)
+                goto normal_char;
+
+              /* Insert before the previous alternative a jump which
+                 jumps to this alternative if the former fails.  */
+              GET_BUFFER_SPACE (3);
+              INSERT_JUMP (on_failure_jump, begalt, b + 6);
+              pending_exact = 0;
+              b += 3;
+
+              /* The alternative before this one has a jump after it
+                 which gets executed if it gets matched.  Adjust that
+                 jump so it will jump to this alternative's analogous
+                 jump (put in below, which in turn will jump to the next
+                 (if any) alternative's such jump, etc.).  The last such
+                 jump jumps to the correct final destination.  A picture:
+                          _____ _____
+                          |   | |   |
+                          |   v |   v
+                         a | b   | c
+
+                 If we are at `b', then fixup_alt_jump right now points to a
+                 three-byte space after `a'.  We'll put in the jump, set
+                 fixup_alt_jump to right after `b', and leave behind three
+                 bytes which we'll fill in when we get to after `c'.  */
+
+              if (fixup_alt_jump)
+                STORE_JUMP (jump_past_alt, fixup_alt_jump, b);
+
+              /* Mark and leave space for a jump after this alternative,
+                 to be filled in later either by next alternative or
+                 when know we're at the end of a series of alternatives.  */
+              fixup_alt_jump = b;
+              GET_BUFFER_SPACE (3);
+              b += 3;
+
+              laststart = 0;
+              begalt = b;
+              break;
+
+
+            case '{':
+              /* If \{ is a literal.  */
+              if (!(syntax & RE_INTERVALS)
+                     /* If we're at `\{' and it's not the open-interval
+                        operator.  */
+                  || ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES))
+                  || (p - 2 == pattern  &&  p == pend))
+                goto normal_backslash;
+
+            handle_interval:
+              {
+                /* If got here, then the syntax allows intervals.  */
+
+                /* At least (most) this many matches must be made.  */
+                int lower_bound = -1, upper_bound = -1;
+
+                beg_interval = p - 1;
+
+                if (p == pend)
+                  {
+                    if (syntax & RE_NO_BK_BRACES)
+                      goto unfetch_interval;
+                    else
+                      return REG_EBRACE;
+                  }
+
+                GET_UNSIGNED_NUMBER (lower_bound);
+
+                if (c == ',')
+                  {
+                    GET_UNSIGNED_NUMBER (upper_bound);
+                    if (upper_bound < 0) upper_bound = RE_DUP_MAX;
+                  }
+                else
+                  /* Interval such as `{1}' => match exactly once. */
+                  upper_bound = lower_bound;
+
+                if (lower_bound < 0 || upper_bound > RE_DUP_MAX
+                    || lower_bound > upper_bound)
+                  {
+                    if (syntax & RE_NO_BK_BRACES)
+                      goto unfetch_interval;
+                    else
+                      return REG_BADBR;
+                  }
+
+                if (!(syntax & RE_NO_BK_BRACES))
+                  {
+                    if (c != '\\') return REG_EBRACE;
+
+                    PATFETCH (c);
+                  }
+
+                if (c != '}')
+                  {
+                    if (syntax & RE_NO_BK_BRACES)
+                      goto unfetch_interval;
+                    else
+                      return REG_BADBR;
+                  }
+
+                /* We just parsed a valid interval.  */
+
+                /* If it's invalid to have no preceding re.  */
+                if (!laststart)
+                  {
+                    if (syntax & RE_CONTEXT_INVALID_OPS)
+                      return REG_BADRPT;
+                    else if (syntax & RE_CONTEXT_INDEP_OPS)
+                      laststart = b;
+                    else
+                      goto unfetch_interval;
+                  }
+
+                /* If the upper bound is zero, don't want to succeed at
+                   all; jump from `laststart' to `b + 3', which will be
+                   the end of the buffer after we insert the jump.  */
+                 if (upper_bound == 0)
+                   {
+                     GET_BUFFER_SPACE (3);
+                     INSERT_JUMP (jump, laststart, b + 3);
+                     b += 3;
+                   }
+
+                 /* Otherwise, we have a nontrivial interval.  When
+                    we're all done, the pattern will look like:
+                      set_number_at <jump count> <upper bound>
+                      set_number_at <succeed_n count> <lower bound>
+                      succeed_n <after jump addr> <succed_n count>
+                      <body of loop>
+                      jump_n <succeed_n addr> <jump count>
+                    (The upper bound and `jump_n' are omitted if
+                    `upper_bound' is 1, though.)  */
+                 else
+                   { /* If the upper bound is > 1, we need to insert
+                        more at the end of the loop.  */
+                     unsigned nbytes = 10 + (upper_bound > 1) * 10;
+
+                     GET_BUFFER_SPACE (nbytes);
+
+                     /* Initialize lower bound of the `succeed_n', even
+                        though it will be set during matching by its
+                        attendant `set_number_at' (inserted next),
+                        because `re_compile_fastmap' needs to know.
+                        Jump to the `jump_n' we might insert below.  */
+                     INSERT_JUMP2 (succeed_n, laststart,
+                                   b + 5 + (upper_bound > 1) * 5,
+                                   lower_bound);
+                     b += 5;
+
+                     /* Code to initialize the lower bound.  Insert
+                        before the `succeed_n'.  The `5' is the last two
+                        bytes of this `set_number_at', plus 3 bytes of
+                        the following `succeed_n'.  */
+                     insert_op2 (set_number_at, laststart, 5, lower_bound, b);
+                     b += 5;
+
+                     if (upper_bound > 1)
+                       { /* More than one repetition is allowed, so
+                            append a backward jump to the `succeed_n'
+                            that starts this interval.
+
+                            When we've reached this during matching,
+                            we'll have matched the interval once, so
+                            jump back only `upper_bound - 1' times.  */
+                         STORE_JUMP2 (jump_n, b, laststart + 5,
+                                      upper_bound - 1);
+                         b += 5;
+
+                         /* The location we want to set is the second
+                            parameter of the `jump_n'; that is `b-2' as
+                            an absolute address.  `laststart' will be
+                            the `set_number_at' we're about to insert;
+                            `laststart+3' the number to set, the source
+                            for the relative address.  But we are
+                            inserting into the middle of the pattern --
+                            so everything is getting moved up by 5.
+                            Conclusion: (b - 2) - (laststart + 3) + 5,
+                            i.e., b - laststart.
+
+                            We insert this at the beginning of the loop
+                            so that if we fail during matching, we'll
+                            reinitialize the bounds.  */
+                         insert_op2 (set_number_at, laststart, b - laststart,
+                                     upper_bound - 1, b);
+                         b += 5;
+                       }
+                   }
+                pending_exact = 0;
+                beg_interval = NULL;
+              }
+              break;
+
+            unfetch_interval:
+              /* If an invalid interval, match the characters as literals.  */
+               assert (beg_interval);
+               p = beg_interval;
+               beg_interval = NULL;
+
+               /* normal_char and normal_backslash need `c'.  */
+               PATFETCH (c);
+
+               if (!(syntax & RE_NO_BK_BRACES))
+                 {
+                   if (p > pattern  &&  p[-1] == '\\')
+                     goto normal_backslash;
+                 }
+               goto normal_char;
+
+#ifdef emacs
+            /* There is no way to specify the before_dot and after_dot
+               operators.  rms says this is ok.  --karl  */
+            case '=':
+              BUF_PUSH (at_dot);
+              break;
+
+            case 's':
+              laststart = b;
+              PATFETCH (c);
+              BUF_PUSH_2 (syntaxspec, syntax_spec_code[c]);
+              break;
+
+            case 'S':
+              laststart = b;
+              PATFETCH (c);
+              BUF_PUSH_2 (notsyntaxspec, syntax_spec_code[c]);
+              break;
+#endif /* emacs */
+
+
+            case 'w':
+              laststart = b;
+              BUF_PUSH (wordchar);
+              break;
+
+
+            case 'W':
+              laststart = b;
+              BUF_PUSH (notwordchar);
+              break;
+
+
+            case '<':
+              BUF_PUSH (wordbeg);
+              break;
+
+            case '>':
+              BUF_PUSH (wordend);
+              break;
+
+            case 'b':
+              BUF_PUSH (wordbound);
+              break;
+
+            case 'B':
+              BUF_PUSH (notwordbound);
+              break;
+
+            case '`':
+              BUF_PUSH (begbuf);
+              break;
+
+            case '\'':
+              BUF_PUSH (endbuf);
+              break;
+
+            case '1': case '2': case '3': case '4': case '5':
+            case '6': case '7': case '8': case '9':
+              if (syntax & RE_NO_BK_REFS)
+                goto normal_char;
+
+              c1 = c - '0';
+
+              if (c1 > regnum)
+                return REG_ESUBREG;
+
+              /* Can't back reference to a subexpression if inside of it.  */
+              if (group_in_compile_stack (compile_stack, c1))
+                goto normal_char;
+
+              laststart = b;
+              BUF_PUSH_2 (duplicate, c1);
+              break;
+
+
+            case '+':
+            case '?':
+              if (syntax & RE_BK_PLUS_QM)
+                goto handle_plus;
+              else
+                goto normal_backslash;
+
+            default:
+            normal_backslash:
+              /* You might think it would be useful for \ to mean
+                 not to translate; but if we don't translate it
+                 it will never match anything.  */
+              c = TRANSLATE (c);
+              goto normal_char;
+            }
+          break;
+
+
+    default:
+        /* Expects the character in `c'.  */
+    normal_char:
+          /* If no exactn currently being built.  */
+          if (!pending_exact
+
+              /* If last exactn not at current position.  */
+              || pending_exact + *pending_exact + 1 != b
+
+              /* We have only one byte following the exactn for the count.  */
+          || *pending_exact == (1 << BYTEWIDTH) - 1
+
+              /* If followed by a repetition operator.  */
+              || *p == '*' || *p == '^'
+          || ((syntax & RE_BK_PLUS_QM)
+          ? *p == '\\' && (p[1] == '+' || p[1] == '?')
+          : (*p == '+' || *p == '?'))
+          || ((syntax & RE_INTERVALS)
+                  && ((syntax & RE_NO_BK_BRACES)
+              ? *p == '{'
+                      : (p[0] == '\\' && p[1] == '{'))))
+        {
+          /* Start building a new exactn.  */
+
+              laststart = b;
+
+          BUF_PUSH_2 (exactn, 0);
+          pending_exact = b - 1;
+            }
+
+      BUF_PUSH (c);
+          (*pending_exact)++;
+      break;
+        } /* switch (c) */
+    } /* while p != pend */
+
+
+  /* Through the pattern now.  */
+
+  if (fixup_alt_jump)
+    STORE_JUMP (jump_past_alt, fixup_alt_jump, b);
+
+  if (!COMPILE_STACK_EMPTY)
+    return REG_EPAREN;
+
+  free (compile_stack.stack);
+
+  /* We have succeeded; set the length of the buffer.  */
+  bufp->used = b - bufp->buffer;
+
+#ifdef DEBUG
+  if (debug)
+    {
+      DEBUG_PRINT1 ("\nCompiled pattern: ");
+      print_compiled_pattern (bufp);
+    }
+#endif /* DEBUG */
+
+  return REG_NOERROR;
+} /* regex_compile */
+
+/* Subroutines for `regex_compile'.  */
+
+/* Store OP at LOC followed by two-byte integer parameter ARG.  */
+
+static void
+store_op1 (op, loc, arg)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg;
+{
+  *loc = (unsigned char) op;
+  STORE_NUMBER (loc + 1, arg);
+}
+
+
+/* Like `store_op1', but for two two-byte parameters ARG1 and ARG2.  */
+
+static void
+store_op2 (op, loc, arg1, arg2)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg1, arg2;
+{
+  *loc = (unsigned char) op;
+  STORE_NUMBER (loc + 1, arg1);
+  STORE_NUMBER (loc + 3, arg2);
+}
+
+
+/* Copy the bytes from LOC to END to open up three bytes of space at LOC
+   for OP followed by two-byte integer parameter ARG.  */
+
+static void
+insert_op1 (op, loc, arg, end)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg;
+    unsigned char *end;
+{
+  register unsigned char *pfrom = end;
+  register unsigned char *pto = end + 3;
+
+  while (pfrom != loc)
+    *--pto = *--pfrom;
+
+  store_op1 (op, loc, arg);
+}
+
+
+/* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2.  */
+
+static void
+insert_op2 (op, loc, arg1, arg2, end)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg1, arg2;
+    unsigned char *end;
+{
+  register unsigned char *pfrom = end;
+  register unsigned char *pto = end + 5;
+
+  while (pfrom != loc)
+    *--pto = *--pfrom;
+
+  store_op2 (op, loc, arg1, arg2);
+}
+
+
+/* P points to just after a ^ in PATTERN.  Return true if that ^ comes
+   after an alternative or a begin-subexpression.  We assume there is at
+   least one character before the ^.  */
+
+static boolean
+at_begline_loc_p (pattern, p, syntax)
+    const char *pattern, *p;
+    reg_syntax_t syntax;
+{
+  const char *prev = p - 2;
+  boolean prev_prev_backslash = prev > pattern && prev[-1] == '\\';
+
+  return
+       /* After a subexpression?  */
+       (*prev == '(' && (syntax & RE_NO_BK_PARENS || prev_prev_backslash))
+       /* After an alternative?  */
+    || (*prev == '|' && (syntax & RE_NO_BK_VBAR || prev_prev_backslash));
+}
+
+
+/* The dual of at_begline_loc_p.  This one is for $.  We assume there is
+   at least one character after the $, i.e., `P < PEND'.  */
+
+static boolean
+at_endline_loc_p (p, pend, syntax)
+    const char *p, *pend;
+    int syntax;
+{
+  const char *next = p;
+  boolean next_backslash = *next == '\\';
+  const char *next_next = p + 1 < pend ? p + 1 : NULL;
+
+  return
+       /* Before a subexpression?  */
+       (syntax & RE_NO_BK_PARENS ? *next == ')'
+        : next_backslash && next_next && *next_next == ')')
+       /* Before an alternative?  */
+    || (syntax & RE_NO_BK_VBAR ? *next == '|'
+        : next_backslash && next_next && *next_next == '|');
+}
+
+
+/* Returns true if REGNUM is in one of COMPILE_STACK's elements and
+   false if it's not.  */
+
+static boolean
+group_in_compile_stack (compile_stack, regnum)
+    compile_stack_type compile_stack;
+    regnum_t regnum;
+{
+  int this_element;
+
+  for (this_element = compile_stack.avail - 1;
+       this_element >= 0;
+       this_element--)
+    if (compile_stack.stack[this_element].regnum == regnum)
+      return true;
+
+  return false;
+}
+
+
+/* Read the ending character of a range (in a bracket expression) from the
+   uncompiled pattern *P_PTR (which ends at PEND).  We assume the
+   starting character is in `P[-2]'.  (`P[-1]' is the character `-'.)
+   Then we set the translation of all bits between the starting and
+   ending characters (inclusive) in the compiled pattern B.
+
+   Return an error code.
+
+   We use these short variable names so we can use the same macros as
+   `regex_compile' itself.  */
+
+static reg_errcode_t
+compile_range (p_ptr, pend, translate, syntax, b)
+    const char **p_ptr, *pend;
+    char *translate;
+    reg_syntax_t syntax;
+    unsigned char *b;
+{
+  unsigned this_char;
+
+  const char *p = *p_ptr;
+  int range_start, range_end;
+
+  if (p == pend)
+    return REG_ERANGE;
+
+  /* Even though the pattern is a signed `char *', we need to fetch
+     with unsigned char *'s; if the high bit of the pattern character
+     is set, the range endpoints will be negative if we fetch using a
+     signed char *.
+
+     We also want to fetch the endpoints without translating them; the
+     appropriate translation is done in the bit-setting loop below.  */
+  range_start = ((unsigned char *) p)[-2];
+  range_end   = ((unsigned char *) p)[0];
+
+  /* Have to increment the pointer into the pattern string, so the
+     caller isn't still at the ending character.  */
+  (*p_ptr)++;
+
+  /* If the start is after the end, the range is empty.  */
+  if (range_start > range_end)
+    return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR;
+
+  /* Here we see why `this_char' has to be larger than an `unsigned
+     char' -- the range is inclusive, so if `range_end' == 0xff
+     (assuming 8-bit characters), we would otherwise go into an infinite
+     loop, since all characters <= 0xff.  */
+  for (this_char = range_start; this_char <= range_end; this_char++)
+    {
+      SET_LIST_BIT (TRANSLATE (this_char));
+    }
+
+  return REG_NOERROR;
+}
+
+/* Failure stack declarations and macros; both re_compile_fastmap and
+   re_match_2 use a failure stack.  These have to be macros because of
+   REGEX_ALLOCATE.  */
+
+
+/* Number of failure points for which to initially allocate space
+   when matching.  If this number is exceeded, we allocate more
+   space, so it is not a hard limit.  */
+#ifndef INIT_FAILURE_ALLOC
+#define INIT_FAILURE_ALLOC 5
+#endif
+
+/* Roughly the maximum number of failure points on the stack.  Would be
+   exactly that if always used MAX_FAILURE_SPACE each time we failed.
+   This is a variable only so users of regex can assign to it; we never
+   change it ourselves.  */
+int re_max_failures = 2000;
+
+typedef const unsigned char *fail_stack_elt_t;
+
+typedef struct
+{
+  fail_stack_elt_t *stack;
+  unsigned size;
+  unsigned avail;			/* Offset of next open position.  */
+} fail_stack_type;
+
+#define FAIL_STACK_EMPTY()     (fail_stack.avail == 0)
+#define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
+#define FAIL_STACK_FULL()      (fail_stack.avail == fail_stack.size)
+#define FAIL_STACK_TOP()       (fail_stack.stack[fail_stack.avail])
+
+
+/* Initialize `fail_stack'.  Do `return -2' if the alloc fails.  */
+
+#define INIT_FAIL_STACK()						\
+  do {									\
+    fail_stack.stack = (fail_stack_elt_t *)				\
+      REGEX_ALLOCATE (INIT_FAILURE_ALLOC * sizeof (fail_stack_elt_t));	\
+                                    \
+    if (fail_stack.stack == NULL)					\
+      return -2;							\
+                                    \
+    fail_stack.size = INIT_FAILURE_ALLOC;				\
+    fail_stack.avail = 0;						\
+  } while (0)
+
+
+/* Double the size of FAIL_STACK, up to approximately `re_max_failures' items.
+
+   Return 1 if succeeds, and 0 if either ran out of memory
+   allocating space for it or it was already too large.
+
+   REGEX_REALLOCATE requires `destination' be declared.   */
+
+#define DOUBLE_FAIL_STACK(fail_stack)					\
+  ((fail_stack).size > re_max_failures * MAX_FAILURE_ITEMS		\
+   ? 0									\
+   : ((fail_stack).stack = (fail_stack_elt_t *)				\
+        REGEX_REALLOCATE ((fail_stack).stack, 				\
+          (fail_stack).size * sizeof (fail_stack_elt_t),		\
+          ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)),	\
+                                    \
+      (fail_stack).stack == NULL					\
+      ? 0								\
+      : ((fail_stack).size <<= 1, 					\
+         1)))
+
+
+/* Push PATTERN_OP on FAIL_STACK.
+
+   Return 1 if was able to do so and 0 if ran out of memory allocating
+   space to do so.  */
+#define PUSH_PATTERN_OP(pattern_op, fail_stack)				\
+  ((FAIL_STACK_FULL ()							\
+    && !DOUBLE_FAIL_STACK (fail_stack))					\
+    ? 0									\
+    : ((fail_stack).stack[(fail_stack).avail++] = pattern_op,		\
+       1))
+
+/* This pushes an item onto the failure stack.  Must be a four-byte
+   value.  Assumes the variable `fail_stack'.  Probably should only
+   be called from within `PUSH_FAILURE_POINT'.  */
+#define PUSH_FAILURE_ITEM(item)						\
+  fail_stack.stack[fail_stack.avail++] = (fail_stack_elt_t) item
+
+/* The complement operation.  Assumes `fail_stack' is nonempty.  */
+#define POP_FAILURE_ITEM() fail_stack.stack[--fail_stack.avail]
+
+/* Used to omit pushing failure point id's when we're not debugging.  */
+#ifdef DEBUG
+#define DEBUG_PUSH PUSH_FAILURE_ITEM
+#define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_ITEM ()
+#else
+#define DEBUG_PUSH(item)
+#define DEBUG_POP(item_addr)
+#endif
+
+
+/* Push the information about the state we will need
+   if we ever fail back to it.
+
+   Requires variables fail_stack, regstart, regend, reg_info, and
+   num_regs be declared.  DOUBLE_FAIL_STACK requires `destination' be
+   declared.
+
+   Does `return FAILURE_CODE' if runs out of memory.  */
+
+#define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code)	\
+  do {									\
+    char *destination;							\
+    /* Must be int, so when we don't save any registers, the arithmetic	\
+       of 0 + -1 isn't done as unsigned.  */				\
+    int this_reg;							\
+                                        \
+    DEBUG_STATEMENT (failure_id++);					\
+    DEBUG_STATEMENT (nfailure_points_pushed++);				\
+    DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%u:\n", failure_id);		\
+    DEBUG_PRINT2 ("  Before push, next avail: %d\n", (fail_stack).avail);\
+    DEBUG_PRINT2 ("                     size: %d\n", (fail_stack).size);\
+                                    \
+    DEBUG_PRINT2 ("  slots needed: %d\n", NUM_FAILURE_ITEMS);		\
+    DEBUG_PRINT2 ("     available: %d\n", REMAINING_AVAIL_SLOTS);	\
+                                    \
+    /* Ensure we have enough space allocated for what we will push.  */	\
+    while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS)			\
+      {									\
+        if (!DOUBLE_FAIL_STACK (fail_stack))			\
+          return failure_code;						\
+                                    \
+        DEBUG_PRINT2 ("\n  Doubled stack; size now: %d\n",		\
+               (fail_stack).size);				\
+        DEBUG_PRINT2 ("  slots available: %d\n", REMAINING_AVAIL_SLOTS);\
+      }									\
+                                    \
+    /* Push the info, starting with the registers.  */			\
+    DEBUG_PRINT1 ("\n");						\
+                                    \
+    for (this_reg = lowest_active_reg; this_reg <= highest_active_reg;	\
+         this_reg++)							\
+      {									\
+    DEBUG_PRINT2 ("  Pushing reg: %d\n", this_reg);			\
+        DEBUG_STATEMENT (num_regs_pushed++);				\
+                                    \
+    DEBUG_PRINT2 ("    start: 0x%x\n", regstart[this_reg]);		\
+        PUSH_FAILURE_ITEM (regstart[this_reg]);				\
+                                                                        \
+    DEBUG_PRINT2 ("    end: 0x%x\n", regend[this_reg]);		\
+        PUSH_FAILURE_ITEM (regend[this_reg]);				\
+                                    \
+    DEBUG_PRINT2 ("    info: 0x%x\n      ", reg_info[this_reg]);	\
+        DEBUG_PRINT2 (" match_null=%d",					\
+                      REG_MATCH_NULL_STRING_P (reg_info[this_reg]));	\
+        DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg]));	\
+        DEBUG_PRINT2 (" matched_something=%d",				\
+                      MATCHED_SOMETHING (reg_info[this_reg]));		\
+        DEBUG_PRINT2 (" ever_matched=%d",				\
+                      EVER_MATCHED_SOMETHING (reg_info[this_reg]));	\
+    DEBUG_PRINT1 ("\n");						\
+        PUSH_FAILURE_ITEM (reg_info[this_reg].word);			\
+      }									\
+                                    \
+    DEBUG_PRINT2 ("  Pushing  low active reg: %d\n", lowest_active_reg);\
+    PUSH_FAILURE_ITEM (lowest_active_reg);				\
+                                    \
+    DEBUG_PRINT2 ("  Pushing high active reg: %d\n", highest_active_reg);\
+    PUSH_FAILURE_ITEM (highest_active_reg);				\
+                                    \
+    DEBUG_PRINT2 ("  Pushing pattern 0x%x: ", pattern_place);		\
+    DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend);		\
+    PUSH_FAILURE_ITEM (pattern_place);					\
+                                    \
+    DEBUG_PRINT2 ("  Pushing string 0x%x: `", string_place);		\
+    DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2,   \
+                 size2);				\
+    DEBUG_PRINT1 ("'\n");						\
+    PUSH_FAILURE_ITEM (string_place);					\
+                                    \
+    DEBUG_PRINT2 ("  Pushing failure id: %u\n", failure_id);		\
+    DEBUG_PUSH (failure_id);						\
+  } while (0)
+
+/* This is the number of items that are pushed and popped on the stack
+   for each register.  */
+#define NUM_REG_ITEMS  3
+
+/* Individual items aside from the registers.  */
+#ifdef DEBUG
+#define NUM_NONREG_ITEMS 5 /* Includes failure point id.  */
+#else
+#define NUM_NONREG_ITEMS 4
+#endif
+
+/* We push at most this many items on the stack.  */
+#define MAX_FAILURE_ITEMS ((num_regs - 1) * NUM_REG_ITEMS + NUM_NONREG_ITEMS)
+
+/* We actually push this many items.  */
+#define NUM_FAILURE_ITEMS						\
+  ((highest_active_reg - lowest_active_reg + 1) * NUM_REG_ITEMS 	\
+    + NUM_NONREG_ITEMS)
+
+/* How many items can still be added to the stack without overflowing it.  */
+#define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
+
+
+/* Pops what PUSH_FAIL_STACK pushes.
+
+   We restore into the parameters, all of which should be lvalues:
+     STR -- the saved data position.
+     PAT -- the saved pattern position.
+     LOW_REG, HIGH_REG -- the highest and lowest active registers.
+     REGSTART, REGEND -- arrays of string positions.
+     REG_INFO -- array of information about each subexpression.
+
+   Also assumes the variables `fail_stack' and (if debugging), `bufp',
+   `pend', `string1', `size1', `string2', and `size2'.  */
+
+#define POP_FAILURE_POINT(str, pat, low_reg, high_reg, regstart, regend, reg_info)\
+{									\
+  DEBUG_STATEMENT (fail_stack_elt_t failure_id;)			\
+  int this_reg;								\
+  const unsigned char *string_temp;					\
+                                    \
+  assert (!FAIL_STACK_EMPTY ());					\
+                                    \
+  /* Remove failure points and point to how many regs pushed.  */	\
+  DEBUG_PRINT1 ("POP_FAILURE_POINT:\n");				\
+  DEBUG_PRINT2 ("  Before pop, next avail: %d\n", fail_stack.avail);	\
+  DEBUG_PRINT2 ("                    size: %d\n", fail_stack.size);	\
+                                    \
+  assert (fail_stack.avail >= NUM_NONREG_ITEMS);			\
+                                    \
+  DEBUG_POP (&failure_id);						\
+  DEBUG_PRINT2 ("  Popping failure id: %u\n", failure_id);		\
+                                    \
+  /* If the saved string location is NULL, it came from an		\
+     on_failure_keep_string_jump opcode, and we want to throw away the	\
+     saved NULL, thus retaining our current position in the string.  */	\
+  string_temp = POP_FAILURE_ITEM ();					\
+  if (string_temp != NULL)						\
+    str = (const char *) string_temp;					\
+                                    \
+  DEBUG_PRINT2 ("  Popping string 0x%x: `", str);			\
+  DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2);	\
+  DEBUG_PRINT1 ("'\n");							\
+                                    \
+  pat = (unsigned char *) POP_FAILURE_ITEM ();				\
+  DEBUG_PRINT2 ("  Popping pattern 0x%x: ", pat);			\
+  DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend);			\
+                                    \
+  /* Restore register info.  */						\
+  high_reg = (unsigned) POP_FAILURE_ITEM ();				\
+  DEBUG_PRINT2 ("  Popping high active reg: %d\n", high_reg);		\
+                                    \
+  low_reg = (unsigned) POP_FAILURE_ITEM ();				\
+  DEBUG_PRINT2 ("  Popping  low active reg: %d\n", low_reg);		\
+                                    \
+  for (this_reg = high_reg; this_reg >= low_reg; this_reg--)		\
+    {									\
+      DEBUG_PRINT2 ("    Popping reg: %d\n", this_reg);			\
+                                    \
+      reg_info[this_reg].word = POP_FAILURE_ITEM ();			\
+      DEBUG_PRINT2 ("      info: 0x%x\n", reg_info[this_reg]);		\
+                                    \
+      regend[this_reg] = (const char *) POP_FAILURE_ITEM ();		\
+      DEBUG_PRINT2 ("      end: 0x%x\n", regend[this_reg]);		\
+                                    \
+      regstart[this_reg] = (const char *) POP_FAILURE_ITEM ();		\
+      DEBUG_PRINT2 ("      start: 0x%x\n", regstart[this_reg]);		\
+    }									\
+                                    \
+  DEBUG_STATEMENT (nfailure_points_popped++);				\
+} /* POP_FAILURE_POINT */
+
+/* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
+   BUFP.  A fastmap records which of the (1 << BYTEWIDTH) possible
+   characters can start a string that matches the pattern.  This fastmap
+   is used by re_search to skip quickly over impossible starting points.
+
+   The caller must supply the address of a (1 << BYTEWIDTH)-byte data
+   area as BUFP->fastmap.
+
+   We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in
+   the pattern buffer.
+
+   Returns 0 if we succeed, -2 if an internal error.   */
+
+int
+re_compile_fastmap (bufp)
+     struct re_pattern_buffer *bufp;
+{
+  int j, k;
+  fail_stack_type fail_stack;
+#ifndef REGEX_MALLOC
+  char *destination;
+#endif
+  /* We don't push any register information onto the failure stack.  */
+  unsigned num_regs = 0;
+
+  register char *fastmap = bufp->fastmap;
+  unsigned char *pattern = bufp->buffer;
+  unsigned long size = bufp->used;
+  const unsigned char *p = pattern;
+  register unsigned char *pend = pattern + size;
+
+  /* Assume that each path through the pattern can be null until
+     proven otherwise.  We set this false at the bottom of switch
+     statement, to which we get only if a particular path doesn't
+     match the empty string.  */
+  boolean path_can_be_null = true;
+
+  /* We aren't doing a `succeed_n' to begin with.  */
+  boolean succeed_n_p = false;
+
+  assert (fastmap != NULL && p != NULL);
+
+  INIT_FAIL_STACK ();
+  bzero (fastmap, 1 << BYTEWIDTH);  /* Assume nothing's valid.  */
+  bufp->fastmap_accurate = 1;	    /* It will be when we're done.  */
+  bufp->can_be_null = 0;
+
+  while (p != pend || !FAIL_STACK_EMPTY ())
+    {
+      if (p == pend)
+        {
+          bufp->can_be_null |= path_can_be_null;
+
+          /* Reset for next path.  */
+          path_can_be_null = true;
+
+          p = fail_stack.stack[--fail_stack.avail];
+    }
+
+      /* We should never be about to go beyond the end of the pattern.  */
+      assert (p < pend);
+
+#ifdef SWITCH_ENUM_BUG
+      switch ((int) ((re_opcode_t) *p++))
+#else
+      switch ((re_opcode_t) *p++)
+#endif
+    {
+
+        /* I guess the idea here is to simply not bother with a fastmap
+           if a backreference is used, since it's too hard to figure out
+           the fastmap for the corresponding group.  Setting
+           `can_be_null' stops `re_search_2' from using the fastmap, so
+           that is all we do.  */
+    case duplicate:
+      bufp->can_be_null = 1;
+          return 0;
+
+
+      /* Following are the cases which match a character.  These end
+         with `break'.  */
+
+    case exactn:
+          fastmap[p[1]] = 1;
+      break;
+
+
+        case charset:
+          for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
+        if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))
+              fastmap[j] = 1;
+      break;
+
+
+    case charset_not:
+      /* Chars beyond end of map must be allowed.  */
+      for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++)
+            fastmap[j] = 1;
+
+      for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
+        if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))))
+              fastmap[j] = 1;
+          break;
+
+
+    case wordchar:
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) == Sword)
+          fastmap[j] = 1;
+      break;
+
+
+    case notwordchar:
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) != Sword)
+          fastmap[j] = 1;
+      break;
+
+
+        case anychar:
+          /* `.' matches anything ...  */
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+            fastmap[j] = 1;
+
+          /* ... except perhaps newline.  */
+          if (!(bufp->syntax & RE_DOT_NEWLINE))
+            fastmap['\n'] = 0;
+
+          /* Return if we have already set `can_be_null'; if we have,
+             then the fastmap is irrelevant.  Something's wrong here.  */
+      else if (bufp->can_be_null)
+        return 0;
+
+          /* Otherwise, have to check alternative paths.  */
+      break;
+
+
+#ifdef emacs
+        case syntaxspec:
+      k = *p++;
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) == (enum syntaxcode) k)
+          fastmap[j] = 1;
+      break;
+
+
+    case notsyntaxspec:
+      k = *p++;
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) != (enum syntaxcode) k)
+          fastmap[j] = 1;
+      break;
+
+
+      /* All cases after this match the empty string.  These end with
+         `continue'.  */
+
+
+    case before_dot:
+    case at_dot:
+    case after_dot:
+          continue;
+#endif /* not emacs */
+
+
+        case no_op:
+        case begline:
+        case endline:
+    case begbuf:
+    case endbuf:
+    case wordbound:
+    case notwordbound:
+    case wordbeg:
+    case wordend:
+        case push_dummy_failure:
+          continue;
+
+
+    case jump_n:
+        case pop_failure_jump:
+    case maybe_pop_jump:
+    case jump:
+        case jump_past_alt:
+    case dummy_failure_jump:
+          EXTRACT_NUMBER_AND_INCR (j, p);
+      p += j;
+      if (j > 0)
+        continue;
+
+          /* Jump backward implies we just went through the body of a
+             loop and matched nothing.  Opcode jumped to should be
+             `on_failure_jump' or `succeed_n'.  Just treat it like an
+             ordinary jump.  For a * loop, it has pushed its failure
+             point already; if so, discard that as redundant.  */
+          if ((re_opcode_t) *p != on_failure_jump
+          && (re_opcode_t) *p != succeed_n)
+        continue;
+
+          p++;
+          EXTRACT_NUMBER_AND_INCR (j, p);
+          p += j;
+
+          /* If what's on the stack is where we are now, pop it.  */
+          if (!FAIL_STACK_EMPTY ()
+          && fail_stack.stack[fail_stack.avail - 1] == p)
+            fail_stack.avail--;
+
+          continue;
+
+
+        case on_failure_jump:
+        case on_failure_keep_string_jump:
+    handle_on_failure_jump:
+          EXTRACT_NUMBER_AND_INCR (j, p);
+
+          /* For some patterns, e.g., `(a?)?', `p+j' here points to the
+             end of the pattern.  We don't want to push such a point,
+             since when we restore it above, entering the switch will
+             increment `p' past the end of the pattern.  We don't need
+             to push such a point since we obviously won't find any more
+             fastmap entries beyond `pend'.  Such a pattern can match
+             the null string, though.  */
+          if (p + j < pend)
+            {
+              if (!PUSH_PATTERN_OP (p + j, fail_stack))
+                return -2;
+            }
+          else
+            bufp->can_be_null = 1;
+
+          if (succeed_n_p)
+            {
+              EXTRACT_NUMBER_AND_INCR (k, p);	/* Skip the n.  */
+              succeed_n_p = false;
+        }
+
+          continue;
+
+
+    case succeed_n:
+          /* Get to the number of times to succeed.  */
+          p += 2;
+
+          /* Increment p past the n for when k != 0.  */
+          EXTRACT_NUMBER_AND_INCR (k, p);
+          if (k == 0)
+        {
+              p -= 4;
+          succeed_n_p = true;  /* Spaghetti code alert.  */
+              goto handle_on_failure_jump;
+            }
+          continue;
+
+
+    case set_number_at:
+          p += 4;
+          continue;
+
+
+    case start_memory:
+        case stop_memory:
+      p += 2;
+      continue;
+
+
+    default:
+          abort (); /* We have listed all the cases.  */
+        } /* switch *p++ */
+
+      /* Getting here means we have found the possible starting
+         characters for one path of the pattern -- and that the empty
+         string does not match.  We need not follow this path further.
+         Instead, look at the next alternative (remembered on the
+         stack), or quit if no more.  The test at the top of the loop
+         does these things.  */
+      path_can_be_null = false;
+      p = pend;
+    } /* while p */
+
+  /* Set `can_be_null' for the last path (also the first path, if the
+     pattern is empty).  */
+  bufp->can_be_null |= path_can_be_null;
+  return 0;
+} /* re_compile_fastmap */
+
+/* Set REGS to hold NUM_REGS registers, storing them in STARTS and
+   ENDS.  Subsequent matches using PATTERN_BUFFER and REGS will use
+   this memory for recording register information.  STARTS and ENDS
+   must be allocated using the malloc library routine, and must each
+   be at least NUM_REGS * sizeof (regoff_t) bytes long.
+
+   If NUM_REGS == 0, then subsequent matches should allocate their own
+   register data.
+
+   Unless this function is called, the first search or match using
+   PATTERN_BUFFER will allocate its own register data, without
+   freeing the old data.  */
+
+void
+re_set_registers (bufp, regs, num_regs, starts, ends)
+    struct re_pattern_buffer *bufp;
+    struct re_registers *regs;
+    unsigned num_regs;
+    regoff_t *starts, *ends;
+{
+  if (num_regs)
+    {
+      bufp->regs_allocated = REGS_REALLOCATE;
+      regs->num_regs = num_regs;
+      regs->start = starts;
+      regs->end = ends;
+    }
+  else
+    {
+      bufp->regs_allocated = REGS_UNALLOCATED;
+      regs->num_regs = 0;
+      regs->start = regs->end = (regoff_t) 0;
+    }
+}
+
+/* Searching routines.  */
+
+/* Like re_search_2, below, but only one string is specified, and
+   doesn't let you say where to stop matching. */
+
+int
+re_search (bufp, string, size, startpos, range, regs)
+     struct re_pattern_buffer *bufp;
+     const char *string;
+     int size, startpos, range;
+     struct re_registers *regs;
+{
+  return re_search_2 (bufp, NULL, 0, string, size, startpos, range,
+              regs, size);
+}
+
+
+/* Using the compiled pattern in BUFP->buffer, first tries to match the
+   virtual concatenation of STRING1 and STRING2, starting first at index
+   STARTPOS, then at STARTPOS + 1, and so on.
+
+   STRING1 and STRING2 have length SIZE1 and SIZE2, respectively.
+
+   RANGE is how far to scan while trying to match.  RANGE = 0 means try
+   only at STARTPOS; in general, the last start tried is STARTPOS +
+   RANGE.
+
+   In REGS, return the indices of the virtual concatenation of STRING1
+   and STRING2 that matched the entire BUFP->buffer and its contained
+   subexpressions.
+
+   Do not consider matching one past the index STOP in the virtual
+   concatenation of STRING1 and STRING2.
+
+   We return either the position in the strings at which the match was
+   found, -1 if no match, or -2 if error (such as failure
+   stack overflow).  */
+
+int
+re_search_2 (bufp, string1, size1, string2, size2, startpos, range, regs, stop)
+     struct re_pattern_buffer *bufp;
+     const char *string1, *string2;
+     int size1, size2;
+     int startpos;
+     int range;
+     struct re_registers *regs;
+     int stop;
+{
+  int val;
+  register char *fastmap = bufp->fastmap;
+  register char *translate = bufp->translate;
+  int total_size = size1 + size2;
+  int endpos = startpos + range;
+
+  /* Check for out-of-range STARTPOS.  */
+  if (startpos < 0 || startpos > total_size)
+    return -1;
+
+  /* Fix up RANGE if it might eventually take us outside
+     the virtual concatenation of STRING1 and STRING2.  */
+  if (endpos < -1)
+    range = -1 - startpos;
+  else if (endpos > total_size)
+    range = total_size - startpos;
+
+  /* If the search isn't to be a backwards one, don't waste time in a
+     search for a pattern that must be anchored.  */
+  if (bufp->used > 0 && (re_opcode_t) bufp->buffer[0] == begbuf && range > 0)
+    {
+      if (startpos > 0)
+    return -1;
+      else
+    range = 1;
+    }
+
+  /* Update the fastmap now if not correct already.  */
+  if (fastmap && !bufp->fastmap_accurate)
+    if (re_compile_fastmap (bufp) == -2)
+      return -2;
+
+  /* Loop through the string, looking for a place to start matching.  */
+  for (;;)
+    {
+      /* If a fastmap is supplied, skip quickly over characters that
+         cannot be the start of a match.  If the pattern can match the
+         null string, however, we don't need to skip characters; we want
+         the first null string.  */
+      if (fastmap && startpos < total_size && !bufp->can_be_null)
+    {
+      if (range > 0)	/* Searching forwards.  */
+        {
+          register const char *d;
+          register int lim = 0;
+          int irange = range;
+
+              if (startpos < size1 && startpos + range >= size1)
+                lim = range - (size1 - startpos);
+
+          d = (startpos >= size1 ? string2 - size1 : string1) + startpos;
+
+              /* Written out as an if-else to avoid testing `translate'
+                 inside the loop.  */
+          if (translate)
+                while (range > lim
+                       && !fastmap[(unsigned char)
+                   translate[(unsigned char) *d++]])
+                  range--;
+          else
+                while (range > lim && !fastmap[(unsigned char) *d++])
+                  range--;
+
+          startpos += irange - range;
+        }
+      else				/* Searching backwards.  */
+        {
+          register char c = (size1 == 0 || startpos >= size1
+                                 ? string2[startpos - size1]
+                                 : string1[startpos]);
+
+          if (!fastmap[(unsigned char) TRANSLATE (c)])
+        goto advance;
+        }
+    }
+
+      /* If can't match the null string, and that's all we have left, fail.  */
+      if (range >= 0 && startpos == total_size && fastmap
+          && !bufp->can_be_null)
+    return -1;
+
+      val = re_match_2 (bufp, string1, size1, string2, size2,
+                    startpos, regs, stop);
+      if (val >= 0)
+    return startpos;
+
+      if (val == -2)
+    return -2;
+
+    advance:
+      if (!range)
+        break;
+      else if (range > 0)
+        {
+          range--;
+          startpos++;
+        }
+      else
+        {
+          range++;
+          startpos--;
+        }
+    }
+  return -1;
+} /* re_search_2 */
+
+/* Declarations and macros for re_match_2.  */
+
+static int bcmp_translate ();
+static boolean alt_match_null_string_p (),
+               common_op_match_null_string_p (),
+               group_match_null_string_p ();
+
+/* Structure for per-register (a.k.a. per-group) information.
+   This must not be longer than one word, because we push this value
+   onto the failure stack.  Other register information, such as the
+   starting and ending positions (which are addresses), and the list of
+   inner groups (which is a bits list) are maintained in separate
+   variables.
+
+   We are making a (strictly speaking) nonportable assumption here: that
+   the compiler will pack our bit fields into something that fits into
+   the type of `word', i.e., is something that fits into one item on the
+   failure stack.  */
+typedef union
+{
+  fail_stack_elt_t word;
+  struct
+  {
+      /* This field is one if this group can match the empty string,
+         zero if not.  If not yet determined,  `MATCH_NULL_UNSET_VALUE'.  */
+#define MATCH_NULL_UNSET_VALUE 3
+    unsigned match_null_string_p : 2;
+    unsigned is_active : 1;
+    unsigned matched_something : 1;
+    unsigned ever_matched_something : 1;
+  } bits;
+} register_info_type;
+
+#define REG_MATCH_NULL_STRING_P(R)  ((R).bits.match_null_string_p)
+#define IS_ACTIVE(R)  ((R).bits.is_active)
+#define MATCHED_SOMETHING(R)  ((R).bits.matched_something)
+#define EVER_MATCHED_SOMETHING(R)  ((R).bits.ever_matched_something)
+
+
+/* Call this when have matched a real character; it sets `matched' flags
+   for the subexpressions which we are currently inside.  Also records
+   that those subexprs have matched.  */
+#define SET_REGS_MATCHED()						\
+  do									\
+    {									\
+      unsigned r;							\
+      for (r = lowest_active_reg; r <= highest_active_reg; r++)		\
+        {								\
+          MATCHED_SOMETHING (reg_info[r])				\
+            = EVER_MATCHED_SOMETHING (reg_info[r])			\
+            = 1;							\
+        }								\
+    }									\
+  while (0)
+
+
+/* This converts PTR, a pointer into one of the search strings `string1'
+   and `string2' into an offset from the beginning of that string.  */
+#define POINTER_TO_OFFSET(ptr)						\
+  (FIRST_STRING_P (ptr) ? (ptr) - string1 : (ptr) - string2 + size1)
+
+/* Registers are set to a sentinel when they haven't yet matched.  */
+#define REG_UNSET_VALUE ((char *) -1)
+#define REG_UNSET(e) ((e) == REG_UNSET_VALUE)
+
+
+/* Macros for dealing with the split strings in re_match_2.  */
+
+#define MATCHING_IN_FIRST_STRING  (dend == end_match_1)
+
+/* Call before fetching a character with *d.  This switches over to
+   string2 if necessary.  */
+#define PREFETCH()							\
+  while (d == dend)						    	\
+    {									\
+      /* End of string2 => fail.  */					\
+      if (dend == end_match_2) 						\
+        goto fail;							\
+      /* End of string1 => advance to string2.  */ 			\
+      d = string2;						        \
+      dend = end_match_2;						\
+    }
+
+
+/* Test if at very beginning or at very end of the virtual concatenation
+   of `string1' and `string2'.  If only one string, it's `string2'.  */
+#define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2)
+#define AT_STRINGS_END(d) ((d) == end2)
+
+
+/* Test if D points to a character which is word-constituent.  We have
+   two special cases to check for: if past the end of string1, look at
+   the first character in string2; and if before the beginning of
+   string2, look at the last character in string1.  */
+#define WORDCHAR_P(d)							\
+  (SYNTAX ((d) == end1 ? *string2					\
+           : (d) == string2 - 1 ? *(end1 - 1) : *(d))			\
+   == Sword)
+
+/* Test if the character before D and the one at D differ with respect
+   to being word-constituent.  */
+#define AT_WORD_BOUNDARY(d)						\
+  (AT_STRINGS_BEG (d) || AT_STRINGS_END (d)				\
+   || WORDCHAR_P (d - 1) != WORDCHAR_P (d))
+
+
+/* Free everything we malloc.  */
+#ifdef REGEX_MALLOC
+#define FREE_VAR(var) if (var) free (var); var = NULL
+#define FREE_VARIABLES()						\
+  do {									\
+    FREE_VAR (fail_stack.stack);					\
+    FREE_VAR (regstart);						\
+    FREE_VAR (regend);							\
+    FREE_VAR (old_regstart);						\
+    FREE_VAR (old_regend);						\
+    FREE_VAR (best_regstart);						\
+    FREE_VAR (best_regend);						\
+    FREE_VAR (reg_info);						\
+    FREE_VAR (reg_dummy);						\
+    FREE_VAR (reg_info_dummy);						\
+  } while (0)
+#else /* not REGEX_MALLOC */
+/* Some MIPS systems (at least) want this to free alloca'd storage.  */
+#define FREE_VARIABLES() alloca (0)
+#endif /* not REGEX_MALLOC */
+
+
+/* These values must meet several constraints.  They must not be valid
+   register values; since we have a limit of 255 registers (because
+   we use only one byte in the pattern for the register number), we can
+   use numbers larger than 255.  They must differ by 1, because of
+   NUM_FAILURE_ITEMS above.  And the value for the lowest register must
+   be larger than the value for the highest register, so we do not try
+   to actually save any registers when none are active.  */
+#define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
+#define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1)
+
+/* Matching routines.  */
+
+#ifndef emacs   /* Emacs never uses this.  */
+/* re_match is like re_match_2 except it takes only a single string.  */
+
+int
+re_match (bufp, string, size, pos, regs)
+     struct re_pattern_buffer *bufp;
+     const char *string;
+     int size, pos;
+     struct re_registers *regs;
+ {
+  return re_match_2 (bufp, NULL, 0, string, size, pos, regs, size);
+}
+#endif /* not emacs */
+
+
+/* re_match_2 matches the compiled pattern in BUFP against the
+   the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1
+   and SIZE2, respectively).  We start matching at POS, and stop
+   matching at STOP.
+
+   If REGS is non-null and the `no_sub' field of BUFP is nonzero, we
+   store offsets for the substring each group matched in REGS.  See the
+   documentation for exactly how many groups we fill.
+
+   We return -1 if no match, -2 if an internal error (such as the
+   failure stack overflowing).  Otherwise, we return the length of the
+   matched substring.  */
+
+int
+re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop)
+     struct re_pattern_buffer *bufp;
+     const char *string1, *string2;
+     int size1, size2;
+     int pos;
+     struct re_registers *regs;
+     int stop;
+{
+  /* General temporaries.  */
+  int mcnt;
+  unsigned char *p1;
+
+  /* Just past the end of the corresponding string.  */
+  const char *end1, *end2;
+
+  /* Pointers into string1 and string2, just past the last characters in
+     each to consider matching.  */
+  const char *end_match_1, *end_match_2;
+
+  /* Where we are in the data, and the end of the current string.  */
+  const char *d, *dend;
+
+  /* Where we are in the pattern, and the end of the pattern.  */
+  unsigned char *p = bufp->buffer;
+  register unsigned char *pend = p + bufp->used;
+
+  /* We use this to map every character in the string.  */
+  char *translate = bufp->translate;
+
+  /* Failure point stack.  Each place that can handle a failure further
+     down the line pushes a failure point on this stack.  It consists of
+     restart, regend, and reg_info for all registers corresponding to
+     the subexpressions we're currently inside, plus the number of such
+     registers, and, finally, two char *'s.  The first char * is where
+     to resume scanning the pattern; the second one is where to resume
+     scanning the strings.  If the latter is zero, the failure point is
+     a ``dummy''; if a failure happens and the failure point is a dummy,
+     it gets discarded and the next next one is tried.  */
+  fail_stack_type fail_stack;
+#ifdef DEBUG
+  static unsigned failure_id = 0;
+  unsigned nfailure_points_pushed = 0, nfailure_points_popped = 0;
+#endif
+
+  /* We fill all the registers internally, independent of what we
+     return, for use in backreferences.  The number here includes
+     an element for register zero.  */
+  unsigned num_regs = bufp->re_nsub + 1;
+
+  /* The currently active registers.  */
+  unsigned lowest_active_reg = NO_LOWEST_ACTIVE_REG;
+  unsigned highest_active_reg = NO_HIGHEST_ACTIVE_REG;
+
+  /* Information on the contents of registers. These are pointers into
+     the input strings; they record just what was matched (on this
+     attempt) by a subexpression part of the pattern, that is, the
+     regnum-th regstart pointer points to where in the pattern we began
+     matching and the regnum-th regend points to right after where we
+     stopped matching the regnum-th subexpression.  (The zeroth register
+     keeps track of what the whole pattern matches.)  */
+  const char **regstart, **regend;
+
+  /* If a group that's operated upon by a repetition operator fails to
+     match anything, then the register for its start will need to be
+     restored because it will have been set to wherever in the string we
+     are when we last see its open-group operator.  Similarly for a
+     register's end.  */
+  const char **old_regstart, **old_regend;
+
+  /* The is_active field of reg_info helps us keep track of which (possibly
+     nested) subexpressions we are currently in. The matched_something
+     field of reg_info[reg_num] helps us tell whether or not we have
+     matched any of the pattern so far this time through the reg_num-th
+     subexpression.  These two fields get reset each time through any
+     loop their register is in.  */
+  register_info_type *reg_info;
+
+  /* The following record the register info as found in the above
+     variables when we find a match better than any we've seen before.
+     This happens as we backtrack through the failure points, which in
+     turn happens only if we have not yet matched the entire string. */
+  unsigned best_regs_set = false;
+  const char **best_regstart, **best_regend;
+
+  /* Logically, this is `best_regend[0]'.  But we don't want to have to
+     allocate space for that if we're not allocating space for anything
+     else (see below).  Also, we never need info about register 0 for
+     any of the other register vectors, and it seems rather a kludge to
+     treat `best_regend' differently than the rest.  So we keep track of
+     the end of the best match so far in a separate variable.  We
+     initialize this to NULL so that when we backtrack the first time
+     and need to test it, it's not garbage.  */
+  const char *match_end = NULL;
+
+  /* Used when we pop values we don't care about.  */
+  const char **reg_dummy;
+  register_info_type *reg_info_dummy;
+
+#ifdef DEBUG
+  /* Counts the total number of registers pushed.  */
+  unsigned num_regs_pushed = 0;
+#endif
+
+  DEBUG_PRINT1 ("\n\nEntering re_match_2.\n");
+
+  INIT_FAIL_STACK ();
+
+  /* Do not bother to initialize all the register variables if there are
+     no groups in the pattern, as it takes a fair amount of time.  If
+     there are groups, we include space for register 0 (the whole
+     pattern), even though we never use it, since it simplifies the
+     array indexing.  We should fix this.  */
+  if (bufp->re_nsub)
+    {
+      regstart = REGEX_TALLOC (num_regs, const char *);
+      regend = REGEX_TALLOC (num_regs, const char *);
+      old_regstart = REGEX_TALLOC (num_regs, const char *);
+      old_regend = REGEX_TALLOC (num_regs, const char *);
+      best_regstart = REGEX_TALLOC (num_regs, const char *);
+      best_regend = REGEX_TALLOC (num_regs, const char *);
+      reg_info = REGEX_TALLOC (num_regs, register_info_type);
+      reg_dummy = REGEX_TALLOC (num_regs, const char *);
+      reg_info_dummy = REGEX_TALLOC (num_regs, register_info_type);
+
+      if (!(regstart && regend && old_regstart && old_regend && reg_info
+            && best_regstart && best_regend && reg_dummy && reg_info_dummy))
+        {
+          FREE_VARIABLES ();
+          return -2;
+        }
+    }
+#ifdef REGEX_MALLOC
+  else
+    {
+      /* We must initialize all our variables to NULL, so that
+         `FREE_VARIABLES' doesn't try to free them.  */
+      regstart = regend = old_regstart = old_regend = best_regstart
+        = best_regend = reg_dummy = NULL;
+      reg_info = reg_info_dummy = (register_info_type *) NULL;
+    }
+#endif /* REGEX_MALLOC */
+
+  /* The starting position is bogus.  */
+  if (pos < 0 || pos > size1 + size2)
+    {
+      FREE_VARIABLES ();
+      return -1;
+    }
+
+  /* Initialize subexpression text positions to -1 to mark ones that no
+     start_memory/stop_memory has been seen for. Also initialize the
+     register information struct.  */
+  for (mcnt = 1; mcnt < num_regs; mcnt++)
+    {
+      regstart[mcnt] = regend[mcnt]
+        = old_regstart[mcnt] = old_regend[mcnt] = REG_UNSET_VALUE;
+
+      REG_MATCH_NULL_STRING_P (reg_info[mcnt]) = MATCH_NULL_UNSET_VALUE;
+      IS_ACTIVE (reg_info[mcnt]) = 0;
+      MATCHED_SOMETHING (reg_info[mcnt]) = 0;
+      EVER_MATCHED_SOMETHING (reg_info[mcnt]) = 0;
+    }
+
+  /* We move `string1' into `string2' if the latter's empty -- but not if
+     `string1' is null.  */
+  if (size2 == 0 && string1 != NULL)
+    {
+      string2 = string1;
+      size2 = size1;
+      string1 = 0;
+      size1 = 0;
+    }
+  end1 = string1 + size1;
+  end2 = string2 + size2;
+
+  /* Compute where to stop matching, within the two strings.  */
+  if (stop <= size1)
+    {
+      end_match_1 = string1 + stop;
+      end_match_2 = string2;
+    }
+  else
+    {
+      end_match_1 = end1;
+      end_match_2 = string2 + stop - size1;
+    }
+
+  /* `p' scans through the pattern as `d' scans through the data.
+     `dend' is the end of the input string that `d' points within.  `d'
+     is advanced into the following input string whenever necessary, but
+     this happens before fetching; therefore, at the beginning of the
+     loop, `d' can be pointing at the end of a string, but it cannot
+     equal `string2'.  */
+  if (size1 > 0 && pos <= size1)
+    {
+      d = string1 + pos;
+      dend = end_match_1;
+    }
+  else
+    {
+      d = string2 + pos - size1;
+      dend = end_match_2;
+    }
+
+  DEBUG_PRINT1 ("The compiled pattern is: ");
+  DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
+  DEBUG_PRINT1 ("The string to match is: `");
+  DEBUG_PRINT_DOUBLE_STRING (d, string1, size1, string2, size2);
+  DEBUG_PRINT1 ("'\n");
+
+  /* This loops over pattern commands.  It exits by returning from the
+     function if the match is complete, or it drops through if the match
+     fails at this starting point in the input data.  */
+  for (;;)
+    {
+      DEBUG_PRINT2 ("\n0x%x: ", p);
+
+      if (p == pend)
+    { /* End of pattern means we might have succeeded.  */
+          DEBUG_PRINT1 ("end of pattern ... ");
+
+      /* If we haven't matched the entire string, and we want the
+             longest match, try backtracking.  */
+          if (d != end_match_2)
+        {
+              DEBUG_PRINT1 ("backtracking.\n");
+
+              if (!FAIL_STACK_EMPTY ())
+                { /* More failure points to try.  */
+                  boolean same_str_p = (FIRST_STRING_P (match_end)
+                                == MATCHING_IN_FIRST_STRING);
+
+                  /* If exceeds best match so far, save it.  */
+                  if (!best_regs_set
+                      || (same_str_p && d > match_end)
+                      || (!same_str_p && !MATCHING_IN_FIRST_STRING))
+                    {
+                      best_regs_set = true;
+                      match_end = d;
+
+                      DEBUG_PRINT1 ("\nSAVING match as best so far.\n");
+
+                      for (mcnt = 1; mcnt < num_regs; mcnt++)
+                        {
+                          best_regstart[mcnt] = regstart[mcnt];
+                          best_regend[mcnt] = regend[mcnt];
+                        }
+                    }
+                  goto fail;
+                }
+
+              /* If no failure points, don't restore garbage.  */
+              else if (best_regs_set)
+                {
+            restore_best_regs:
+                  /* Restore best match.  It may happen that `dend ==
+                     end_match_1' while the restored d is in string2.
+                     For example, the pattern `x.*y.*z' against the
+                     strings `x-' and `y-z-', if the two strings are
+                     not consecutive in memory.  */
+                  DEBUG_PRINT1 ("Restoring best registers.\n");
+
+                  d = match_end;
+                  dend = ((d >= string1 && d <= end1)
+                   ? end_match_1 : end_match_2);
+
+          for (mcnt = 1; mcnt < num_regs; mcnt++)
+            {
+              regstart[mcnt] = best_regstart[mcnt];
+              regend[mcnt] = best_regend[mcnt];
+            }
+                }
+            } /* d != end_match_2 */
+
+          DEBUG_PRINT1 ("Accepting match.\n");
+
+          /* If caller wants register contents data back, do it.  */
+          if (regs && !bufp->no_sub)
+        {
+              /* Have the register data arrays been allocated?  */
+              if (bufp->regs_allocated == REGS_UNALLOCATED)
+                { /* No.  So allocate them with malloc.  We need one
+                     extra element beyond `num_regs' for the `-1' marker
+                     GNU code uses.  */
+                  regs->num_regs = MAX (RE_NREGS, num_regs + 1);
+                  regs->start = TALLOC (regs->num_regs, regoff_t);
+                  regs->end = TALLOC (regs->num_regs, regoff_t);
+                  if (regs->start == NULL || regs->end == NULL)
+                    return -2;
+                  bufp->regs_allocated = REGS_REALLOCATE;
+                }
+              else if (bufp->regs_allocated == REGS_REALLOCATE)
+                { /* Yes.  If we need more elements than were already
+                     allocated, reallocate them.  If we need fewer, just
+                     leave it alone.  */
+                  if (regs->num_regs < num_regs + 1)
+                    {
+                      regs->num_regs = num_regs + 1;
+                      RETALLOC (regs->start, regs->num_regs, regoff_t);
+                      RETALLOC (regs->end, regs->num_regs, regoff_t);
+                      if (regs->start == NULL || regs->end == NULL)
+                        return -2;
+                    }
+                }
+              else
+                assert (bufp->regs_allocated == REGS_FIXED);
+
+              /* Convert the pointer data in `regstart' and `regend' to
+                 indices.  Register zero has to be set differently,
+                 since we haven't kept track of any info for it.  */
+              if (regs->num_regs > 0)
+                {
+                  regs->start[0] = pos;
+                  regs->end[0] = (MATCHING_IN_FIRST_STRING ? d - string1
+                      : d - string2 + size1);
+                }
+
+              /* Go through the first `min (num_regs, regs->num_regs)'
+                 registers, since that is all we initialized.  */
+          for (mcnt = 1; mcnt < MIN (num_regs, regs->num_regs); mcnt++)
+        {
+                  if (REG_UNSET (regstart[mcnt]) || REG_UNSET (regend[mcnt]))
+                    regs->start[mcnt] = regs->end[mcnt] = -1;
+                  else
+                    {
+              regs->start[mcnt] = POINTER_TO_OFFSET (regstart[mcnt]);
+                      regs->end[mcnt] = POINTER_TO_OFFSET (regend[mcnt]);
+                    }
+        }
+
+              /* If the regs structure we return has more elements than
+                 were in the pattern, set the extra elements to -1.  If
+                 we (re)allocated the registers, this is the case,
+                 because we always allocate enough to have at least one
+                 -1 at the end.  */
+              for (mcnt = num_regs; mcnt < regs->num_regs; mcnt++)
+                regs->start[mcnt] = regs->end[mcnt] = -1;
+        } /* regs && !bufp->no_sub */
+
+          FREE_VARIABLES ();
+          DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n",
+                        nfailure_points_pushed, nfailure_points_popped,
+                        nfailure_points_pushed - nfailure_points_popped);
+          DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed);
+
+          mcnt = d - pos - (MATCHING_IN_FIRST_STRING
+                ? string1
+                : string2 - size1);
+
+          DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt);
+
+          return mcnt;
+        }
+
+      /* Otherwise match next pattern command.  */
+#ifdef SWITCH_ENUM_BUG
+      switch ((int) ((re_opcode_t) *p++))
+#else
+      switch ((re_opcode_t) *p++)
+#endif
+    {
+        /* Ignore these.  Used to ignore the n of succeed_n's which
+           currently have n == 0.  */
+        case no_op:
+          DEBUG_PRINT1 ("EXECUTING no_op.\n");
+          break;
+
+
+        /* Match the next n pattern characters exactly.  The following
+           byte in the pattern defines n, and the n bytes after that
+           are the characters to match.  */
+    case exactn:
+      mcnt = *p++;
+          DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt);
+
+          /* This is written out as an if-else so we don't waste time
+             testing `translate' inside the loop.  */
+          if (translate)
+        {
+          do
+        {
+          PREFETCH ();
+          if (translate[(unsigned char) *d++] != (char) *p++)
+                    goto fail;
+        }
+          while (--mcnt);
+        }
+      else
+        {
+          do
+        {
+          PREFETCH ();
+          if (*d++ != (char) *p++) goto fail;
+        }
+          while (--mcnt);
+        }
+      SET_REGS_MATCHED ();
+          break;
+
+
+        /* Match any character except possibly a newline or a null.  */
+    case anychar:
+          DEBUG_PRINT1 ("EXECUTING anychar.\n");
+
+          PREFETCH ();
+
+          if ((!(bufp->syntax & RE_DOT_NEWLINE) && TRANSLATE (*d) == '\n')
+              || (bufp->syntax & RE_DOT_NOT_NULL && TRANSLATE (*d) == '\000'))
+        goto fail;
+
+          SET_REGS_MATCHED ();
+          DEBUG_PRINT2 ("  Matched `%d'.\n", *d);
+          d++;
+      break;
+
+
+    case charset:
+    case charset_not:
+      {
+        register unsigned char c;
+        boolean not = (re_opcode_t) *(p - 1) == charset_not;
+
+            DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : "");
+
+        PREFETCH ();
+        c = TRANSLATE (*d); /* The character to match.  */
+
+            /* Cast to `unsigned' instead of `unsigned char' in case the
+               bit list is a full 32 bytes long.  */
+        if (c < (unsigned) (*p * BYTEWIDTH)
+        && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
+          not = !not;
+
+        p += 1 + *p;
+
+        if (!not) goto fail;
+
+        SET_REGS_MATCHED ();
+            d++;
+        break;
+      }
+
+
+        /* The beginning of a group is represented by start_memory.
+           The arguments are the register number in the next byte, and the
+           number of groups inner to this one in the next.  The text
+           matched within the group is recorded (in the internal
+           registers data structure) under the register number.  */
+        case start_memory:
+      DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p, p[1]);
+
+          /* Find out if this group can match the empty string.  */
+      p1 = p;		/* To send to group_match_null_string_p.  */
+
+          if (REG_MATCH_NULL_STRING_P (reg_info[*p]) == MATCH_NULL_UNSET_VALUE)
+            REG_MATCH_NULL_STRING_P (reg_info[*p])
+              = group_match_null_string_p (&p1, pend, reg_info);
+
+          /* Save the position in the string where we were the last time
+             we were at this open-group operator in case the group is
+             operated upon by a repetition operator, e.g., with `(a*)*b'
+             against `ab'; then we want to ignore where we are now in
+             the string in case this attempt to match fails.  */
+          old_regstart[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p])
+                             ? REG_UNSET (regstart[*p]) ? d : regstart[*p]
+                             : regstart[*p];
+      DEBUG_PRINT2 ("  old_regstart: %d\n",
+             POINTER_TO_OFFSET (old_regstart[*p]));
+
+          regstart[*p] = d;
+      DEBUG_PRINT2 ("  regstart: %d\n", POINTER_TO_OFFSET (regstart[*p]));
+
+          IS_ACTIVE (reg_info[*p]) = 1;
+          MATCHED_SOMETHING (reg_info[*p]) = 0;
+
+          /* This is the new highest active register.  */
+          highest_active_reg = *p;
+
+          /* If nothing was active before, this is the new lowest active
+             register.  */
+          if (lowest_active_reg == NO_LOWEST_ACTIVE_REG)
+            lowest_active_reg = *p;
+
+          /* Move past the register number and inner group count.  */
+          p += 2;
+          break;
+
+
+        /* The stop_memory opcode represents the end of a group.  Its
+           arguments are the same as start_memory's: the register
+           number, and the number of inner groups.  */
+    case stop_memory:
+      DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p, p[1]);
+
+          /* We need to save the string position the last time we were at
+             this close-group operator in case the group is operated
+             upon by a repetition operator, e.g., with `((a*)*(b*)*)*'
+             against `aba'; then we want to ignore where we are now in
+             the string in case this attempt to match fails.  */
+          old_regend[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p])
+                           ? REG_UNSET (regend[*p]) ? d : regend[*p]
+               : regend[*p];
+      DEBUG_PRINT2 ("      old_regend: %d\n",
+             POINTER_TO_OFFSET (old_regend[*p]));
+
+          regend[*p] = d;
+      DEBUG_PRINT2 ("      regend: %d\n", POINTER_TO_OFFSET (regend[*p]));
+
+          /* This register isn't active anymore.  */
+          IS_ACTIVE (reg_info[*p]) = 0;
+
+          /* If this was the only register active, nothing is active
+             anymore.  */
+          if (lowest_active_reg == highest_active_reg)
+            {
+              lowest_active_reg = NO_LOWEST_ACTIVE_REG;
+              highest_active_reg = NO_HIGHEST_ACTIVE_REG;
+            }
+          else
+            { /* We must scan for the new highest active register, since
+                 it isn't necessarily one less than now: consider
+                 (a(b)c(d(e)f)g).  When group 3 ends, after the f), the
+                 new highest active register is 1.  */
+              unsigned char r = *p - 1;
+              while (r > 0 && !IS_ACTIVE (reg_info[r]))
+                r--;
+
+              /* If we end up at register zero, that means that we saved
+                 the registers as the result of an `on_failure_jump', not
+                 a `start_memory', and we jumped to past the innermost
+                 `stop_memory'.  For example, in ((.)*) we save
+                 registers 1 and 2 as a result of the *, but when we pop
+                 back to the second ), we are at the stop_memory 1.
+                 Thus, nothing is active.  */
+          if (r == 0)
+                {
+                  lowest_active_reg = NO_LOWEST_ACTIVE_REG;
+                  highest_active_reg = NO_HIGHEST_ACTIVE_REG;
+                }
+              else
+                highest_active_reg = r;
+            }
+
+          /* If just failed to match something this time around with a
+             group that's operated on by a repetition operator, try to
+             force exit from the ``loop'', and restore the register
+             information for this group that we had before trying this
+             last match.  */
+          if ((!MATCHED_SOMETHING (reg_info[*p])
+               || (re_opcode_t) p[-3] == start_memory)
+          && (p + 2) < pend)
+            {
+              boolean is_a_jump_n = false;
+
+              p1 = p + 2;
+              mcnt = 0;
+              switch ((re_opcode_t) *p1++)
+                {
+                  case jump_n:
+            is_a_jump_n = true;
+                  case pop_failure_jump:
+          case maybe_pop_jump:
+          case jump:
+          case dummy_failure_jump:
+                    EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+            if (is_a_jump_n)
+              p1 += 2;
+                    break;
+
+                  default:
+                    /* do nothing */ ;
+                }
+          p1 += mcnt;
+
+              /* If the next operation is a jump backwards in the pattern
+             to an on_failure_jump right before the start_memory
+                 corresponding to this stop_memory, exit from the loop
+                 by forcing a failure after pushing on the stack the
+                 on_failure_jump's jump in the pattern, and d.  */
+              if (mcnt < 0 && (re_opcode_t) *p1 == on_failure_jump
+                  && (re_opcode_t) p1[3] == start_memory && p1[4] == *p)
+        {
+                  /* If this group ever matched anything, then restore
+                     what its registers were before trying this last
+                     failed match, e.g., with `(a*)*b' against `ab' for
+                     regstart[1], and, e.g., with `((a*)*(b*)*)*'
+                     against `aba' for regend[3].
+
+                     Also restore the registers for inner groups for,
+                     e.g., `((a*)(b*))*' against `aba' (register 3 would
+                     otherwise get trashed).  */
+
+                  if (EVER_MATCHED_SOMETHING (reg_info[*p]))
+            {
+              unsigned r;
+
+                      EVER_MATCHED_SOMETHING (reg_info[*p]) = 0;
+
+              /* Restore this and inner groups' (if any) registers.  */
+                      for (r = *p; r < *p + *(p + 1); r++)
+                        {
+                          regstart[r] = old_regstart[r];
+
+                          /* xx why this test?  */
+                          if ((int) old_regend[r] >= (int) regstart[r])
+                            regend[r] = old_regend[r];
+                        }
+                    }
+          p1++;
+                  EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+                  PUSH_FAILURE_POINT (p1 + mcnt, d, -2);
+
+                  goto fail;
+                }
+            }
+
+          /* Move past the register number and the inner group count.  */
+          p += 2;
+          break;
+
+
+    /* \<digit> has been turned into a `duplicate' command which is
+           followed by the numeric value of <digit> as the register number.  */
+        case duplicate:
+      {
+        register const char *d2, *dend2;
+        int regno = *p++;   /* Get which register to match against.  */
+        DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno);
+
+        /* Can't back reference a group which we've never matched.  */
+            if (REG_UNSET (regstart[regno]) || REG_UNSET (regend[regno]))
+              goto fail;
+
+            /* Where in input to try to start matching.  */
+            d2 = regstart[regno];
+
+            /* Where to stop matching; if both the place to start and
+               the place to stop matching are in the same string, then
+               set to the place to stop, otherwise, for now have to use
+               the end of the first string.  */
+
+            dend2 = ((FIRST_STRING_P (regstart[regno])
+              == FIRST_STRING_P (regend[regno]))
+             ? regend[regno] : end_match_1);
+        for (;;)
+          {
+        /* If necessary, advance to next segment in register
+                   contents.  */
+        while (d2 == dend2)
+          {
+            if (dend2 == end_match_2) break;
+            if (dend2 == regend[regno]) break;
+
+                    /* End of string1 => advance to string2. */
+                    d2 = string2;
+                    dend2 = regend[regno];
+          }
+        /* At end of register contents => success */
+        if (d2 == dend2) break;
+
+        /* If necessary, advance to next segment in data.  */
+        PREFETCH ();
+
+        /* How many characters left in this segment to match.  */
+        mcnt = dend - d;
+
+        /* Want how many consecutive characters we can match in
+                   one shot, so, if necessary, adjust the count.  */
+                if (mcnt > dend2 - d2)
+          mcnt = dend2 - d2;
+
+        /* Compare that many; failure if mismatch, else move
+                   past them.  */
+        if (translate
+                    ? bcmp_translate (d, d2, mcnt, translate)
+                    : bcmp (d, d2, mcnt))
+          goto fail;
+        d += mcnt, d2 += mcnt;
+          }
+      }
+      break;
+
+
+        /* begline matches the empty string at the beginning of the string
+           (unless `not_bol' is set in `bufp'), and, if
+           `newline_anchor' is set, after newlines.  */
+    case begline:
+          DEBUG_PRINT1 ("EXECUTING begline.\n");
+
+          if (AT_STRINGS_BEG (d))
+            {
+              if (!bufp->not_bol) break;
+            }
+          else if (d[-1] == '\n' && bufp->newline_anchor)
+            {
+              break;
+            }
+          /* In all other cases, we fail.  */
+          goto fail;
+
+
+        /* endline is the dual of begline.  */
+    case endline:
+          DEBUG_PRINT1 ("EXECUTING endline.\n");
+
+          if (AT_STRINGS_END (d))
+            {
+              if (!bufp->not_eol) break;
+            }
+
+          /* We have to ``prefetch'' the next character.  */
+          else if ((d == end1 ? *string2 : *d) == '\n'
+                   && bufp->newline_anchor)
+            {
+              break;
+            }
+          goto fail;
+
+
+    /* Match at the very beginning of the data.  */
+        case begbuf:
+          DEBUG_PRINT1 ("EXECUTING begbuf.\n");
+          if (AT_STRINGS_BEG (d))
+            break;
+          goto fail;
+
+
+    /* Match at the very end of the data.  */
+        case endbuf:
+          DEBUG_PRINT1 ("EXECUTING endbuf.\n");
+      if (AT_STRINGS_END (d))
+        break;
+          goto fail;
+
+
+        /* on_failure_keep_string_jump is used to optimize `.*\n'.  It
+           pushes NULL as the value for the string on the stack.  Then
+           `pop_failure_point' will keep the current value for the
+           string, instead of restoring it.  To see why, consider
+           matching `foo\nbar' against `.*\n'.  The .* matches the foo;
+           then the . fails against the \n.  But the next thing we want
+           to do is match the \n against the \n; if we restored the
+           string value, we would be back at the foo.
+
+           Because this is used only in specific cases, we don't need to
+           check all the things that `on_failure_jump' does, to make
+           sure the right things get saved on the stack.  Hence we don't
+           share its code.  The only reason to push anything on the
+           stack at all is that otherwise we would have to change
+           `anychar's code to do something besides goto fail in this
+           case; that seems worse than this.  */
+        case on_failure_keep_string_jump:
+          DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump");
+
+          EXTRACT_NUMBER_AND_INCR (mcnt, p);
+          DEBUG_PRINT3 (" %d (to 0x%x):\n", mcnt, p + mcnt);
+
+          PUSH_FAILURE_POINT (p + mcnt, NULL, -2);
+          break;
+
+
+    /* Uses of on_failure_jump:
+
+           Each alternative starts with an on_failure_jump that points
+           to the beginning of the next alternative.  Each alternative
+           except the last ends with a jump that in effect jumps past
+           the rest of the alternatives.  (They really jump to the
+           ending jump of the following alternative, because tensioning
+           these jumps is a hassle.)
+
+           Repeats start with an on_failure_jump that points past both
+           the repetition text and either the following jump or
+           pop_failure_jump back to this on_failure_jump.  */
+    case on_failure_jump:
+        on_failure:
+          DEBUG_PRINT1 ("EXECUTING on_failure_jump");
+
+          EXTRACT_NUMBER_AND_INCR (mcnt, p);
+          DEBUG_PRINT3 (" %d (to 0x%x)", mcnt, p + mcnt);
+
+          /* If this on_failure_jump comes right before a group (i.e.,
+             the original * applied to a group), save the information
+             for that group and all inner ones, so that if we fail back
+             to this point, the group's information will be correct.
+             For example, in \(a*\)*\1, we need the preceding group,
+             and in \(\(a*\)b*\)\2, we need the inner group.  */
+
+          /* We can't use `p' to check ahead because we push
+             a failure point to `p + mcnt' after we do this.  */
+          p1 = p;
+
+          /* We need to skip no_op's before we look for the
+             start_memory in case this on_failure_jump is happening as
+             the result of a completed succeed_n, as in \(a\)\{1,3\}b\1
+             against aba.  */
+          while (p1 < pend && (re_opcode_t) *p1 == no_op)
+            p1++;
+
+          if (p1 < pend && (re_opcode_t) *p1 == start_memory)
+            {
+              /* We have a new highest active register now.  This will
+                 get reset at the start_memory we are about to get to,
+                 but we will have saved all the registers relevant to
+                 this repetition op, as described above.  */
+              highest_active_reg = *(p1 + 1) + *(p1 + 2);
+              if (lowest_active_reg == NO_LOWEST_ACTIVE_REG)
+                lowest_active_reg = *(p1 + 1);
+            }
+
+          DEBUG_PRINT1 (":\n");
+          PUSH_FAILURE_POINT (p + mcnt, d, -2);
+          break;
+
+
+        /* A smart repeat ends with `maybe_pop_jump'.
+       We change it to either `pop_failure_jump' or `jump'.  */
+        case maybe_pop_jump:
+          EXTRACT_NUMBER_AND_INCR (mcnt, p);
+          DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt);
+          {
+        register unsigned char *p2 = p;
+
+            /* Compare the beginning of the repeat with what in the
+               pattern follows its end. If we can establish that there
+               is nothing that they would both match, i.e., that we
+               would have to backtrack because of (as in, e.g., `a*a')
+               then we can change to pop_failure_jump, because we'll
+               never have to backtrack.
+
+               This is not true in the case of alternatives: in
+               `(a|ab)*' we do need to backtrack to the `ab' alternative
+               (e.g., if the string was `ab').  But instead of trying to
+               detect that here, the alternative has put on a dummy
+               failure point which is what we will end up popping.  */
+
+        /* Skip over open/close-group commands.  */
+        while (p2 + 2 < pend
+           && ((re_opcode_t) *p2 == stop_memory
+               || (re_opcode_t) *p2 == start_memory))
+          p2 += 3;			/* Skip over args, too.  */
+
+            /* If we're at the end of the pattern, we can change.  */
+            if (p2 == pend)
+          {
+        /* Consider what happens when matching ":\(.*\)"
+           against ":/".  I don't really understand this code
+           yet.  */
+            p[-3] = (unsigned char) pop_failure_jump;
+                DEBUG_PRINT1
+                  ("  End of pattern: change to `pop_failure_jump'.\n");
+              }
+
+            else if ((re_opcode_t) *p2 == exactn
+             || (bufp->newline_anchor && (re_opcode_t) *p2 == endline))
+          {
+        register unsigned char c
+                  = *p2 == (unsigned char) endline ? '\n' : p2[2];
+        p1 = p + mcnt;
+
+                /* p1[0] ... p1[2] are the `on_failure_jump' corresponding
+                   to the `maybe_finalize_jump' of this case.  Examine what
+                   follows.  */
+                if ((re_opcode_t) p1[3] == exactn && p1[5] != c)
+                  {
+            p[-3] = (unsigned char) pop_failure_jump;
+                    DEBUG_PRINT3 ("  %c != %c => pop_failure_jump.\n",
+                                  c, p1[5]);
+                  }
+
+        else if ((re_opcode_t) p1[3] == charset
+             || (re_opcode_t) p1[3] == charset_not)
+          {
+            int not = (re_opcode_t) p1[3] == charset_not;
+
+            if (c < (unsigned char) (p1[4] * BYTEWIDTH)
+            && p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
+              not = !not;
+
+                    /* `not' is equal to 1 if c would match, which means
+                        that we can't change to pop_failure_jump.  */
+            if (!not)
+                      {
+                p[-3] = (unsigned char) pop_failure_jump;
+                        DEBUG_PRINT1 ("  No match => pop_failure_jump.\n");
+                      }
+          }
+          }
+      }
+      p -= 2;		/* Point at relative address again.  */
+      if ((re_opcode_t) p[-1] != pop_failure_jump)
+        {
+          p[-1] = (unsigned char) jump;
+              DEBUG_PRINT1 ("  Match => jump.\n");
+          goto unconditional_jump;
+        }
+        /* Note fall through.  */
+
+
+    /* The end of a simple repeat has a pop_failure_jump back to
+           its matching on_failure_jump, where the latter will push a
+           failure point.  The pop_failure_jump takes off failure
+           points put on by this pop_failure_jump's matching
+           on_failure_jump; we got through the pattern to here from the
+           matching on_failure_jump, so didn't fail.  */
+        case pop_failure_jump:
+          {
+            /* We need to pass separate storage for the lowest and
+               highest registers, even though we don't care about the
+               actual values.  Otherwise, we will restore only one
+               register from the stack, since lowest will == highest in
+               `pop_failure_point'.  */
+            unsigned dummy_low_reg, dummy_high_reg;
+            unsigned char *pdummy;
+            const char *sdummy;
+
+            DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n");
+            POP_FAILURE_POINT (sdummy, pdummy,
+                               dummy_low_reg, dummy_high_reg,
+                               reg_dummy, reg_dummy, reg_info_dummy);
+          }
+          /* Note fall through.  */
+
+
+        /* Unconditionally jump (without popping any failure points).  */
+        case jump:
+    unconditional_jump:
+      EXTRACT_NUMBER_AND_INCR (mcnt, p);	/* Get the amount to jump.  */
+          DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt);
+      p += mcnt;				/* Do the jump.  */
+          DEBUG_PRINT2 ("(to 0x%x).\n", p);
+      break;
+
+
+        /* We need this opcode so we can detect where alternatives end
+           in `group_match_null_string_p' et al.  */
+        case jump_past_alt:
+          DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n");
+          goto unconditional_jump;
+
+
+        /* Normally, the on_failure_jump pushes a failure point, which
+           then gets popped at pop_failure_jump.  We will end up at
+           pop_failure_jump, also, and with a pattern of, say, `a+', we
+           are skipping over the on_failure_jump, so we have to push
+           something meaningless for pop_failure_jump to pop.  */
+        case dummy_failure_jump:
+          DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n");
+          /* It doesn't matter what we push for the string here.  What
+             the code at `fail' tests is the value for the pattern.  */
+          PUSH_FAILURE_POINT (0, 0, -2);
+          goto unconditional_jump;
+
+
+        /* At the end of an alternative, we need to push a dummy failure
+           point in case we are followed by a `pop_failure_jump', because
+           we don't want the failure point for the alternative to be
+           popped.  For example, matching `(a|ab)*' against `aab'
+           requires that we match the `ab' alternative.  */
+        case push_dummy_failure:
+          DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n");
+          /* See comments just above at `dummy_failure_jump' about the
+             two zeroes.  */
+          PUSH_FAILURE_POINT (0, 0, -2);
+          break;
+
+        /* Have to succeed matching what follows at least n times.
+           After that, handle like `on_failure_jump'.  */
+        case succeed_n:
+          EXTRACT_NUMBER (mcnt, p + 2);
+          DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt);
+
+          assert (mcnt >= 0);
+          /* Originally, this is how many times we HAVE to succeed.  */
+          if (mcnt > 0)
+            {
+               mcnt--;
+           p += 2;
+               STORE_NUMBER_AND_INCR (p, mcnt);
+               DEBUG_PRINT3 ("  Setting 0x%x to %d.\n", p, mcnt);
+            }
+      else if (mcnt == 0)
+            {
+              DEBUG_PRINT2 ("  Setting two bytes from 0x%x to no_op.\n", p+2);
+          p[2] = (unsigned char) no_op;
+              p[3] = (unsigned char) no_op;
+              goto on_failure;
+            }
+          break;
+
+        case jump_n:
+          EXTRACT_NUMBER (mcnt, p + 2);
+          DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt);
+
+          /* Originally, this is how many times we CAN jump.  */
+          if (mcnt)
+            {
+               mcnt--;
+               STORE_NUMBER (p + 2, mcnt);
+           goto unconditional_jump;
+            }
+          /* If don't have to jump any more, skip over the rest of command.  */
+      else
+        p += 4;
+          break;
+
+    case set_number_at:
+      {
+            DEBUG_PRINT1 ("EXECUTING set_number_at.\n");
+
+            EXTRACT_NUMBER_AND_INCR (mcnt, p);
+            p1 = p + mcnt;
+            EXTRACT_NUMBER_AND_INCR (mcnt, p);
+            DEBUG_PRINT3 ("  Setting 0x%x to %d.\n", p1, mcnt);
+        STORE_NUMBER (p1, mcnt);
+            break;
+          }
+
+        case wordbound:
+          DEBUG_PRINT1 ("EXECUTING wordbound.\n");
+          if (AT_WORD_BOUNDARY (d))
+        break;
+          goto fail;
+
+    case notwordbound:
+          DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
+      if (AT_WORD_BOUNDARY (d))
+        goto fail;
+          break;
+
+    case wordbeg:
+          DEBUG_PRINT1 ("EXECUTING wordbeg.\n");
+      if (WORDCHAR_P (d) && (AT_STRINGS_BEG (d) || !WORDCHAR_P (d - 1)))
+        break;
+          goto fail;
+
+    case wordend:
+          DEBUG_PRINT1 ("EXECUTING wordend.\n");
+      if (!AT_STRINGS_BEG (d) && WORDCHAR_P (d - 1)
+              && (!WORDCHAR_P (d) || AT_STRINGS_END (d)))
+        break;
+          goto fail;
+
+#ifdef emacs
+#ifdef emacs19
+    case before_dot:
+          DEBUG_PRINT1 ("EXECUTING before_dot.\n");
+      if (PTR_CHAR_POS ((unsigned char *) d) >= point)
+        goto fail;
+      break;
+
+    case at_dot:
+          DEBUG_PRINT1 ("EXECUTING at_dot.\n");
+      if (PTR_CHAR_POS ((unsigned char *) d) != point)
+        goto fail;
+      break;
+
+    case after_dot:
+          DEBUG_PRINT1 ("EXECUTING after_dot.\n");
+          if (PTR_CHAR_POS ((unsigned char *) d) <= point)
+        goto fail;
+      break;
+#else /* not emacs19 */
+    case at_dot:
+          DEBUG_PRINT1 ("EXECUTING at_dot.\n");
+      if (PTR_CHAR_POS ((unsigned char *) d) + 1 != point)
+        goto fail;
+      break;
+#endif /* not emacs19 */
+
+    case syntaxspec:
+          DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt);
+      mcnt = *p++;
+      goto matchsyntax;
+
+        case wordchar:
+          DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n");
+      mcnt = (int) Sword;
+        matchsyntax:
+      PREFETCH ();
+      if (SYNTAX (*d++) != (enum syntaxcode) mcnt)
+            goto fail;
+          SET_REGS_MATCHED ();
+      break;
+
+    case notsyntaxspec:
+          DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt);
+      mcnt = *p++;
+      goto matchnotsyntax;
+
+        case notwordchar:
+          DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n");
+      mcnt = (int) Sword;
+        matchnotsyntax:
+      PREFETCH ();
+      if (SYNTAX (*d++) == (enum syntaxcode) mcnt)
+            goto fail;
+      SET_REGS_MATCHED ();
+          break;
+
+#else /* not emacs */
+    case wordchar:
+          DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n");
+      PREFETCH ();
+          if (!WORDCHAR_P (d))
+            goto fail;
+      SET_REGS_MATCHED ();
+          d++;
+      break;
+
+    case notwordchar:
+          DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n");
+      PREFETCH ();
+      if (WORDCHAR_P (d))
+            goto fail;
+          SET_REGS_MATCHED ();
+          d++;
+      break;
+#endif /* not emacs */
+
+        default:
+          abort ();
+    }
+      continue;  /* Successfully executed one pattern command; keep going.  */
+
+
+    /* We goto here if a matching operation fails. */
+    fail:
+      if (!FAIL_STACK_EMPTY ())
+    { /* A restart point is known.  Restore to that state.  */
+          DEBUG_PRINT1 ("\nFAIL:\n");
+          POP_FAILURE_POINT (d, p,
+                             lowest_active_reg, highest_active_reg,
+                             regstart, regend, reg_info);
+
+          /* If this failure point is a dummy, try the next one.  */
+          if (!p)
+        goto fail;
+
+          /* If we failed to the end of the pattern, don't examine *p.  */
+      assert (p <= pend);
+          if (p < pend)
+            {
+              boolean is_a_jump_n = false;
+
+              /* If failed to a backwards jump that's part of a repetition
+                 loop, need to pop this failure point and use the next one.  */
+              switch ((re_opcode_t) *p)
+                {
+                case jump_n:
+                  is_a_jump_n = true;
+                case maybe_pop_jump:
+                case pop_failure_jump:
+                case jump:
+                  p1 = p + 1;
+                  EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+                  p1 += mcnt;
+
+                  if ((is_a_jump_n && (re_opcode_t) *p1 == succeed_n)
+                      || (!is_a_jump_n
+                          && (re_opcode_t) *p1 == on_failure_jump))
+                    goto fail;
+                  break;
+                default:
+                  /* do nothing */ ;
+                }
+            }
+
+          if (d >= string1 && d <= end1)
+        dend = end_match_1;
+        }
+      else
+        break;   /* Matching at this starting point really fails.  */
+    } /* for (;;) */
+
+  if (best_regs_set)
+    goto restore_best_regs;
+
+  FREE_VARIABLES ();
+
+  return -1;         			/* Failure to match.  */
+} /* re_match_2 */
+
+/* Subroutine definitions for re_match_2.  */
+
+
+/* We are passed P pointing to a register number after a start_memory.
+
+   Return true if the pattern up to the corresponding stop_memory can
+   match the empty string, and false otherwise.
+
+   If we find the matching stop_memory, sets P to point to one past its number.
+   Otherwise, sets P to an undefined byte less than or equal to END.
+
+   We don't handle duplicates properly (yet).  */
+
+static boolean
+group_match_null_string_p (p, end, reg_info)
+    unsigned char **p, *end;
+    register_info_type *reg_info;
+{
+  int mcnt;
+  /* Point to after the args to the start_memory.  */
+  unsigned char *p1 = *p + 2;
+
+  while (p1 < end)
+    {
+      /* Skip over opcodes that can match nothing, and return true or
+     false, as appropriate, when we get to one that can't, or to the
+         matching stop_memory.  */
+
+      switch ((re_opcode_t) *p1)
+        {
+        /* Could be either a loop or a series of alternatives.  */
+        case on_failure_jump:
+          p1++;
+          EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+
+          /* If the next operation is not a jump backwards in the
+         pattern.  */
+
+      if (mcnt >= 0)
+        {
+              /* Go through the on_failure_jumps of the alternatives,
+                 seeing if any of the alternatives cannot match nothing.
+                 The last alternative starts with only a jump,
+                 whereas the rest start with on_failure_jump and end
+                 with a jump, e.g., here is the pattern for `a|b|c':
+
+                 /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6
+                 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3
+                 /exactn/1/c
+
+                 So, we have to first go through the first (n-1)
+                 alternatives and then deal with the last one separately.  */
+
+
+              /* Deal with the first (n-1) alternatives, which start
+                 with an on_failure_jump (see above) that jumps to right
+                 past a jump_past_alt.  */
+
+              while ((re_opcode_t) p1[mcnt-3] == jump_past_alt)
+                {
+                  /* `mcnt' holds how many bytes long the alternative
+                     is, including the ending `jump_past_alt' and
+                     its number.  */
+
+                  if (!alt_match_null_string_p (p1, p1 + mcnt - 3,
+                                      reg_info))
+                    return false;
+
+                  /* Move to right after this alternative, including the
+             jump_past_alt.  */
+                  p1 += mcnt;
+
+                  /* Break if it's the beginning of an n-th alternative
+                     that doesn't begin with an on_failure_jump.  */
+                  if ((re_opcode_t) *p1 != on_failure_jump)
+                    break;
+
+          /* Still have to check that it's not an n-th
+             alternative that starts with an on_failure_jump.  */
+          p1++;
+                  EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+                  if ((re_opcode_t) p1[mcnt-3] != jump_past_alt)
+                    {
+              /* Get to the beginning of the n-th alternative.  */
+                      p1 -= 3;
+                      break;
+                    }
+                }
+
+              /* Deal with the last alternative: go back and get number
+                 of the `jump_past_alt' just before it.  `mcnt' contains
+                 the length of the alternative.  */
+              EXTRACT_NUMBER (mcnt, p1 - 2);
+
+              if (!alt_match_null_string_p (p1, p1 + mcnt, reg_info))
+                return false;
+
+              p1 += mcnt;	/* Get past the n-th alternative.  */
+            } /* if mcnt > 0 */
+          break;
+
+
+        case stop_memory:
+      assert (p1[1] == **p);
+          *p = p1 + 2;
+          return true;
+
+
+        default:
+          if (!common_op_match_null_string_p (&p1, end, reg_info))
+            return false;
+        }
+    } /* while p1 < end */
+
+  return false;
+} /* group_match_null_string_p */
+
+
+/* Similar to group_match_null_string_p, but doesn't deal with alternatives:
+   It expects P to be the first byte of a single alternative and END one
+   byte past the last. The alternative can contain groups.  */
+
+static boolean
+alt_match_null_string_p (p, end, reg_info)
+    unsigned char *p, *end;
+    register_info_type *reg_info;
+{
+  int mcnt;
+  unsigned char *p1 = p;
+
+  while (p1 < end)
+    {
+      /* Skip over opcodes that can match nothing, and break when we get
+         to one that can't.  */
+
+      switch ((re_opcode_t) *p1)
+        {
+    /* It's a loop.  */
+        case on_failure_jump:
+          p1++;
+          EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+          p1 += mcnt;
+          break;
+
+    default:
+          if (!common_op_match_null_string_p (&p1, end, reg_info))
+            return false;
+        }
+    }  /* while p1 < end */
+
+  return true;
+} /* alt_match_null_string_p */
+
+
+/* Deals with the ops common to group_match_null_string_p and
+   alt_match_null_string_p.
+
+   Sets P to one after the op and its arguments, if any.  */
+
+static boolean
+common_op_match_null_string_p (p, end, reg_info)
+    unsigned char **p, *end;
+    register_info_type *reg_info;
+{
+  int mcnt;
+  boolean ret;
+  int reg_no;
+  unsigned char *p1 = *p;
+
+  switch ((re_opcode_t) *p1++)
+    {
+    case no_op:
+    case begline:
+    case endline:
+    case begbuf:
+    case endbuf:
+    case wordbeg:
+    case wordend:
+    case wordbound:
+    case notwordbound:
+#ifdef emacs
+    case before_dot:
+    case at_dot:
+    case after_dot:
+#endif
+      break;
+
+    case start_memory:
+      reg_no = *p1;
+      assert (reg_no > 0 && reg_no <= MAX_REGNUM);
+      ret = group_match_null_string_p (&p1, end, reg_info);
+
+      /* Have to set this here in case we're checking a group which
+         contains a group and a back reference to it.  */
+
+      if (REG_MATCH_NULL_STRING_P (reg_info[reg_no]) == MATCH_NULL_UNSET_VALUE)
+        REG_MATCH_NULL_STRING_P (reg_info[reg_no]) = ret;
+
+      if (!ret)
+        return false;
+      break;
+
+    /* If this is an optimized succeed_n for zero times, make the jump.  */
+    case jump:
+      EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+      if (mcnt >= 0)
+        p1 += mcnt;
+      else
+        return false;
+      break;
+
+    case succeed_n:
+      /* Get to the number of times to succeed.  */
+      p1 += 2;
+      EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+
+      if (mcnt == 0)
+        {
+          p1 -= 4;
+          EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+          p1 += mcnt;
+        }
+      else
+        return false;
+      break;
+
+    case duplicate:
+      if (!REG_MATCH_NULL_STRING_P (reg_info[*p1]))
+        return false;
+      break;
+
+    case set_number_at:
+      p1 += 4;
+
+    default:
+      /* All other opcodes mean we cannot match the empty string.  */
+      return false;
+  }
+
+  *p = p1;
+  return true;
+} /* common_op_match_null_string_p */
+
+
+/* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN
+   bytes; nonzero otherwise.  */
+
+static int
+bcmp_translate (s1, s2, len, translate)
+     unsigned char *s1, *s2;
+     register int len;
+     char *translate;
+{
+  register unsigned char *p1 = s1, *p2 = s2;
+  while (len)
+    {
+      if (translate[*p1++] != translate[*p2++]) return 1;
+      len--;
+    }
+  return 0;
+}
+
+/* Entry points for GNU code.  */
+
+/* re_compile_pattern is the GNU regular expression compiler: it
+   compiles PATTERN (of length SIZE) and puts the result in BUFP.
+   Returns 0 if the pattern was valid, otherwise an error string.
+
+   Assumes the `allocated' (and perhaps `buffer') and `translate' fields
+   are set in BUFP on entry.
+
+   We call regex_compile to do the actual compilation.  */
+
+const char *
+re_compile_pattern (pattern, length, bufp)
+     const char *pattern;
+     int length;
+     struct re_pattern_buffer *bufp;
+{
+  reg_errcode_t ret;
+
+  /* GNU code is written to assume at least RE_NREGS registers will be set
+     (and at least one extra will be -1).  */
+  bufp->regs_allocated = REGS_UNALLOCATED;
+
+  /* And GNU code determines whether or not to get register information
+     by passing null for the REGS argument to re_match, etc., not by
+     setting no_sub.  */
+  bufp->no_sub = 0;
+
+  /* Match anchors at newline.  */
+  bufp->newline_anchor = 1;
+
+  ret = regex_compile (pattern, length, re_syntax_options, bufp);
+
+  return re_error_msg[(int) ret];
+}
+
+/* Entry points compatible with 4.2 BSD regex library.  We don't define
+   them if this is an Emacs or POSIX compilation.  */
+
+#if !defined (emacs) && !defined (_POSIX_SOURCE)
+
+/* BSD has one and only one pattern buffer.  */
+static struct re_pattern_buffer re_comp_buf;
+
+char *
+re_comp (s)
+    const char *s;
+{
+  reg_errcode_t ret;
+
+  if (!s)
+    {
+      if (!re_comp_buf.buffer)
+    return "No previous regular expression";
+      return 0;
+    }
+
+  if (!re_comp_buf.buffer)
+    {
+      re_comp_buf.buffer = (unsigned char *) malloc (200);
+      if (re_comp_buf.buffer == NULL)
+        return "Memory exhausted";
+      re_comp_buf.allocated = 200;
+
+      re_comp_buf.fastmap = (char *) malloc (1 << BYTEWIDTH);
+      if (re_comp_buf.fastmap == NULL)
+    return "Memory exhausted";
+    }
+
+  /* Since `re_exec' always passes NULL for the `regs' argument, we
+     don't need to initialize the pattern buffer fields which affect it.  */
+
+  /* Match anchors at newlines.  */
+  re_comp_buf.newline_anchor = 1;
+
+  ret = regex_compile (s, strlen (s), re_syntax_options, &re_comp_buf);
+
+  /* Yes, we're discarding `const' here.  */
+  return (char *) re_error_msg[(int) ret];
+}
+
+
+int
+re_exec (s)
+    const char *s;
+{
+  const int len = strlen (s);
+  return
+    0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
+}
+#endif /* not emacs and not _POSIX_SOURCE */
+
+/* POSIX.2 functions.  Don't define these for Emacs.  */
+
+#ifndef emacs
+
+/* regcomp takes a regular expression as a string and compiles it.
+
+   PREG is a regex_t *.  We do not expect any fields to be initialized,
+   since POSIX says we shouldn't.  Thus, we set
+
+     `buffer' to the compiled pattern;
+     `used' to the length of the compiled pattern;
+     `syntax' to RE_SYNTAX_POSIX_EXTENDED if the
+       REG_EXTENDED bit in CFLAGS is set; otherwise, to
+       RE_SYNTAX_POSIX_BASIC;
+     `newline_anchor' to REG_NEWLINE being set in CFLAGS;
+     `fastmap' and `fastmap_accurate' to zero;
+     `re_nsub' to the number of subexpressions in PATTERN.
+
+   PATTERN is the address of the pattern string.
+
+   CFLAGS is a series of bits which affect compilation.
+
+     If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we
+     use POSIX basic syntax.
+
+     If REG_NEWLINE is set, then . and [^...] don't match newline.
+     Also, regexec will try a match beginning after every newline.
+
+     If REG_ICASE is set, then we considers upper- and lowercase
+     versions of letters to be equivalent when matching.
+
+     If REG_NOSUB is set, then when PREG is passed to regexec, that
+     routine will report only success or failure, and nothing about the
+     registers.
+
+   It returns 0 if it succeeds, nonzero if it doesn't.  (See regex.h for
+   the return codes and their meanings.)  */
+
+int
+regcomp (preg, pattern, cflags)
+    regex_t *preg;
+    const char *pattern;
+    int cflags;
+{
+  reg_errcode_t ret;
+  unsigned syntax
+    = (cflags & REG_EXTENDED) ?
+      RE_SYNTAX_POSIX_EXTENDED : RE_SYNTAX_POSIX_BASIC;
+
+  /* regex_compile will allocate the space for the compiled pattern.  */
+  preg->buffer = 0;
+  preg->allocated = 0;
+
+  /* Don't bother to use a fastmap when searching.  This simplifies the
+     REG_NEWLINE case: if we used a fastmap, we'd have to put all the
+     characters after newlines into the fastmap.  This way, we just try
+     every character.  */
+  preg->fastmap = 0;
+
+  if (cflags & REG_ICASE)
+    {
+      unsigned i;
+
+      preg->translate = (char *) malloc (CHAR_SET_SIZE);
+      if (preg->translate == NULL)
+        return (int) REG_ESPACE;
+
+      /* Map uppercase characters to corresponding lowercase ones.  */
+      for (i = 0; i < CHAR_SET_SIZE; i++)
+        preg->translate[i] = ISUPPER (i) ? tolower (i) : i;
+    }
+  else
+    preg->translate = NULL;
+
+  /* If REG_NEWLINE is set, newlines are treated differently.  */
+  if (cflags & REG_NEWLINE)
+    { /* REG_NEWLINE implies neither . nor [^...] match newline.  */
+      syntax &= ~RE_DOT_NEWLINE;
+      syntax |= RE_HAT_LISTS_NOT_NEWLINE;
+      /* It also changes the matching behavior.  */
+      preg->newline_anchor = 1;
+    }
+  else
+    preg->newline_anchor = 0;
+
+  preg->no_sub = !!(cflags & REG_NOSUB);
+
+  /* POSIX says a null character in the pattern terminates it, so we
+     can use strlen here in compiling the pattern.  */
+  ret = regex_compile (pattern, strlen (pattern), syntax, preg);
+
+  /* POSIX doesn't distinguish between an unmatched open-group and an
+     unmatched close-group: both are REG_EPAREN.  */
+  if (ret == REG_ERPAREN) ret = REG_EPAREN;
+
+  return (int) ret;
+}
+
+
+/* regexec searches for a given pattern, specified by PREG, in the
+   string STRING.
+
+   If NMATCH is zero or REG_NOSUB was set in the cflags argument to
+   `regcomp', we ignore PMATCH.  Otherwise, we assume PMATCH has at
+   least NMATCH elements, and we set them to the offsets of the
+   corresponding matched substrings.
+
+   EFLAGS specifies `execution flags' which affect matching: if
+   REG_NOTBOL is set, then ^ does not match at the beginning of the
+   string; if REG_NOTEOL is set, then $ does not match at the end.
+
+   We return 0 if we find a match and REG_NOMATCH if not.  */
+
+int
+regexec (preg, string, nmatch, pmatch, eflags)
+    const regex_t *preg;
+    const char *string;
+    size_t nmatch;
+    regmatch_t pmatch[];
+    int eflags;
+{
+  int ret;
+  struct re_registers regs;
+  regex_t private_preg;
+  int len = strlen (string);
+  boolean want_reg_info = !preg->no_sub && nmatch > 0;
+
+  private_preg = *preg;
+
+  private_preg.not_bol = !!(eflags & REG_NOTBOL);
+  private_preg.not_eol = !!(eflags & REG_NOTEOL);
+
+  /* The user has told us exactly how many registers to return
+     information about, via `nmatch'.  We have to pass that on to the
+     matching routines.  */
+  private_preg.regs_allocated = REGS_FIXED;
+
+  if (want_reg_info)
+    {
+      regs.num_regs = nmatch;
+      regs.start = TALLOC (nmatch, regoff_t);
+      regs.end = TALLOC (nmatch, regoff_t);
+      if (regs.start == NULL || regs.end == NULL)
+        return (int) REG_NOMATCH;
+    }
+
+  /* Perform the searching operation.  */
+  ret = re_search (&private_preg, string, len,
+                   /* start: */ 0, /* range: */ len,
+                   want_reg_info ? &regs : (struct re_registers *) 0);
+
+  /* Copy the register information to the POSIX structure.  */
+  if (want_reg_info)
+    {
+      if (ret >= 0)
+        {
+          unsigned r;
+
+          for (r = 0; r < nmatch; r++)
+            {
+              pmatch[r].rm_so = regs.start[r];
+              pmatch[r].rm_eo = regs.end[r];
+            }
+        }
+
+      /* If we needed the temporary register info, free the space now.  */
+      free (regs.start);
+      free (regs.end);
+    }
+
+  /* We want zero return to mean success, unlike `re_search'.  */
+  return ret >= 0 ? (int) REG_NOERROR : (int) REG_NOMATCH;
+}
+
+
+/* Returns a message corresponding to an error code, ERRCODE, returned
+   from either regcomp or regexec.   We don't use PREG here.  */
+
+size_t
+regerror (errcode_v, preg, errbuf, errbuf_size)
+    int errcode_v;
+    const regex_t *preg;
+    char *errbuf;
+    size_t errbuf_size;
+{
+  const char *msg;
+  size_t msg_size;
+
+  if (errcode_v < 0
+      || errcode_v >= (sizeof (re_error_msg) / sizeof (re_error_msg[0])))
+    /* Only error codes returned by the rest of the code should be passed
+       to this routine.  If we are given anything else, or if other regex
+       code generates an invalid error code, then the program has a bug.
+       Dump core so we can fix it.  */
+    abort ();
+
+  msg = re_error_msg[errcode_v];
+
+  /* POSIX doesn't require that we do anything in this case, but why
+     not be nice.  */
+  if (! msg)
+    msg = "Success";
+
+  msg_size = strlen (msg) + 1; /* Includes the null.  */
+
+  if (errbuf_size != 0)
+    {
+      if (msg_size > errbuf_size)
+        {
+          strncpy (errbuf, msg, errbuf_size - 1);
+          errbuf[errbuf_size - 1] = 0;
+        }
+      else
+        strcpy (errbuf, msg);
+    }
+
+  return msg_size;
+}
+
+
+/* Free dynamically allocated space used by PREG.  */
+
+void
+regfree (preg)
+    regex_t *preg;
+{
+  if (preg->buffer != NULL)
+    free (preg->buffer);
+  preg->buffer = NULL;
+
+  preg->allocated = 0;
+  preg->used = 0;
+
+  if (preg->fastmap != NULL)
+    free (preg->fastmap);
+  preg->fastmap = NULL;
+  preg->fastmap_accurate = 0;
+
+  if (preg->translate != NULL)
+    free (preg->translate);
+  preg->translate = NULL;
+}
+
+#endif /* not emacs  */
+
+/*
+Local variables:
+make-backup-files: t
+version-control: t
+trim-versions-without-asking: nil
+End:
+*/
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/regex.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/regex.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/regex.h	(revision 70339)
@@ -0,0 +1,498 @@
+/* Definitions for data structures and routines for the regular
+   expression library, version 0.12.
+
+   Copyright (C) 1985, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
+
+#ifndef __REGEXP_LIBRARY_H__
+#define __REGEXP_LIBRARY_H__
+
+#ifdef __cplusplus
+  extern "C" {
+#endif
+
+/* POSIX says that <sys/types.h> must be included (by the caller) before
+   <regex.h>.  */
+
+#ifdef VMS
+/* VMS doesn't have `size_t' in <sys/types.h>, even though POSIX says it
+   should be there.  */
+#include <stddef.h>
+#endif
+
+
+/* The following bits are used to determine the regexp syntax we
+   recognize.  The set/not-set meanings are chosen so that Emacs syntax
+   remains the value 0.  The bits are given in alphabetical order, and
+   the definitions shifted by one from the previous bit; thus, when we
+   add or remove a bit, only one other definition need change.  */
+typedef unsigned reg_syntax_t;
+
+/* If this bit is not set, then \ inside a bracket expression is literal.
+   If set, then such a \ quotes the following character.  */
+#define RE_BACKSLASH_ESCAPE_IN_LISTS (1)
+
+/* If this bit is not set, then + and ? are operators, and \+ and \? are
+	 literals.
+   If set, then \+ and \? are operators and + and ? are literals.  */
+#define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1)
+
+/* If this bit is set, then character classes are supported.  They are:
+	 [:alpha:], [:upper:], [:lower:],  [:digit:], [:alnum:], [:xdigit:],
+	 [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:].
+   If not set, then character classes are not supported.  */
+#define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1)
+
+/* If this bit is set, then ^ and $ are always anchors (outside bracket
+	 expressions, of course).
+   If this bit is not set, then it depends:
+		^  is an anchor if it is at the beginning of a regular
+		   expression or after an open-group or an alternation operator;
+		$  is an anchor if it is at the end of a regular expression, or
+		   before a close-group or an alternation operator.
+
+   This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because
+   POSIX draft 11.2 says that * etc. in leading positions is undefined.
+   We already implemented a previous draft which made those constructs
+   invalid, though, so we haven't changed the code back.  */
+#define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1)
+
+/* If this bit is set, then special characters are always special
+	 regardless of where they are in the pattern.
+   If this bit is not set, then special characters are special only in
+	 some contexts; otherwise they are ordinary.  Specifically,
+	 * + ? and intervals are only special when not after the beginning,
+	 open-group, or alternation operator.  */
+#define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1)
+
+/* If this bit is set, then *, +, ?, and { cannot be first in an re or
+	 immediately after an alternation or begin-group operator.  */
+#define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1)
+
+/* If this bit is set, then . matches newline.
+   If not set, then it doesn't.  */
+#define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1)
+
+/* If this bit is set, then . doesn't match NUL.
+   If not set, then it does.  */
+#define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1)
+
+/* If this bit is set, nonmatching lists [^...] do not match newline.
+   If not set, they do.  */
+#define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1)
+
+/* If this bit is set, either \{...\} or {...} defines an
+	 interval, depending on RE_NO_BK_BRACES.
+   If not set, \{, \}, {, and } are literals.  */
+#define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1)
+
+/* If this bit is set, +, ? and | aren't recognized as operators.
+   If not set, they are.  */
+#define RE_LIMITED_OPS (RE_INTERVALS << 1)
+
+/* If this bit is set, newline is an alternation operator.
+   If not set, newline is literal.  */
+#define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1)
+
+/* If this bit is set, then `{...}' defines an interval, and \{ and \}
+	 are literals.
+  If not set, then `\{...\}' defines an interval.  */
+#define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1)
+
+/* If this bit is set, (...) defines a group, and \( and \) are literals.
+   If not set, \(...\) defines a group, and ( and ) are literals.  */
+#define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1)
+
+/* If this bit is set, then \<digit> matches <digit>.
+   If not set, then \<digit> is a back-reference.  */
+#define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1)
+
+/* If this bit is set, then | is an alternation operator, and \| is literal.
+   If not set, then \| is an alternation operator, and | is literal.  */
+#define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1)
+
+/* If this bit is set, then an ending range point collating higher
+	 than the starting range point, as in [z-a], is invalid.
+   If not set, then when ending range point collates higher than the
+	 starting range point, the range is ignored.  */
+#define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1)
+
+/* If this bit is set, then an unmatched ) is ordinary.
+   If not set, then an unmatched ) is invalid.  */
+#define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1)
+
+/* This global variable defines the particular regexp syntax to use (for
+   some interfaces).  When a regexp is compiled, the syntax used is
+   stored in the pattern buffer, so changing this does not affect
+   already-compiled regexps.  */
+extern reg_syntax_t re_syntax_options;
+
+/* Define combinations of the above bits for the standard possibilities.
+   (The [[[ comments delimit what gets put into the Texinfo file, so
+   don't delete them!)  */
+/* [[[begin syntaxes]]] */
+#define RE_SYNTAX_EMACS 0
+
+#define RE_SYNTAX_AWK							\
+  (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL			\
+   | RE_NO_BK_PARENS            | RE_NO_BK_REFS				\
+   | RE_NO_BK_VBAR               | RE_NO_EMPTY_RANGES			\
+   | RE_UNMATCHED_RIGHT_PAREN_ORD)
+
+#define RE_SYNTAX_POSIX_AWK 						\
+  (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS)
+
+#define RE_SYNTAX_GREP							\
+  (RE_BK_PLUS_QM              | RE_CHAR_CLASSES				\
+   | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS				\
+   | RE_NEWLINE_ALT)
+
+#define RE_SYNTAX_EGREP							\
+  (RE_CHAR_CLASSES        | RE_CONTEXT_INDEP_ANCHORS			\
+   | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE			\
+   | RE_NEWLINE_ALT       | RE_NO_BK_PARENS				\
+   | RE_NO_BK_VBAR)
+
+#define RE_SYNTAX_POSIX_EGREP						\
+  (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES)
+
+/* P1003.2/D11.2, section 4.20.7.1, lines 5078ff.  */
+#define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC
+
+#define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC
+
+/* Syntax bits common to both basic and extended POSIX regex syntax.  */
+#define _RE_SYNTAX_POSIX_COMMON						\
+  (RE_CHAR_CLASSES | RE_DOT_NEWLINE      | RE_DOT_NOT_NULL		\
+   | RE_INTERVALS  | RE_NO_EMPTY_RANGES)
+
+#define RE_SYNTAX_POSIX_BASIC						\
+  (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM)
+
+/* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes
+   RE_LIMITED_OPS, i.e., \? \+ \| are not recognized.  Actually, this
+   isn't minimal, since other operators, such as \`, aren't disabled.  */
+#define RE_SYNTAX_POSIX_MINIMAL_BASIC					\
+  (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS)
+
+#define RE_SYNTAX_POSIX_EXTENDED					\
+  (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS			\
+   | RE_CONTEXT_INDEP_OPS  | RE_NO_BK_BRACES				\
+   | RE_NO_BK_PARENS       | RE_NO_BK_VBAR				\
+   | RE_UNMATCHED_RIGHT_PAREN_ORD)
+
+/* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS
+   replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added.  */
+#define RE_SYNTAX_POSIX_MINIMAL_EXTENDED				\
+  (_RE_SYNTAX_POSIX_COMMON  | RE_CONTEXT_INDEP_ANCHORS			\
+   | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES				\
+   | RE_NO_BK_PARENS        | RE_NO_BK_REFS				\
+   | RE_NO_BK_VBAR	    | RE_UNMATCHED_RIGHT_PAREN_ORD)
+/* [[[end syntaxes]]] */
+
+/* Maximum number of duplicates an interval can allow.  Some systems
+   (erroneously) define this in other header files, but we want our
+   value, so remove any previous define.  */
+#ifdef RE_DUP_MAX
+#undef RE_DUP_MAX
+#endif
+#define RE_DUP_MAX ((1 << 15) - 1)
+
+
+/* POSIX `cflags' bits (i.e., information for `regcomp').  */
+
+/* If this bit is set, then use extended regular expression syntax.
+   If not set, then use basic regular expression syntax.  */
+#define REG_EXTENDED 1
+
+/* If this bit is set, then ignore case when matching.
+   If not set, then case is significant.  */
+#define REG_ICASE (REG_EXTENDED << 1)
+
+/* If this bit is set, then anchors do not match at newline
+	 characters in the string.
+   If not set, then anchors do match at newlines.  */
+#define REG_NEWLINE (REG_ICASE << 1)
+
+/* If this bit is set, then report only success or fail in regexec.
+   If not set, then returns differ between not matching and errors.  */
+#define REG_NOSUB (REG_NEWLINE << 1)
+
+
+/* POSIX `eflags' bits (i.e., information for regexec).  */
+
+/* If this bit is set, then the beginning-of-line operator doesn't match
+	 the beginning of the string (presumably because it's not the
+	 beginning of a line).
+   If not set, then the beginning-of-line operator does match the
+	 beginning of the string.  */
+#define REG_NOTBOL 1
+
+/* Like REG_NOTBOL, except for the end-of-line.  */
+#define REG_NOTEOL (1 << 1)
+
+
+/* If any error codes are removed, changed, or added, update the
+   `re_error_msg' table in regex.c.  */
+typedef enum
+{
+  REG_NOERROR = 0,	/* Success.  */
+  REG_NOMATCH,		/* Didn't find a match (for regexec).  */
+
+  /* POSIX regcomp return error codes.  (In the order listed in the
+	 standard.)  */
+  REG_BADPAT,		/* Invalid pattern.  */
+  REG_ECOLLATE,		/* Not implemented.  */
+  REG_ECTYPE,		/* Invalid character class name.  */
+  REG_EESCAPE,		/* Trailing backslash.  */
+  REG_ESUBREG,		/* Invalid back reference.  */
+  REG_EBRACK,		/* Unmatched left bracket.  */
+  REG_EPAREN,		/* Parenthesis imbalance.  */
+  REG_EBRACE,		/* Unmatched \{.  */
+  REG_BADBR,		/* Invalid contents of \{\}.  */
+  REG_ERANGE,		/* Invalid range end.  */
+  REG_ESPACE,		/* Ran out of memory.  */
+  REG_BADRPT,		/* No preceding re for repetition op.  */
+
+  /* Error codes we've added.  */
+  REG_EEND,		/* Premature end.  */
+  REG_ESIZE,		/* Compiled pattern bigger than 2^16 bytes.  */
+  REG_ERPAREN		/* Unmatched ) or \); not returned from regcomp.  */
+} reg_errcode_t;
+
+/* This data structure represents a compiled pattern.  Before calling
+   the pattern compiler, the fields `buffer', `allocated', `fastmap',
+   `translate', and `no_sub' can be set.  After the pattern has been
+   compiled, the `re_nsub' field is available.  All other fields are
+   private to the regex routines.  */
+
+struct re_pattern_buffer
+{
+/* [[[begin pattern_buffer]]] */
+	/* Space that holds the compiled pattern.  It is declared as
+		  `unsigned char *' because its elements are
+		   sometimes used as array indexes.  */
+  unsigned char *buffer;
+
+	/* Number of bytes to which `buffer' points.  */
+  unsigned long allocated;
+
+	/* Number of bytes actually used in `buffer'.  */
+  unsigned long used;
+
+		/* Syntax setting with which the pattern was compiled.  */
+  reg_syntax_t syntax;
+
+		/* Pointer to a fastmap, if any, otherwise zero.  re_search uses
+		   the fastmap, if there is one, to skip over impossible
+		   starting points for matches.  */
+  char *fastmap;
+
+		/* Either a translate table to apply to all characters before
+		   comparing them, or zero for no translation.  The translation
+		   is applied to a pattern when it is compiled and to a string
+		   when it is matched.  */
+  char *translate;
+
+	/* Number of subexpressions found by the compiler.  */
+  size_t re_nsub;
+
+		/* Zero if this pattern cannot match the empty string, one else.
+		   Well, in truth it's used only in `re_search_2', to see
+		   whether or not we should use the fastmap, so we don't set
+		   this absolutely perfectly; see `re_compile_fastmap' (the
+		   `duplicate' case).  */
+  unsigned can_be_null : 1;
+
+		/* If REGS_UNALLOCATED, allocate space in the `regs' structure
+			 for `max (RE_NREGS, re_nsub + 1)' groups.
+		   If REGS_REALLOCATE, reallocate space if necessary.
+		   If REGS_FIXED, use what's there.  */
+#define REGS_UNALLOCATED 0
+#define REGS_REALLOCATE 1
+#define REGS_FIXED 2
+  unsigned regs_allocated : 2;
+
+		/* Set to zero when `regex_compile' compiles a pattern; set to one
+		   by `re_compile_fastmap' if it updates the fastmap.  */
+  unsigned fastmap_accurate : 1;
+
+		/* If set, `re_match_2' does not return information about
+		   subexpressions.  */
+  unsigned no_sub : 1;
+
+		/* If set, a beginning-of-line anchor doesn't match at the
+		   beginning of the string.  */
+  unsigned not_bol : 1;
+
+		/* Similarly for an end-of-line anchor.  */
+  unsigned not_eol : 1;
+
+		/* If true, an anchor at a newline matches.  */
+  unsigned newline_anchor : 1;
+
+/* [[[end pattern_buffer]]] */
+};
+
+typedef struct re_pattern_buffer regex_t;
+
+
+/* search.c (search_buffer) in Emacs needs this one opcode value.  It is
+   defined both in `regex.c' and here.  */
+#define RE_EXACTN_VALUE 1
+
+/* Type for byte offsets within the string.  POSIX mandates this.  */
+typedef int regoff_t;
+
+
+/* This is the structure we store register match data in.  See
+   regex.texinfo for a full description of what registers match.  */
+struct re_registers
+{
+  unsigned num_regs;
+  regoff_t *start;
+  regoff_t *end;
+};
+
+
+/* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer,
+   `re_match_2' returns information about at least this many registers
+   the first time a `regs' structure is passed.  */
+#ifndef RE_NREGS
+#define RE_NREGS 30
+#endif
+
+
+/* POSIX specification for registers.  Aside from the different names than
+   `re_registers', POSIX uses an array of structures, instead of a
+   structure of arrays.  */
+typedef struct
+{
+  regoff_t rm_so;  /* Byte offset from string's start to substring's start.  */
+  regoff_t rm_eo;  /* Byte offset from string's start to substring's end.  */
+} regmatch_t;
+
+/* Declarations for routines.  */
+
+/* To avoid duplicating every routine declaration -- once with a
+   prototype (if we are ANSI), and once without (if we aren't) -- we
+   use the following macro to declare argument types.  This
+   unfortunately clutters up the declarations a bit, but I think it's
+   worth it.  */
+
+#if __STDC__
+
+#define _RE_ARGS(args) args
+
+#else /* not __STDC__ */
+
+#define _RE_ARGS(args) ()
+
+#endif /* not __STDC__ */
+
+/* Sets the current default syntax to SYNTAX, and return the old syntax.
+   You can also simply assign to the `re_syntax_options' variable.  */
+extern reg_syntax_t re_set_syntax _RE_ARGS ((reg_syntax_t syntax));
+
+/* Compile the regular expression PATTERN, with length LENGTH
+   and syntax given by the global `re_syntax_options', into the buffer
+   BUFFER.  Return NULL if successful, and an error string if not.  */
+extern const char *re_compile_pattern
+  _RE_ARGS ((const char *pattern, int length,
+			 struct re_pattern_buffer *buffer));
+
+
+/* Compile a fastmap for the compiled pattern in BUFFER; used to
+   accelerate searches.  Return 0 if successful and -2 if was an
+   internal error.  */
+extern int re_compile_fastmap _RE_ARGS ((struct re_pattern_buffer *buffer));
+
+
+/* Search in the string STRING (with length LENGTH) for the pattern
+   compiled into BUFFER.  Start searching at position START, for RANGE
+   characters.  Return the starting position of the match, -1 for no
+   match, or -2 for an internal error.  Also return register
+   information in REGS (if REGS and BUFFER->no_sub are nonzero).  */
+extern int re_search
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string,
+			int length, int start, int range, struct re_registers *regs));
+
+
+/* Like `re_search', but search in the concatenation of STRING1 and
+   STRING2.  Also, stop searching at index START + STOP.  */
+extern int re_search_2
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1,
+			 int length1, const char *string2, int length2,
+			 int start, int range, struct re_registers *regs, int stop));
+
+
+/* Like `re_search', but return how many characters in STRING the regexp
+   in BUFFER matched, starting at position START.  */
+extern int re_match
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string,
+			 int length, int start, struct re_registers *regs));
+
+
+/* Relates to `re_match' as `re_search_2' relates to `re_search'.  */
+extern int re_match_2
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1,
+			 int length1, const char *string2, int length2,
+			 int start, struct re_registers *regs, int stop));
+
+
+/* Set REGS to hold NUM_REGS registers, storing them in STARTS and
+   ENDS.  Subsequent matches using BUFFER and REGS will use this memory
+   for recording register information.  STARTS and ENDS must be
+   allocated with malloc, and must each be at least `NUM_REGS * sizeof
+   (regoff_t)' bytes long.
+
+   If NUM_REGS == 0, then subsequent matches should allocate their own
+   register data.
+
+   Unless this function is called, the first search or match using
+   PATTERN_BUFFER will allocate its own register data, without
+   freeing the old data.  */
+extern void re_set_registers
+  _RE_ARGS ((struct re_pattern_buffer *buffer, struct re_registers *regs,
+			 unsigned num_regs, regoff_t *starts, regoff_t *ends));
+
+/* 4.2 bsd compatibility.  */
+extern char *re_comp _RE_ARGS ((const char *));
+extern int re_exec _RE_ARGS ((const char *));
+
+/* POSIX compatibility.  */
+extern int regcomp _RE_ARGS ((regex_t *preg, const char *pattern, int cflags));
+extern int regexec
+  _RE_ARGS ((const regex_t *preg, const char *string, size_t nmatch,
+			 regmatch_t pmatch[], int eflags));
+extern size_t regerror
+  _RE_ARGS ((int errcode, const regex_t *preg, char *errbuf,
+			 size_t errbuf_size));
+extern void regfree _RE_ARGS ((regex_t *preg));
+
+#ifdef __cplusplus
+  }
+#endif
+
+#endif /* not __REGEXP_LIBRARY_H__ */
+
+/*
+Local variables:
+make-backup-files: t
+version-control: t
+trim-versions-without-asking: nil
+End:
+*/
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/unistd.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/unistd.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/unistd.h	(revision 70339)
@@ -0,0 +1,10 @@
+// This should really be defined elsewhere
+#define YY_INPUT(buf,result,max_size) \
+	if ( (result = fread( (char *) buf, 1, max_size, yyin )) < 0 ) \
+		YY_FATAL_ERROR( "input in flex scanner failed" );
+
+#define fileno _fileno
+
+#define isatty(x) 0
+
+#define unlink _unlink
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/getopt.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/getopt.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/getopt.h	(revision 70339)
@@ -0,0 +1,19 @@
+#ifndef GETOPT_H
+#define GETOPT_H
+
+#ifdef __cplusplus
+	extern "C" {
+#endif
+
+int getopt(int argc, char** argv, char* opts);
+
+extern int opterr;
+extern int optind;
+extern int optopt;
+extern char *optarg;
+
+#ifdef __cplusplus
+	}
+#endif
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/libgen.c
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/libgen.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/libgen.c	(revision 70339)
@@ -0,0 +1,25 @@
+#include <string.h>
+
+#include "libgen.h"
+
+// http://www.opengroup.org/onlinepubs/007908775/xsh/basename.html
+
+char* basename(char *path) {
+	if (path != NULL) {
+		// Find the last position of the \ in the path name
+		char* pos = strrchr(path, '\\');
+
+		if (pos != NULL) { // If a \ char was found...
+			if (pos + 1 != NULL) // If it is not the last character in the string...
+				return pos + 1; // then return a pointer to the first character after \.
+			else
+				return pos; // else return a pointer to \
+
+		} else { // If a \ char was NOT found
+			return path; // return the pointer passed to basename (this is probably non-conformant)
+		}
+
+	} else { // If path == NULL, return "."
+		return ".";
+	}
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/libgen.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/libgen.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/win32/libgen.h	(revision 70339)
@@ -0,0 +1,14 @@
+#ifndef LIBGEN_H
+#define LIBGEN_H
+
+#ifdef __cplusplus
+	extern "C" {
+#endif
+
+char  *basename(char *);
+
+#ifdef __cplusplus
+	}
+#endif
+
+#endif
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/PLACEFRAMEWORKS.txt
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/PLACEFRAMEWORKS.txt	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/PLACEFRAMEWORKS.txt	(revision 70339)
@@ -0,0 +1,5 @@
+Place frameworks in this directory:
+
+libexslt.framework
+libxml.framework
+libxslt.framework
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/project.pbxproj
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/project.pbxproj	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/project.pbxproj	(revision 70339)
@@ -0,0 +1,616 @@
+// !$*UTF8*$!
+{
+	archiveVersion = 1;
+	classes = {
+	};
+	objectVersion = 44;
+	objects = {
+
+/* Begin PBXBuildFile section */
+		ACE777E50E20008300F7C0C6 /* lt_expand.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE777E40E20008300F7C0C6 /* lt_expand.cc */; };
+		ACE777ED0E20009B00F7C0C6 /* lt_proc.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE777EC0E20009B00F7C0C6 /* lt_proc.cc */; };
+		ACE777F00E2000B700F7C0C6 /* lt_comp.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE777EF0E2000B700F7C0C6 /* lt_comp.cc */; };
+		ACE777F40E2000D800F7C0C6 /* libexslt.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = ACE777F10E2000D800F7C0C6 /* libexslt.framework */; };
+		ACE777F50E2000D800F7C0C6 /* libxml.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = ACE777F20E2000D800F7C0C6 /* libxml.framework */; };
+		ACE777F60E2000D800F7C0C6 /* libxslt.framework in Frameworks */ = {isa = PBXBuildFile; fileRef = ACE777F30E2000D800F7C0C6 /* libxslt.framework */; };
+		ACE778290E20013F00F7C0C6 /* alphabet.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE777FE0E20013F00F7C0C6 /* alphabet.cc */; };
+		ACE7782A0E20013F00F7C0C6 /* alphabet.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE777FF0E20013F00F7C0C6 /* alphabet.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7782B0E20013F00F7C0C6 /* buffer.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778000E20013F00F7C0C6 /* buffer.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7782C0E20013F00F7C0C6 /* compiler.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778010E20013F00F7C0C6 /* compiler.cc */; };
+		ACE7782D0E20013F00F7C0C6 /* compiler.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778020E20013F00F7C0C6 /* compiler.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7782E0E20013F00F7C0C6 /* compression.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778030E20013F00F7C0C6 /* compression.cc */; };
+		ACE7782F0E20013F00F7C0C6 /* compression.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778040E20013F00F7C0C6 /* compression.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778300E20013F00F7C0C6 /* endian_util.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778060E20013F00F7C0C6 /* endian_util.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778310E20013F00F7C0C6 /* entry_token.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778070E20013F00F7C0C6 /* entry_token.cc */; };
+		ACE778320E20013F00F7C0C6 /* entry_token.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778080E20013F00F7C0C6 /* entry_token.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778330E20013F00F7C0C6 /* exception.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778090E20013F00F7C0C6 /* exception.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778340E20013F00F7C0C6 /* expander.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE7780A0E20013F00F7C0C6 /* expander.cc */; };
+		ACE778350E20013F00F7C0C6 /* expander.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE7780B0E20013F00F7C0C6 /* expander.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778360E20013F00F7C0C6 /* fst_processor.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE7780C0E20013F00F7C0C6 /* fst_processor.cc */; };
+		ACE778370E20013F00F7C0C6 /* fst_processor.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE7780D0E20013F00F7C0C6 /* fst_processor.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778380E20013F00F7C0C6 /* lt_locale.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE7780E0E20013F00F7C0C6 /* lt_locale.cc */; };
+		ACE778390E20013F00F7C0C6 /* lt_locale.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE7780F0E20013F00F7C0C6 /* lt_locale.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7783A0E20013F00F7C0C6 /* ltstr.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778100E20013F00F7C0C6 /* ltstr.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7783B0E20013F00F7C0C6 /* match_exe.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778110E20013F00F7C0C6 /* match_exe.cc */; };
+		ACE7783C0E20013F00F7C0C6 /* match_exe.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778120E20013F00F7C0C6 /* match_exe.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7783D0E20013F00F7C0C6 /* match_node.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778130E20013F00F7C0C6 /* match_node.cc */; };
+		ACE7783E0E20013F00F7C0C6 /* match_node.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778140E20013F00F7C0C6 /* match_node.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7783F0E20013F00F7C0C6 /* match_state.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778150E20013F00F7C0C6 /* match_state.cc */; };
+		ACE778400E20013F00F7C0C6 /* match_state.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778160E20013F00F7C0C6 /* match_state.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778410E20013F00F7C0C6 /* my_stdio.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778170E20013F00F7C0C6 /* my_stdio.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778420E20013F00F7C0C6 /* node.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778180E20013F00F7C0C6 /* node.cc */; };
+		ACE778430E20013F00F7C0C6 /* node.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778190E20013F00F7C0C6 /* node.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778440E20013F00F7C0C6 /* pattern_list.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE7781A0E20013F00F7C0C6 /* pattern_list.cc */; };
+		ACE778450E20013F00F7C0C6 /* pattern_list.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE7781B0E20013F00F7C0C6 /* pattern_list.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778460E20013F00F7C0C6 /* pool.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE7781C0E20013F00F7C0C6 /* pool.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778470E20013F00F7C0C6 /* regexp_compiler.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE7781D0E20013F00F7C0C6 /* regexp_compiler.cc */; };
+		ACE778480E20013F00F7C0C6 /* regexp_compiler.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE7781E0E20013F00F7C0C6 /* regexp_compiler.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778490E20013F00F7C0C6 /* sorted_vector.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE7781F0E20013F00F7C0C6 /* sorted_vector.cc */; };
+		ACE7784A0E20013F00F7C0C6 /* sorted_vector.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778200E20013F00F7C0C6 /* sorted_vector.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7784B0E20013F00F7C0C6 /* state.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778210E20013F00F7C0C6 /* state.cc */; };
+		ACE7784C0E20013F00F7C0C6 /* state.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778220E20013F00F7C0C6 /* state.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7784D0E20013F00F7C0C6 /* trans_exe.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778230E20013F00F7C0C6 /* trans_exe.cc */; };
+		ACE7784E0E20013F00F7C0C6 /* trans_exe.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778240E20013F00F7C0C6 /* trans_exe.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7784F0E20013F00F7C0C6 /* transducer.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778250E20013F00F7C0C6 /* transducer.cc */; };
+		ACE778500E20013F00F7C0C6 /* transducer.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778260E20013F00F7C0C6 /* transducer.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778510E20013F00F7C0C6 /* xml_parse_util.cc in Sources */ = {isa = PBXBuildFile; fileRef = ACE778270E20013F00F7C0C6 /* xml_parse_util.cc */; };
+		ACE778520E20013F00F7C0C6 /* xml_parse_util.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778280E20013F00F7C0C6 /* xml_parse_util.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE778590E20015E00F7C0C6 /* lttools_config.h in Headers */ = {isa = PBXBuildFile; fileRef = ACE778580E20015E00F7C0C6 /* lttools_config.h */; settings = {ATTRIBUTES = (Public, ); }; };
+		ACE7785D0E2001CD00F7C0C6 /* liblttoolbox.dylib in Frameworks */ = {isa = PBXBuildFile; fileRef = D2AAC0630554660B00DB518D /* liblttoolbox.dylib */; };
+		ACE7785E0E2001D300F7C0C6 /* liblttoolbox.dylib in Frameworks */ = {isa = PBXBuildFile; fileRef = D2AAC0630554660B00DB518D /* liblttoolbox.dylib */; };
+		ACE7785F0E2001E000F7C0C6 /* liblttoolbox.dylib in Frameworks */ = {isa = PBXBuildFile; fileRef = D2AAC0630554660B00DB518D /* liblttoolbox.dylib */; };
+/* End PBXBuildFile section */
+
+/* Begin PBXFileReference section */
+		ACE777D10E20003F00F7C0C6 /* lt-comp */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = "lt-comp"; sourceTree = BUILT_PRODUCTS_DIR; };
+		ACE777D80E20005300F7C0C6 /* lt-proc */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = "lt-proc"; sourceTree = BUILT_PRODUCTS_DIR; };
+		ACE777DF0E20006600F7C0C6 /* lt-expand */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = "lt-expand"; sourceTree = BUILT_PRODUCTS_DIR; };
+		ACE777E30E20008300F7C0C6 /* lt-expand.1 */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.man; name = "lt-expand.1"; path = "../../lt-expand.1"; sourceTree = SOURCE_ROOT; };
+		ACE777E40E20008300F7C0C6 /* lt_expand.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = lt_expand.cc; path = ../../lt_expand.cc; sourceTree = SOURCE_ROOT; };
+		ACE777EB0E20009B00F7C0C6 /* lt-proc.1 */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.man; name = "lt-proc.1"; path = "../../lt-proc.1"; sourceTree = SOURCE_ROOT; };
+		ACE777EC0E20009B00F7C0C6 /* lt_proc.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = lt_proc.cc; path = ../../lt_proc.cc; sourceTree = SOURCE_ROOT; };
+		ACE777EE0E2000B700F7C0C6 /* lt-comp.1 */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.man; name = "lt-comp.1"; path = "../../lt-comp.1"; sourceTree = SOURCE_ROOT; };
+		ACE777EF0E2000B700F7C0C6 /* lt_comp.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = lt_comp.cc; path = ../../lt_comp.cc; sourceTree = SOURCE_ROOT; };
+		ACE777F10E2000D800F7C0C6 /* libexslt.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = libexslt.framework; path = ../libexslt.framework; sourceTree = SOURCE_ROOT; };
+		ACE777F20E2000D800F7C0C6 /* libxml.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = libxml.framework; path = ../libxml.framework; sourceTree = SOURCE_ROOT; };
+		ACE777F30E2000D800F7C0C6 /* libxslt.framework */ = {isa = PBXFileReference; lastKnownFileType = wrapper.framework; name = libxslt.framework; path = ../libxslt.framework; sourceTree = SOURCE_ROOT; };
+		ACE777FD0E20013F00F7C0C6 /* acx.rng */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xml; name = acx.rng; path = ../../acx.rng; sourceTree = SOURCE_ROOT; };
+		ACE777FE0E20013F00F7C0C6 /* alphabet.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = alphabet.cc; path = ../../alphabet.cc; sourceTree = SOURCE_ROOT; };
+		ACE777FF0E20013F00F7C0C6 /* alphabet.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = alphabet.h; path = ../../alphabet.h; sourceTree = SOURCE_ROOT; };
+		ACE778000E20013F00F7C0C6 /* buffer.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = buffer.h; path = ../../buffer.h; sourceTree = SOURCE_ROOT; };
+		ACE778010E20013F00F7C0C6 /* compiler.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = compiler.cc; path = ../../compiler.cc; sourceTree = SOURCE_ROOT; };
+		ACE778020E20013F00F7C0C6 /* compiler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = compiler.h; path = ../../compiler.h; sourceTree = SOURCE_ROOT; };
+		ACE778030E20013F00F7C0C6 /* compression.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = compression.cc; path = ../../compression.cc; sourceTree = SOURCE_ROOT; };
+		ACE778040E20013F00F7C0C6 /* compression.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = compression.h; path = ../../compression.h; sourceTree = SOURCE_ROOT; };
+		ACE778050E20013F00F7C0C6 /* dix.dtd */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = text.xml; name = dix.dtd; path = ../../dix.dtd; sourceTree = SOURCE_ROOT; };
+		ACE778060E20013F00F7C0C6 /* endian_util.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = endian_util.h; path = ../../endian_util.h; sourceTree = SOURCE_ROOT; };
+		ACE778070E20013F00F7C0C6 /* entry_token.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = entry_token.cc; path = ../../entry_token.cc; sourceTree = SOURCE_ROOT; };
+		ACE778080E20013F00F7C0C6 /* entry_token.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = entry_token.h; path = ../../entry_token.h; sourceTree = SOURCE_ROOT; };
+		ACE778090E20013F00F7C0C6 /* exception.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = exception.h; path = ../../exception.h; sourceTree = SOURCE_ROOT; };
+		ACE7780A0E20013F00F7C0C6 /* expander.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = expander.cc; path = ../../expander.cc; sourceTree = SOURCE_ROOT; };
+		ACE7780B0E20013F00F7C0C6 /* expander.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = expander.h; path = ../../expander.h; sourceTree = SOURCE_ROOT; };
+		ACE7780C0E20013F00F7C0C6 /* fst_processor.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = fst_processor.cc; path = ../../fst_processor.cc; sourceTree = SOURCE_ROOT; };
+		ACE7780D0E20013F00F7C0C6 /* fst_processor.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = fst_processor.h; path = ../../fst_processor.h; sourceTree = SOURCE_ROOT; };
+		ACE7780E0E20013F00F7C0C6 /* lt_locale.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = lt_locale.cc; path = ../../lt_locale.cc; sourceTree = SOURCE_ROOT; };
+		ACE7780F0E20013F00F7C0C6 /* lt_locale.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lt_locale.h; path = ../../lt_locale.h; sourceTree = SOURCE_ROOT; };
+		ACE778100E20013F00F7C0C6 /* ltstr.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = ltstr.h; path = ../../ltstr.h; sourceTree = SOURCE_ROOT; };
+		ACE778110E20013F00F7C0C6 /* match_exe.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = match_exe.cc; path = ../../match_exe.cc; sourceTree = SOURCE_ROOT; };
+		ACE778120E20013F00F7C0C6 /* match_exe.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = match_exe.h; path = ../../match_exe.h; sourceTree = SOURCE_ROOT; };
+		ACE778130E20013F00F7C0C6 /* match_node.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = match_node.cc; path = ../../match_node.cc; sourceTree = SOURCE_ROOT; };
+		ACE778140E20013F00F7C0C6 /* match_node.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = match_node.h; path = ../../match_node.h; sourceTree = SOURCE_ROOT; };
+		ACE778150E20013F00F7C0C6 /* match_state.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = match_state.cc; path = ../../match_state.cc; sourceTree = SOURCE_ROOT; };
+		ACE778160E20013F00F7C0C6 /* match_state.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = match_state.h; path = ../../match_state.h; sourceTree = SOURCE_ROOT; };
+		ACE778170E20013F00F7C0C6 /* my_stdio.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = my_stdio.h; path = ../../my_stdio.h; sourceTree = SOURCE_ROOT; };
+		ACE778180E20013F00F7C0C6 /* node.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = node.cc; path = ../../node.cc; sourceTree = SOURCE_ROOT; };
+		ACE778190E20013F00F7C0C6 /* node.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = node.h; path = ../../node.h; sourceTree = SOURCE_ROOT; };
+		ACE7781A0E20013F00F7C0C6 /* pattern_list.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = pattern_list.cc; path = ../../pattern_list.cc; sourceTree = SOURCE_ROOT; };
+		ACE7781B0E20013F00F7C0C6 /* pattern_list.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = pattern_list.h; path = ../../pattern_list.h; sourceTree = SOURCE_ROOT; };
+		ACE7781C0E20013F00F7C0C6 /* pool.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = pool.h; path = ../../pool.h; sourceTree = SOURCE_ROOT; };
+		ACE7781D0E20013F00F7C0C6 /* regexp_compiler.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = regexp_compiler.cc; path = ../../regexp_compiler.cc; sourceTree = SOURCE_ROOT; };
+		ACE7781E0E20013F00F7C0C6 /* regexp_compiler.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = regexp_compiler.h; path = ../../regexp_compiler.h; sourceTree = SOURCE_ROOT; };
+		ACE7781F0E20013F00F7C0C6 /* sorted_vector.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = sorted_vector.cc; path = ../../sorted_vector.cc; sourceTree = SOURCE_ROOT; };
+		ACE778200E20013F00F7C0C6 /* sorted_vector.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = sorted_vector.h; path = ../../sorted_vector.h; sourceTree = SOURCE_ROOT; };
+		ACE778210E20013F00F7C0C6 /* state.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = state.cc; path = ../../state.cc; sourceTree = SOURCE_ROOT; };
+		ACE778220E20013F00F7C0C6 /* state.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = state.h; path = ../../state.h; sourceTree = SOURCE_ROOT; };
+		ACE778230E20013F00F7C0C6 /* trans_exe.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = trans_exe.cc; path = ../../trans_exe.cc; sourceTree = SOURCE_ROOT; };
+		ACE778240E20013F00F7C0C6 /* trans_exe.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = trans_exe.h; path = ../../trans_exe.h; sourceTree = SOURCE_ROOT; };
+		ACE778250E20013F00F7C0C6 /* transducer.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = transducer.cc; path = ../../transducer.cc; sourceTree = SOURCE_ROOT; };
+		ACE778260E20013F00F7C0C6 /* transducer.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = transducer.h; path = ../../transducer.h; sourceTree = SOURCE_ROOT; };
+		ACE778270E20013F00F7C0C6 /* xml_parse_util.cc */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; name = xml_parse_util.cc; path = ../../xml_parse_util.cc; sourceTree = SOURCE_ROOT; };
+		ACE778280E20013F00F7C0C6 /* xml_parse_util.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = xml_parse_util.h; path = ../../xml_parse_util.h; sourceTree = SOURCE_ROOT; };
+		ACE778580E20015E00F7C0C6 /* lttools_config.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = lttools_config.h; path = ../lttools_config.h; sourceTree = SOURCE_ROOT; };
+		D2AAC0630554660B00DB518D /* liblttoolbox.dylib */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.dylib"; includeInIndex = 0; path = liblttoolbox.dylib; sourceTree = BUILT_PRODUCTS_DIR; };
+/* End PBXFileReference section */
+
+/* Begin PBXFrameworksBuildPhase section */
+		ACE777CF0E20003F00F7C0C6 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE7785D0E2001CD00F7C0C6 /* liblttoolbox.dylib in Frameworks */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		ACE777D60E20005300F7C0C6 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE7785F0E2001E000F7C0C6 /* liblttoolbox.dylib in Frameworks */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		ACE777DD0E20006600F7C0C6 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE7785E0E2001D300F7C0C6 /* liblttoolbox.dylib in Frameworks */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		D289988505E68E00004EDB86 /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE777F40E2000D800F7C0C6 /* libexslt.framework in Frameworks */,
+				ACE777F50E2000D800F7C0C6 /* libxml.framework in Frameworks */,
+				ACE777F60E2000D800F7C0C6 /* libxslt.framework in Frameworks */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXFrameworksBuildPhase section */
+
+/* Begin PBXGroup section */
+		08FB7794FE84155DC02AAC07 /* lttoolbox */ = {
+			isa = PBXGroup;
+			children = (
+				ACE778580E20015E00F7C0C6 /* lttools_config.h */,
+				ACE777FD0E20013F00F7C0C6 /* acx.rng */,
+				ACE777FE0E20013F00F7C0C6 /* alphabet.cc */,
+				ACE777FF0E20013F00F7C0C6 /* alphabet.h */,
+				ACE778000E20013F00F7C0C6 /* buffer.h */,
+				ACE778010E20013F00F7C0C6 /* compiler.cc */,
+				ACE778020E20013F00F7C0C6 /* compiler.h */,
+				ACE778030E20013F00F7C0C6 /* compression.cc */,
+				ACE778040E20013F00F7C0C6 /* compression.h */,
+				ACE778050E20013F00F7C0C6 /* dix.dtd */,
+				ACE778060E20013F00F7C0C6 /* endian_util.h */,
+				ACE778070E20013F00F7C0C6 /* entry_token.cc */,
+				ACE778080E20013F00F7C0C6 /* entry_token.h */,
+				ACE778090E20013F00F7C0C6 /* exception.h */,
+				ACE7780A0E20013F00F7C0C6 /* expander.cc */,
+				ACE7780B0E20013F00F7C0C6 /* expander.h */,
+				ACE7780C0E20013F00F7C0C6 /* fst_processor.cc */,
+				ACE7780D0E20013F00F7C0C6 /* fst_processor.h */,
+				ACE7780E0E20013F00F7C0C6 /* lt_locale.cc */,
+				ACE7780F0E20013F00F7C0C6 /* lt_locale.h */,
+				ACE778100E20013F00F7C0C6 /* ltstr.h */,
+				ACE778110E20013F00F7C0C6 /* match_exe.cc */,
+				ACE778120E20013F00F7C0C6 /* match_exe.h */,
+				ACE778130E20013F00F7C0C6 /* match_node.cc */,
+				ACE778140E20013F00F7C0C6 /* match_node.h */,
+				ACE778150E20013F00F7C0C6 /* match_state.cc */,
+				ACE778160E20013F00F7C0C6 /* match_state.h */,
+				ACE778170E20013F00F7C0C6 /* my_stdio.h */,
+				ACE778180E20013F00F7C0C6 /* node.cc */,
+				ACE778190E20013F00F7C0C6 /* node.h */,
+				ACE7781A0E20013F00F7C0C6 /* pattern_list.cc */,
+				ACE7781B0E20013F00F7C0C6 /* pattern_list.h */,
+				ACE7781C0E20013F00F7C0C6 /* pool.h */,
+				ACE7781D0E20013F00F7C0C6 /* regexp_compiler.cc */,
+				ACE7781E0E20013F00F7C0C6 /* regexp_compiler.h */,
+				ACE7781F0E20013F00F7C0C6 /* sorted_vector.cc */,
+				ACE778200E20013F00F7C0C6 /* sorted_vector.h */,
+				ACE778210E20013F00F7C0C6 /* state.cc */,
+				ACE778220E20013F00F7C0C6 /* state.h */,
+				ACE778230E20013F00F7C0C6 /* trans_exe.cc */,
+				ACE778240E20013F00F7C0C6 /* trans_exe.h */,
+				ACE778250E20013F00F7C0C6 /* transducer.cc */,
+				ACE778260E20013F00F7C0C6 /* transducer.h */,
+				ACE778270E20013F00F7C0C6 /* xml_parse_util.cc */,
+				ACE778280E20013F00F7C0C6 /* xml_parse_util.h */,
+				ACE777F10E2000D800F7C0C6 /* libexslt.framework */,
+				ACE777F20E2000D800F7C0C6 /* libxml.framework */,
+				ACE777F30E2000D800F7C0C6 /* libxslt.framework */,
+				ACE777EE0E2000B700F7C0C6 /* lt-comp.1 */,
+				ACE777EF0E2000B700F7C0C6 /* lt_comp.cc */,
+				ACE777EB0E20009B00F7C0C6 /* lt-proc.1 */,
+				ACE777EC0E20009B00F7C0C6 /* lt_proc.cc */,
+				ACE777E30E20008300F7C0C6 /* lt-expand.1 */,
+				ACE777E40E20008300F7C0C6 /* lt_expand.cc */,
+				08FB7795FE84155DC02AAC07 /* Source */,
+				1AB674ADFE9D54B511CA2CBB /* Products */,
+			);
+			name = lttoolbox;
+			sourceTree = "<group>";
+		};
+		08FB7795FE84155DC02AAC07 /* Source */ = {
+			isa = PBXGroup;
+			children = (
+			);
+			name = Source;
+			sourceTree = "<group>";
+		};
+		1AB674ADFE9D54B511CA2CBB /* Products */ = {
+			isa = PBXGroup;
+			children = (
+				D2AAC0630554660B00DB518D /* liblttoolbox.dylib */,
+				ACE777D10E20003F00F7C0C6 /* lt-comp */,
+				ACE777D80E20005300F7C0C6 /* lt-proc */,
+				ACE777DF0E20006600F7C0C6 /* lt-expand */,
+			);
+			name = Products;
+			sourceTree = "<group>";
+		};
+/* End PBXGroup section */
+
+/* Begin PBXHeadersBuildPhase section */
+		D2AAC0600554660B00DB518D /* Headers */ = {
+			isa = PBXHeadersBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE7782A0E20013F00F7C0C6 /* alphabet.h in Headers */,
+				ACE7782B0E20013F00F7C0C6 /* buffer.h in Headers */,
+				ACE7782D0E20013F00F7C0C6 /* compiler.h in Headers */,
+				ACE7782F0E20013F00F7C0C6 /* compression.h in Headers */,
+				ACE778300E20013F00F7C0C6 /* endian_util.h in Headers */,
+				ACE778320E20013F00F7C0C6 /* entry_token.h in Headers */,
+				ACE778330E20013F00F7C0C6 /* exception.h in Headers */,
+				ACE778350E20013F00F7C0C6 /* expander.h in Headers */,
+				ACE778370E20013F00F7C0C6 /* fst_processor.h in Headers */,
+				ACE778390E20013F00F7C0C6 /* lt_locale.h in Headers */,
+				ACE7783A0E20013F00F7C0C6 /* ltstr.h in Headers */,
+				ACE7783C0E20013F00F7C0C6 /* match_exe.h in Headers */,
+				ACE7783E0E20013F00F7C0C6 /* match_node.h in Headers */,
+				ACE778400E20013F00F7C0C6 /* match_state.h in Headers */,
+				ACE778410E20013F00F7C0C6 /* my_stdio.h in Headers */,
+				ACE778430E20013F00F7C0C6 /* node.h in Headers */,
+				ACE778450E20013F00F7C0C6 /* pattern_list.h in Headers */,
+				ACE778460E20013F00F7C0C6 /* pool.h in Headers */,
+				ACE778480E20013F00F7C0C6 /* regexp_compiler.h in Headers */,
+				ACE7784A0E20013F00F7C0C6 /* sorted_vector.h in Headers */,
+				ACE7784C0E20013F00F7C0C6 /* state.h in Headers */,
+				ACE7784E0E20013F00F7C0C6 /* trans_exe.h in Headers */,
+				ACE778500E20013F00F7C0C6 /* transducer.h in Headers */,
+				ACE778520E20013F00F7C0C6 /* xml_parse_util.h in Headers */,
+				ACE778590E20015E00F7C0C6 /* lttools_config.h in Headers */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXHeadersBuildPhase section */
+
+/* Begin PBXNativeTarget section */
+		ACE777D00E20003F00F7C0C6 /* lt-comp */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = ACE777E60E20008300F7C0C6 /* Build configuration list for PBXNativeTarget "lt-comp" */;
+			buildPhases = (
+				ACE777CE0E20003F00F7C0C6 /* Sources */,
+				ACE777CF0E20003F00F7C0C6 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = "lt-comp";
+			productName = "lt-comp";
+			productReference = ACE777D10E20003F00F7C0C6 /* lt-comp */;
+			productType = "com.apple.product-type.tool";
+		};
+		ACE777D70E20005300F7C0C6 /* lt-proc */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = ACE777E70E20008300F7C0C6 /* Build configuration list for PBXNativeTarget "lt-proc" */;
+			buildPhases = (
+				ACE777D50E20005300F7C0C6 /* Sources */,
+				ACE777D60E20005300F7C0C6 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = "lt-proc";
+			productName = "lt-proc";
+			productReference = ACE777D80E20005300F7C0C6 /* lt-proc */;
+			productType = "com.apple.product-type.tool";
+		};
+		ACE777DE0E20006600F7C0C6 /* lt-expand */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = ACE777E80E20008300F7C0C6 /* Build configuration list for PBXNativeTarget "lt-expand" */;
+			buildPhases = (
+				ACE777DC0E20006600F7C0C6 /* Sources */,
+				ACE777DD0E20006600F7C0C6 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = "lt-expand";
+			productName = "lt-expand";
+			productReference = ACE777DF0E20006600F7C0C6 /* lt-expand */;
+			productType = "com.apple.product-type.tool";
+		};
+		D2AAC0620554660B00DB518D /* lttoolbox */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = 1DEB914A08733D8E0010E9CD /* Build configuration list for PBXNativeTarget "lttoolbox" */;
+			buildPhases = (
+				D2AAC0600554660B00DB518D /* Headers */,
+				D2AAC0610554660B00DB518D /* Sources */,
+				D289988505E68E00004EDB86 /* Frameworks */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = lttoolbox;
+			productName = lttoolbox;
+			productReference = D2AAC0630554660B00DB518D /* liblttoolbox.dylib */;
+			productType = "com.apple.product-type.library.dynamic";
+		};
+/* End PBXNativeTarget section */
+
+/* Begin PBXProject section */
+		08FB7793FE84155DC02AAC07 /* Project object */ = {
+			isa = PBXProject;
+			buildConfigurationList = 1DEB914E08733D8E0010E9CD /* Build configuration list for PBXProject "lttoolbox" */;
+			compatibilityVersion = "Xcode 3.0";
+			hasScannedForEncodings = 1;
+			mainGroup = 08FB7794FE84155DC02AAC07 /* lttoolbox */;
+			projectDirPath = "";
+			projectRoot = "";
+			targets = (
+				D2AAC0620554660B00DB518D /* lttoolbox */,
+				ACE777D00E20003F00F7C0C6 /* lt-comp */,
+				ACE777D70E20005300F7C0C6 /* lt-proc */,
+				ACE777DE0E20006600F7C0C6 /* lt-expand */,
+			);
+		};
+/* End PBXProject section */
+
+/* Begin PBXSourcesBuildPhase section */
+		ACE777CE0E20003F00F7C0C6 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE777F00E2000B700F7C0C6 /* lt_comp.cc in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		ACE777D50E20005300F7C0C6 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE777ED0E20009B00F7C0C6 /* lt_proc.cc in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		ACE777DC0E20006600F7C0C6 /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE777E50E20008300F7C0C6 /* lt_expand.cc in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+		D2AAC0610554660B00DB518D /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+				ACE778290E20013F00F7C0C6 /* alphabet.cc in Sources */,
+				ACE7782C0E20013F00F7C0C6 /* compiler.cc in Sources */,
+				ACE7782E0E20013F00F7C0C6 /* compression.cc in Sources */,
+				ACE778310E20013F00F7C0C6 /* entry_token.cc in Sources */,
+				ACE778340E20013F00F7C0C6 /* expander.cc in Sources */,
+				ACE778360E20013F00F7C0C6 /* fst_processor.cc in Sources */,
+				ACE778380E20013F00F7C0C6 /* lt_locale.cc in Sources */,
+				ACE7783B0E20013F00F7C0C6 /* match_exe.cc in Sources */,
+				ACE7783D0E20013F00F7C0C6 /* match_node.cc in Sources */,
+				ACE7783F0E20013F00F7C0C6 /* match_state.cc in Sources */,
+				ACE778420E20013F00F7C0C6 /* node.cc in Sources */,
+				ACE778440E20013F00F7C0C6 /* pattern_list.cc in Sources */,
+				ACE778470E20013F00F7C0C6 /* regexp_compiler.cc in Sources */,
+				ACE778490E20013F00F7C0C6 /* sorted_vector.cc in Sources */,
+				ACE7784B0E20013F00F7C0C6 /* state.cc in Sources */,
+				ACE7784D0E20013F00F7C0C6 /* trans_exe.cc in Sources */,
+				ACE7784F0E20013F00F7C0C6 /* transducer.cc in Sources */,
+				ACE778510E20013F00F7C0C6 /* xml_parse_util.cc in Sources */,
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXSourcesBuildPhase section */
+
+/* Begin XCBuildConfiguration section */
+		1DEB914B08733D8E0010E9CD /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = NO;
+				EXECUTABLE_PREFIX = lib;
+				FRAMEWORK_SEARCH_PATHS = (
+					"$(inherited)",
+					"\"$(SRCROOT)/..\"",
+				);
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_ENABLE_FIX_AND_CONTINUE = YES;
+				GCC_MODEL_TUNING = G5;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				INSTALL_PATH = /usr/local/lib;
+				PRODUCT_NAME = lttoolbox;
+				ZERO_LINK = YES;
+			};
+			name = Debug;
+		};
+		1DEB914C08733D8E0010E9CD /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+				EXECUTABLE_PREFIX = lib;
+				FRAMEWORK_SEARCH_PATHS = (
+					"$(inherited)",
+					"\"$(SRCROOT)/..\"",
+				);
+				GCC_MODEL_TUNING = G5;
+				INSTALL_PATH = /usr/local/lib;
+				PRODUCT_NAME = lttoolbox;
+			};
+			name = Release;
+		};
+		1DEB914F08733D8E0010E9CD /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				GCC_WARN_ABOUT_RETURN_TYPE = YES;
+				GCC_WARN_UNUSED_VARIABLE = YES;
+				PREBINDING = NO;
+				SDKROOT = "$(DEVELOPER_SDK_DIR)/MacOSX10.5.sdk";
+			};
+			name = Debug;
+		};
+		1DEB915008733D8E0010E9CD /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ARCHS = (
+					ppc,
+					i386,
+				);
+				GCC_WARN_ABOUT_RETURN_TYPE = YES;
+				GCC_WARN_UNUSED_VARIABLE = YES;
+				PREBINDING = NO;
+				SDKROOT = "$(DEVELOPER_SDK_DIR)/MacOSX10.5.sdk";
+			};
+			name = Release;
+		};
+		ACE777D30E20003F00F7C0C6 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = NO;
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_ENABLE_FIX_AND_CONTINUE = YES;
+				GCC_MODEL_TUNING = G5;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				INSTALL_PATH = /usr/local/bin;
+				PREBINDING = NO;
+				PRODUCT_NAME = "lt-comp";
+				ZERO_LINK = YES;
+			};
+			name = Debug;
+		};
+		ACE777D40E20003F00F7C0C6 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = YES;
+				DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+				GCC_ENABLE_FIX_AND_CONTINUE = NO;
+				GCC_MODEL_TUNING = G5;
+				INSTALL_PATH = /usr/local/bin;
+				PREBINDING = NO;
+				PRODUCT_NAME = "lt-comp";
+				ZERO_LINK = NO;
+			};
+			name = Release;
+		};
+		ACE777DA0E20005300F7C0C6 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = NO;
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_ENABLE_FIX_AND_CONTINUE = YES;
+				GCC_MODEL_TUNING = G5;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				INSTALL_PATH = /usr/local/bin;
+				PREBINDING = NO;
+				PRODUCT_NAME = "lt-proc";
+				ZERO_LINK = YES;
+			};
+			name = Debug;
+		};
+		ACE777DB0E20005300F7C0C6 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = YES;
+				DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+				GCC_ENABLE_FIX_AND_CONTINUE = NO;
+				GCC_MODEL_TUNING = G5;
+				INSTALL_PATH = /usr/local/bin;
+				PREBINDING = NO;
+				PRODUCT_NAME = "lt-proc";
+				ZERO_LINK = NO;
+			};
+			name = Release;
+		};
+		ACE777E10E20006600F7C0C6 /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = NO;
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_ENABLE_FIX_AND_CONTINUE = YES;
+				GCC_MODEL_TUNING = G5;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				INSTALL_PATH = /usr/local/bin;
+				PREBINDING = NO;
+				PRODUCT_NAME = "lt-expand";
+				ZERO_LINK = YES;
+			};
+			name = Debug;
+		};
+		ACE777E20E20006600F7C0C6 /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				COPY_PHASE_STRIP = YES;
+				DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+				GCC_ENABLE_FIX_AND_CONTINUE = NO;
+				GCC_MODEL_TUNING = G5;
+				INSTALL_PATH = /usr/local/bin;
+				PREBINDING = NO;
+				PRODUCT_NAME = "lt-expand";
+				ZERO_LINK = NO;
+			};
+			name = Release;
+		};
+/* End XCBuildConfiguration section */
+
+/* Begin XCConfigurationList section */
+		1DEB914A08733D8E0010E9CD /* Build configuration list for PBXNativeTarget "lttoolbox" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				1DEB914B08733D8E0010E9CD /* Debug */,
+				1DEB914C08733D8E0010E9CD /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		1DEB914E08733D8E0010E9CD /* Build configuration list for PBXProject "lttoolbox" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				1DEB914F08733D8E0010E9CD /* Debug */,
+				1DEB915008733D8E0010E9CD /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		ACE777E60E20008300F7C0C6 /* Build configuration list for PBXNativeTarget "lt-comp" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				ACE777D30E20003F00F7C0C6 /* Debug */,
+				ACE777D40E20003F00F7C0C6 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		ACE777E70E20008300F7C0C6 /* Build configuration list for PBXNativeTarget "lt-proc" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				ACE777DA0E20005300F7C0C6 /* Debug */,
+				ACE777DB0E20005300F7C0C6 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		ACE777E80E20008300F7C0C6 /* Build configuration list for PBXNativeTarget "lt-expand" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				ACE777E10E20006600F7C0C6 /* Debug */,
+				ACE777E20E20006600F7C0C6 /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+/* End XCConfigurationList section */
+	};
+	rootObject = 08FB7793FE84155DC02AAC07 /* Project object */;
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/sortiz.mode1v3
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/sortiz.mode1v3	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/sortiz.mode1v3	(revision 70339)
@@ -0,0 +1,1425 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>ActivePerspectiveName</key>
+	<string>Project</string>
+	<key>AllowedModules</key>
+	<array>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXSmartGroupTreeModule</string>
+			<key>Name</key>
+			<string>Groups and Files Outline View</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXNavigatorGroup</string>
+			<key>Name</key>
+			<string>Editor</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>XCTaskListModule</string>
+			<key>Name</key>
+			<string>Task List</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>XCDetailModule</string>
+			<key>Name</key>
+			<string>File and Smart Group Detail Viewer</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>1</string>
+			<key>Module</key>
+			<string>PBXBuildResultsModule</string>
+			<key>Name</key>
+			<string>Detailed Build Results Viewer</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>1</string>
+			<key>Module</key>
+			<string>PBXProjectFindModule</string>
+			<key>Name</key>
+			<string>Project Batch Find Tool</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>XCProjectFormatConflictsModule</string>
+			<key>Name</key>
+			<string>Project Format Conflicts List</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXBookmarksModule</string>
+			<key>Name</key>
+			<string>Bookmarks Tool</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXClassBrowserModule</string>
+			<key>Name</key>
+			<string>Class Browser</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXCVSModule</string>
+			<key>Name</key>
+			<string>Source Code Control Tool</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXDebugBreakpointsModule</string>
+			<key>Name</key>
+			<string>Debug Breakpoints Tool</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>XCDockableInspector</string>
+			<key>Name</key>
+			<string>Inspector</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>PBXOpenQuicklyModule</string>
+			<key>Name</key>
+			<string>Open Quickly Tool</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>1</string>
+			<key>Module</key>
+			<string>PBXDebugSessionModule</string>
+			<key>Name</key>
+			<string>Debugger</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>1</string>
+			<key>Module</key>
+			<string>PBXDebugCLIModule</string>
+			<key>Name</key>
+			<string>Debug Console</string>
+		</dict>
+		<dict>
+			<key>BundleLoadPath</key>
+			<string></string>
+			<key>MaxInstances</key>
+			<string>n</string>
+			<key>Module</key>
+			<string>XCSnapshotModule</string>
+			<key>Name</key>
+			<string>Snapshots Tool</string>
+		</dict>
+	</array>
+	<key>BundlePath</key>
+	<string>/Developer/Library/PrivateFrameworks/DevToolsInterface.framework/Resources</string>
+	<key>Description</key>
+	<string>DefaultDescriptionKey</string>
+	<key>DockingSystemVisible</key>
+	<false/>
+	<key>Extension</key>
+	<string>mode1v3</string>
+	<key>FavBarConfig</key>
+	<dict>
+		<key>PBXProjectModuleGUID</key>
+		<string>ACE778650E20020B00F7C0C6</string>
+		<key>XCBarModuleItemNames</key>
+		<dict/>
+		<key>XCBarModuleItems</key>
+		<array/>
+	</dict>
+	<key>FirstTimeWindowDisplayed</key>
+	<false/>
+	<key>Identifier</key>
+	<string>com.apple.perspectives.project.mode1v3</string>
+	<key>MajorVersion</key>
+	<integer>33</integer>
+	<key>MinorVersion</key>
+	<integer>0</integer>
+	<key>Name</key>
+	<string>Default</string>
+	<key>Notifications</key>
+	<array/>
+	<key>OpenEditors</key>
+	<array>
+		<dict>
+			<key>Content</key>
+			<dict>
+				<key>PBXProjectModuleGUID</key>
+				<string>AC11C8A60E20DCD400B07E6D</string>
+				<key>PBXProjectModuleLabel</key>
+				<string>ltstr.h</string>
+				<key>PBXSplitModuleInNavigatorKey</key>
+				<dict>
+					<key>Split0</key>
+					<dict>
+						<key>PBXProjectModuleGUID</key>
+						<string>AC11C8A70E20DCD400B07E6D</string>
+						<key>PBXProjectModuleLabel</key>
+						<string>ltstr.h</string>
+						<key>_historyCapacity</key>
+						<integer>0</integer>
+						<key>bookmark</key>
+						<string>AC3AA9820E212BD6003FADD9</string>
+						<key>history</key>
+						<array>
+							<string>ACA8B8880E2118AF00634D8F</string>
+						</array>
+					</dict>
+					<key>SplitCount</key>
+					<string>1</string>
+				</dict>
+				<key>StatusBarVisibility</key>
+				<true/>
+			</dict>
+			<key>Geometry</key>
+			<dict>
+				<key>Frame</key>
+				<string>{{0, 20}, {918, 697}}</string>
+				<key>PBXModuleWindowStatusBarHidden2</key>
+				<false/>
+				<key>RubberWindowFrame</key>
+				<string>769 282 918 738 0 0 1680 1028 </string>
+			</dict>
+		</dict>
+	</array>
+	<key>PerspectiveWidths</key>
+	<array>
+		<integer>-1</integer>
+		<integer>-1</integer>
+	</array>
+	<key>Perspectives</key>
+	<array>
+		<dict>
+			<key>ChosenToolbarItems</key>
+			<array>
+				<string>active-target-popup</string>
+				<string>active-buildstyle-popup</string>
+				<string>action</string>
+				<string>NSToolbarFlexibleSpaceItem</string>
+				<string>buildOrClean</string>
+				<string>build-and-goOrGo</string>
+				<string>com.apple.ide.PBXToolbarStopButton</string>
+				<string>get-info</string>
+				<string>toggle-editor</string>
+				<string>NSToolbarFlexibleSpaceItem</string>
+				<string>com.apple.pbx.toolbar.searchfield</string>
+			</array>
+			<key>ControllerClassBaseName</key>
+			<string></string>
+			<key>IconName</key>
+			<string>WindowOfProjectWithEditor</string>
+			<key>Identifier</key>
+			<string>perspective.project</string>
+			<key>IsVertical</key>
+			<false/>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>ContentConfiguration</key>
+					<dict>
+						<key>PBXBottomSmartGroupGIDs</key>
+						<array>
+							<string>1C37FBAC04509CD000000102</string>
+							<string>1C37FAAC04509CD000000102</string>
+							<string>1C08E77C0454961000C914BD</string>
+							<string>1C37FABC05509CD000000102</string>
+							<string>1C37FABC05539CD112110102</string>
+							<string>E2644B35053B69B200211256</string>
+							<string>1C37FABC04509CD000100104</string>
+							<string>1CC0EA4004350EF90044410B</string>
+							<string>1CC0EA4004350EF90041110B</string>
+						</array>
+						<key>PBXProjectModuleGUID</key>
+						<string>1CE0B1FE06471DED0097A5F4</string>
+						<key>PBXProjectModuleLabel</key>
+						<string>Files</string>
+						<key>PBXProjectStructureProvided</key>
+						<string>yes</string>
+						<key>PBXSmartGroupTreeModuleColumnData</key>
+						<dict>
+							<key>PBXSmartGroupTreeModuleColumnWidthsKey</key>
+							<array>
+								<real>186</real>
+							</array>
+							<key>PBXSmartGroupTreeModuleColumnsKey_v4</key>
+							<array>
+								<string>MainColumn</string>
+							</array>
+						</dict>
+						<key>PBXSmartGroupTreeModuleOutlineStateKey_v7</key>
+						<dict>
+							<key>PBXSmartGroupTreeModuleOutlineStateExpansionKey</key>
+							<array>
+								<string>1C37FAAC04509CD000000102</string>
+								<string>1C37FABC05509CD000000102</string>
+							</array>
+							<key>PBXSmartGroupTreeModuleOutlineStateSelectionKey</key>
+							<array>
+								<array>
+									<integer>0</integer>
+								</array>
+							</array>
+							<key>PBXSmartGroupTreeModuleOutlineStateVisibleRectKey</key>
+							<string>{{0, 0}, {186, 342}}</string>
+						</dict>
+						<key>PBXTopSmartGroupGIDs</key>
+						<array/>
+						<key>XCIncludePerspectivesSwitch</key>
+						<true/>
+						<key>XCSharingToken</key>
+						<string>com.apple.Xcode.GFSharingToken</string>
+					</dict>
+					<key>GeometryConfiguration</key>
+					<dict>
+						<key>Frame</key>
+						<string>{{0, 0}, {203, 360}}</string>
+						<key>GroupTreeTableConfiguration</key>
+						<array>
+							<string>MainColumn</string>
+							<real>186</real>
+						</array>
+						<key>RubberWindowFrame</key>
+						<string>763 427 821 401 0 0 1680 1028 </string>
+					</dict>
+					<key>Module</key>
+					<string>PBXSmartGroupTreeModule</string>
+					<key>Proportion</key>
+					<string>203pt</string>
+				</dict>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CE0B20306471E060097A5F4</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>MyNewFile14.java</string>
+								<key>PBXSplitModuleInNavigatorKey</key>
+								<dict>
+									<key>Split0</key>
+									<dict>
+										<key>PBXProjectModuleGUID</key>
+										<string>1CE0B20406471E060097A5F4</string>
+										<key>PBXProjectModuleLabel</key>
+										<string>MyNewFile14.java</string>
+									</dict>
+									<key>SplitCount</key>
+									<string>1</string>
+								</dict>
+								<key>StatusBarVisibility</key>
+								<true/>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 0}, {613, 0}}</string>
+								<key>RubberWindowFrame</key>
+								<string>763 427 821 401 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXNavigatorGroup</string>
+							<key>Proportion</key>
+							<string>0pt</string>
+						</dict>
+						<dict>
+							<key>BecomeActive</key>
+							<true/>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CE0B20506471E060097A5F4</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Detail</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 5}, {613, 355}}</string>
+								<key>RubberWindowFrame</key>
+								<string>763 427 821 401 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>XCDetailModule</string>
+							<key>Proportion</key>
+							<string>355pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>613pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Project</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>XCModuleDock</string>
+				<string>PBXSmartGroupTreeModule</string>
+				<string>XCModuleDock</string>
+				<string>PBXNavigatorGroup</string>
+				<string>XCDetailModule</string>
+			</array>
+			<key>TableOfContents</key>
+			<array>
+				<string>AC3AA9610E2125C9003FADD9</string>
+				<string>1CE0B1FE06471DED0097A5F4</string>
+				<string>AC3AA9620E2125C9003FADD9</string>
+				<string>1CE0B20306471E060097A5F4</string>
+				<string>1CE0B20506471E060097A5F4</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.defaultV3</string>
+		</dict>
+		<dict>
+			<key>ControllerClassBaseName</key>
+			<string></string>
+			<key>IconName</key>
+			<string>WindowOfProject</string>
+			<key>Identifier</key>
+			<string>perspective.morph</string>
+			<key>IsVertical</key>
+			<integer>0</integer>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>BecomeActive</key>
+					<integer>1</integer>
+					<key>ContentConfiguration</key>
+					<dict>
+						<key>PBXBottomSmartGroupGIDs</key>
+						<array>
+							<string>1C37FBAC04509CD000000102</string>
+							<string>1C37FAAC04509CD000000102</string>
+							<string>1C08E77C0454961000C914BD</string>
+							<string>1C37FABC05509CD000000102</string>
+							<string>1C37FABC05539CD112110102</string>
+							<string>E2644B35053B69B200211256</string>
+							<string>1C37FABC04509CD000100104</string>
+							<string>1CC0EA4004350EF90044410B</string>
+							<string>1CC0EA4004350EF90041110B</string>
+						</array>
+						<key>PBXProjectModuleGUID</key>
+						<string>11E0B1FE06471DED0097A5F4</string>
+						<key>PBXProjectModuleLabel</key>
+						<string>Files</string>
+						<key>PBXProjectStructureProvided</key>
+						<string>yes</string>
+						<key>PBXSmartGroupTreeModuleColumnData</key>
+						<dict>
+							<key>PBXSmartGroupTreeModuleColumnWidthsKey</key>
+							<array>
+								<real>186</real>
+							</array>
+							<key>PBXSmartGroupTreeModuleColumnsKey_v4</key>
+							<array>
+								<string>MainColumn</string>
+							</array>
+						</dict>
+						<key>PBXSmartGroupTreeModuleOutlineStateKey_v7</key>
+						<dict>
+							<key>PBXSmartGroupTreeModuleOutlineStateExpansionKey</key>
+							<array>
+								<string>29B97314FDCFA39411CA2CEA</string>
+								<string>1C37FABC05509CD000000102</string>
+							</array>
+							<key>PBXSmartGroupTreeModuleOutlineStateSelectionKey</key>
+							<array>
+								<array>
+									<integer>0</integer>
+								</array>
+							</array>
+							<key>PBXSmartGroupTreeModuleOutlineStateVisibleRectKey</key>
+							<string>{{0, 0}, {186, 337}}</string>
+						</dict>
+						<key>PBXTopSmartGroupGIDs</key>
+						<array/>
+						<key>XCIncludePerspectivesSwitch</key>
+						<integer>1</integer>
+						<key>XCSharingToken</key>
+						<string>com.apple.Xcode.GFSharingToken</string>
+					</dict>
+					<key>GeometryConfiguration</key>
+					<dict>
+						<key>Frame</key>
+						<string>{{0, 0}, {203, 355}}</string>
+						<key>GroupTreeTableConfiguration</key>
+						<array>
+							<string>MainColumn</string>
+							<real>186</real>
+						</array>
+						<key>RubberWindowFrame</key>
+						<string>373 269 690 397 0 0 1440 878 </string>
+					</dict>
+					<key>Module</key>
+					<string>PBXSmartGroupTreeModule</string>
+					<key>Proportion</key>
+					<string>100%</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Morph</string>
+			<key>PreferredWidth</key>
+			<integer>300</integer>
+			<key>ServiceClasses</key>
+			<array>
+				<string>XCModuleDock</string>
+				<string>PBXSmartGroupTreeModule</string>
+			</array>
+			<key>TableOfContents</key>
+			<array>
+				<string>11E0B1FE06471DED0097A5F4</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.default.shortV3</string>
+		</dict>
+	</array>
+	<key>PerspectivesBarVisible</key>
+	<false/>
+	<key>ShelfIsVisible</key>
+	<false/>
+	<key>SourceDescription</key>
+	<string>file at '/Developer/Library/PrivateFrameworks/DevToolsInterface.framework/Resources/XCPerspectivesSpecificationMode1.xcperspec'</string>
+	<key>StatusbarIsVisible</key>
+	<true/>
+	<key>TimeStamp</key>
+	<real>0.0</real>
+	<key>ToolbarDisplayMode</key>
+	<integer>1</integer>
+	<key>ToolbarIsVisible</key>
+	<true/>
+	<key>ToolbarSizeMode</key>
+	<integer>1</integer>
+	<key>Type</key>
+	<string>Perspectives</string>
+	<key>UpdateMessage</key>
+	<string>The Default Workspace in this version of Xcode now includes support to hide and show the detail view (what has been referred to as the "Metro-Morph" feature).  You must discard your current Default Workspace settings and update to the latest Default Workspace in order to gain this feature.  Do you wish to update to the latest Workspace defaults for project '%@'?</string>
+	<key>WindowJustification</key>
+	<integer>5</integer>
+	<key>WindowOrderList</key>
+	<array>
+		<string>ACE778560E20015500F7C0C6</string>
+		<string>AC11C8A60E20DCD400B07E6D</string>
+		<string>1CD10A99069EF8BA00B06720</string>
+		<string>/Users/sortiz/Devel/paquetes/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj</string>
+	</array>
+	<key>WindowString</key>
+	<string>763 427 821 401 0 0 1680 1028 </string>
+	<key>WindowToolsV3</key>
+	<array>
+		<dict>
+			<key>FirstTimeWindowDisplayed</key>
+			<false/>
+			<key>Identifier</key>
+			<string>windowTool.build</string>
+			<key>IsVertical</key>
+			<true/>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CD0528F0623707200166675</string>
+								<key>PBXProjectModuleLabel</key>
+								<string></string>
+								<key>StatusBarVisibility</key>
+								<true/>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 0}, {500, 218}}</string>
+								<key>RubberWindowFrame</key>
+								<string>516 378 500 500 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXNavigatorGroup</string>
+							<key>Proportion</key>
+							<string>218pt</string>
+						</dict>
+						<dict>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>XCMainBuildResultsModuleGUID</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Build</string>
+								<key>XCBuildResultsTrigger_Collapse</key>
+								<integer>1021</integer>
+								<key>XCBuildResultsTrigger_Open</key>
+								<integer>1011</integer>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 223}, {500, 236}}</string>
+								<key>RubberWindowFrame</key>
+								<string>516 378 500 500 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXBuildResultsModule</string>
+							<key>Proportion</key>
+							<string>236pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>459pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Build Results</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXBuildResultsModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<true/>
+			<key>TableOfContents</key>
+			<array>
+				<string>ACE778560E20015500F7C0C6</string>
+				<string>AC3AA9680E2125C9003FADD9</string>
+				<string>1CD0528F0623707200166675</string>
+				<string>XCMainBuildResultsModuleGUID</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.buildV3</string>
+			<key>WindowString</key>
+			<string>516 378 500 500 0 0 1680 1028 </string>
+			<key>WindowToolGUID</key>
+			<string>ACE778560E20015500F7C0C6</string>
+			<key>WindowToolIsVisible</key>
+			<false/>
+		</dict>
+		<dict>
+			<key>FirstTimeWindowDisplayed</key>
+			<false/>
+			<key>Identifier</key>
+			<string>windowTool.debugger</string>
+			<key>IsVertical</key>
+			<true/>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>Debugger</key>
+								<dict>
+									<key>HorizontalSplitView</key>
+									<dict>
+										<key>_collapsingFrameDimension</key>
+										<real>0.0</real>
+										<key>_indexOfCollapsedView</key>
+										<integer>0</integer>
+										<key>_percentageOfCollapsedView</key>
+										<real>0.0</real>
+										<key>isCollapsed</key>
+										<string>yes</string>
+										<key>sizes</key>
+										<array>
+											<string>{{0, 0}, {442, 285}}</string>
+											<string>{{442, 0}, {528, 285}}</string>
+										</array>
+									</dict>
+									<key>VerticalSplitView</key>
+									<dict>
+										<key>_collapsingFrameDimension</key>
+										<real>0.0</real>
+										<key>_indexOfCollapsedView</key>
+										<integer>0</integer>
+										<key>_percentageOfCollapsedView</key>
+										<real>0.0</real>
+										<key>isCollapsed</key>
+										<string>yes</string>
+										<key>sizes</key>
+										<array>
+											<string>{{0, 0}, {970, 285}}</string>
+											<string>{{0, 285}, {970, 256}}</string>
+										</array>
+									</dict>
+								</dict>
+								<key>LauncherConfigVersion</key>
+								<string>8</string>
+								<key>PBXProjectModuleGUID</key>
+								<string>1C162984064C10D400B95A72</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Debug - GLUTExamples (Underwater)</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>DebugConsoleVisible</key>
+								<string>None</string>
+								<key>DebugConsoleWindowFrame</key>
+								<string>{{200, 200}, {500, 300}}</string>
+								<key>DebugSTDIOWindowFrame</key>
+								<string>{{200, 200}, {500, 300}}</string>
+								<key>Frame</key>
+								<string>{{0, 0}, {970, 541}}</string>
+								<key>PBXDebugSessionStackFrameViewKey</key>
+								<dict>
+									<key>DebugVariablesTableConfiguration</key>
+									<array>
+										<string>Name</string>
+										<real>235</real>
+										<string>Value</string>
+										<real>85</real>
+										<string>Summary</string>
+										<real>183</real>
+									</array>
+									<key>Frame</key>
+									<string>{{442, 0}, {528, 285}}</string>
+									<key>RubberWindowFrame</key>
+									<string>111 405 970 582 0 0 1680 1028 </string>
+								</dict>
+								<key>RubberWindowFrame</key>
+								<string>111 405 970 582 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXDebugSessionModule</string>
+							<key>Proportion</key>
+							<string>541pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>541pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Debugger</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXDebugSessionModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<true/>
+			<key>TableOfContents</key>
+			<array>
+				<string>1CD10A99069EF8BA00B06720</string>
+				<string>AC3AA9690E2125C9003FADD9</string>
+				<string>1C162984064C10D400B95A72</string>
+				<string>AC3AA96A0E2125C9003FADD9</string>
+				<string>AC3AA96B0E2125C9003FADD9</string>
+				<string>AC3AA96C0E2125C9003FADD9</string>
+				<string>AC3AA96D0E2125C9003FADD9</string>
+				<string>AC3AA96E0E2125C9003FADD9</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.debugV3</string>
+			<key>WindowString</key>
+			<string>111 405 970 582 0 0 1680 1028 </string>
+			<key>WindowToolGUID</key>
+			<string>1CD10A99069EF8BA00B06720</string>
+			<key>WindowToolIsVisible</key>
+			<true/>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.find</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>Dock</key>
+							<array>
+								<dict>
+									<key>ContentConfiguration</key>
+									<dict>
+										<key>PBXProjectModuleGUID</key>
+										<string>1CDD528C0622207200134675</string>
+										<key>PBXProjectModuleLabel</key>
+										<string>&lt;No Editor&gt;</string>
+										<key>PBXSplitModuleInNavigatorKey</key>
+										<dict>
+											<key>Split0</key>
+											<dict>
+												<key>PBXProjectModuleGUID</key>
+												<string>1CD0528D0623707200166675</string>
+											</dict>
+											<key>SplitCount</key>
+											<string>1</string>
+										</dict>
+										<key>StatusBarVisibility</key>
+										<integer>1</integer>
+									</dict>
+									<key>GeometryConfiguration</key>
+									<dict>
+										<key>Frame</key>
+										<string>{{0, 0}, {781, 167}}</string>
+										<key>RubberWindowFrame</key>
+										<string>62 385 781 470 0 0 1440 878 </string>
+									</dict>
+									<key>Module</key>
+									<string>PBXNavigatorGroup</string>
+									<key>Proportion</key>
+									<string>781pt</string>
+								</dict>
+							</array>
+							<key>Proportion</key>
+							<string>50%</string>
+						</dict>
+						<dict>
+							<key>BecomeActive</key>
+							<integer>1</integer>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CD0528E0623707200166675</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Project Find</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{8, 0}, {773, 254}}</string>
+								<key>RubberWindowFrame</key>
+								<string>62 385 781 470 0 0 1440 878 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXProjectFindModule</string>
+							<key>Proportion</key>
+							<string>50%</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>428pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Project Find</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXProjectFindModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<integer>1</integer>
+			<key>TableOfContents</key>
+			<array>
+				<string>1C530D57069F1CE1000CFCEE</string>
+				<string>1C530D58069F1CE1000CFCEE</string>
+				<string>1C530D59069F1CE1000CFCEE</string>
+				<string>1CDD528C0622207200134675</string>
+				<string>1C530D5A069F1CE1000CFCEE</string>
+				<string>1CE0B1FE06471DED0097A5F4</string>
+				<string>1CD0528E0623707200166675</string>
+			</array>
+			<key>WindowString</key>
+			<string>62 385 781 470 0 0 1440 878 </string>
+			<key>WindowToolGUID</key>
+			<string>1C530D57069F1CE1000CFCEE</string>
+			<key>WindowToolIsVisible</key>
+			<integer>0</integer>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>MENUSEPARATOR</string>
+		</dict>
+		<dict>
+			<key>FirstTimeWindowDisplayed</key>
+			<false/>
+			<key>Identifier</key>
+			<string>windowTool.debuggerConsole</string>
+			<key>IsVertical</key>
+			<true/>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>BecomeActive</key>
+							<true/>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1C78EAAC065D492600B07095</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Debugger Console</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 0}, {650, 209}}</string>
+								<key>RubberWindowFrame</key>
+								<string>1064 255 650 250 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXDebugCLIModule</string>
+							<key>Proportion</key>
+							<string>209pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>209pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Debugger Console</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXDebugCLIModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<true/>
+			<key>TableOfContents</key>
+			<array>
+				<string>1C78EAAD065D492600B07095</string>
+				<string>AC11C85C0E2018A300B07E6D</string>
+				<string>1C78EAAC065D492600B07095</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.consoleV3</string>
+			<key>WindowString</key>
+			<string>1064 255 650 250 0 0 1680 1028 </string>
+			<key>WindowToolGUID</key>
+			<string>1C78EAAD065D492600B07095</string>
+			<key>WindowToolIsVisible</key>
+			<true/>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.snapshots</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>Module</key>
+							<string>XCSnapshotModule</string>
+							<key>Proportion</key>
+							<string>100%</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>100%</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Snapshots</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>XCSnapshotModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<string>Yes</string>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.snapshots</string>
+			<key>WindowString</key>
+			<string>315 824 300 550 0 0 1440 878 </string>
+			<key>WindowToolIsVisible</key>
+			<string>Yes</string>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.scm</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1C78EAB2065D492600B07095</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>&lt;No Editor&gt;</string>
+								<key>PBXSplitModuleInNavigatorKey</key>
+								<dict>
+									<key>Split0</key>
+									<dict>
+										<key>PBXProjectModuleGUID</key>
+										<string>1C78EAB3065D492600B07095</string>
+									</dict>
+									<key>SplitCount</key>
+									<string>1</string>
+								</dict>
+								<key>StatusBarVisibility</key>
+								<integer>1</integer>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 0}, {452, 0}}</string>
+								<key>RubberWindowFrame</key>
+								<string>743 379 452 308 0 0 1280 1002 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXNavigatorGroup</string>
+							<key>Proportion</key>
+							<string>0pt</string>
+						</dict>
+						<dict>
+							<key>BecomeActive</key>
+							<integer>1</integer>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CD052920623707200166675</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>SCM</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>ConsoleFrame</key>
+								<string>{{0, 259}, {452, 0}}</string>
+								<key>Frame</key>
+								<string>{{0, 7}, {452, 259}}</string>
+								<key>RubberWindowFrame</key>
+								<string>743 379 452 308 0 0 1280 1002 </string>
+								<key>TableConfiguration</key>
+								<array>
+									<string>Status</string>
+									<real>30</real>
+									<string>FileName</string>
+									<real>199</real>
+									<string>Path</string>
+									<real>197.09500122070312</real>
+								</array>
+								<key>TableFrame</key>
+								<string>{{0, 0}, {452, 250}}</string>
+							</dict>
+							<key>Module</key>
+							<string>PBXCVSModule</string>
+							<key>Proportion</key>
+							<string>262pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>266pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>SCM</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXCVSModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<integer>1</integer>
+			<key>TableOfContents</key>
+			<array>
+				<string>1C78EAB4065D492600B07095</string>
+				<string>1C78EAB5065D492600B07095</string>
+				<string>1C78EAB2065D492600B07095</string>
+				<string>1CD052920623707200166675</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.scm</string>
+			<key>WindowString</key>
+			<string>743 379 452 308 0 0 1280 1002 </string>
+		</dict>
+		<dict>
+			<key>FirstTimeWindowDisplayed</key>
+			<false/>
+			<key>Identifier</key>
+			<string>windowTool.breakpoints</string>
+			<key>IsVertical</key>
+			<false/>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>BecomeActive</key>
+							<true/>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXBottomSmartGroupGIDs</key>
+								<array>
+									<string>1C77FABC04509CD000000102</string>
+								</array>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CE0B1FE06471DED0097A5F4</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Files</string>
+								<key>PBXProjectStructureProvided</key>
+								<string>no</string>
+								<key>PBXSmartGroupTreeModuleColumnData</key>
+								<dict>
+									<key>PBXSmartGroupTreeModuleColumnWidthsKey</key>
+									<array>
+										<real>168</real>
+									</array>
+									<key>PBXSmartGroupTreeModuleColumnsKey_v4</key>
+									<array>
+										<string>MainColumn</string>
+									</array>
+								</dict>
+								<key>PBXSmartGroupTreeModuleOutlineStateKey_v7</key>
+								<dict>
+									<key>PBXSmartGroupTreeModuleOutlineStateExpansionKey</key>
+									<array>
+										<string>1C77FABC04509CD000000102</string>
+									</array>
+									<key>PBXSmartGroupTreeModuleOutlineStateSelectionKey</key>
+									<array>
+										<array>
+											<integer>0</integer>
+										</array>
+									</array>
+									<key>PBXSmartGroupTreeModuleOutlineStateVisibleRectKey</key>
+									<string>{{0, 0}, {168, 350}}</string>
+								</dict>
+								<key>PBXTopSmartGroupGIDs</key>
+								<array/>
+								<key>XCIncludePerspectivesSwitch</key>
+								<false/>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{0, 0}, {185, 368}}</string>
+								<key>GroupTreeTableConfiguration</key>
+								<array>
+									<string>MainColumn</string>
+									<real>168</real>
+								</array>
+								<key>RubberWindowFrame</key>
+								<string>132 555 744 409 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXSmartGroupTreeModule</string>
+							<key>Proportion</key>
+							<string>185pt</string>
+						</dict>
+						<dict>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CA1AED706398EBD00589147</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Detail</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{{190, 0}, {554, 368}}</string>
+								<key>RubberWindowFrame</key>
+								<string>132 555 744 409 0 0 1680 1028 </string>
+							</dict>
+							<key>Module</key>
+							<string>XCDetailModule</string>
+							<key>Proportion</key>
+							<string>554pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>368pt</string>
+				</dict>
+			</array>
+			<key>MajorVersion</key>
+			<integer>3</integer>
+			<key>MinorVersion</key>
+			<integer>0</integer>
+			<key>Name</key>
+			<string>Breakpoints</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXSmartGroupTreeModule</string>
+				<string>XCDetailModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<true/>
+			<key>TableOfContents</key>
+			<array>
+				<string>AC11C8820E20A98D00B07E6D</string>
+				<string>AC11C8830E20A98D00B07E6D</string>
+				<string>1CE0B1FE06471DED0097A5F4</string>
+				<string>1CA1AED706398EBD00589147</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.breakpointsV3</string>
+			<key>WindowString</key>
+			<string>132 555 744 409 0 0 1680 1028 </string>
+			<key>WindowToolGUID</key>
+			<string>AC11C8820E20A98D00B07E6D</string>
+			<key>WindowToolIsVisible</key>
+			<false/>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.debugAnimator</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>Module</key>
+							<string>PBXNavigatorGroup</string>
+							<key>Proportion</key>
+							<string>100%</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>100%</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Debug Visualizer</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXNavigatorGroup</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<integer>1</integer>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.debugAnimatorV3</string>
+			<key>WindowString</key>
+			<string>100 100 700 500 0 0 1280 1002 </string>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.bookmarks</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>Module</key>
+							<string>PBXBookmarksModule</string>
+							<key>Proportion</key>
+							<string>100%</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>100%</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Bookmarks</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXBookmarksModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<integer>0</integer>
+			<key>WindowString</key>
+			<string>538 42 401 187 0 0 1280 1002 </string>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.projectFormatConflicts</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>Module</key>
+							<string>XCProjectFormatConflictsModule</string>
+							<key>Proportion</key>
+							<string>100%</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>100%</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Project Format Conflicts</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>XCProjectFormatConflictsModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<integer>0</integer>
+			<key>WindowContentMinSize</key>
+			<string>450 300</string>
+			<key>WindowString</key>
+			<string>50 850 472 307 0 0 1440 877</string>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.classBrowser</string>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>BecomeActive</key>
+							<integer>1</integer>
+							<key>ContentConfiguration</key>
+							<dict>
+								<key>OptionsSetName</key>
+								<string>Hierarchy, all classes</string>
+								<key>PBXProjectModuleGUID</key>
+								<string>1CA6456E063B45B4001379D8</string>
+								<key>PBXProjectModuleLabel</key>
+								<string>Class Browser - NSObject</string>
+							</dict>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>ClassesFrame</key>
+								<string>{{0, 0}, {374, 96}}</string>
+								<key>ClassesTreeTableConfiguration</key>
+								<array>
+									<string>PBXClassNameColumnIdentifier</string>
+									<real>208</real>
+									<string>PBXClassBookColumnIdentifier</string>
+									<real>22</real>
+								</array>
+								<key>Frame</key>
+								<string>{{0, 0}, {630, 331}}</string>
+								<key>MembersFrame</key>
+								<string>{{0, 105}, {374, 395}}</string>
+								<key>MembersTreeTableConfiguration</key>
+								<array>
+									<string>PBXMemberTypeIconColumnIdentifier</string>
+									<real>22</real>
+									<string>PBXMemberNameColumnIdentifier</string>
+									<real>216</real>
+									<string>PBXMemberTypeColumnIdentifier</string>
+									<real>97</real>
+									<string>PBXMemberBookColumnIdentifier</string>
+									<real>22</real>
+								</array>
+								<key>PBXModuleWindowStatusBarHidden2</key>
+								<integer>1</integer>
+								<key>RubberWindowFrame</key>
+								<string>385 179 630 352 0 0 1440 878 </string>
+							</dict>
+							<key>Module</key>
+							<string>PBXClassBrowserModule</string>
+							<key>Proportion</key>
+							<string>332pt</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>332pt</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Class Browser</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>PBXClassBrowserModule</string>
+			</array>
+			<key>StatusbarIsVisible</key>
+			<integer>0</integer>
+			<key>TableOfContents</key>
+			<array>
+				<string>1C0AD2AF069F1E9B00FABCE6</string>
+				<string>1C0AD2B0069F1E9B00FABCE6</string>
+				<string>1CA6456E063B45B4001379D8</string>
+			</array>
+			<key>ToolbarConfiguration</key>
+			<string>xcode.toolbar.config.classbrowser</string>
+			<key>WindowString</key>
+			<string>385 179 630 352 0 0 1440 878 </string>
+			<key>WindowToolGUID</key>
+			<string>1C0AD2AF069F1E9B00FABCE6</string>
+			<key>WindowToolIsVisible</key>
+			<integer>0</integer>
+		</dict>
+		<dict>
+			<key>Identifier</key>
+			<string>windowTool.refactoring</string>
+			<key>IncludeInToolsMenu</key>
+			<integer>0</integer>
+			<key>Layout</key>
+			<array>
+				<dict>
+					<key>Dock</key>
+					<array>
+						<dict>
+							<key>BecomeActive</key>
+							<integer>1</integer>
+							<key>GeometryConfiguration</key>
+							<dict>
+								<key>Frame</key>
+								<string>{0, 0}, {500, 335}</string>
+								<key>RubberWindowFrame</key>
+								<string>{0, 0}, {500, 335}</string>
+							</dict>
+							<key>Module</key>
+							<string>XCRefactoringModule</string>
+							<key>Proportion</key>
+							<string>100%</string>
+						</dict>
+					</array>
+					<key>Proportion</key>
+					<string>100%</string>
+				</dict>
+			</array>
+			<key>Name</key>
+			<string>Refactoring</string>
+			<key>ServiceClasses</key>
+			<array>
+				<string>XCRefactoringModule</string>
+			</array>
+			<key>WindowString</key>
+			<string>200 200 500 356 0 0 1920 1200 </string>
+		</dict>
+	</array>
+</dict>
+</plist>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/sortiz.pbxuser
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/sortiz.pbxuser	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttoolbox/lttoolbox.xcodeproj/sortiz.pbxuser	(revision 70339)
@@ -0,0 +1,500 @@
+// !$*UTF8*$!
+{
+	08FB7793FE84155DC02AAC07 /* Project object */ = {
+		activeArchitecture = i386;
+		activeBuildConfigurationName = Release;
+		activeExecutable = ACE777E00E20006600F7C0C6 /* lt-expand */;
+		activeTarget = D2AAC0620554660B00DB518D /* lttoolbox */;
+		addToTargets = (
+			D2AAC0620554660B00DB518D /* lttoolbox */,
+		);
+		breakpoints = (
+			AC11C8410E2015CD00B07E6D /* lt_comp.cc:45 */,
+			AC11C8630E201F4F00B07E6D /* compiler.cc:121 */,
+			AC11C86A0E20212200B07E6D /* transducer.cc:293 */,
+			AC11C87E0E20A98200B07E6D /* transducer.cc:378 */,
+			AC11C8860E20AD7B00B07E6D /* transducer.cc:115 */,
+			AC11C88A0E20CA4500B07E6D /* compiler.cc:623 */,
+			AC11C88C0E20CAE100B07E6D /* compiler.cc:182 */,
+			AC11C88E0E20CCA800B07E6D /* compiler.cc:233 */,
+		);
+		codeSenseManager = ACE777EA0E20008300F7C0C6 /* Code sense */;
+		executables = (
+			ACE777D20E20003F00F7C0C6 /* lt-comp */,
+			ACE777D90E20005300F7C0C6 /* lt-proc */,
+			ACE777E00E20006600F7C0C6 /* lt-expand */,
+		);
+		perUserDictionary = {
+			"PBXConfiguration.PBXBreakpointsDataSource.v1:1CA1AED706398EBD00589147" = {
+				PBXFileTableDataSourceColumnSortingDirectionKey = "-1";
+				PBXFileTableDataSourceColumnSortingKey = PBXBreakpointsDataSource_BreakpointID;
+				PBXFileTableDataSourceColumnWidthsKey = (
+					20,
+					20,
+					198,
+					20,
+					99,
+					99,
+					29,
+					20,
+				);
+				PBXFileTableDataSourceColumnsKey = (
+					PBXBreakpointsDataSource_ActionID,
+					PBXBreakpointsDataSource_TypeID,
+					PBXBreakpointsDataSource_BreakpointID,
+					PBXBreakpointsDataSource_UseID,
+					PBXBreakpointsDataSource_LocationID,
+					PBXBreakpointsDataSource_ConditionID,
+					PBXBreakpointsDataSource_IgnoreCountID,
+					PBXBreakpointsDataSource_ContinueID,
+				);
+			};
+			PBXConfiguration.PBXFileTableDataSource3.PBXExecutablesDataSource = {
+				PBXFileTableDataSourceColumnSortingDirectionKey = "-1";
+				PBXFileTableDataSourceColumnSortingKey = PBXExecutablesDataSource_NameID;
+				PBXFileTableDataSourceColumnWidthsKey = (
+					22,
+					300,
+					262,
+				);
+				PBXFileTableDataSourceColumnsKey = (
+					PBXExecutablesDataSource_ActiveFlagID,
+					PBXExecutablesDataSource_NameID,
+					PBXExecutablesDataSource_CommentsID,
+				);
+			};
+			PBXConfiguration.PBXFileTableDataSource3.PBXFileTableDataSource = {
+				PBXFileTableDataSourceColumnSortingDirectionKey = "-1";
+				PBXFileTableDataSourceColumnSortingKey = PBXFileDataSource_Filename_ColumnID;
+				PBXFileTableDataSourceColumnWidthsKey = (
+					20,
+					374,
+					20,
+					48,
+					43,
+					43,
+					20,
+				);
+				PBXFileTableDataSourceColumnsKey = (
+					PBXFileDataSource_FiletypeID,
+					PBXFileDataSource_Filename_ColumnID,
+					PBXFileDataSource_Built_ColumnID,
+					PBXFileDataSource_ObjectSize_ColumnID,
+					PBXFileDataSource_Errors_ColumnID,
+					PBXFileDataSource_Warnings_ColumnID,
+					PBXFileDataSource_Target_ColumnID,
+				);
+			};
+			PBXConfiguration.PBXTargetDataSource.PBXTargetDataSource = {
+				PBXFileTableDataSourceColumnSortingDirectionKey = "-1";
+				PBXFileTableDataSourceColumnSortingKey = PBXFileDataSource_Filename_ColumnID;
+				PBXFileTableDataSourceColumnWidthsKey = (
+					20,
+					334,
+					60,
+					20,
+					48,
+					43,
+					43,
+				);
+				PBXFileTableDataSourceColumnsKey = (
+					PBXFileDataSource_FiletypeID,
+					PBXFileDataSource_Filename_ColumnID,
+					PBXTargetDataSource_PrimaryAttribute,
+					PBXFileDataSource_Built_ColumnID,
+					PBXFileDataSource_ObjectSize_ColumnID,
+					PBXFileDataSource_Errors_ColumnID,
+					PBXFileDataSource_Warnings_ColumnID,
+				);
+			};
+			PBXPerProjectTemplateStateSaveDate = 237053231;
+			PBXWorkspaceStateSaveDate = 237053231;
+		};
+		perUserProjectItems = {
+			AC3AA9820E212BD6003FADD9 /* PBXTextBookmark */ = AC3AA9820E212BD6003FADD9 /* PBXTextBookmark */;
+			ACA8B8880E2118AF00634D8F /* PBXTextBookmark */ = ACA8B8880E2118AF00634D8F /* PBXTextBookmark */;
+		};
+		sourceControlManager = ACE777E90E20008300F7C0C6 /* Source Control */;
+		userBuildSettings = {
+		};
+	};
+	AC11C8410E2015CD00B07E6D /* lt_comp.cc:45 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE777EF0E2000B700F7C0C6 /* lt_comp.cc */;
+		functionName = "main(int argc, char *argv[])";
+		hitCount = 1;
+		ignoreCount = 0;
+		lineNumber = 45;
+		location = "lt-comp";
+		modificationTime = 237031457.499251;
+		state = 1;
+	};
+	AC11C8630E201F4F00B07E6D /* compiler.cc:121 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778010E20013F00F7C0C6 /* compiler.cc */;
+		functionName = "Compiler::parse(string const &fichero, wstring const &dir)";
+		hitCount = 1;
+		ignoreCount = 0;
+		lineNumber = 121;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031480.5613829;
+		state = 1;
+	};
+	AC11C86A0E20212200B07E6D /* transducer.cc:293 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778250E20013F00F7C0C6 /* transducer.cc */;
+		functionName = "Transducer::determinize(int const epsilon_tag)";
+		hitCount = 2;
+		ignoreCount = 0;
+		lineNumber = 293;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031485.892191;
+		state = 1;
+	};
+	AC11C87E0E20A98200B07E6D /* transducer.cc:378 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778250E20013F00F7C0C6 /* transducer.cc */;
+		functionName = "Transducer::minimize(int const epsilon_tag)";
+		hitCount = 1;
+		ignoreCount = 0;
+		lineNumber = 378;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031481.252296;
+		state = 1;
+	};
+	AC11C8860E20AD7B00B07E6D /* transducer.cc:115 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778250E20013F00F7C0C6 /* transducer.cc */;
+		functionName = "Transducer::insertNewSingleTransduction(int const tag, int const source)";
+		hitCount = 0;
+		ignoreCount = 0;
+		lineNumber = 115;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031434.994582;
+		state = 1;
+	};
+	AC11C88A0E20CA4500B07E6D /* compiler.cc:623 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778010E20013F00F7C0C6 /* compiler.cc */;
+		functionName = "Compiler::procEntry()";
+		hitCount = 1;
+		ignoreCount = 0;
+		lineNumber = 623;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031462.034278;
+		state = 1;
+	};
+	AC11C88C0E20CAE100B07E6D /* compiler.cc:182 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778010E20013F00F7C0C6 /* compiler.cc */;
+		functionName = "Compiler::matchTransduction(list<int> const &pi, list<int> const &pd, int estado, Transducer &t)";
+		hitCount = 1;
+		ignoreCount = 0;
+		lineNumber = 182;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031462.47401;
+		state = 1;
+	};
+	AC11C88E0E20CCA800B07E6D /* compiler.cc:233 */ = {
+		isa = PBXFileBreakpoint;
+		actions = (
+		);
+		breakpointStyle = 0;
+		continueAfterActions = 0;
+		countType = 0;
+		delayBeforeContinue = 0;
+		fileReference = ACE778010E20013F00F7C0C6 /* compiler.cc */;
+		functionName = "Compiler::matchTransduction(list<int> const &pi, list<int> const &pd, int estado, Transducer &t)";
+		hitCount = 1;
+		ignoreCount = 0;
+		lineNumber = 233;
+		location = liblttoolbox.dylib;
+		modificationTime = 237031463.518671;
+		state = 1;
+	};
+	AC3AA9820E212BD6003FADD9 /* PBXTextBookmark */ = {
+		isa = PBXTextBookmark;
+		fRef = ACE778100E20013F00F7C0C6 /* ltstr.h */;
+		name = "ltstr.h: 52";
+		rLen = 0;
+		rLoc = 1365;
+		rType = 0;
+		vrLen = 1289;
+		vrLoc = 76;
+	};
+	ACA8B8880E2118AF00634D8F /* PBXTextBookmark */ = {
+		isa = PBXTextBookmark;
+		fRef = ACE778100E20013F00F7C0C6 /* ltstr.h */;
+		name = "ltstr.h: 52";
+		rLen = 0;
+		rLoc = 1365;
+		rType = 0;
+		vrLen = 1224;
+		vrLoc = 141;
+	};
+	ACE777D00E20003F00F7C0C6 /* lt-comp */ = {
+		activeExec = 0;
+		executables = (
+			ACE777D20E20003F00F7C0C6 /* lt-comp */,
+		);
+	};
+	ACE777D20E20003F00F7C0C6 /* lt-comp */ = {
+		isa = PBXExecutable;
+		activeArgIndices = (
+			YES,
+			YES,
+			YES,
+		);
+		argumentStrings = (
+			lr,
+			"/Users/sortiz/Devel/paquetes/apertium-es-ca/tonto.dix",
+			/tmp/tonto.bin,
+		);
+		autoAttachOnCrash = 1;
+		breakpointsEnabled = 1;
+		configStateDict = {
+		};
+		customDataFormattersEnabled = 1;
+		debuggerPlugin = GDBDebugging;
+		disassemblyDisplayState = 0;
+		dylibVariantSuffix = "";
+		enableDebugStr = 1;
+		environmentEntries = (
+		);
+		executableSystemSymbolLevel = 0;
+		executableUserSymbolLevel = 0;
+		libgmallocEnabled = 0;
+		name = "lt-comp";
+		savedGlobals = {
+		};
+		sourceDirectories = (
+		);
+		variableFormatDictionary = {
+		};
+	};
+	ACE777D70E20005300F7C0C6 /* lt-proc */ = {
+		activeExec = 0;
+		executables = (
+			ACE777D90E20005300F7C0C6 /* lt-proc */,
+		);
+	};
+	ACE777D90E20005300F7C0C6 /* lt-proc */ = {
+		isa = PBXExecutable;
+		activeArgIndices = (
+		);
+		argumentStrings = (
+		);
+		autoAttachOnCrash = 1;
+		breakpointsEnabled = 1;
+		configStateDict = {
+		};
+		customDataFormattersEnabled = 1;
+		debuggerPlugin = GDBDebugging;
+		disassemblyDisplayState = 0;
+		enableDebugStr = 1;
+		environmentEntries = (
+		);
+		executableSystemSymbolLevel = 0;
+		executableUserSymbolLevel = 0;
+		libgmallocEnabled = 0;
+		name = "lt-proc";
+		sourceDirectories = (
+		);
+	};
+	ACE777DE0E20006600F7C0C6 /* lt-expand */ = {
+		activeExec = 0;
+		executables = (
+			ACE777E00E20006600F7C0C6 /* lt-expand */,
+		);
+	};
+	ACE777E00E20006600F7C0C6 /* lt-expand */ = {
+		isa = PBXExecutable;
+		activeArgIndices = (
+		);
+		argumentStrings = (
+		);
+		autoAttachOnCrash = 1;
+		breakpointsEnabled = 1;
+		configStateDict = {
+		};
+		customDataFormattersEnabled = 1;
+		debuggerPlugin = GDBDebugging;
+		disassemblyDisplayState = 0;
+		dylibVariantSuffix = "";
+		enableDebugStr = 1;
+		environmentEntries = (
+		);
+		executableSystemSymbolLevel = 0;
+		executableUserSymbolLevel = 0;
+		libgmallocEnabled = 0;
+		name = "lt-expand";
+		sourceDirectories = (
+		);
+	};
+	ACE777E40E20008300F7C0C6 /* lt_expand.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 1120}}";
+			sepNavSelRange = "{1286, 0}";
+			sepNavVisRange = "{797, 1042}";
+			sepNavWindowFrame = "{{38, 208}, {918, 794}}";
+		};
+	};
+	ACE777E90E20008300F7C0C6 /* Source Control */ = {
+		isa = PBXSourceControlManager;
+		fallbackIsa = XCSourceControlManager;
+		isSCMEnabled = 0;
+		scmConfiguration = {
+		};
+	};
+	ACE777EA0E20008300F7C0C6 /* Code sense */ = {
+		isa = PBXCodeSenseManager;
+		indexTemplatePath = "";
+	};
+	ACE777EF0E2000B700F7C0C6 /* lt_comp.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {909, 1064}}";
+			sepNavSelRange = "{1449, 0}";
+			sepNavVisRange = "{1325, 229}";
+			sepNavWindowFrame = "{{532, 61}, {918, 794}}";
+		};
+	};
+	ACE777FE0E20013F00F7C0C6 /* alphabet.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 3136}}";
+			sepNavSelRange = "{4591, 0}";
+			sepNavVisRange = "{0, 1257}";
+			sepNavWindowFrame = "{{84, 166}, {918, 794}}";
+		};
+	};
+	ACE777FF0E20013F00F7C0C6 /* alphabet.h */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 2198}}";
+			sepNavSelRange = "{1292, 0}";
+			sepNavVisRange = "{1028, 700}";
+			sepNavWindowFrame = "{{176, 82}, {918, 794}}";
+		};
+	};
+	ACE778010E20013F00F7C0C6 /* compiler.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {909, 11578}}";
+			sepNavSelRange = "{15625, 0}";
+			sepNavVisRange = "{3795, 382}";
+			sepNavWindowFrame = "{{84, 166}, {918, 794}}";
+		};
+	};
+	ACE778070E20013F00F7C0C6 /* entry_token.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {909, 1666}}";
+			sepNavSelRange = "{2029, 0}";
+			sepNavVisRange = "{1859, 193}";
+		};
+	};
+	ACE778080E20013F00F7C0C6 /* entry_token.h */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 2142}}";
+			sepNavSelRange = "{0, 0}";
+			sepNavVisRange = "{875, 798}";
+			sepNavWindowFrame = "{{15, 229}, {918, 794}}";
+		};
+	};
+	ACE778100E20013F00F7C0C6 /* ltstr.h */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 728}}";
+			sepNavSelRange = "{1365, 0}";
+			sepNavVisRange = "{76, 1289}";
+			sepNavWindowFrame = "{{769, 226}, {918, 794}}";
+		};
+	};
+	ACE778110E20013F00F7C0C6 /* match_exe.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {439, 1456}}";
+			sepNavSelRange = "{831, 38}";
+			sepNavVisRange = "{649, 313}";
+		};
+	};
+	ACE7781D0E20013F00F7C0C6 /* regexp_compiler.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {909, 6496}}";
+			sepNavSelRange = "{1865, 2}";
+			sepNavVisRange = "{2223, 238}";
+			sepNavWindowFrame = "{{150, 111}, {918, 794}}";
+		};
+	};
+	ACE7781E0E20013F00F7C0C6 /* regexp_compiler.h */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 3080}}";
+			sepNavSelRange = "{0, 0}";
+			sepNavVisRange = "{2581, 895}";
+			sepNavWindowFrame = "{{38, 208}, {918, 794}}";
+		};
+	};
+	ACE778210E20013F00F7C0C6 /* state.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 4620}}";
+			sepNavSelRange = "{3717, 0}";
+			sepNavVisRange = "{3092, 1193}";
+			sepNavWindowFrame = "{{985, 182}, {918, 794}}";
+		};
+	};
+	ACE778250E20013F00F7C0C6 /* transducer.cc */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 8764}}";
+			sepNavSelRange = "{14104, 0}";
+			sepNavVisRange = "{13400, 1344}";
+			sepNavWindowFrame = "{{401, 234}, {918, 794}}";
+		};
+	};
+	ACE778260E20013F00F7C0C6 /* transducer.h */ = {
+		uiCtxt = {
+			sepNavIntBoundsRect = "{{0, 0}, {859, 3668}}";
+			sepNavSelRange = "{6357, 0}";
+			sepNavVisRange = "{73, 1171}";
+			sepNavWindowFrame = "{{153, 103}, {918, 794}}";
+		};
+	};
+	D2AAC0620554660B00DB518D /* lttoolbox */ = {
+		activeExec = 0;
+	};
+}
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttools_config.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttools_config.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/macosx/lttools_config.h	(revision 70339)
@@ -0,0 +1,123 @@
+/* lttoolbox/lttools_config.h.  Generated from lttools_config.h.in by configure.  */
+/* lttoolbox/lttools_config.h.in.  Generated from configure.ac by autoheader.  */
+
+/* Define to 1 if you have the declaration of `fgetc_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL_FGETC_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of `fputs_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL_FPUTS_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of `fputwc_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL_FPUTWC_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of `fputws_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL_FPUTWS_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of `fread_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL_FREAD_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of `fwrite_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL_FWRITE_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of ` fgetwc_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL___________________FGETWC_UNLOCKED 0
+
+/* Define to 1 if you have the declaration of `\ fputc_unlocked', and to 0 if
+   you don't. */
+#define HAVE_DECL____________________FPUTC_UNLOCKED 0
+
+/* Define to 1 if you have the <dlfcn.h> header file. */
+#define HAVE_DLFCN_H 1
+
+/* Define to 1 if you have the `getopt_long' function. */
+#define HAVE_GETOPT_LONG 1
+
+/* Define to 1 if you have the <inttypes.h> header file. */
+#define HAVE_INTTYPES_H 1
+
+/* Define to 1 if you have the `xml2' library (-lxml2). */
+#define HAVE_LIBXML2 1
+
+/* Define to 1 if your system has a GNU libc compatible `malloc' function, and
+   to 0 otherwise. */
+#define HAVE_MALLOC 1
+
+/* Define to 1 if you have the <memory.h> header file. */
+#define HAVE_MEMORY_H 1
+
+/* Define to 1 if your system has a GNU libc compatible `realloc' function,
+   and to 0 otherwise. */
+#define HAVE_REALLOC 1
+
+/* Define to 1 if you have the `setlocale' function. */
+#define HAVE_SETLOCALE 1
+
+/* Define to 1 if stdbool.h conforms to C99. */
+#define HAVE_STDBOOL_H 1
+
+/* Define to 1 if you have the <stddef.h> header file. */
+#define HAVE_STDDEF_H 1
+
+/* Define to 1 if you have the <stdint.h> header file. */
+#define HAVE_STDINT_H 1
+
+/* Define to 1 if you have the <stdlib.h> header file. */
+#define HAVE_STDLIB_H 1
+
+/* Define to 1 if you have the `strdup' function. */
+#define HAVE_STRDUP 1
+
+/* Define to 1 if you have the <strings.h> header file. */
+#define HAVE_STRINGS_H 1
+
+/* Define to 1 if you have the <string.h> header file. */
+#define HAVE_STRING_H 1
+
+/* Define to 1 if you have the <sys/stat.h> header file. */
+#define HAVE_SYS_STAT_H 1
+
+/* Define to 1 if you have the <sys/types.h> header file. */
+#define HAVE_SYS_TYPES_H 1
+
+/* Define to 1 if you have the <unistd.h> header file. */
+#define HAVE_UNISTD_H 1
+
+/* Define to 1 if the system has the type `_Bool'. */
+/* #undef HAVE__BOOL */
+
+/* Define to the address where bug reports for this package should be sent. */
+#define PACKAGE_BUGREPORT "sortiz@users.sourceforge.net"
+
+/* Define to the full name of this package. */
+#define PACKAGE_NAME "lttoolbox/lttoolbox.h"
+
+/* Define to the full name and version of this package. */
+#define PACKAGE_STRING "lttoolbox/lttoolbox.h 3.0.4"
+
+/* Define to the one symbol short name of this package. */
+#define PACKAGE_TARNAME "lttoolbox-lttoolbox-h"
+
+/* Define to the version of this package. */
+#define PACKAGE_VERSION "3.0.4"
+
+/* Define to 1 if you have the ANSI C header files. */
+#define STDC_HEADERS 1
+
+/* Define to empty if `const' does not conform to ANSI C. */
+/* #undef const */
+
+/* Define to rpl_malloc if the replacement function should be used. */
+/* #undef malloc */
+
+/* Define to rpl_realloc if the replacement function should be used. */
+/* #undef realloc */
+
+/* Define to `unsigned int' if <sys/types.h> does not define. */
+/* #undef size_t */
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/acx.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/acx.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox/acx.rng	(revision 70339)
@@ -0,0 +1,21 @@
+<?xml version="1.0"?>
+<element name="analysis-chars" xmlns="http://relaxng.org/ns/structure/1.0" datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes">
+  <oneOrMore>
+    <element name="char">
+      <attribute name="value">
+        <data type="token">
+          <param name="length">1</param>
+        </data>
+      </attribute>
+      <oneOrMore>
+        <element name="equiv-char">
+          <attribute name="value">
+            <data type="token">
+              <param name="length">1</param>
+            </data>
+          </attribute>
+        </element>
+      </oneOrMore>
+    </element>
+  </oneOrMore>
+</element>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox
___________________________________________________________________
Added: svn:ignore
## -0,0 +1,28 ##
+*.bin
+*.cache
+*.in
+*.log
+*.mode
+*.status
+*.hfst
+*.ol
+.deps
+INSTALL
+Makefile
+Makefile.in
+aclocal.m4
+config
+configure
+install-sh
+missing
+modes
+stamp-h1
+*.h
+lt-tmxcomp
+lt-proc
+lt-tmxproc
+lt-comp
+lt-expand
+TAGS
+lt-print
+lt-trim
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/proctest.py
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/proctest.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/proctest.py	(revision 70339)
@@ -0,0 +1,84 @@
+# -*- coding: utf-8 -*-
+
+import itertools
+from subprocess import Popen, PIPE, call
+from tempfile import mkdtemp
+from shutil import rmtree
+
+import signal
+class Alarm(Exception):
+    pass
+
+class ProcTest():
+    """See lt_proc test for how to use this. Override runTest if you don't
+    want to use NUL flushing."""
+    
+    procdix = "data/minimal-mono.dix"
+    procdir = "lr"
+    procflags = ["-z"]
+    inputs = itertools.repeat("")
+    expectedOutputs = itertools.repeat("")
+    expectedRetCodeFail = False
+
+    def alarmHandler(self, signum, frame):
+        raise Alarm
+
+    def withTimeout(self, seconds, cmd, *args, **kwds):
+        signal.signal(signal.SIGALRM, self.alarmHandler)
+        signal.alarm(seconds)
+        ret = cmd(*args, **kwds)
+        signal.alarm(0)         # reset the alarm
+        return ret
+
+    def communicateFlush(self, string):
+        self.proc.stdin.write(string.encode('utf-8'))
+        self.proc.stdin.write(b'\0')
+        self.proc.stdin.flush()
+
+        output = []
+        char = None
+        try:
+            char = self.withTimeout(2, self.proc.stdout.read, 1)
+        except Alarm:
+            pass
+        while char and char != b'\0':
+            output.append(char)
+            try:
+                char = self.withTimeout(2, self.proc.stdout.read, 1)
+            except Alarm:
+                break           # send what we got up till now
+
+        return b"".join(output).decode('utf-8')
+
+    def compileTest(self, tmpd):
+        self.assertEqual(0, call(["../lttoolbox/lt-comp",
+                                  self.procdir,
+                                  self.procdix,
+                                  tmpd+"/compiled.bin"],
+                                 stdout=PIPE))
+
+    def runTest(self):
+        tmpd = mkdtemp()
+        try:
+            self.compileTest(tmpd)
+            self.proc = Popen(["../lttoolbox/lt-proc"] + self.procflags + [tmpd+"/compiled.bin"],
+                              stdin=PIPE,
+                              stdout=PIPE,
+                              stderr=PIPE)
+
+            for inp, exp in zip(self.inputs, self.expectedOutputs):
+                self.assertEqual(self.communicateFlush(inp+"[][\n]"),
+                                 exp+"[][\n]")
+
+            self.proc.communicate() # let it terminate
+            self.proc.stdin.close()
+            self.proc.stdout.close()
+            self.proc.stderr.close()
+            retCode = self.proc.poll()
+            if self.expectedRetCodeFail:
+                self.assertNotEqual(retCode, 0)
+            else:
+                self.assertEqual(retCode, 0)
+
+        finally:
+            rmtree(tmpd)
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/alphabetic-after-group-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/alphabetic-after-group-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/alphabetic-after-group-bi.dix	(revision 70339)
@@ -0,0 +1,22 @@
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="Y" />
+    <sdef n="inf"  />
+    <sdef n="X" />
+    <sdef n="n" />
+  </sdefs>
+
+  <pardefs>
+    <pardef n="apar">
+<e>       <p><l><s n="inf"/><s n="Y"/></l>    <r><s n="inf"/></r></p></e>
+<e>       <p><l><s n="X"/></l>                <r><s n="X"/></r></p> <p><l>TAIL</l><r></r></p></e>
+    </pardef>
+</pardefs>
+
+  <section id="main" type="standard">
+<e>         <p><l>a<g><b/></g></l>	<r>te</r></p><par n="apar"/></e>
+<e>       <p><l>include<s n="n"/></l>   <r>meh<s n="n"/></r></p> </e>
+  </section>
+</dictionary>
+
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/alphabetic-after-group-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/alphabetic-after-group-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/alphabetic-after-group-mono.dix	(revision 70339)
@@ -0,0 +1,18 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+ <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzÀÁÂÄÅÆÇÈÉÊËÌÍÎÏÑÒÓÔÖØÙÚÛÜàáâäåæçèéêëìíîïñòóôöøùúûüŠš</alphabet>
+ <sdefs>
+   <sdef n="inf"      />
+   <sdef n="unmatched"/>
+   <sdef n="n"/>
+
+   <sdef n="compound-only-L" c="compound-only-L"/>
+   <sdef n="compound-R"      c="compound-R"/>
+ </sdefs>
+
+ <section id="main" type="standard">
+<e>       <p><l>as</l>   <r>a<s n="inf"/><s n="unmatched"/></r></p> <p><l></l><r><g><b/></g></r></p></e>
+<e>       <p><l>include</l>   <r>include<s n="n"/></r></p> </e>
+ </section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/biproc-skips-tags-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/biproc-skips-tags-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/biproc-skips-tags-mono.dix	(revision 70339)
@@ -0,0 +1,14 @@
+<dictionary>
+  <sdefs>
+    <sdef n="KEPT"/>
+    <sdef n="STILLMATCHING"/>
+    <sdef n="MATCHSOFAR"/>
+    <sdef n="NONMATCHL"/>
+    <sdef n="NONMATCHR"/>
+  </sdefs>
+
+  <section id="main" type="standard">
+<e><p><l>vihki<s n="KEPT"/><s n="MATCHSOFAR"/><s n="STILLMATCHING"/><s n="NONMATCHL"/></l><r>vihki<s n="KEPT"/><s n="MATCHSOFAR"/><s n="STILLMATCHING"/><s n="NONMATCHR"/></r></p></e>
+<e><p><l>vihki<s n="KEPT"/></l><r>vihki<s n="KEPT"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/double-clitics-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/double-clitics-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/double-clitics-bi.dix	(revision 70339)
@@ -0,0 +1,16 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="prn" />
+    <sdef n="vblex" />
+  </sdefs>
+
+
+  <section id="main" type="standard">
+<e>       <p><l>a<g><b/>d<s n="vblex"/></g></l><r>A<s n="vblex"/></r></p></e>
+<e>       <p><l>b<s n="prn"/></l><r>B<s n="prn"/></r></p></e>
+<e>       <p><l>c<s n="prn"/></l><r>C<s n="prn"/></r></p></e>
+<e>       <p><l>x<s n="vblex"/></l><r>X<s n="vblex"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/double-clitics-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/double-clitics-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/double-clitics-mono.dix	(revision 70339)
@@ -0,0 +1,24 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠčČðđÐ</alphabet>
+        <sdefs>
+          <sdef n="vblex"/>
+          <sdef n="pp"/>
+          <sdef n="prn" />
+          <sdef n="ger" />
+          <sdef n="inf" />
+          <sdef n="enc" />
+	</sdefs>
+	<pardefs>
+<pardef n="__vblex">
+ <e>  <p><l>-b-c</l>  <r><s n="vblex"/><s n="ger"/><j/>b<s n="prn"/><s n="enc"/><j/>c<s n="prn"/><s n="enc"/></r></p></e>
+ <e>  <p><l></l>      <r><s n="vblex"/><s n="inf"/></r></p></e>
+</pardef>
+	</pardefs>
+
+<section id="main" type="standard">
+ <e><i>a</i><par n="__vblex"/> <p><l><b/>d</l><r><g><b/>d</g></r></p></e>
+ <e><i>x</i><par n="__vblex"/></e>
+ <e><i>y</i><par n="__vblex"/></e>
+</section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidix-epsilons-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidix-epsilons-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidix-epsilons-bi.dix	(revision 70339)
@@ -0,0 +1,22 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="n" />
+    <sdef n="vblex" />
+    <sdef n="f" />
+    <sdef n="m" />
+  </sdefs>
+
+  <pardefs>
+    <pardef n="__n">
+<e>       <p><l></l>                     <r><s n="n"/><s n="m"/></r></p></e>
+    </pardef>
+  </pardefs>
+
+  <section id="main" type="standard">
+<e>       <p><l>aa<s n="vblex"/></l><r>aa<s n="vblex"/></r></p></e>
+<e>       <p><l>aa<s n="n"/><s n="f"/></l><r>aa</r></p><par n="__n"/></e>
+<e>       <p><l>ba<s n="n"/><s n="f"/></l><r>ba</r></p><par n="__n"/></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidix-epsilons-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidix-epsilons-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidix-epsilons-mono.dix	(revision 70339)
@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠčČðđÐ</alphabet>
+	<sdefs>
+		<sdef n="vblex" 	c="Verb"/>
+		<sdef n="pp" 	c="pp"/>
+	</sdefs>
+	<pardefs>
+<pardef n="DONT_REMOVE_bug_was_dependent_on_transition_order">
+  <e>                    <p><l>b</l> <r>b</r></p></e>
+</pardef>
+<pardef n="__vblex">
+  <e>       <p><l>a</l>         <r>a<s n="vblex"/><s n="pp"/></r></p></e>
+</pardef>
+	</pardefs>
+
+<section id="main" type="standard">
+  <e><i>a</i><par n="__vblex"/></e>
+  <e><i>b</i><par n="__vblex"/></e>
+</section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/final-epsilons-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/final-epsilons-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/final-epsilons-bi.dix	(revision 70339)
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="n"/>
+  </sdefs>
+
+  <section id="main" type="standard">
+    <e>   <p><l>e<g>a</g><s n="n"/></l> <r>x<s n="n"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/final-epsilons-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/final-epsilons-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/final-epsilons-mono.dix	(revision 70339)
@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠ</alphabet>
+  <sdefs>
+    <sdef n="n"/>
+  </sdefs>
+
+  <section id="main" type="standard">
+    <e>   <p><l>e</l>    <r>e<s n="n"/></r></p></e>
+    <e>   <p><l>e</l>    <r>e<s n="n"/></r></p><p><l>a</l><r><g>a</g></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/left-unbalanced-epsilons-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/left-unbalanced-epsilons-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/left-unbalanced-epsilons-bi.dix	(revision 70339)
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="adv"     c="Adverb"/>
+  </sdefs>
+  <section id="main" type="standard">
+    <e>       <p><l>ab<s n="adv"/></l><r>a<s n="adv"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/left-unbalanced-epsilons-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/left-unbalanced-epsilons-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/left-unbalanced-epsilons-mono.dix	(revision 70339)
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠčČðđÐ</alphabet>
+  <sdefs>
+    <sdef n="adv" 	c="Adverb"/>
+  </sdefs>
+  <section id="main" type="standard">
+    <e>       <p><l>a</l><r>a<s n="adv"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/diverging-paths-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/diverging-paths-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/diverging-paths-bi.dix	(revision 70339)
@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="vblex"   c="Verb"/>
+    <sdef n="adj"     c="Adjective"/>
+  </sdefs>
+
+  <section id="main" type="standard">
+    <e>       <p><l>x<s n="adj"/></l>    <r>x<s n="adj"/></r></p></e>
+    <e>       <p><l>ya<s n="vblex"/></l>  <r>ya<s n="vblex"/></r></p></e>
+  </section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/diverging-paths-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/diverging-paths-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/diverging-paths-mono.dix	(revision 70339)
@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠčČðđÐ</alphabet>
+  <sdefs>
+    <sdef n="vblex" 	c="Verb"/>
+    <sdef n="inf" 	c="Infinitive"/>
+  </sdefs>
+  <section id="main" type="standard">
+    <e>         <p><l>xa</l><r>xa<s n="vblex"/></r></p></e> <!-- should not be included! -->
+    <e>         <p><l>ya</l><r>ya<s n="vblex"/></r></p></e> <!-- should be included!-->
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/merging-paths-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/merging-paths-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/merging-paths-bi.dix	(revision 70339)
@@ -0,0 +1,15 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="det"     c="Determiner"/>
+    <sdef n="f"       c="Feminine"/>
+    <sdef n="m"       c="Masculine"/>
+    <sdef n="qnt"     c="Quantifier"/>
+    <sdef n="GD"      c="Gender to be determined"/>
+  </sdefs>
+  <section id="main" type="standard">
+    <e><p><l>ein<s n="det"/><s n="qnt"/><s n="GD"/></l><r>en<s n="det"/><s n="qnt"/><s n="m"/></r></p></e>
+    <e><p><l>ein<s n="det"/><s n="qnt"/><s n="f"/></l><r>en<s n="det"/><s n="qnt"/><s n="f"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/merging-paths-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/merging-paths-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/merging-paths-mono.dix	(revision 70339)
@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠčČðđÐ</alphabet>
+  <sdefs>
+    <sdef n="det" 	c="Determiner"/>
+    <sdef n="f" 	c="Feminine"/>
+    <sdef n="m" 	c="Masculine"/>
+    <sdef n="sg" 	c="Singular"/>
+    <sdef n="qnt" 	c="Quantifier"/>
+  </sdefs>
+  <pardefs>
+    <pardef n="e/n__num">
+      <e>       <p><l>n</l>          <r>n<s n="det"/><s n="qnt"/><s n="m"/><s n="sg"/></r></p></e>
+      <e>       <p><l>i</l>          <r>n<s n="det"/><s n="qnt"/><s n="f"/><s n="sg"/></r></p></e>
+    </pardef>
+  </pardefs>
+  <section id="main" type="standard">
+    <e lm="en">              <i>e</i><par n="e/n__num"/></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/group-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/group-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/group-bi.dix	(revision 70339)
@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="n"/>
+    <sdef n="f"/>
+  </sdefs>
+  <pardefs>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <!-- These are in monodix: -->
+    <e><p><l>ab<g>c</g><s n="n"/></l> <r>feh<s n="n"/></r></p></e>
+    <e><p><l>pq<s n="n"/></l>         <r>feh<s n="n"/></r></p></e>
+    <e><p><l>pq<g>r</g><s n="n"/></l> <r>feh<s n="n"/></r></p></e>
+
+    <e><p><l>j<g>l</g><s n="n"/></l>  <r>feh</r></p></e>
+    <e><p><l>k<s n="n"/></l>        <r>feh</r></p></e>
+
+    <e><p><l>de<g>f</g><s n="n"/><s n="f"/></l><r>verylongword<s n="n"/></r></p></e>
+
+    <!-- These are not in monodix: -->
+    <e><p><l>pq<g>n</g><s n="n"/></l> <r>feh<s n="n"/></r></p></e>
+    <e><p><l>xy<s n="n"/></l>         <r>feh<s n="n"/></r></p></e>
+  </section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/group-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/group-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/group-mono.dix	(revision 70339)
@@ -0,0 +1,32 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+  <sdefs>
+    <sdef n="n"/>
+    <sdef n="ind"/>
+    <sdef n="f"/>
+    <sdef n="pl"/>
+    <sdef n="sg"/>
+  </sdefs>
+  <pardefs>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <!-- Should be included: -->
+    <e><p><l>abc</l> <r>ab<s n="n"/><s n="ind"/><g>c</g></r></p></e>
+    <e><p><l>pq</l>  <r>pq<s n="n"/><s n="ind"/></r></p></e>
+    <e><p><l>pqr</l> <r>pq<s n="n"/><s n="ind"/><g>r</g></r></p></e>
+
+    <e><p><l>jkl</l> <r>j<s n="n"/><s n="ind"/><j/>k<s n="n"/><s n="ind"/><g>l</g></r></p></e>
+
+    <e><p><l>def</l><r>de<s n="n"/><s n="f"/><s n="sg"/><g>f</g></r></p></e>
+
+    <!-- Should not be included: -->
+    <e><p><l>pqs</l> <r>pq<s n="n"/><s n="ind"/><g>s</g></r></p></e>
+    <e><p><l>xyz</l> <r>xy<s n="n"/><s n="ind"/><g>z</g></r></p></e>
+
+    <e><p><l>jkm</l> <r>j<s n="n"/><s n="ind"/><j/>k<s n="n"/><s n="ind"/><g>m</g></r></p></e>
+    <e><p><l>jnl</l> <r>j<s n="n"/><s n="ind"/><j/>n<s n="n"/><s n="ind"/><g>l</g></r></p></e>
+  </section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/empty-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/empty-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/empty-bi.dix	(revision 70339)
@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="n" 	c="Noun"/>
+  </sdefs>
+  <pardefs>
+  </pardefs>
+  <section id="main" type="standard">
+    <e><p><l>b</l><r>b<s n="n"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/empty-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/empty-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/empty-mono.dix	(revision 70339)
@@ -0,0 +1,12 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+  <sdefs>
+    <sdef n="n" 	c="Noun"/>
+  </sdefs>
+  <pardefs>
+  </pardefs>
+  <section id="main" type="standard">
+    <e><p><l>a</l><r>a<s n="n"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/unbalanced-epsilons-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/unbalanced-epsilons-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/unbalanced-epsilons-bi.dix	(revision 70339)
@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+  <sdefs>
+    <sdef n="vblex"   c="Verb"/>
+  </sdefs>
+
+  <pardefs>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <e>
+      <p><l>abcdefghijklmnopqrstuvwxyz</l><r>re</r></p>
+      <p><l><s n="vblex"/></l><r><s n="vblex"/></r></p>
+    </e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/unbalanced-epsilons-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/unbalanced-epsilons-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/unbalanced-epsilons-mono.dix	(revision 70339)
@@ -0,0 +1,19 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÆØÅabcdefghijklmnopqrstuvwxyzæøåcqwxzCQWXZéèêóòâôÉÊÈÓÔÒÂáàÁÀäÄöÖšŠčČðđÐ</alphabet>
+  <sdefs>
+    <sdef n="vblex" 	c="Verb"/>
+    <sdef n="inf" 	c="Infinitive"/>
+    <sdef n="pres" 	c="Present"/>
+    <sdef n="pret" 	c="Preterite"/>
+  </sdefs>
+  <pardefs>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <e>       <i>r</i><p><l>e</l>         <r>e<s n="vblex"/><s n="inf"/></r></p></e>
+    <e>       <i>r</i><p><l>er</l>        <r>e<s n="vblex"/><s n="pres"/></r></p></e>
+    <e>       <i>r</i><p><l>es</l>        <r>e<s n="vblex"/><s n="pres"/></r></p></e>
+    <e>       <i>r</i><p><l>et</l>        <r>e<s n="vblex"/><s n="pret"/></r></p></e>
+  </section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidixpardef-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidixpardef-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidixpardef-bi.dix	(revision 70339)
@@ -0,0 +1,15 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+  <sdefs>
+    <sdef n="vblex"   c="Verb"/>
+  </sdefs>
+<pardefs>
+<pardef n="vblex">
+<e>       <p><l><s n="vblex"/></l><r><s n="vblex"/></r></p></e>
+    </pardef>
+</pardefs>
+<section id="main" type="standard">
+  <e>       <p><l>ab</l><r>c</r></p><par n="vblex"/></e>
+</section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidixpardef-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidixpardef-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/bidixpardef-mono.dix	(revision 70339)
@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+		<sdef n="vblex" c="Verb"/>
+		<sdef n="inf" 	c="Infinitive"/>
+	</sdefs>
+<pardefs>
+</pardefs>
+<section id="main" type="standard">
+  <e>       <p><l>c</l>       <r>c<s n="vblex"/><s n="inf"/></r></p></e>
+</section>
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/longleft-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/longleft-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/longleft-bi.dix	(revision 70339)
@@ -0,0 +1,15 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+	  <sdef n="adj"/>
+	  <sdef n="pprs"/>
+        </sdefs>
+<pardefs>
+</pardefs>
+
+<section id="main" type="standard">
+<e>       <p><l>herde<s n="adj"/><s n="pprs"/></l><r>herde<s n="adj"/><s n="pprs"/></r></p></e>
+</section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/longleft-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/longleft-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/longleft-mono.dix	(revision 70339)
@@ -0,0 +1,15 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+	  <sdef n="adj"/>
+	  <sdef n="pprs"/>
+        </sdefs>
+<pardefs>
+</pardefs>
+
+<section id="main" type="standard">
+    <e><p><l>herdende</l>      <r>herde<s n="adj"/><s n="pprs"/></r></p></e>
+</section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/cmp-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/cmp-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/cmp-bi.dix	(revision 70339)
@@ -0,0 +1,21 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+	  <sdef n="n"/>
+	  <sdef n="pr"/>
+	  <sdef n="compound-only-L"/>
+	  <sdef n="compound-R"/>
+        </sdefs>
+<pardefs>
+
+</pardefs>
+
+<section id="cmp" type="standard">
+  <e><p><l>a<s n="n"/></l><r>a<s n="n"/></r></p></e>
+  <e><p><l>b<s n="n"/></l><r>b<s n="n"/></r></p></e>
+  <e><p><l>c<s n="n"/></l><r>d<s n="n"/></r></p></e>
+  <e><p><l>d<s n="n"/></l><r>d<s n="n"/></r></p></e>
+</section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/cmp-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/cmp-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/cmp-mono.dix	(revision 70339)
@@ -0,0 +1,28 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+	  <sdef n="n"/>
+	  <sdef n="pr"/>
+	  <sdef n="compound-only-L"/>
+	  <sdef n="compound-R"/>
+        </sdefs>
+<pardefs>
+
+</pardefs>
+
+<section id="cmp" type="standard">
+  <e><p><l>a</l><r>a<s n="n"/><s n="compound-only-L"/></r></p></e>
+  <e><p><l>b</l><r>b<s n="n"/><s n="compound-R"/></r></p></e>
+
+  <e><p><l>c</l><r>d<s n="compound-only-L"/><s n="n"/></r></p></e>
+  <e><p><l>d</l><r>d<s n="compound-R"/><s n="n"/></r></p></e>
+
+  <e><p><l>a</l><r>a<s n="pr"/><s n="compound-only-L"/></r></p></e>
+  <e><p><l>b</l><r>b<s n="pr"/><s n="compound-R"/></r></p></e>
+
+  <e><p><l>c</l><r>d<s n="compound-only-L"/><s n="pr"/></r></p></e>
+  <e><p><l>d</l><r>d<s n="compound-R"/><s n="pr"/></r></p></e>
+</section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/minimal-mono.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/minimal-mono.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/minimal-mono.dix	(revision 70339)
@@ -0,0 +1,29 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+	  <sdef n="n"/>
+	  <sdef n="vblex"/>
+	  <sdef n="m"/>
+	  <sdef n="pr"/>
+	  <sdef n="def"/>
+	  <sdef n="ind"/>
+        </sdefs>
+<pardefs>
+
+</pardefs>
+
+<section id="main" type="standard">
+  <e><p><l>abc</l><r>ab<s n="n"/><s n="def"/></r></p></e>
+  <e><p><l>ab</l><r>ab<s n="n"/><s n="ind"/></r></p></e>
+  <e><p><l>y</l><r>y<s n="n"/><s n="ind"/></r></p></e>
+  <e><p><l>n</l><r>n<s n="n"/><s n="ind"/></r></p></e>
+</section>
+
+<section id="j" type="standard">
+  <e><p><l>jg</l><r>j<s n="pr"/><j/>g<s n="n"/></r></p></e>
+  <e><p><l>jh</l><r>j<s n="pr"/><j/>h<s n="n"/></r></p></e>
+  <e><p><l>kg</l><r>k<s n="pr"/><j/>g<s n="n"/></r></p></e>
+</section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/minimal-bi.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/minimal-bi.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/data/minimal-bi.dix	(revision 70339)
@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+	<alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZÀÁÂÄÅÆÇÈÉÊËÍÑÒÓÔÕÖØÙÚÜČĐŊŠŦŽabcdefghijklmnopqrstuvwxyzàáâäåæçèéêëíñòóôõöøùúüčđŋšŧž­-</alphabet>
+	<sdefs>
+	  <sdef n="n"/>
+	  <sdef n="pr"/>
+	  <sdef n="vblex"/>
+        </sdefs>
+<pardefs>
+
+</pardefs>
+
+<section id="main" type="standard">
+  <e><p><l>ab<s n="n"/></l><r>xy<s n="n"/></r></p></e>
+  <e><p><l>y<s n="n"/></l><r>z<s n="n"/></r></p></e>
+</section>
+
+<section id="j" type="standard">
+  <e><p><l>j<s n="pr"/></l><r>j<s n="pr"/></r></p></e>
+  <e><p><l>g<s n="n"/></l><r>g<s n="n"/></r></p></e>
+</section>
+
+</dictionary>
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_trim/__init__.py
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_trim/__init__.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_trim/__init__.py	(revision 70339)
@@ -0,0 +1,163 @@
+# -*- coding: utf-8 -*-
+from __future__ import unicode_literals
+
+# If you have HFST installed, you can diff lttoolbox binaries like this:
+# $ lt-print full.bin | sed 's/ /@_SPACE_@/g' | hfst-txt2fst -e ε | hfst-fst2strings -c1 > full.strings 
+# $ lt-print trim.bin | sed 's/ /@_SPACE_@/g' | hfst-txt2fst -e ε | hfst-fst2strings -c1 > trim.strings 
+# $ diff -y full.strings trim.strings | less
+# This is similar to diffing the lt-expand of uncompiled XML dictionaries.
+# See also `man hfst-fst2strings'.
+
+from proctest import ProcTest
+import unittest
+
+from subprocess import Popen, PIPE, call
+from tempfile import mkdtemp
+from shutil import rmtree
+
+class TrimProcTest(ProcTest):
+    monodix = "data/minimal-mono.dix"
+    monodir = "lr"
+    bidix = "data/minimal-bi.dix"
+    bidir = "lr"
+    procflags = ["-z"]
+
+    def compileTest(self, tmpd):
+        self.assertEqual(0, call(["../lttoolbox/lt-comp",
+                                  self.monodir,
+                                  self.monodix,
+                                  tmpd+"/mono.bin"],
+                                 stdout=PIPE))
+        self.assertEqual(0, call(["../lttoolbox/lt-comp",
+                                  self.bidir,
+                                  self.bidix,
+                                  tmpd+"/bi.bin"],
+                                 stdout=PIPE))
+        self.assertEqual(0, call(["../lttoolbox/lt-trim",
+                                  tmpd+"/mono.bin",
+                                  tmpd+"/bi.bin",
+                                  tmpd+"/compiled.bin"],
+                                 stdout=PIPE))
+
+
+class TrimNormalAndJoin(unittest.TestCase, TrimProcTest):
+    inputs = ["abc", "ab", "y", "n", "jg", "jh", "kg"]
+    expectedOutputs = ["^abc/ab<n><def>$", "^ab/ab<n><ind>$", "^y/y<n><ind>$", "^n/*n$", "^jg/j<pr>+g<n>$", "^jh/*jh$", "^kg/*kg$"]
+
+class TrimCmp(unittest.TestCase, TrimProcTest):
+    inputs = ["a", "b", "c", "d", "aa", "ab", "ac", "ad", "ba", "bb", "bc", "bd", "ca", "cb", "cc", "cd", "da", "db", "dc", "dd", ]
+    expectedOutputs = ["^a/*a$", "^b/b<n>$", "^c/*c$", "^d/d<n>$", "^aa/*aa$", "^ab/a<n>+b<n>$", "^ac/*ac$", "^ad/a<n>+d<n>$", "^ba/*ba$", "^bb/*bb$", "^bc/*bc$", "^bd/*bd$", "^ca/*ca$", "^cb/d<n>+b<n>$", "^cc/*cc$", "^cd/d<n>+d<n>$", "^da/*da$", "^db/*db$", "^dc/*dc$", "^dd/*dd$"]
+    monodix = "data/cmp-mono.dix"
+    bidix = "data/cmp-bi.dix"
+    procflags = ["-e", "-z"]
+
+class TrimLongleft(unittest.TestCase, TrimProcTest):
+    inputs = ["herdende"]
+    expectedOutputs = ["^herdende/herde<adj><pprs>$"]
+    monodix = "data/longleft-mono.dix"
+    bidix = "data/longleft-bi.dix"
+
+class DivergingPaths(unittest.TestCase, TrimProcTest):
+    inputs = ["xa ya"]
+    expectedOutputs = ["^xa/*xa$ ^ya/ya<vblex>$"]
+    monodix = "data/diverging-paths-mono.dix"
+    bidix = "data/diverging-paths-bi.dix"
+
+class MergingPaths(unittest.TestCase, TrimProcTest):
+    inputs = ["en ei"]
+    expectedOutputs = ["^en/en<det><qnt><m><sg>$ ^ei/en<det><qnt><f><sg>$"]
+    monodix = "data/merging-paths-mono.dix"
+    bidir = "rl"
+    bidix = "data/merging-paths-bi.dix"
+
+class BidixPardef(unittest.TestCase, TrimProcTest):
+    inputs = ["c"]
+    expectedOutputs = ["^c/c<vblex><inf>$"]
+    monodix = "data/bidixpardef-mono.dix"
+    bidir = "rl"
+    bidix = "data/bidixpardef-bi.dix"
+
+class UnbalancedEpsilons(unittest.TestCase, TrimProcTest):
+    inputs = ["re", "rer", "res", "ret"]
+    expectedOutputs = ["^re/re<vblex><inf>$", "^rer/re<vblex><pres>$", "^res/re<vblex><pres>$", "^ret/re<vblex><pret>$"]
+    monodix = "data/unbalanced-epsilons-mono.dix"
+    bidir = "rl"
+    bidix = "data/unbalanced-epsilons-bi.dix"
+
+class LeftUnbalancedEpsilons(unittest.TestCase, TrimProcTest):
+    inputs = ["a"]
+    expectedOutputs = ["^a/a<adv>$"]
+    monodix = "data/left-unbalanced-epsilons-mono.dix"
+    bidir = "rl"
+    bidix = "data/left-unbalanced-epsilons-bi.dix"
+
+class Group(unittest.TestCase, TrimProcTest):
+    inputs = ["abc", "pq", "pqr", "pqs", "xyz"]
+    expectedOutputs = ["^abc/ab<n><ind>#c$", "^pq/pq<n><ind>$", "^pqr/pq<n><ind>#r$", "^pqs/*pqs$", "^xyz/*xyz$"]
+    monodix = "data/group-mono.dix"
+    bidix = "data/group-bi.dix"
+
+class GroupUnbalancedEpsilons(unittest.TestCase, TrimProcTest):
+    inputs = ["def"]
+    expectedOutputs = ["^def/de<n><f><sg>#f$"]
+    monodix = "data/group-mono.dix"
+    bidix = "data/group-bi.dix"
+
+class BothJoinAndGroup(unittest.TestCase, TrimProcTest):
+    inputs = ["jkl", "jkm", "jnl"]
+    expectedOutputs = ["^jkl/j<n><ind>+k<n><ind>#l$", "^jkm/*jkm$", "^jnl/*jnl$"]
+    monodix = "data/group-mono.dix"
+    bidix = "data/group-bi.dix"
+
+
+class FinalEpsilons(unittest.TestCase, TrimProcTest):
+    inputs = ["ea"]
+    expectedOutputs = ["^ea/e<n>#a$"]
+    monodix = "data/final-epsilons-mono.dix"
+    bidix = "data/final-epsilons-bi.dix"
+
+class BidixEpsilons(unittest.TestCase, TrimProcTest):
+    inputs = ["aa ba"]
+    expectedOutputs = ["^aa/aa<vblex><pp>$ ^ba/*ba$"]
+    monodix = "data/bidix-epsilons-mono.dix"
+    bidix = "data/bidix-epsilons-bi.dix"
+    bidir = "rl"
+
+class AlphabeticAfterGroup(unittest.TestCase, TrimProcTest):
+    inputs = ["as"]
+    expectedOutputs = ["^as/*as$"]
+    monodix = "data/alphabetic-after-group-mono.dix"
+    bidix = "data/alphabetic-after-group-bi.dix"
+    bidir = "lr"
+
+class DoubleClitics(unittest.TestCase, TrimProcTest):
+    inputs = ["a-b-c d"]
+    expectedOutputs = ["^a-b-c d/a<vblex><ger>+b<prn><enc>+c<prn><enc># d$"]
+    monodix = "data/double-clitics-mono.dix"
+    bidix = "data/double-clitics-bi.dix"
+    bidir = "lr"
+
+
+class Empty(unittest.TestCase, TrimProcTest):
+    def runTest(self):
+        tmpd = mkdtemp()
+        try:
+            self.assertEqual(0, call(["../lttoolbox/lt-comp",
+                                      "lr",
+                                      "data/empty-mono.dix",
+                                      tmpd+"/empty-mono.bin"],
+                                     stdout=PIPE))
+            self.assertEqual(0, call(["../lttoolbox/lt-comp",
+                                      "rl", # rl!
+                                      "data/empty-bi.dix",
+                                      tmpd+"/empty-bi.bin"],
+                                     stdout=PIPE))
+            self.assertEqual(1, call(["../lttoolbox/lt-trim",
+                                      tmpd+"/empty-mono.bin",
+                                      tmpd+"/empty-bi.bin",
+                                      tmpd+"/empty-trimmed.bin"],
+                                     stdout=PIPE,
+                                     stderr=PIPE))
+
+        finally:
+            rmtree(tmpd)
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_proc/null_flush_invalid_stream_format.py
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_proc/null_flush_invalid_stream_format.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_proc/null_flush_invalid_stream_format.py	(revision 70339)
@@ -0,0 +1,42 @@
+# -*- coding: utf-8 -*-
+from __future__ import unicode_literals
+
+import sys
+import unittest
+from proctest import ProcTest
+
+# These tests are for invalid Apertium Stream format; lt-proc's output
+# for these seems system-dependent, so we can't use them as regression
+# tests (until that's fixed, if it's worth fixing).
+
+class NoSuperblankBeforeNUL(unittest.TestCase, ProcTest):
+    inputs = ["The dog gladly eats homework.",
+              "If wé swim fast enough,",
+              "we should reach shallow waters.",
+              "before;",
+              "the sharks;",
+              "come."]
+
+    expectedOutputs = ["^The/The<det><def><sp>$ ^dog/dog<n><sg>$ ^gladly/gladly<adv>$ ^eats/eat<vblex><pri><p3><sg>$ ^homework/homework<n><unc><sg>$",
+                       "^If/If<cnjadv>$ ^wé/*wé$ ^swim/swim<vblex><inf>/swim<vblex><pres>$ ^fast/fast<adj><sint>/fast<n><sg>$ ^enough/enough<adv>/enough<det><qnt><sp>$",
+                       "^we/prpers<prn><subj><p1><mf><pl>$ ^should/should<vaux><inf>$ ^reach/reach<vblex><inf>/reach<vblex><pres>$ ^shallow/shallow<adj><sint>$ ^waters/water<n><pl>$",
+                       "^before/before<adv>/before<cnjadv>/before<pr>$",
+                       "^the/the<det><def><sp>$ ^sharks/shark<n><pl>$",
+                       "^come/come<vblex><inf>/come<vblex><pres>/come<vblex><pp>$"]
+
+class WronglyEscapedLetter(unittest.TestCase, ProcTest):
+    inputs = ["before you g\\o to bed.[][\n]"]
+    expectedOutputs = ["^before/before<adv>/before<cnjadv>/before<pr>$ ^you/prpers<prn><subj><p2><mf><sp>/prpers<prn><obj><p2><mf><sp>$ "]
+    expectedRetCodeFail = True
+
+
+class UnescapedAngleBracket(unittest.TestCase, ProcTest):
+    inputs = ["Simon prefers dark chocolate>.[][\n]"]
+    expectedOutputs = ["^Simon/Simon<np><ant><m><sg>$ ^prefers/prefer<vblex><pri><p3><sg>$ ^dark/dark<adj><sint>/dark<n><sg>$ "]
+    expectedRetCodeFail = True
+
+class UnclosedSuperblank(unittest.TestCase, ProcTest):
+    inputs = ["you should always[ eat"]
+    #expectedOutputs = ["^you/prpers<prn><subj><p2><mf><sp>/prpers<prn><obj><p2><mf><sp>$ ^should/should<vaux><inf>$ "]
+    expectedOutputs = [""]
+    expectedRetCodeFail = True
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_proc/__init__.py
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_proc/__init__.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/lt_proc/__init__.py	(revision 70339)
@@ -0,0 +1,23 @@
+# -*- coding: utf-8 -*-
+from __future__ import unicode_literals
+
+import sys
+import unittest
+from proctest import ProcTest
+
+class ValidInput(unittest.TestCase, ProcTest):
+    inputs = ["ab",
+              "ABC jg",
+              "y n"]
+    expectedOutputs = ["^ab/ab<n><ind>$",
+                       "^ABC/AB<n><def>$ ^jg/j<pr>+g<n>$",
+                       "^y/y<n><ind>$ ^n/n<n><ind>$"]
+
+class BiprocSkipTags(unittest.TestCase, ProcTest):
+    procdix = "data/biproc-skips-tags-mono.dix"
+    procflags = ["-b", "-z"]
+    inputs = ["^vihki<KEPT><MATCHSOFAR><STILLMATCHING><SOMEHOWKEPT1><@SOMEHOWKEPT2>$"]
+    expectedOutputs = ["^vihki<KEPT><MATCHSOFAR><STILLMATCHING><SOMEHOWKEPT1><@SOMEHOWKEPT2>/vihki<KEPT><MATCHSOFAR><STILLMATCHING><SOMEHOWKEPT1><@SOMEHOWKEPT2>$"]
+
+# These fail on some systems:
+#from null_flush_invalid_stream_format import *
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/run_tests.py
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/run_tests.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/run_tests.py	(revision 70339)
@@ -0,0 +1,17 @@
+#!/usr/bin/env python2
+
+import sys
+import os
+sys.path.append(os.path.realpath("."))
+
+import unittest
+import lt_proc, lt_trim
+
+if __name__ == "__main__":
+    os.chdir(os.path.dirname(__file__))
+    failures = 0
+    for module in [lt_trim, lt_proc]:
+        suite = unittest.TestLoader().loadTestsFromModule(module)
+        res = unittest.TextTestRunner(verbosity = 2).run(suite)
+        failures += len(res.failures)
+    sys.exit(min(failures, 255))

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/tests/run_tests.py
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/tests/README
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/tests/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/tests/README	(revision 70339)
@@ -0,0 +1,7 @@
+Tests require python2, run like
+
+    python2 tests/run_tests.py
+
+You may have to do "(sudo) make install" once before running the tests.
+
+They should all pass.
Index: branches/weighted-transfer/tags/midterm/lttoolbox/NEWS
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/NEWS	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/NEWS	(revision 70339)
@@ -0,0 +1,61 @@
+
+===================
+ NEWS for lttoolbox
+===================
+
+SVN
+---
+
+
+Version 3.3.3, 2016-05-15 (-r68450)
+-----------------------------------
+
+* add .rnc files for validation (just converted from DTD's; DTD's are
+  still the source)
+
+* new match-state functions needed for apertium-transfer-tools
+
+* various distribution-related fixes
+
+Version 3.3.2, 2016-01-02 (-r64329)
+-----------------------------------
+
+* lt-proc -b no longer swallows tags on partial matches
+  https://sourceforge.net/p/apertium/tickets/82/
+
+* various distribution-related fixes, static analysis fixes; "make
+  test" should always pass now
+
+* lt-trim now supports multiple <j/> elements
+  https://sourceforge.net/p/apertium/tickets/83/
+
+
+Version 3.3.1, 2015-03-17 (-r61000)
+-----------------------------------
+
+* dix.xsd used for extra warnings on validation
+
+* minor bug fixes in lt-trim, lt-comp
+
+* new functions needed for pcre_version storing in apertium
+
+* tests run on "make test"
+
+* various distribution-related fixes, static analysis fixes,
+  documentation
+
+Version 3.3.0, 2014-08-20 (-r?)
+-----------------------------------
+
+# NEWS TODO
+
+Version 3.0.2, 2008-03-31 08:43:07 BST
+--------------------------------------
+
+# older NEWS TODO
+
+
+
+# Local Variables:
+# mode: markdown
+# End:
Index: branches/weighted-transfer/tags/midterm/lttoolbox/configure.ac
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/configure.ac	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/configure.ac	(revision 70339)
@@ -0,0 +1,128 @@
+#                                               -*- Autoconf -*-
+# Process this file with autoconf to produce a configure script.
+
+AC_PREREQ(2.52)
+
+m4_define([required_libxml_version], [2.6.17])
+
+AC_INIT([lttoolbox/lttoolbox.h], [3.3.3], [sortiz@users.sourceforge.net])
+AC_CONFIG_HEADER([lttoolbox/lttoolbox_config.h])
+
+AC_CANONICAL_SYSTEM
+
+GENERIC_LIBRARY_NAME=lttoolbox
+
+# Release versioning
+GENERIC_MAJOR_VERSION=3
+GENERIC_MINOR_VERSION=3
+GENERIC_MICRO_VERSION=3
+
+# API version (often = GENERIC_MAJOR_VERSION.GENERIC_MINOR_VERSION)
+GENERIC_API_VERSION=$GENERIC_MAJOR_VERSION.$GENERIC_MINOR_VERSION
+AC_SUBST(GENERIC_API_VERSION)
+AC_SUBST(GENERIC_MAJOR_VERSION)
+
+# Shared library versioning
+GENERIC_LIBRARY_VERSION=0:0:0
+#                       | | |
+#                +------+ | +---+
+#                |        |     |
+#             current:revision:age
+#                |        |     |
+#                |        |     +- increment if interfaces have been added
+#                |        |        set to zero if interfaces have been removed
+#                                  or changed
+#                |        +- increment if source code has changed
+#                |           set to zero if current is incremented
+#                +- increment if interfaces have been added, removed or changed
+
+AC_SUBST(GENERIC_LIBRARY_VERSION)
+PACKAGE=$GENERIC_LIBRARY_NAME
+AC_SUBST(GENERIC_LIBRARY_NAME)
+
+GENERIC_VERSION=$GENERIC_MAJOR_VERSION.$GENERIC_MINOR_VERSION.$GENERIC_MICRO_VERSION
+GENERIC_RELEASE=$GENERIC_MAJOR_VERSION.$GENERIC_MINOR_VERSION
+AC_SUBST(GENERIC_RELEASE)
+AC_SUBST(GENERIC_VERSION)
+
+VERSION=$GENERIC_VERSION
+
+AM_INIT_AUTOMAKE($PACKAGE, $VERSION, no-define)
+
+AC_CANONICAL_HOST
+AC_PROG_CXX
+AM_PROG_LIBTOOL
+AM_SANITY_CHECK
+AC_LANG_CPLUSPLUS
+
+CFLAGS="-Wall -Wextra $CFLAGS"
+CXXFLAGS="-Wall -Wextra $CXXFLAGS"
+
+AC_ARG_ENABLE(debug,
+              [  --enable-debug  Enable "-g -Wall" compiler options],
+              [CXXFLAGS="-g -Wall";CFLAGS="-g -Wall"])
+
+AC_ARG_ENABLE(profile,
+              [  --enable-profile  Enable "-pg -g -Wall" compiler options],
+              [CXXFLAGS="-pg -g -Wall"; CFLAGS="-pg -g -Wall"; LDFLAGS="-pg"])
+                            
+
+AC_PATH_PROG(PKG_CONFIG, pkg-config, no)
+if test x$ac_cv_path_PKG_CONFIG = x
+then
+  AC_MSG_ERROR([You don't have pkg-config installed])
+fi
+if test x$ac_cv_path_PKG_CONFIG = xno
+then
+  AC_MSG_ERROR([You don't have pkg-config installed])
+fi
+
+PKG_CHECK_MODULES(LTTOOLBOX, [libxml-2.0 >= required_libxml_version])
+
+# Check for wide strings
+AC_DEFUN([AC_CXX_WSTRING],[
+  AC_CACHE_CHECK(whether the compiler supports wide strings,
+  ac_cv_cxx_wstring,
+  [AC_LANG_SAVE
+   AC_LANG_CPLUSPLUS
+   AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include <string>]],[[
+std::wstring test = L"test";
+   ]])],
+   [ac_cv_cxx_wstring=yes], [ac_cv_cxx_wstring=no])
+   AC_LANG_RESTORE
+  ])
+])
+
+AC_CXX_WSTRING
+
+if test "$ac_cv_cxx_wstring" = no 
+then
+  AC_MSG_ERROR([Missing wide string support])
+fi
+
+
+# Checks for libraries.
+AC_CHECK_LIB(xml2, xmlReaderForFile)
+
+# Checks for header files.
+AC_HEADER_STDC
+AC_CHECK_HEADERS([stdlib.h string.h unistd.h stddef.h])
+
+# Checks for typedefs, structures, and compiler characteristics.
+AC_HEADER_STDBOOL
+AC_C_CONST
+AC_TYPE_SIZE_T
+
+# Checks for library functions.
+AC_FUNC_ERROR_AT_LINE
+
+AC_CHECK_DECLS([fread_unlocked, fwrite_unlocked, fgetc_unlocked, \
+fputc_unlocked, fputs_unlocked, fgetwc_unlocked, fputwc_unlocked, fputws_unlocked])
+                
+AC_CHECK_FUNCS([setlocale strdup getopt_long])
+
+AM_CONDITIONAL([WINDOWS], [test x$version_type = xwindows])
+
+AM_PATH_PYTHON([2], [], [AC_MSG_WARN([Can't run 'make test' without Python installed.])])
+
+AC_OUTPUT([Makefile lttoolbox.pc lttoolbox/Makefile])
Index: branches/weighted-transfer/tags/midterm/lttoolbox/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/Makefile.am	(revision 70339)
@@ -0,0 +1,11 @@
+SUBDIRS = $(GENERIC_LIBRARY_NAME)
+DIST_SUBDIRS = $(GENERIC_LIBRARY_NAME)
+
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = lttoolbox.pc
+
+EXTRA_DIST=autogen.sh CMakeLists.txt
+
+# TODO: the below will use python3 if you run it on Arch Linux with no python2 installed
+test: tests/run_tests.py
+	$(PYTHON) $<
Index: branches/weighted-transfer/tags/midterm/lttoolbox/COPYING
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/COPYING	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/COPYING	(revision 70339)
@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.
Index: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/checked.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/checked.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/checked.h	(revision 70339)
@@ -0,0 +1,327 @@
+// Copyright 2006 Nemanja Trifunovic
+
+/*
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+*/
+
+
+#ifndef UTF8_FOR_CPP_CHECKED_H_2675DCD0_9480_4c0c_B92A_CC14C027B731
+#define UTF8_FOR_CPP_CHECKED_H_2675DCD0_9480_4c0c_B92A_CC14C027B731
+
+#include "core.h"
+#include <stdexcept>
+
+namespace utf8
+{
+    // Base for the exceptions that may be thrown from the library
+    class exception : public ::std::exception {
+    };
+
+    // Exceptions that may be thrown from the library functions.
+    class invalid_code_point : public exception {
+        uint32_t cp;
+    public:
+        invalid_code_point(uint32_t cp) : cp(cp) {}
+        virtual const char* what() const throw() { return "Invalid code point"; }
+        uint32_t code_point() const {return cp;}
+    };
+
+    class invalid_utf8 : public exception {
+        uint8_t u8;
+    public:
+        invalid_utf8 (uint8_t u) : u8(u) {}
+        virtual const char* what() const throw() { return "Invalid UTF-8"; }
+        uint8_t utf8_octet() const {return u8;}
+    };
+
+    class invalid_utf16 : public exception {
+        uint16_t u16;
+    public:
+        invalid_utf16 (uint16_t u) : u16(u) {}
+        virtual const char* what() const throw() { return "Invalid UTF-16"; }
+        uint16_t utf16_word() const {return u16;}
+    };
+
+    class not_enough_room : public exception {
+    public:
+        virtual const char* what() const throw() { return "Not enough space"; }
+    };
+
+    /// The library API - functions intended to be called by the users
+
+    template <typename octet_iterator>
+    octet_iterator append(uint32_t cp, octet_iterator result)
+    {
+        if (!utf8::internal::is_code_point_valid(cp))
+            throw invalid_code_point(cp);
+
+        if (cp < 0x80)                        // one octet
+            *(result++) = static_cast<uint8_t>(cp);
+        else if (cp < 0x800) {                // two octets
+            *(result++) = static_cast<uint8_t>((cp >> 6)            | 0xc0);
+            *(result++) = static_cast<uint8_t>((cp & 0x3f)          | 0x80);
+        }
+        else if (cp < 0x10000) {              // three octets
+            *(result++) = static_cast<uint8_t>((cp >> 12)           | 0xe0);
+            *(result++) = static_cast<uint8_t>(((cp >> 6) & 0x3f)   | 0x80);
+            *(result++) = static_cast<uint8_t>((cp & 0x3f)          | 0x80);
+        }
+        else {                                // four octets
+            *(result++) = static_cast<uint8_t>((cp >> 18)           | 0xf0);
+            *(result++) = static_cast<uint8_t>(((cp >> 12) & 0x3f)  | 0x80);
+            *(result++) = static_cast<uint8_t>(((cp >> 6) & 0x3f)   | 0x80);
+            *(result++) = static_cast<uint8_t>((cp & 0x3f)          | 0x80);
+        }
+        return result;
+    }
+
+    template <typename octet_iterator, typename output_iterator>
+    output_iterator replace_invalid(octet_iterator start, octet_iterator end, output_iterator out, uint32_t replacement)
+    {
+        while (start != end) {
+            octet_iterator sequence_start = start;
+            internal::utf_error err_code = utf8::internal::validate_next(start, end);
+            switch (err_code) {
+                case internal::UTF8_OK :
+                    for (octet_iterator it = sequence_start; it != start; ++it)
+                        *out++ = *it;
+                    break;
+                case internal::NOT_ENOUGH_ROOM:
+                    throw not_enough_room();
+                case internal::INVALID_LEAD:
+                    out = utf8::append (replacement, out);
+                    ++start;
+                    break;
+                case internal::INCOMPLETE_SEQUENCE:
+                case internal::OVERLONG_SEQUENCE:
+                case internal::INVALID_CODE_POINT:
+                    out = utf8::append (replacement, out);
+                    ++start;
+                    // just one replacement mark for the sequence
+                    while (start != end && utf8::internal::is_trail(*start))
+                        ++start;
+                    break;
+            }
+        }
+        return out;
+    }
+
+    template <typename octet_iterator, typename output_iterator>
+    inline output_iterator replace_invalid(octet_iterator start, octet_iterator end, output_iterator out)
+    {
+        static const uint32_t replacement_marker = utf8::internal::mask16(0xfffd);
+        return utf8::replace_invalid(start, end, out, replacement_marker);
+    }
+
+    template <typename octet_iterator>
+    uint32_t next(octet_iterator& it, octet_iterator end)
+    {
+        uint32_t cp = 0;
+        internal::utf_error err_code = utf8::internal::validate_next(it, end, cp);
+        switch (err_code) {
+            case internal::UTF8_OK :
+                break;
+            case internal::NOT_ENOUGH_ROOM :
+                throw not_enough_room();
+            case internal::INVALID_LEAD :
+            case internal::INCOMPLETE_SEQUENCE :
+            case internal::OVERLONG_SEQUENCE :
+                throw invalid_utf8(*it);
+            case internal::INVALID_CODE_POINT :
+                throw invalid_code_point(cp);
+        }
+        return cp;
+    }
+
+    template <typename octet_iterator>
+    uint32_t peek_next(octet_iterator it, octet_iterator end)
+    {
+        return utf8::next(it, end);
+    }
+
+    template <typename octet_iterator>
+    uint32_t prior(octet_iterator& it, octet_iterator start)
+    {
+        // can't do much if it == start
+        if (it == start)
+            throw not_enough_room();
+
+        octet_iterator end = it;
+        // Go back until we hit either a lead octet or start
+        while (utf8::internal::is_trail(*(--it)))
+            if (it == start)
+                throw invalid_utf8(*it); // error - no lead byte in the sequence
+        return utf8::peek_next(it, end);
+    }
+
+    /// Deprecated in versions that include "prior"
+    template <typename octet_iterator>
+    uint32_t previous(octet_iterator& it, octet_iterator pass_start)
+    {
+        octet_iterator end = it;
+        while (utf8::internal::is_trail(*(--it)))
+            if (it == pass_start)
+                throw invalid_utf8(*it); // error - no lead byte in the sequence
+        octet_iterator temp = it;
+        return utf8::next(temp, end);
+    }
+
+    template <typename octet_iterator, typename distance_type>
+    void advance (octet_iterator& it, distance_type n, octet_iterator end)
+    {
+        for (distance_type i = 0; i < n; ++i)
+            utf8::next(it, end);
+    }
+
+    template <typename octet_iterator>
+    typename std::iterator_traits<octet_iterator>::difference_type
+    distance (octet_iterator first, octet_iterator last)
+    {
+        typename std::iterator_traits<octet_iterator>::difference_type dist;
+        for (dist = 0; first < last; ++dist)
+            utf8::next(first, last);
+        return dist;
+    }
+
+    template <typename u16bit_iterator, typename octet_iterator>
+    octet_iterator utf16to8 (u16bit_iterator start, u16bit_iterator end, octet_iterator result)
+    {
+        while (start != end) {
+            uint32_t cp = utf8::internal::mask16(*start++);
+            // Take care of surrogate pairs first
+            if (utf8::internal::is_lead_surrogate(cp)) {
+                if (start != end) {
+                    uint32_t trail_surrogate = utf8::internal::mask16(*start++);
+                    if (utf8::internal::is_trail_surrogate(trail_surrogate))
+                        cp = (cp << 10) + trail_surrogate + internal::SURROGATE_OFFSET;
+                    else
+                        throw invalid_utf16(static_cast<uint16_t>(trail_surrogate));
+                }
+                else
+                    throw invalid_utf16(static_cast<uint16_t>(cp));
+
+            }
+            // Lone trail surrogate
+            else if (utf8::internal::is_trail_surrogate(cp))
+                throw invalid_utf16(static_cast<uint16_t>(cp));
+
+            result = utf8::append(cp, result);
+        }
+        return result;
+    }
+
+    template <typename u16bit_iterator, typename octet_iterator>
+    u16bit_iterator utf8to16 (octet_iterator start, octet_iterator end, u16bit_iterator result)
+    {
+        while (start != end) {
+            uint32_t cp = utf8::next(start, end);
+            if (cp > 0xffff) { //make a surrogate pair
+                *result++ = static_cast<uint16_t>((cp >> 10)   + internal::LEAD_OFFSET);
+                *result++ = static_cast<uint16_t>((cp & 0x3ff) + internal::TRAIL_SURROGATE_MIN);
+            }
+            else
+                *result++ = static_cast<uint16_t>(cp);
+        }
+        return result;
+    }
+
+    template <typename octet_iterator, typename u32bit_iterator>
+    octet_iterator utf32to8 (u32bit_iterator start, u32bit_iterator end, octet_iterator result)
+    {
+        while (start != end)
+            result = utf8::append(*(start++), result);
+
+        return result;
+    }
+
+    template <typename octet_iterator, typename u32bit_iterator>
+    u32bit_iterator utf8to32 (octet_iterator start, octet_iterator end, u32bit_iterator result)
+    {
+        while (start != end)
+            (*result++) = utf8::next(start, end);
+
+        return result;
+    }
+
+    // The iterator class
+    template <typename octet_iterator>
+    class iterator : public std::iterator <std::bidirectional_iterator_tag, uint32_t> {
+      octet_iterator it;
+      octet_iterator range_start;
+      octet_iterator range_end;
+      public:
+      iterator () {}
+      explicit iterator (const octet_iterator& octet_it,
+                         const octet_iterator& range_start,
+                         const octet_iterator& range_end) :
+               it(octet_it), range_start(range_start), range_end(range_end)
+      {
+          if (it < range_start || it > range_end)
+              throw std::out_of_range("Invalid utf-8 iterator position");
+      }
+      // the default "big three" are OK
+      octet_iterator base () const { return it; }
+      uint32_t operator * () const
+      {
+          octet_iterator temp = it;
+          return utf8::next(temp, range_end);
+      }
+      bool operator == (const iterator& rhs) const
+      {
+          if (range_start != rhs.range_start || range_end != rhs.range_end)
+              throw std::logic_error("Comparing utf-8 iterators defined with different ranges");
+          return (it == rhs.it);
+      }
+      bool operator != (const iterator& rhs) const
+      {
+          return !(operator == (rhs));
+      }
+      iterator& operator ++ ()
+      {
+          utf8::next(it, range_end);
+          return *this;
+      }
+      iterator operator ++ (int)
+      {
+          iterator temp = *this;
+          utf8::next(it, range_end);
+          return temp;
+      }
+      iterator& operator -- ()
+      {
+          utf8::prior(it, range_start);
+          return *this;
+      }
+      iterator operator -- (int)
+      {
+          iterator temp = *this;
+          utf8::prior(it, range_start);
+          return temp;
+      }
+    }; // class iterator
+
+} // namespace utf8
+
+#endif //header guard
+
+

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/checked.h
___________________________________________________________________
Added: svn:eol-style
## -0,0 +1 ##
+LF
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/core.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/core.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/core.h	(revision 70339)
@@ -0,0 +1,329 @@
+// Copyright 2006 Nemanja Trifunovic
+
+/*
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+*/
+
+
+#ifndef UTF8_FOR_CPP_CORE_H_2675DCD0_9480_4c0c_B92A_CC14C027B731
+#define UTF8_FOR_CPP_CORE_H_2675DCD0_9480_4c0c_B92A_CC14C027B731
+
+#include <iterator>
+
+namespace utf8
+{
+    // The typedefs for 8-bit, 16-bit and 32-bit unsigned integers
+    // You may need to change them to match your system.
+    // These typedefs have the same names as ones from cstdint, or boost/cstdint
+    typedef unsigned char   uint8_t;
+    typedef unsigned short  uint16_t;
+    typedef unsigned int    uint32_t;
+
+// Helper code - not intended to be directly called by the library users. May be changed at any time
+namespace internal
+{
+    // Unicode constants
+    // Leading (high) surrogates: 0xd800 - 0xdbff
+    // Trailing (low) surrogates: 0xdc00 - 0xdfff
+    const uint16_t LEAD_SURROGATE_MIN  = 0xd800u;
+    const uint16_t LEAD_SURROGATE_MAX  = 0xdbffu;
+    const uint16_t TRAIL_SURROGATE_MIN = 0xdc00u;
+    const uint16_t TRAIL_SURROGATE_MAX = 0xdfffu;
+    const uint16_t LEAD_OFFSET         = LEAD_SURROGATE_MIN - (0x10000 >> 10);
+    const uint32_t SURROGATE_OFFSET    = 0x10000u - (LEAD_SURROGATE_MIN << 10) - TRAIL_SURROGATE_MIN;
+
+    // Maximum valid value for a Unicode code point
+    const uint32_t CODE_POINT_MAX      = 0x0010ffffu;
+
+    template<typename octet_type>
+    inline uint8_t mask8(octet_type oc)
+    {
+        return static_cast<uint8_t>(0xff & oc);
+    }
+    template<typename u16_type>
+    inline uint16_t mask16(u16_type oc)
+    {
+        return static_cast<uint16_t>(0xffff & oc);
+    }
+    template<typename octet_type>
+    inline bool is_trail(octet_type oc)
+    {
+        return ((utf8::internal::mask8(oc) >> 6) == 0x2);
+    }
+
+    template <typename u16>
+    inline bool is_lead_surrogate(u16 cp)
+    {
+        return (cp >= LEAD_SURROGATE_MIN && cp <= LEAD_SURROGATE_MAX);
+    }
+
+    template <typename u16>
+    inline bool is_trail_surrogate(u16 cp)
+    {
+        return (cp >= TRAIL_SURROGATE_MIN && cp <= TRAIL_SURROGATE_MAX);
+    }
+
+    template <typename u16>
+    inline bool is_surrogate(u16 cp)
+    {
+        return (cp >= LEAD_SURROGATE_MIN && cp <= TRAIL_SURROGATE_MAX);
+    }
+
+    template <typename u32>
+    inline bool is_code_point_valid(u32 cp)
+    {
+        return (cp <= CODE_POINT_MAX && !utf8::internal::is_surrogate(cp));
+    }
+
+    template <typename octet_iterator>
+    inline typename std::iterator_traits<octet_iterator>::difference_type
+    sequence_length(octet_iterator lead_it)
+    {
+        uint8_t lead = utf8::internal::mask8(*lead_it);
+        if (lead < 0x80)
+            return 1;
+        else if ((lead >> 5) == 0x6)
+            return 2;
+        else if ((lead >> 4) == 0xe)
+            return 3;
+        else if ((lead >> 3) == 0x1e)
+            return 4;
+        else
+            return 0;
+    }
+
+    template <typename octet_difference_type>
+    inline bool is_overlong_sequence(uint32_t cp, octet_difference_type length)
+    {
+        if (cp < 0x80) {
+            if (length != 1) 
+                return true;
+        }
+        else if (cp < 0x800) {
+            if (length != 2) 
+                return true;
+        }
+        else if (cp < 0x10000) {
+            if (length != 3) 
+                return true;
+        }
+
+        return false;
+    }
+
+    enum utf_error {UTF8_OK, NOT_ENOUGH_ROOM, INVALID_LEAD, INCOMPLETE_SEQUENCE, OVERLONG_SEQUENCE, INVALID_CODE_POINT};
+
+    /// Helper for get_sequence_x
+    template <typename octet_iterator>
+    utf_error increase_safely(octet_iterator& it, octet_iterator end)
+    {
+        if (++it == end)
+            return NOT_ENOUGH_ROOM;
+
+        if (!utf8::internal::is_trail(*it))
+            return INCOMPLETE_SEQUENCE;
+        
+        return UTF8_OK;
+    }
+
+    #define UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(IT, END) {utf_error ret = increase_safely(IT, END); if (ret != UTF8_OK) return ret;}    
+
+    /// get_sequence_x functions decode utf-8 sequences of the length x
+    template <typename octet_iterator>
+    utf_error get_sequence_1(octet_iterator& it, octet_iterator end, uint32_t& code_point)
+    {
+        if (it == end)
+            return NOT_ENOUGH_ROOM;
+
+        code_point = utf8::internal::mask8(*it);
+
+        return UTF8_OK;
+    }
+
+    template <typename octet_iterator>
+    utf_error get_sequence_2(octet_iterator& it, octet_iterator end, uint32_t& code_point)
+    {
+        if (it == end) 
+            return NOT_ENOUGH_ROOM;
+        
+        code_point = utf8::internal::mask8(*it);
+
+        UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(it, end)
+
+        code_point = ((code_point << 6) & 0x7ff) + ((*it) & 0x3f);
+
+        return UTF8_OK;
+    }
+
+    template <typename octet_iterator>
+    utf_error get_sequence_3(octet_iterator& it, octet_iterator end, uint32_t& code_point)
+    {
+        if (it == end)
+            return NOT_ENOUGH_ROOM;
+            
+        code_point = utf8::internal::mask8(*it);
+
+        UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(it, end)
+
+        code_point = ((code_point << 12) & 0xffff) + ((utf8::internal::mask8(*it) << 6) & 0xfff);
+
+        UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(it, end)
+
+        code_point += (*it) & 0x3f;
+
+        return UTF8_OK;
+    }
+
+    template <typename octet_iterator>
+    utf_error get_sequence_4(octet_iterator& it, octet_iterator end, uint32_t& code_point)
+    {
+        if (it == end)
+           return NOT_ENOUGH_ROOM;
+
+        code_point = utf8::internal::mask8(*it);
+
+        UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(it, end)
+
+        code_point = ((code_point << 18) & 0x1fffff) + ((utf8::internal::mask8(*it) << 12) & 0x3ffff);
+
+        UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(it, end)
+
+        code_point += (utf8::internal::mask8(*it) << 6) & 0xfff;
+
+        UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR(it, end)
+
+        code_point += (*it) & 0x3f;
+
+        return UTF8_OK;
+    }
+
+    #undef UTF8_CPP_INCREASE_AND_RETURN_ON_ERROR
+
+    template <typename octet_iterator>
+    utf_error validate_next(octet_iterator& it, octet_iterator end, uint32_t& code_point)
+    {
+        // Save the original value of it so we can go back in case of failure
+        // Of course, it does not make much sense with i.e. stream iterators
+        octet_iterator original_it = it;
+
+        uint32_t cp = 0;
+        // Determine the sequence length based on the lead octet
+        typedef typename std::iterator_traits<octet_iterator>::difference_type octet_difference_type;
+        const octet_difference_type length = utf8::internal::sequence_length(it);
+
+        // Get trail octets and calculate the code point
+        utf_error err = UTF8_OK;
+        switch (length) {
+            case 0: 
+                return INVALID_LEAD;
+            case 1:
+                err = utf8::internal::get_sequence_1(it, end, cp);
+                break;
+            case 2:
+                err = utf8::internal::get_sequence_2(it, end, cp);
+            break;
+            case 3:
+                err = utf8::internal::get_sequence_3(it, end, cp);
+            break;
+            case 4:
+                err = utf8::internal::get_sequence_4(it, end, cp);
+            break;
+        }
+
+        if (err == UTF8_OK) {
+            // Decoding succeeded. Now, security checks...
+            if (utf8::internal::is_code_point_valid(cp)) {
+                if (!utf8::internal::is_overlong_sequence(cp, length)){
+                    // Passed! Return here.
+                    code_point = cp;
+                    ++it;
+                    return UTF8_OK;
+                }
+                else
+                    err = OVERLONG_SEQUENCE;
+            }
+            else 
+                err = INVALID_CODE_POINT;
+        }
+
+        // Failure branch - restore the original value of the iterator
+        it = original_it;
+        return err;
+    }
+
+    template <typename octet_iterator>
+    inline utf_error validate_next(octet_iterator& it, octet_iterator end) {
+        uint32_t ignored;
+        return utf8::internal::validate_next(it, end, ignored);
+    }
+
+} // namespace internal
+
+    /// The library API - functions intended to be called by the users
+
+    // Byte order mark
+    const uint8_t bom[] = {0xef, 0xbb, 0xbf};
+
+    template <typename octet_iterator>
+    octet_iterator find_invalid(octet_iterator start, octet_iterator end)
+    {
+        octet_iterator result = start;
+        while (result != end) {
+            utf8::internal::utf_error err_code = utf8::internal::validate_next(result, end);
+            if (err_code != internal::UTF8_OK)
+                return result;
+        }
+        return result;
+    }
+
+    template <typename octet_iterator>
+    inline bool is_valid(octet_iterator start, octet_iterator end)
+    {
+        return (utf8::find_invalid(start, end) == end);
+    }
+
+    template <typename octet_iterator>
+    inline bool starts_with_bom (octet_iterator it, octet_iterator end)
+    {
+        return (
+            ((it != end) && (utf8::internal::mask8(*it++)) == bom[0]) &&
+            ((it != end) && (utf8::internal::mask8(*it++)) == bom[1]) &&
+            ((it != end) && (utf8::internal::mask8(*it))   == bom[2])
+           );
+    }
+	
+    //Deprecated in release 2.3 
+    template <typename octet_iterator>
+    inline bool is_bom (octet_iterator it)
+    {
+        return (
+            (utf8::internal::mask8(*it++)) == bom[0] &&
+            (utf8::internal::mask8(*it++)) == bom[1] &&
+            (utf8::internal::mask8(*it))   == bom[2]
+           );
+    }
+} // namespace utf8
+
+#endif // header guard
+
+

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/core.h
___________________________________________________________________
Added: svn:eol-style
## -0,0 +1 ##
+LF
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/unchecked.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/unchecked.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/unchecked.h	(revision 70339)
@@ -0,0 +1,228 @@
+// Copyright 2006 Nemanja Trifunovic
+
+/*
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+*/
+
+
+#ifndef UTF8_FOR_CPP_UNCHECKED_H_2675DCD0_9480_4c0c_B92A_CC14C027B731
+#define UTF8_FOR_CPP_UNCHECKED_H_2675DCD0_9480_4c0c_B92A_CC14C027B731
+
+#include "core.h"
+
+namespace utf8
+{
+    namespace unchecked 
+    {
+        template <typename octet_iterator>
+        octet_iterator append(uint32_t cp, octet_iterator result)
+        {
+            if (cp < 0x80)                        // one octet
+                *(result++) = static_cast<uint8_t>(cp);  
+            else if (cp < 0x800) {                // two octets
+                *(result++) = static_cast<uint8_t>((cp >> 6)          | 0xc0);
+                *(result++) = static_cast<uint8_t>((cp & 0x3f)        | 0x80);
+            }
+            else if (cp < 0x10000) {              // three octets
+                *(result++) = static_cast<uint8_t>((cp >> 12)         | 0xe0);
+                *(result++) = static_cast<uint8_t>(((cp >> 6) & 0x3f) | 0x80);
+                *(result++) = static_cast<uint8_t>((cp & 0x3f)        | 0x80);
+            }
+            else {                                // four octets
+                *(result++) = static_cast<uint8_t>((cp >> 18)         | 0xf0);
+                *(result++) = static_cast<uint8_t>(((cp >> 12) & 0x3f)| 0x80);
+                *(result++) = static_cast<uint8_t>(((cp >> 6) & 0x3f) | 0x80);
+                *(result++) = static_cast<uint8_t>((cp & 0x3f)        | 0x80);
+            }
+            return result;
+        }
+
+        template <typename octet_iterator>
+        uint32_t next(octet_iterator& it)
+        {
+            uint32_t cp = utf8::internal::mask8(*it);
+            typename std::iterator_traits<octet_iterator>::difference_type length = utf8::internal::sequence_length(it);
+            switch (length) {
+                case 1:
+                    break;
+                case 2:
+                    it++;
+                    cp = ((cp << 6) & 0x7ff) + ((*it) & 0x3f);
+                    break;
+                case 3:
+                    ++it; 
+                    cp = ((cp << 12) & 0xffff) + ((utf8::internal::mask8(*it) << 6) & 0xfff);
+                    ++it;
+                    cp += (*it) & 0x3f;
+                    break;
+                case 4:
+                    ++it;
+                    cp = ((cp << 18) & 0x1fffff) + ((utf8::internal::mask8(*it) << 12) & 0x3ffff);                
+                    ++it;
+                    cp += (utf8::internal::mask8(*it) << 6) & 0xfff;
+                    ++it;
+                    cp += (*it) & 0x3f; 
+                    break;
+            }
+            ++it;
+            return cp;        
+        }
+
+        template <typename octet_iterator>
+        uint32_t peek_next(octet_iterator it)
+        {
+            return utf8::unchecked::next(it);    
+        }
+
+        template <typename octet_iterator>
+        uint32_t prior(octet_iterator& it)
+        {
+            while (utf8::internal::is_trail(*(--it))) ;
+            octet_iterator temp = it;
+            return utf8::unchecked::next(temp);
+        }
+
+        // Deprecated in versions that include prior, but only for the sake of consistency (see utf8::previous)
+        template <typename octet_iterator>
+        inline uint32_t previous(octet_iterator& it)
+        {
+            return utf8::unchecked::prior(it);
+        }
+
+        template <typename octet_iterator, typename distance_type>
+        void advance (octet_iterator& it, distance_type n)
+        {
+            for (distance_type i = 0; i < n; ++i)
+                utf8::unchecked::next(it);
+        }
+
+        template <typename octet_iterator>
+        typename std::iterator_traits<octet_iterator>::difference_type
+        distance (octet_iterator first, octet_iterator last)
+        {
+            typename std::iterator_traits<octet_iterator>::difference_type dist;
+            for (dist = 0; first < last; ++dist) 
+                utf8::unchecked::next(first);
+            return dist;
+        }
+
+        template <typename u16bit_iterator, typename octet_iterator>
+        octet_iterator utf16to8 (u16bit_iterator start, u16bit_iterator end, octet_iterator result)
+        {       
+            while (start != end) {
+                uint32_t cp = utf8::internal::mask16(*start++);
+            // Take care of surrogate pairs first
+                if (utf8::internal::is_lead_surrogate(cp)) {
+                    uint32_t trail_surrogate = utf8::internal::mask16(*start++);
+                    cp = (cp << 10) + trail_surrogate + internal::SURROGATE_OFFSET;
+                }
+                result = utf8::unchecked::append(cp, result);
+            }
+            return result;         
+        }
+
+        template <typename u16bit_iterator, typename octet_iterator>
+        u16bit_iterator utf8to16 (octet_iterator start, octet_iterator end, u16bit_iterator result)
+        {
+            while (start < end) {
+                uint32_t cp = utf8::unchecked::next(start);
+                if (cp > 0xffff) { //make a surrogate pair
+                    *result++ = static_cast<uint16_t>((cp >> 10)   + internal::LEAD_OFFSET);
+                    *result++ = static_cast<uint16_t>((cp & 0x3ff) + internal::TRAIL_SURROGATE_MIN);
+                }
+                else
+                    *result++ = static_cast<uint16_t>(cp);
+            }
+            return result;
+        }
+
+        template <typename octet_iterator, typename u32bit_iterator>
+        octet_iterator utf32to8 (u32bit_iterator start, u32bit_iterator end, octet_iterator result)
+        {
+            while (start != end)
+                result = utf8::unchecked::append(*(start++), result);
+
+            return result;
+        }
+
+        template <typename octet_iterator, typename u32bit_iterator>
+        u32bit_iterator utf8to32 (octet_iterator start, octet_iterator end, u32bit_iterator result)
+        {
+            while (start < end)
+                (*result++) = utf8::unchecked::next(start);
+
+            return result;
+        }
+
+        // The iterator class
+        template <typename octet_iterator>
+          class iterator : public std::iterator <std::bidirectional_iterator_tag, uint32_t> { 
+            octet_iterator it;
+            public:
+            iterator () {}
+            explicit iterator (const octet_iterator& octet_it): it(octet_it) {}
+            // the default "big three" are OK
+            octet_iterator base () const { return it; }
+            uint32_t operator * () const
+            {
+                octet_iterator temp = it;
+                return utf8::unchecked::next(temp);
+            }
+            bool operator == (const iterator& rhs) const 
+            { 
+                return (it == rhs.it);
+            }
+            bool operator != (const iterator& rhs) const
+            {
+                return !(operator == (rhs));
+            }
+            iterator& operator ++ () 
+            {
+                ::std::advance(it, utf8::internal::sequence_length(it));
+                return *this;
+            }
+            iterator operator ++ (int)
+            {
+                iterator temp = *this;
+                ::std::advance(it, utf8::internal::sequence_length(it));
+                return temp;
+            }  
+            iterator& operator -- ()
+            {
+                utf8::unchecked::prior(it);
+                return *this;
+            }
+            iterator operator -- (int)
+            {
+                iterator temp = *this;
+                utf8::unchecked::prior(it);
+                return temp;
+            }
+          }; // class iterator
+
+    } // namespace utf8::unchecked
+} // namespace utf8 
+
+
+#endif // header guard
+

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8/unchecked.h
___________________________________________________________________
Added: svn:eol-style
## -0,0 +1 ##
+LF
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8.h
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8.h	(revision 70339)
@@ -0,0 +1,34 @@
+// Copyright 2006 Nemanja Trifunovic
+
+/*
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+*/
+
+
+#ifndef UTF8_FOR_CPP_2675DCD0_9480_4c0c_B92A_CC14C027B731
+#define UTF8_FOR_CPP_2675DCD0_9480_4c0c_B92A_CC14C027B731
+
+#include "utf8/checked.h"
+#include "utf8/unchecked.h"
+
+#endif // header guard

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8.h
___________________________________________________________________
Added: svn:eol-style
## -0,0 +1 ##
+LF
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8_fwrap.hpp
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8_fwrap.hpp	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8_fwrap.hpp	(revision 70339)
@@ -0,0 +1,100 @@
+#ifndef _UTF8_FWRAP_HPP
+#define _UTF8_FWRAP_HPP
+
+#include <utf8.h>
+#include <string>
+#include <iterator>
+#include <stdexcept>
+#include <cstdio>
+#include <cwchar>
+#include <stdint.h>
+
+inline wint_t fgetwc_u8(FILE *in) {
+	int32_t rv = 0;
+	int c = 0, i = 0;
+	char buf[4];
+	if ((c = fgetc_unlocked(in)) != EOF) {
+		buf[i++] = static_cast<char>(c);
+		if ((c & 0xF0) == 0xF0) {
+			if (fread_unlocked(buf+i, 1, 3, in) != 3) {
+				throw std::runtime_error("Could not read 3 expected bytes from stream");
+			}
+			i += 3;
+		}
+		else if ((c & 0xE0) == 0xE0) {
+			if (fread_unlocked(buf+i, 1, 2, in) != 2) {
+				throw std::runtime_error("Could not read 2 expected bytes from stream");
+			}
+			i += 2;
+		}
+		else if ((c & 0xC0) == 0xC0) {
+			if (fread_unlocked(buf+i, 1, 1, in) != 1) {
+				throw std::runtime_error("Could not read 1 expected byte from stream");
+			}
+			i += 1;
+		}
+	}
+	if (i == 0 && c == EOF) {
+		rv = WEOF;
+	}
+	else {
+		utf8::unchecked::utf8to32(buf, buf+i, &rv);
+	}
+	return static_cast<wint_t>(rv);
+}
+
+inline wint_t fputwc_u8(wint_t wc, FILE *out) {
+	char buf[4] = {};
+	char *e = utf8::unchecked::utf32to8(&wc, &wc+1, buf);
+	if (fwrite_unlocked(buf, 1, e-buf, out) != static_cast<size_t>(e-buf)) {
+		return WEOF;
+	}
+
+	return wc;
+}
+
+inline int fputws_u8(const wchar_t* str, FILE *out) {
+	static std::string buf;
+	buf.clear();
+	size_t len = wcslen(str);
+	utf8::unchecked::utf32to8(str, str+len, std::back_inserter(buf));
+	if (fwrite_unlocked(&buf[0], 1, buf.size(), out) != buf.size()) {
+		return WEOF;
+	}
+
+	return 1;
+}
+
+inline wint_t ungetwc_u8(wint_t wc, FILE *out) {
+	char buf[4] = {};
+	char *e = utf8::unchecked::utf32to8(&wc, &wc+1, buf);
+	for (char *b = buf ; b != e ; ++b) {
+		if (ungetc(*b, out) == EOF) {
+			return WEOF;
+		}
+	}
+
+	return wc;
+}
+
+#ifdef fgetwc_unlocked
+	#undef fgetwc_unlocked
+#endif
+#define fgetwc_unlocked fgetwc_u8
+
+#ifdef fputwc_unlocked
+	#undef fputwc_unlocked
+#endif
+#define fputwc_unlocked fputwc_u8
+
+#ifdef fputws_unlocked
+	#undef fputws_unlocked
+#endif
+#define fputws_unlocked fputws_u8
+
+#ifdef ungetwc
+	#undef ungetwc
+#endif
+#define ungetwc ungetwc_u8
+
+#endif

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/utf8/utf8_fwrap.hpp
___________________________________________________________________
Added: svn:eol-style
## -0,0 +1 ##
+LF
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/autogen.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/autogen.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/autogen.sh	(revision 70339)
@@ -0,0 +1,35 @@
+#! /bin/sh
+
+# If the user specified a --prefix, take that, otherwise /usr/local/
+# is the default.
+PREFIX=/usr/local
+prefixnext=false
+for i in "$@"; do
+    case $i in
+        --prefix=*)		# equals separated:
+	    PREFIX="${i#*=}"
+	    ;;
+        --prefix)		# space separated:
+	    prefixnext=true
+	    ;;
+        *)
+	    $prefixnext && PREFIX="$i" && prefixnext=false
+	    ;;
+    esac
+done
+
+# Set the paths needed by libtool/pkg-config/aclocal etc. By inferring
+# them based on --prefix , users don't have to edit ~/.bashrc. We only
+# append, so if a user has some other preference, that will override.
+PATH="${PATH}:/usr/local/bin"
+export PATH
+LD_LIBRARY_PATH="${LD_LIBRARY_PATH}:${PREFIX}/lib"
+export LD_LIBRARY_PATH
+PKG_CONFIG_PATH="${PKG_CONFIG_PATH}:${PREFIX}/share/pkgconfig:${PREFIX}/lib/pkgconfig"
+export PKG_CONFIG_PATH
+ACLOCAL_PATH="${ACLOCAL_PATH}:${PREFIX}/share/aclocal"
+export ACLOCAL_PATH
+
+
+# Pass on all args to configure
+autoreconf -fi && ./configure "$@"

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox/autogen.sh
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/lttoolbox/README
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/README	(revision 70339)
@@ -0,0 +1,33 @@
+README FILE OF LTTOOLBOX
+
+1. Programs
+
+	lt-comp   -> compiler, execute without parameters to show the
+                     instructions of use.
+
+	lt-proc   -> processor, works with options -a (lexical analyser, 
+                     default option), -g (lexical generator) and -p 
+                    (lexical post-generator).  Using -h will show all 
+                    flags.
+
+	lt-expand -> generates all the pairs of transductions of a given
+	             dictionary.  Execute without parameters to show the
+                     instructions of use.
+
+	lt-trim   -> (experimental) trims a compiled analyser to only
+	             contain entries which would pass through a compiled
+		     bidix, creating a new compiled and trimmed analyser.
+
+
+2. Install
+
+	a. Requirements:
+	        - i686, ppc, SPARC, etc.
+		- g++ >= 2.95
+		- gnu make
+		- libxml2 (last version)
+
+	b. Building & installing
+		- ./configure
+		- make
+		- make install (o make-install script)
Index: branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox.pc.in
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox.pc.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/lttoolbox.pc.in	(revision 70339)
@@ -0,0 +1,10 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: lttoolbox
+Description: Augmented letter transducer tools for natural language processing
+Version: @VERSION@
+Libs: -L${libdir} -l@GENERIC_LIBRARY_NAME@@GENERIC_MAJOR_VERSION@ @LTTOOLBOX_LIBS@
+Cflags: -I${includedir}/@GENERIC_LIBRARY_NAME@-@GENERIC_API_VERSION@ -I${libdir}/@GENERIC_LIBRARY_NAME@-@GENERIC_API_VERSION@/include @LTTOOLBOX_CFLAGS@
Index: branches/weighted-transfer/tags/midterm/lttoolbox/README.Win32
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/README.Win32	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/README.Win32	(revision 70339)
@@ -0,0 +1,58 @@
+Building lttoolbox on Win32
+---------------------------
+
+1. Cygwin
+
+Current versions of Cygwin (up to the 1.7 beta) do not have support for
+wstring; you cannot build lttoolbox using Cygwin.
+
+
+
+2. MinGW
+
+The only supported version of MinGW is TDM-GCC: 
+http://www.tdragon.net/recentgcc/
+
+The supported build environment is MSYS with MSysDTK 
+(http://www.mingw.org)
+
+pkgconfig, libxml2, libxslt, pkgconfig, glib, gettext, iconv, zlib, 
+libgcrypt, and libgpg-error are all required. Binary packages are 
+available here:
+http://sourceforge.net/project/showfiles.php?group_id=204414
+
+MSys, by default, installs binaries to /bin; pkg-config is written
+to not run from that location: it must be installed elsewhere.
+
+/bin/install doesn't work on MSYS. After lttoolbox has built, you will 
+need to do this:
+
+  cp lttoolbox/liblttoolbox3.a /lib
+  cp lttoolbox/liblttoolbox3.lai /lib/liblttoolbox3.la
+  mkdir /include/lttoolbox
+  cp lttoolbox/*.h /include/lttoolbox
+  cp lttoolbox-3.1.pc /lib/pkgconfig
+
+
+
+3. Microsoft Visual C++
+
+lttoolbox has only been build using Visual C++ 2008 Express Edition.
+It may work with other versions, but we have no way of testing it.
+
+The Visual C++ .sln file is built using CMake. Only CMake 2.6 has been
+tested.
+
+Dependencies:
+
+lttoolbox depends on libxml (and so on zlib and iconv), and for normal 
+use requires xsltproc from libxslt. We only support building against 
+the binaries distributed at http://xmlsoft.org/sources/win32/
+
+The default directories that the CMake configuration checks for these are:
+
+    libxml  : C:\Program Files\libxml
+    zlib    : C:\Program Files\zlib
+    iconv   : C:\Program Files\iconv
+    libxslt : C:\Program Files\libxslt
+
Index: branches/weighted-transfer/tags/midterm/lttoolbox/AUTHORS
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/AUTHORS	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/AUTHORS	(revision 70339)
@@ -0,0 +1,3 @@
+(c) 2005 Universitat d'Alacant / Universidad de Alicante.
+(c) 2007-2008 Prompsit Language Engineering S.L.
+ 
Index: branches/weighted-transfer/tags/midterm/lttoolbox/.tm_project.cache
===================================================================
Index: branches/weighted-transfer/tags/midterm/lttoolbox/ChangeLog
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox/ChangeLog	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox/ChangeLog	(revision 70339)
@@ -0,0 +1,143 @@
+Version 0.2
+
+* Generation supported (-g option)
+* Version number displayed (-v option)
+
+Version 0.5
+
+* Full intergration of transfer and format modules 
+
+Version 0.5.2
+
+* ltproc checks if the transducer accepts the empty string
+
+Version 0.6
+
+* PoolVecUshort problems fixed
+
+Version 0.6.2
+
+* Bilingual problem with accents solved
+* Generator inconsistencies writing policy changed
+
+Version 0.6.4
+
+* adflex added
+* retflex added
+
+Version 0.6.5
+
+* Problem in format block generation fixed
+
+Version 0.6.6
+
+* Problem with spaces in generation fixed
+
+Version 0.6.7
+
+* g++-2.95 support discarded
+
+Version 0.6.8
+
+* Optional flex optimizations in "gen-*" scripts with flag "-O"
+* adflex problem with nonalphabetic characters solved
+
+Version 0.6.9
+
+* adflex and retflex problem with [] blocks patched
+
+Version 0.6.10
+
+* get-case-from transfer module error fixed
+
+Version 0.6.11
+
+* <b> element in the transfer specification rule behavior is changed.  If
+attribute is nonspecified, then a blank spacing character (ASCII 32) is
+generated.  The transfer.dtd file is modified accordingly.
+
+Version 0.6.12
+
+* dots in lit-tag 'v' attributes are translated as "><"
+
+Version 0.7
+
+* adflex deleted
+* transfer.xsl multi-lexical units treatment added
+
+Version 0.7.1
+
+* skipUntil error fixed
+* dix.dtd included as EXTRA_DIST
+* "postblank" section type support
+
+Version 0.7.2
+
+* "notdollar" transfer variable redefined
+
+Version 0.7.3
+
+* transfer problem temporarily solved
+
+Version 0.8
+
+* transfer problem definitely solved
+
+Version 0.8.1
+
+* Added support for uppercase first characters of words when post-generation 
+  mark is present
+* basename feature added
+
+Version 0.8.2
+
+* Empty blanks support added
+
+Version 0.8.3
+
+* _unlocked standard I/O updated
+* getopt_long feature set as optional
+
+Version 0.8.4
+
+* retflex adds a blank behind two elements of a multi-lexical form of a word
+* "hay incidencias" problem patched
+
+Version 0.9
+
+* New transfer
+
+Version 0.9.1
+
+* Minor bugfixes in transfer
+
+Version 0.9.2
+
+* Minor bugfixes in transfer
+
+Version 0.9.3
+
+* -n option added to ltproc
+* capitalisation problem of generator solved
+
+Version 0.9.5
+
+* Escaped character minor fixes
+
+Version 0.9.6
+
+* <equali> transfer tag introduced
+
+Version 0.9.7
+
+* Line number bug fixed
+
+Version 0.9.9
+
+* "whole" part in transfer is now persistent
+* <equali> replaced by <equal caseless="yes">.  transfer.dtd edited
+  accordingly.
+
+Pending:
+* Implement the new policy of case propagation of the post-generator
+* Solve the problems with '$' and '^' when appearing in the original text
Index: branches/weighted-transfer/tags/midterm/lttoolbox
===================================================================
--- branches/weighted-transfer/tags/midterm/lttoolbox	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/lttoolbox	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/lttoolbox
___________________________________________________________________
Added: svn:ignore
## -0,0 +1,24 ##
+*.bin
+*.cache
+*.in
+*.log
+*.mode
+*.status
+.deps
+INSTALL
+Makefile
+Makefile.in
+aclocal.m4
+config
+configure
+install-sh
+missing
+modes
+stamp-h1
+config.guess
+config.sub
+depcomp
+libtool
+ltmain.sh
+*.pc
+compile
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.dix	(revision 70339)
@@ -0,0 +1,170 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+
+  <!-- Define the alphabet below. -->
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz</alphabet>
+
+  <sdefs>
+    <!-- Define symbol definitions within <sdef> here. -->
+    <sdef n="n"               c="Noun"/>
+    <sdef n="np"              c="Proper noun"/>
+    <sdef n="vblex"           c="Verb, lexical"/>
+    <sdef n="vbmod"           c="Modal verb"/>
+    <sdef n="vaux"            c="Auxiliary verb"/>
+    <sdef n="vbser"           c="'To be' verb"/>
+    <sdef n="vbhaver"         c="'To have' verb"/>
+    <sdef n="cnjsub"          c="Subordinating conjunction"/>
+    <sdef n="cnjcoo"          c="Co-ordinating conjunction"/>
+    <sdef n="cnjadv"          c="Adverbial conjunction"/>
+    <sdef n="pr"              c="Preposition"/>
+    <sdef n="adv"             c="Adverb"/>
+    <sdef n="ij"              c="Interjection"/>
+    <sdef n="adj"             c="Adjective"/>
+    <sdef n="prn"             c="Pronoun"/>
+    <sdef n="det"             c="Determiner"/>
+
+    <sdef n="attr"            c="Attributive"/>
+    <sdef n="top"             c="Toponym"/>
+    <sdef n="ant"             c="Anthroponym"/>
+    <sdef n="cog"             c="Cognomen"/>
+    <sdef n="org"             c="Organisation"/>
+    <sdef n="al"              c="Altres / misc proper nouns"/>
+
+    <sdef n="pers"            c="Personal pronoun"/>
+    <sdef n="ref"             c="Reflexive pronoun"/>
+    <sdef n="res"             c="Reciprocal pronoun"/>
+
+    <sdef n="det"             c="Determiner"/>
+    <sdef n="pos"             c="Possessive"/>
+
+    <sdef n="p1"              c="1st person"/>
+    <sdef n="p2"              c="2nd person"/>
+    <sdef n="p3"              c="3rd person"/>
+
+    <sdef n="nt"              c="Neuter"/>
+    <sdef n="ut"              c="Utrum"/>
+    <sdef n="f"               c="Feminine"/>
+    <sdef n="m"               c="Masculine"/>
+    <sdef n="un"              c="No gender"/>
+
+    <sdef n="sg"              c="Singular"/>
+    <sdef n="du"              c="Dual"/>
+    <sdef n="pl"              c="Plural"/>
+    <sdef n="sp"              c="Singular / plural"/>
+
+    <sdef n="ind"             c="Indefinite"/>
+    <sdef n="def"             c="Definite"/>
+
+    <sdef n="nom"             c="Nominative"/>
+    <sdef n="acc"             c="Accusative"/>
+    <sdef n="gen"             c="Genitive"/>
+
+    <sdef n="dem"             c="Demonstrative"/>
+    <sdef n="itg"             c="Question word / interrogative"/>
+    <sdef n="qnt"             c="Quantifier"/>
+    <sdef n="neg"             c="Negative"/>
+    <sdef n="emph"            c="Emphatic"/>
+
+    <sdef n="inf"             c="Infinitive"/>
+    <sdef n="pres"            c="Present"/>
+    <sdef n="imp"             c="Imperative"/>
+    <sdef n="pret"            c="Preterite"/>
+    <sdef n="pp"              c="Perfect participle"/>
+    <sdef n="pprs"            c="Present participle"/>
+    <sdef n="pasv"            c="Passive"/>
+    <sdef n="actv"            c="Active voice"/>
+
+    <sdef n="sint"            c="Synthetic (of adjectives)"/>
+    <sdef n="pst"             c="Positive"/>
+    <sdef n="comp"            c="Comparative"/>
+    <sdef n="sup"             c="Superlative"/>
+
+    <sdef n="ord"             c="Ordinal"/>
+    <sdef n="acr"             c="Acronym"/>
+    <sdef n="unc"             c="Uncountable"/>
+
+    <sdef n="num"             c="Numeral"/>
+    <sdef n="sent"            c="Sentence end"/>
+    <sdef n="cm"              c="Comma"/>
+    <sdef n="apos"            c="Apostrophe"/>
+    <sdef n="guio"            c="Dash"/>
+    <sdef n="lpar"            c="Left parenthesis"/>
+    <sdef n="rpar"            c="Right parenthesis"/>
+    <sdef n="lquot"           c="Left quote"/>
+    <sdef n="rquot"           c="Right quote"/>
+
+    <sdef n="compound-only-L" c="May only be the left-side of a compound"/>
+    <sdef n="compound-R"      c="May be the right-side of a compound, or a full word"/>
+  </sdefs>
+
+  <pardefs>
+    <!-- Define paradigms within <pardef> here. -->
+    <pardef n="big">
+      <e><p><l></l><r><s n="adj"/></r></p></e>
+    </pardef>
+    <pardef n="ordinal__num">
+      <e><p><l></l><r><s n="num"/></r></p></e>
+    </pardef>
+    <pardef n="regular__n">
+      <e><p><l>'s</l><r><s n="n"/><s n="sg"/><s n="pos"/></r></p></e>
+      <e><p><l>s'</l><r><s n="n"/><s n="pl"/><s n="pos"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/></r></p></e>
+      <e><p><l>s</l><r><s n="n"/><s n="pl"/></r></p></e>
+    </pardef>
+    <pardef n="man">
+      <e><p><l>an's</l><r>an<s n="n"/><s n="sg"/><s n="pos"/></r></p></e>
+      <e><p><l>en's</l><r>an<s n="n"/><s n="pl"/><s n="pos"/></r></p></e>
+      <e><p><l>an</l><r>an<s n="n"/><s n="sg"/></r></p></e>
+      <e><p><l>en</l><r>an<s n="n"/><s n="pl"/></r></p></e>
+    </pardef>
+    <pardef n="__pr">
+      <e><p><l></l><r><s n="pr"/></r></p></e>
+    </pardef>
+    <pardef n="a__det">
+      <e><p><l></l><r><s n="det"/><s n="ind"/></r></p></e>
+    </pardef>
+    <pardef n="the__det">
+      <e><p><l></l><r><s n="det"/><s n="def"/></r></p></e>
+    </pardef>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <!-- Define entries within <e> here. -->
+    <e lm="deadman"><i>dead<b/>m</i><par n="man"/></e>
+    <e lm="island"><i>island</i><par n="regular__n"/></e>
+    <e lm="sea"><i>sea</i><par n="regular__n"/></e>
+    <e lm="boot"><i>boot</i><par n="regular__n"/></e>
+    <e lm="chest"><i>chest</i><par n="regular__n"/></e>
+    <e lm="lock"><i>lock</i><par n="regular__n"/></e>
+    <e lm="sock"><i>sock</i><par n="regular__n"/></e>
+    <e lm="pair"><i>pair</i><par n="regular__n"/></e>
+    <e lm="day"><i>day</i><par n="regular__n"/></e>
+    <e lm="of"><i>of</i><par n="__pr"/></e>
+    <e lm="a"><i>a</i><par n="a__det"/></e>
+    <e lm="the"><i>the</i><par n="the__det"/></e>
+    <e lm="big"><i>big</i><par n="big"/></e>
+    <e lm="new"><i>new</i><par n="big"/></e>
+    <e lm="first"><i>the<b/>first</i><par n="ordinal__num"/></e>
+    <e lm="second"><i>the<b/>second</i><par n="ordinal__num"/></e>
+    <e lm="third"><i>the<b/>third</i><par n="ordinal__num"/></e>
+    <e lm="fourth"><i>the<b/>fourth</i><par n="ordinal__num"/></e>
+    <e lm="fifth"><i>the<b/>fifth</i><par n="ordinal__num"/></e>
+    <e lm="sixth"><i>the<b/>sixth</i><par n="ordinal__num"/></e>
+    <e lm="seventh"><i>the<b/>seventh</i><par n="ordinal__num"/></e>
+    <e lm="eighth"><i>the<b/>eighth</i><par n="ordinal__num"/></e>
+    <e lm="ninth"><i>the<b/>ninth</i><par n="ordinal__num"/></e>
+    <e lm="tenth"><i>the<b/>tenth</i><par n="ordinal__num"/></e>
+  </section>
+
+  <section id="final" type="inconditional">
+    <e><re>[.\?;:!…¿¶]</re><p><l></l><r><s n="sent"/></r></p></e>
+    <e><re>,</re>          <p><l></l><r><s n="cm"/></r></p></e>
+  </section>
+
+</dictionary>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Monodix_basics
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Monolingual_dictionaries
+-->
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng-rus.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng-rus.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng-rus.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng-rus.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng-rus.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/rus-eng.autogen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/rus-eng.autogen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/rus-eng.autogen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/rus-eng.autogen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/rus-eng.autogen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/.deps/.d
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/AUTHORS
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/COPYING
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/COPYING	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/COPYING	(revision 70339)
@@ -0,0 +1,675 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/ChangeLog
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/INSTALL
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/INSTALL	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/INSTALL	(revision 70339)
@@ -0,0 +1,370 @@
+Installation Instructions
+*************************
+
+Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation,
+Inc.
+
+   Copying and distribution of this file, with or without modification,
+are permitted in any medium without royalty provided the copyright
+notice and this notice are preserved.  This file is offered as-is,
+without warranty of any kind.
+
+Basic Installation
+==================
+
+   Briefly, the shell command `./configure && make && make install'
+should configure, build, and install this package.  The following
+more-detailed instructions are generic; see the `README' file for
+instructions specific to this package.  Some packages provide this
+`INSTALL' file but do not implement all of the features documented
+below.  The lack of an optional feature in a given package is not
+necessarily a bug.  More recommendations for GNU packages can be found
+in *note Makefile Conventions: (standards)Makefile Conventions.
+
+   The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation.  It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions.  Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, and a
+file `config.log' containing compiler output (useful mainly for
+debugging `configure').
+
+   It can also use an optional file (typically called `config.cache'
+and enabled with `--cache-file=config.cache' or simply `-C') that saves
+the results of its tests to speed up reconfiguring.  Caching is
+disabled by default to prevent problems with accidental use of stale
+cache files.
+
+   If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release.  If you are using the cache, and at
+some point `config.cache' contains results you don't want to keep, you
+may remove or edit it.
+
+   The file `configure.ac' (or `configure.in') is used to create
+`configure' by a program called `autoconf'.  You need `configure.ac' if
+you want to change it or regenerate `configure' using a newer version
+of `autoconf'.
+
+   The simplest way to compile this package is:
+
+  1. `cd' to the directory containing the package's source code and type
+     `./configure' to configure the package for your system.
+
+     Running `configure' might take a while.  While running, it prints
+     some messages telling which features it is checking for.
+
+  2. Type `make' to compile the package.
+
+  3. Optionally, type `make check' to run any self-tests that come with
+     the package, generally using the just-built uninstalled binaries.
+
+  4. Type `make install' to install the programs and any data files and
+     documentation.  When installing into a prefix owned by root, it is
+     recommended that the package be configured and built as a regular
+     user, and only the `make install' phase executed with root
+     privileges.
+
+  5. Optionally, type `make installcheck' to repeat any self-tests, but
+     this time using the binaries in their final installed location.
+     This target does not install anything.  Running this target as a
+     regular user, particularly if the prior `make install' required
+     root privileges, verifies that the installation completed
+     correctly.
+
+  6. You can remove the program binaries and object files from the
+     source code directory by typing `make clean'.  To also remove the
+     files that `configure' created (so you can compile the package for
+     a different kind of computer), type `make distclean'.  There is
+     also a `make maintainer-clean' target, but that is intended mainly
+     for the package's developers.  If you use it, you may have to get
+     all sorts of other programs in order to regenerate files that came
+     with the distribution.
+
+  7. Often, you can also type `make uninstall' to remove the installed
+     files again.  In practice, not all packages have tested that
+     uninstallation works correctly, even though it is required by the
+     GNU Coding Standards.
+
+  8. Some packages, particularly those that use Automake, provide `make
+     distcheck', which can by used by developers to test that all other
+     targets like `make install' and `make uninstall' work correctly.
+     This target is generally not run by end users.
+
+Compilers and Options
+=====================
+
+   Some systems require unusual options for compilation or linking that
+the `configure' script does not know about.  Run `./configure --help'
+for details on some of the pertinent environment variables.
+
+   You can give `configure' initial values for configuration parameters
+by setting variables in the command line or in the environment.  Here
+is an example:
+
+     ./configure CC=c99 CFLAGS=-g LIBS=-lposix
+
+   *Note Defining Variables::, for more details.
+
+Compiling For Multiple Architectures
+====================================
+
+   You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory.  To do this, you can use GNU `make'.  `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script.  `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.  This
+is known as a "VPATH" build.
+
+   With a non-GNU `make', it is safer to compile the package for one
+architecture at a time in the source code directory.  After you have
+installed the package for one architecture, use `make distclean' before
+reconfiguring for another architecture.
+
+   On MacOS X 10.5 and later systems, you can create libraries and
+executables that work on multiple system types--known as "fat" or
+"universal" binaries--by specifying multiple `-arch' options to the
+compiler but only a single `-arch' option to the preprocessor.  Like
+this:
+
+     ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CPP="gcc -E" CXXCPP="g++ -E"
+
+   This is not guaranteed to produce working output in all cases, you
+may have to build one architecture at a time and combine the results
+using the `lipo' tool if you have problems.
+
+Installation Names
+==================
+
+   By default, `make install' installs the package's commands under
+`/usr/local/bin', include files under `/usr/local/include', etc.  You
+can specify an installation prefix other than `/usr/local' by giving
+`configure' the option `--prefix=PREFIX', where PREFIX must be an
+absolute file name.
+
+   You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files.  If you
+pass the option `--exec-prefix=PREFIX' to `configure', the package uses
+PREFIX as the prefix for installing programs and libraries.
+Documentation and other data files still use the regular prefix.
+
+   In addition, if you use an unusual directory layout you can give
+options like `--bindir=DIR' to specify different values for particular
+kinds of files.  Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.  In general, the
+default for these options is expressed in terms of `${prefix}', so that
+specifying just `--prefix' will affect all of the other directory
+specifications that were not explicitly provided.
+
+   The most portable way to affect installation locations is to pass the
+correct locations to `configure'; however, many packages provide one or
+both of the following shortcuts of passing variable assignments to the
+`make install' command line to change installation locations without
+having to reconfigure or recompile.
+
+   The first method involves providing an override variable for each
+affected directory.  For example, `make install
+prefix=/alternate/directory' will choose an alternate location for all
+directory configuration variables that were expressed in terms of
+`${prefix}'.  Any directories that were specified during `configure',
+but not in terms of `${prefix}', must each be overridden at install
+time for the entire installation to be relocated.  The approach of
+makefile variable overrides for each directory variable is required by
+the GNU Coding Standards, and ideally causes no recompilation.
+However, some platforms have known limitations with the semantics of
+shared libraries that end up requiring recompilation when using this
+method, particularly noticeable in packages that use GNU Libtool.
+
+   The second method involves providing the `DESTDIR' variable.  For
+example, `make install DESTDIR=/alternate/directory' will prepend
+`/alternate/directory' before all installation names.  The approach of
+`DESTDIR' overrides is not required by the GNU Coding Standards, and
+does not work on platforms that have drive letters.  On the other hand,
+it does better at avoiding recompilation issues, and works well even
+when some directory options were not specified in terms of `${prefix}'
+at `configure' time.
+
+Optional Features
+=================
+
+   If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+   Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System).  The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+   For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+   Some packages offer the ability to configure how verbose the
+execution of `make' will be.  For these packages, running `./configure
+--enable-silent-rules' sets the default to minimal output, which can be
+overridden with `make V=1'; while running `./configure
+--disable-silent-rules' sets the default to verbose, which can be
+overridden with `make V=0'.
+
+Particular systems
+==================
+
+   On HP-UX, the default C compiler is not ANSI C compatible.  If GNU
+CC is not installed, it is recommended to use the following options in
+order to use an ANSI C compiler:
+
+     ./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
+
+and if that doesn't work, install pre-built binaries of GCC for HP-UX.
+
+   HP-UX `make' updates targets which have the same time stamps as
+their prerequisites, which makes it generally unusable when shipped
+generated files such as `configure' are involved.  Use GNU `make'
+instead.
+
+   On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
+parse its `<wchar.h>' header file.  The option `-nodtk' can be used as
+a workaround.  If GNU CC is not installed, it is therefore recommended
+to try
+
+     ./configure CC="cc"
+
+and if that doesn't work, try
+
+     ./configure CC="cc -nodtk"
+
+   On Solaris, don't put `/usr/ucb' early in your `PATH'.  This
+directory contains several dysfunctional programs; working variants of
+these programs are available in `/usr/bin'.  So, if you need `/usr/ucb'
+in your `PATH', put it _after_ `/usr/bin'.
+
+   On Haiku, software installed for all users goes in `/boot/common',
+not `/usr/local'.  It is recommended to use the following options:
+
+     ./configure --prefix=/boot/common
+
+Specifying the System Type
+==========================
+
+   There may be some features `configure' cannot figure out
+automatically, but needs to determine by the type of machine the package
+will run on.  Usually, assuming the package is built to be run on the
+_same_ architectures, `configure' can figure that out, but if it prints
+a message saying it cannot guess the machine type, give it the
+`--build=TYPE' option.  TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name which has the form:
+
+     CPU-COMPANY-SYSTEM
+
+where SYSTEM can have one of these forms:
+
+     OS
+     KERNEL-OS
+
+   See the file `config.sub' for the possible values of each field.  If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the machine type.
+
+   If you are _building_ compiler tools for cross-compiling, you should
+use the option `--target=TYPE' to select the type of system they will
+produce code for.
+
+   If you want to _use_ a cross compiler, that generates code for a
+platform different from the build platform, you should specify the
+"host" platform (i.e., that on which the generated programs will
+eventually be run) with `--host=TYPE'.
+
+Sharing Defaults
+================
+
+   If you want to set default values for `configure' scripts to share,
+you can create a site shell script called `config.site' that gives
+default values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists.  Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Defining Variables
+==================
+
+   Variables not defined in a site shell script can be set in the
+environment passed to `configure'.  However, some packages may run
+configure again during the build, and the customized values of these
+variables may be lost.  In order to avoid this problem, you should set
+them in the `configure' command line, using `VAR=value'.  For example:
+
+     ./configure CC=/usr/local2/bin/gcc
+
+causes the specified `gcc' to be used as the C compiler (unless it is
+overridden in the site shell script).
+
+Unfortunately, this technique does not work for `CONFIG_SHELL' due to
+an Autoconf limitation.  Until the limitation is lifted, you can use
+this workaround:
+
+     CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash
+
+`configure' Invocation
+======================
+
+   `configure' recognizes the following options to control how it
+operates.
+
+`--help'
+`-h'
+     Print a summary of all of the options to `configure', and exit.
+
+`--help=short'
+`--help=recursive'
+     Print a summary of the options unique to this package's
+     `configure', and exit.  The `short' variant lists options used
+     only in the top level, while the `recursive' variant lists options
+     also present in any nested packages.
+
+`--version'
+`-V'
+     Print the version of Autoconf used to generate the `configure'
+     script, and exit.
+
+`--cache-file=FILE'
+     Enable the cache: use and save the results of the tests in FILE,
+     traditionally `config.cache'.  FILE defaults to `/dev/null' to
+     disable caching.
+
+`--config-cache'
+`-C'
+     Alias for `--cache-file=config.cache'.
+
+`--quiet'
+`--silent'
+`-q'
+     Do not print messages saying which checks are being made.  To
+     suppress all normal output, redirect it to `/dev/null' (any error
+     messages will still be shown).
+
+`--srcdir=DIR'
+     Look for the package's source code in directory DIR.  Usually
+     `configure' can determine that directory automatically.
+
+`--prefix=DIR'
+     Use DIR as the installation prefix.  *note Installation Names::
+     for more details, including other options available for fine-tuning
+     the installation locations.
+
+`--no-create'
+`-n'
+     Run the configure checks, but stop before creating any output
+     files.
+
+`configure' also accepts some other, not widely useful, options.  Run
+`configure --help' for more details.
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile	(revision 70339)
@@ -0,0 +1,752 @@
+# Makefile.in generated by automake 1.14.1 from Makefile.am.
+# Makefile.  Generated from Makefile.in by configure.
+
+# Copyright (C) 1994-2013 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+
+
+###############################################################################
+###############################################################################
+
+
+am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/apertium-{{languageCode1}}-{{languageCode2}}
+pkgincludedir = $(includedir)/apertium-{{languageCode1}}-{{languageCode2}}
+pkglibdir = $(libdir)/apertium-{{languageCode1}}-{{languageCode2}}
+pkglibexecdir = $(libexecdir)/apertium-{{languageCode1}}-{{languageCode2}}
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+subdir = .
+DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \
+	$(srcdir)/Makefile.in $(srcdir)/Makefile.am \
+	$(top_srcdir)/configure $(am__configure_deps) \
+	$(srcdir)/apertium-eng.pc.in COPYING install-sh missing
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES = apertium-eng.pc
+CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_$(V))
+am__v_P_ = $(am__v_P_$(AM_DEFAULT_VERBOSITY))
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_$(V))
+am__v_GEN_ = $(am__v_GEN_$(AM_DEFAULT_VERBOSITY))
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_$(V))
+am__v_at_ = $(am__v_at_$(AM_DEFAULT_VERBOSITY))
+am__v_at_0 = @
+am__v_at_1 = 
+SOURCES =
+DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(apertium_engdir)" \
+	"$(DESTDIR)$(pkgconfigdir)"
+DATA = $(apertium_eng_DATA) $(noinst_DATA) $(pkgconfig_DATA)
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+DIST_TARGETS = dist-gzip
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing aclocal-1.14
+AMTAR = $${TAR-tar}
+AM_DEFAULT_VERBOSITY = 1
+APERTIUM_CFLAGS = -I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  
+APERTIUM_LIBS = -L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  
+AUTOCONF = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing autoconf
+AUTOHEADER = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing autoheader
+AUTOMAKE = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing automake-1.14
+AWK = gawk
+CGCOMP = /usr/bin/cg-comp
+CYGPATH_W = echo
+DEFS = -DPACKAGE_NAME=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\" -DPACKAGE_TARNAME=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE_VERSION=\"0.1.0\" -DPACKAGE_STRING=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\ 0.1.0\" -DPACKAGE_BUGREPORT=\"super-antispam@ya.ru\" -DPACKAGE_URL=\"http://wiki.apertium.org/wiki/Apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DVERSION=\"0.1.0\"
+ECHO_C = 
+ECHO_N = -n
+ECHO_T = 
+INSTALL = /usr/bin/install -c
+INSTALL_DATA = ${INSTALL} -m 644
+INSTALL_PROGRAM = ${INSTALL}
+INSTALL_SCRIPT = ${INSTALL}
+INSTALL_STRIP_PROGRAM = $(install_sh) -c -s
+LIBOBJS = 
+LIBS = 
+LN_S = ln -s
+LTLIBOBJS = 
+LTTOOLBOX_CFLAGS = -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  
+LTTOOLBOX_LIBS = -L/usr/local/lib -llttoolbox3 -lxml2  
+MAKEINFO = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing makeinfo
+MKDIR_P = /bin/mkdir -p
+PACKAGE = apertium-{{languageCode1}}-{{languageCode2}}
+PACKAGE_BUGREPORT = super-antispam@ya.ru
+PACKAGE_NAME = Apertium {{languageName1}}-{{languageName2}}
+PACKAGE_STRING = Apertium {{languageName1}}-{{languageName2}} 0.1.0
+PACKAGE_TARNAME = apertium-{{languageCode1}}-{{languageCode2}}
+PACKAGE_URL = http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}
+PACKAGE_VERSION = 0.1.0
+PATH_SEPARATOR = :
+PKG_CONFIG = /usr/bin/pkg-config
+PKG_CONFIG_LIBDIR = 
+PKG_CONFIG_PATH = /usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig
+SET_MAKE = 
+SHELL = /bin/bash
+STRIP = 
+VERSION = 0.1.0
+abs_builddir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng
+abs_srcdir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng
+abs_top_builddir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng
+abs_top_srcdir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng
+am__leading_dot = .
+am__tar = $${TAR-tar} chof - "$$tardir"
+am__untar = $${TAR-tar} xf -
+bindir = ${exec_prefix}/bin
+build_alias = 
+builddir = .
+datadir = ${datarootdir}
+datarootdir = ${prefix}/share
+docdir = ${datarootdir}/doc/${PACKAGE_TARNAME}
+dvidir = ${docdir}
+exec_prefix = ${prefix}
+host_alias = 
+htmldir = ${docdir}
+includedir = ${prefix}/include
+infodir = ${datarootdir}/info
+install_sh = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/install-sh
+libdir = ${exec_prefix}/lib
+libexecdir = ${exec_prefix}/libexec
+localedir = ${datarootdir}/locale
+localstatedir = ${prefix}/var
+mandir = ${datarootdir}/man
+mkdir_p = $(MKDIR_P)
+oldincludedir = /usr/include
+pdfdir = ${docdir}
+prefix = /usr/local
+program_transform_name = s,x,x,
+psdir = ${docdir}
+sbindir = ${exec_prefix}/sbin
+sharedstatedir = ${prefix}/com
+srcdir = .
+sysconfdir = ${prefix}/etc
+target_alias = 
+top_build_prefix = 
+top_builddir = .
+top_srcdir = .
+RELEASE = 0.1
+LANG1 = eng
+BASENAME = apertium-$(LANG1)
+TARGETS_COMMON = \
+	$(LANG1).automorf.bin		\
+	$(LANG1).automorf.att.gz	\
+	$(LANG1).autogen.bin		\
+	$(LANG1).autogen.att.gz		\
+	$(LANG1).autopgen.bin		\
+	$(LANG1).rlx.bin
+
+
+###############################################################################
+###############################################################################
+EXTRA_DIST = $(BASENAME).$(LANG1).dix		\
+		$(BASENAME).$(LANG1).acx	\
+		$(BASENAME).$(LANG1).rlx	\
+		$(BASENAME).post-$(LANG1).dix	\
+		$(LANG1).prob			\
+		modes.xml
+
+
+###############################################################################
+###############################################################################
+#
+#   apertium_eng_dir: This is where the compiled binaries go
+#   apertium_eng_srcdir: This is where the source files go
+apertium_engdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_eng_srcdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_eng_DATA = $(TARGETS_COMMON) $(LANG1).prob
+pkgconfigdir = $(prefix)/share/pkgconfig
+pkgconfig_DATA = $(BASENAME).pc
+noinst_DATA = modes/$(LANG1)-morph.mode
+CLEANFILES = $(TARGETS_COMMON)
+all: all-am
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+apertium-eng.pc: $(top_builddir)/config.status $(srcdir)/apertium-eng.pc.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+install-apertium_engDATA: $(apertium_eng_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(apertium_eng_DATA)'; test -n "$(apertium_engdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(apertium_engdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(apertium_engdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(apertium_engdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(apertium_engdir)" || exit $$?; \
+	done
+
+uninstall-apertium_engDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(apertium_eng_DATA)'; test -n "$(apertium_engdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(apertium_engdir)'; $(am__uninstall_files_from_dir)
+install-pkgconfigDATA: $(pkgconfig_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \
+	done
+
+uninstall-pkgconfigDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir)
+tags TAGS:
+
+ctags CTAGS:
+
+cscope cscopelist:
+
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__post_remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__post_remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__post_remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__post_remove_distdir)
+
+dist-tarZ: distdir
+	@echo WARNING: "Support for shar distribution archives is" \
+	               "deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__post_remove_distdir)
+
+dist-shar: distdir
+	@echo WARNING: "Support for distribution archives compressed with" \
+		       "legacy program 'compress' is deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__post_remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__post_remove_distdir)
+
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	    --srcdir=.. --prefix="$$dc_install_base" \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__post_remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-am
+all-am: Makefile $(DATA)
+installdirs:
+	for dir in "$(DESTDIR)$(apertium_engdir)" "$(DESTDIR)$(pkgconfigdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+
+clean-generic:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am: install-apertium_engDATA install-data-local \
+	install-pkgconfigDATA
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-apertium_engDATA uninstall-pkgconfigDATA
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am am--refresh check check-am clean clean-generic \
+	clean-local cscopelist-am ctags-am dist dist-all dist-bzip2 \
+	dist-gzip dist-lzip dist-shar dist-tarZ dist-xz dist-zip \
+	distcheck distclean distclean-generic distcleancheck distdir \
+	distuninstallcheck dvi dvi-am html html-am info info-am \
+	install install-am install-apertium_engDATA install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-pkgconfigDATA install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-generic pdf pdf-am ps ps-am tags-am uninstall \
+	uninstall-am uninstall-apertium_engDATA \
+	uninstall-pkgconfigDATA
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then mv $$modes modes/; fi
+
+apertium_modesdir=$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml $(prefix)/share/apertium/$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d $(DESTDIR)$(apertium_modesdir) || mkdir $(DESTDIR)$(apertium_modesdir)
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then \
+			$(INSTALL_DATA) $$modes $(DESTDIR)$(apertium_modesdir); \
+			rm $$modes; \
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch $@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; 	if $(am__make_keepgoing); then 	  failcom='fail=yes'; 	else 	  failcom='exit 1'; 	fi; 	dot_seen=no; 	list='$(AP_SUBDIRS)'; 	for subdir in $$list; do 	  echo "Making $$subdir"; 	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) all-am) 	  || eval $$failcom; 	done; 	$(MAKE) $(AM_MAKEFLAGS) all-am || exit 1; 	test -z "$$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/$*.autobil.att > .deps/$*.autobil.hfst
+	hfst-project -p upper .deps/$*.autobil.hfst > .deps/$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/$*.autobil.upper -2 .deps/$*.any-nonplus.hfst -o .deps/$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/$*.single-plus.hfst -2 .deps/$*.autobil.nonplussed -o .deps/$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/$*.autobil.postplus -o .deps/$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/$*.autobil.nonplussed -2 .deps/$*.autobil.postplus.0,3 -o $@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+
+###############################################################################
+###############################################################################
+
+$(LANG1).autogen.bin: $(BASENAME).$(LANG1).dix .deps/.d
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).automorf.bin: $(BASENAME).$(LANG1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).autogen.att.gz: $(LANG1).autogen.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).automorf.att.gz: $(LANG1).automorf.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).autopgen.bin: $(BASENAME).post-$(LANG1).dix
+	lt-comp lr $< $@
+
+###############################################################################
+###############################################################################
+
+$(LANG1).rlx.bin: $(BASENAME).$(LANG1).rlx $(CGCOMP)
+	$(CGCOMP) $< $@
+
+# Modes are not installed since they're all just "debug modes". All
+# modes are created by this goal.
+modes/$(LANG1)-morph.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+
+install-data-local:
+	test -d $(DESTDIR)$(apertium_eng_srcdir) || mkdir -p $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).dix $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).rlx $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).post-$(LANG1).dix $(DESTDIR)$(apertium_eng_srcdir)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+###############################################################################
+
+test: all
+	echo "TODO test sentence" | apertium -d . eng-morph | tee .test-mt
+	@echo "TODO test analysis results" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile.am	(revision 70339)
@@ -0,0 +1,101 @@
+###############################################################################
+## Makefile for apertium-eng
+###############################################################################
+
+RELEASE=0.1
+VERSION=0.1.0
+LANG1=eng
+BASENAME=apertium-$(LANG1)
+
+TARGETS_COMMON =			\
+	$(LANG1).automorf.bin		\
+	$(LANG1).automorf.att.gz	\
+	$(LANG1).autogen.bin		\
+	$(LANG1).autogen.att.gz		\
+	$(LANG1).autopgen.bin		\
+	$(LANG1).rlx.bin
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+@ap_include@
+
+###############################################################################
+## English transducer
+###############################################################################
+
+$(LANG1).autogen.bin: $(BASENAME).$(LANG1).dix .deps/.d
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).automorf.bin: $(BASENAME).$(LANG1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).autogen.att.gz: $(LANG1).autogen.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).automorf.att.gz: $(LANG1).automorf.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).autopgen.bin: $(BASENAME).post-$(LANG1).dix
+	lt-comp lr $< $@
+
+###############################################################################
+## Disambiguation rules
+###############################################################################
+
+$(LANG1).rlx.bin: $(BASENAME).$(LANG1).rlx $(CGCOMP)
+	$(CGCOMP) $< $@
+
+###############################################################################
+## Distribution
+###############################################################################
+EXTRA_DIST=$(BASENAME).$(LANG1).dix		\
+		$(BASENAME).$(LANG1).acx	\
+		$(BASENAME).$(LANG1).rlx	\
+		$(BASENAME).post-$(LANG1).dix	\
+		$(LANG1).prob			\
+		modes.xml
+
+###############################################################################
+## Installation stuff
+###############################################################################
+#
+#   apertium_eng_dir: This is where the compiled binaries go
+#   apertium_eng_srcdir: This is where the source files go
+
+apertium_engdir=$(prefix)/share/apertium/$(BASENAME)/
+apertium_eng_srcdir=$(prefix)/share/apertium/$(BASENAME)/
+
+apertium_eng_DATA=$(TARGETS_COMMON) $(LANG1).prob
+
+pkgconfigdir = $(prefix)/share/pkgconfig
+pkgconfig_DATA = $(BASENAME).pc
+
+# Modes are not installed since they're all just "debug modes". All
+# modes are created by this goal.
+modes/$(LANG1)-morph.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+
+noinst_DATA=modes/$(LANG1)-morph.mode
+
+install-data-local:
+	test -d $(DESTDIR)$(apertium_eng_srcdir) || mkdir -p $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).dix $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).rlx $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).post-$(LANG1).dix $(DESTDIR)$(apertium_eng_srcdir)
+
+CLEANFILES = $(TARGETS_COMMON)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+## Test
+###############################################################################
+
+test: all
+	echo "TODO test sentence" | apertium -d . eng-morph | tee .test-mt
+	@echo "TODO test analysis results" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/Makefile.in	(revision 70339)
@@ -0,0 +1,711 @@
+# Makefile.in generated by automake 1.14.1 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994-2013 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+
+###############################################################################
+###############################################################################
+
+VPATH = @srcdir@
+am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkglibexecdir = $(libexecdir)/@PACKAGE@
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+subdir = .
+DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \
+	$(srcdir)/Makefile.in $(srcdir)/Makefile.am \
+	$(top_srcdir)/configure $(am__configure_deps) \
+	$(srcdir)/apertium-eng.pc.in COPYING install-sh missing
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES = apertium-eng.pc
+CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_@AM_V@)
+am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_@AM_V@)
+am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_@AM_V@)
+am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
+SOURCES =
+DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(apertium_engdir)" \
+	"$(DESTDIR)$(pkgconfigdir)"
+DATA = $(apertium_eng_DATA) $(noinst_DATA) $(pkgconfig_DATA)
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+DIST_TARGETS = dist-gzip
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
+APERTIUM_CFLAGS = @APERTIUM_CFLAGS@
+APERTIUM_LIBS = @APERTIUM_LIBS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CGCOMP = @CGCOMP@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+LTTOOLBOX_CFLAGS = @LTTOOLBOX_CFLAGS@
+LTTOOLBOX_LIBS = @LTTOOLBOX_LIBS@
+MAKEINFO = @MAKEINFO@
+MKDIR_P = @MKDIR_P@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_URL = @PACKAGE_URL@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+PKG_CONFIG = @PKG_CONFIG@
+PKG_CONFIG_LIBDIR = @PKG_CONFIG_LIBDIR@
+PKG_CONFIG_PATH = @PKG_CONFIG_PATH@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = 0.1.0
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+am__leading_dot = @am__leading_dot@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build_alias = @build_alias@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host_alias = @host_alias@
+htmldir = @htmldir@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localedir = @localedir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+pdfdir = @pdfdir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+psdir = @psdir@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+srcdir = @srcdir@
+sysconfdir = @sysconfdir@
+target_alias = @target_alias@
+top_build_prefix = @top_build_prefix@
+top_builddir = @top_builddir@
+top_srcdir = @top_srcdir@
+RELEASE = 0.1
+LANG1 = eng
+BASENAME = apertium-$(LANG1)
+TARGETS_COMMON = \
+	$(LANG1).automorf.bin		\
+	$(LANG1).automorf.att.gz	\
+	$(LANG1).autogen.bin		\
+	$(LANG1).autogen.att.gz		\
+	$(LANG1).autopgen.bin		\
+	$(LANG1).rlx.bin
+
+
+###############################################################################
+###############################################################################
+EXTRA_DIST = $(BASENAME).$(LANG1).dix		\
+		$(BASENAME).$(LANG1).acx	\
+		$(BASENAME).$(LANG1).rlx	\
+		$(BASENAME).post-$(LANG1).dix	\
+		$(LANG1).prob			\
+		modes.xml
+
+
+###############################################################################
+###############################################################################
+#
+#   apertium_eng_dir: This is where the compiled binaries go
+#   apertium_eng_srcdir: This is where the source files go
+apertium_engdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_eng_srcdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_eng_DATA = $(TARGETS_COMMON) $(LANG1).prob
+pkgconfigdir = $(prefix)/share/pkgconfig
+pkgconfig_DATA = $(BASENAME).pc
+noinst_DATA = modes/$(LANG1)-morph.mode
+CLEANFILES = $(TARGETS_COMMON)
+all: all-am
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+apertium-eng.pc: $(top_builddir)/config.status $(srcdir)/apertium-eng.pc.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+install-apertium_engDATA: $(apertium_eng_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(apertium_eng_DATA)'; test -n "$(apertium_engdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(apertium_engdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(apertium_engdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(apertium_engdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(apertium_engdir)" || exit $$?; \
+	done
+
+uninstall-apertium_engDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(apertium_eng_DATA)'; test -n "$(apertium_engdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(apertium_engdir)'; $(am__uninstall_files_from_dir)
+install-pkgconfigDATA: $(pkgconfig_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \
+	done
+
+uninstall-pkgconfigDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir)
+tags TAGS:
+
+ctags CTAGS:
+
+cscope cscopelist:
+
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__post_remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__post_remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__post_remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__post_remove_distdir)
+
+dist-tarZ: distdir
+	@echo WARNING: "Support for shar distribution archives is" \
+	               "deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__post_remove_distdir)
+
+dist-shar: distdir
+	@echo WARNING: "Support for distribution archives compressed with" \
+		       "legacy program 'compress' is deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__post_remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__post_remove_distdir)
+
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	    --srcdir=.. --prefix="$$dc_install_base" \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__post_remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-am
+all-am: Makefile $(DATA)
+installdirs:
+	for dir in "$(DESTDIR)$(apertium_engdir)" "$(DESTDIR)$(pkgconfigdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+
+clean-generic:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am: install-apertium_engDATA install-data-local \
+	install-pkgconfigDATA
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-apertium_engDATA uninstall-pkgconfigDATA
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am am--refresh check check-am clean clean-generic \
+	clean-local cscopelist-am ctags-am dist dist-all dist-bzip2 \
+	dist-gzip dist-lzip dist-shar dist-tarZ dist-xz dist-zip \
+	distcheck distclean distclean-generic distcleancheck distdir \
+	distuninstallcheck dvi dvi-am html html-am info info-am \
+	install install-am install-apertium_engDATA install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-pkgconfigDATA install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-generic pdf pdf-am ps ps-am tags-am uninstall \
+	uninstall-am uninstall-apertium_engDATA \
+	uninstall-pkgconfigDATA
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+@ap_include@
+
+###############################################################################
+###############################################################################
+
+$(LANG1).autogen.bin: $(BASENAME).$(LANG1).dix .deps/.d
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).automorf.bin: $(BASENAME).$(LANG1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).autogen.att.gz: $(LANG1).autogen.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).automorf.att.gz: $(LANG1).automorf.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).autopgen.bin: $(BASENAME).post-$(LANG1).dix
+	lt-comp lr $< $@
+
+###############################################################################
+###############################################################################
+
+$(LANG1).rlx.bin: $(BASENAME).$(LANG1).rlx $(CGCOMP)
+	$(CGCOMP) $< $@
+
+# Modes are not installed since they're all just "debug modes". All
+# modes are created by this goal.
+modes/$(LANG1)-morph.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+
+install-data-local:
+	test -d $(DESTDIR)$(apertium_eng_srcdir) || mkdir -p $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).dix $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).rlx $(DESTDIR)$(apertium_eng_srcdir)
+	$(INSTALL_DATA) $(BASENAME).post-$(LANG1).dix $(DESTDIR)$(apertium_eng_srcdir)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+###############################################################################
+
+test: all
+	echo "TODO test sentence" | apertium -d . eng-morph | tee .test-mt
+	@echo "TODO test analysis results" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/NEWS
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/README
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/README	(revision 70339)
@@ -0,0 +1,84 @@
+English
+
+                            apertium-eng
+===============================================================================
+
+This is an Apertium monolingual language package for English. What
+you can use this language package for:
+
+* Morphological analysis of English
+* Morphological generation of English
+* Part-of-speech tagging of English
+
+Requirements
+===============================================================================
+
+You will need the following software installed:
+
+* lttoolbox (>= 3.3.0)
+* apertium (>= 3.3.0)
+* vislcg3 (>= 0.9.9.10297)
+
+If this does not make any sense, we recommend you look at: www.apertium.org
+
+Compiling
+===============================================================================
+
+Given the requirements being installed, you should be able to just run:
+
+$ ./configure
+$ make
+
+You can use ./autogen.sh instead of ./configure if you're compiling
+from SVN.
+
+If you're doing development, you don't have to install the data, you
+can use it directly from this directory.
+
+If you are installing this language package as a prerequisite for an
+Apertium translation pair, then do (typically as root / with sudo):
+
+# make install
+
+You can give a --prefix to ./configure to install as a non-root user,
+but make sure to use the same prefix when installing the translation
+pair and any other language packages.
+
+Testing
+===============================================================================
+
+If you are in the source directory after running make, the following
+commands should work:
+
+$  echo "TODO: test sentence" | apertium -d . eng-morph
+TODO: test analysis result
+
+$ echo "TODO: test sentence" | apertium -d . eng-tagger
+TODO: test tagger result
+
+Files and data
+===============================================================================
+
+* apertium-eng.eng.dix            - Monolingual dictionary
+* eng.prob                        - Tagger model
+* apertium-eng.eng.rlx            - Constraint Grammar disambiguation rules
+* apertium-eng.post-eng.dix       - Post-generator
+* modes.xml                       - Translation modes
+
+For more information
+===============================================================================
+
+* http://wiki.apertium.org/wiki/Installation
+* http://wiki.apertium.org/wiki/apertium-eng
+* http://wiki.apertium.org/wiki/Using_an_lttoolbox_dictionary
+
+Help and support
+===============================================================================
+
+If you need help using this language pair or data, you can contact:
+
+* Mailing list: apertium-stuff@lists.sourceforge.net
+* IRC: #apertium on irc.freenode.net
+
+See also the file AUTHORS included in this distribution.
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/aclocal.m4
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/aclocal.m4	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/aclocal.m4	(revision 70339)
@@ -0,0 +1,1053 @@
+# generated automatically by aclocal 1.14.1 -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+m4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])])
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],,
+[m4_warning([this file was generated for autoconf 2.69.
+You have another version of autoconf.  It may work, but is not guaranteed to.
+If you have problems, you may need to regenerate the build system entirely.
+To do so, use the procedure documented by the package, typically 'autoreconf'.])])
+
+# pkg.m4 - Macros to locate and utilise pkg-config.            -*- Autoconf -*-
+# serial 1 (pkg-config-0.24)
+# 
+# Copyright © 2004 Scott James Remnant <scott@netsplit.com>.
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+# PKG_PROG_PKG_CONFIG([MIN-VERSION])
+# ----------------------------------
+AC_DEFUN([PKG_PROG_PKG_CONFIG],
+[m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility])
+AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path])
+AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path])
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	AC_PATH_TOOL([PKG_CONFIG], [pkg-config])
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=m4_default([$1], [0.9.0])
+	AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version])
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		AC_MSG_RESULT([yes])
+	else
+		AC_MSG_RESULT([no])
+		PKG_CONFIG=""
+	fi
+fi[]dnl
+])# PKG_PROG_PKG_CONFIG
+
+# PKG_CHECK_EXISTS(MODULES, [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND])
+#
+# Check to see whether a particular set of modules exists.  Similar
+# to PKG_CHECK_MODULES(), but does not set variables or print errors.
+#
+# Please remember that m4 expands AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+# only at the first occurence in configure.ac, so if the first place
+# it's called might be skipped (such as if it is within an "if", you
+# have to call PKG_CHECK_EXISTS manually
+# --------------------------------------------------------------
+AC_DEFUN([PKG_CHECK_EXISTS],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+if test -n "$PKG_CONFIG" && \
+    AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then
+  m4_default([$2], [:])
+m4_ifvaln([$3], [else
+  $3])dnl
+fi])
+
+# _PKG_CONFIG([VARIABLE], [COMMAND], [MODULES])
+# ---------------------------------------------
+m4_define([_PKG_CONFIG],
+[if test -n "$$1"; then
+    pkg_cv_[]$1="$$1"
+ elif test -n "$PKG_CONFIG"; then
+    PKG_CHECK_EXISTS([$3],
+                     [pkg_cv_[]$1=`$PKG_CONFIG --[]$2 "$3" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ],
+		     [pkg_failed=yes])
+ else
+    pkg_failed=untried
+fi[]dnl
+])# _PKG_CONFIG
+
+# _PKG_SHORT_ERRORS_SUPPORTED
+# -----------------------------
+AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi[]dnl
+])# _PKG_SHORT_ERRORS_SUPPORTED
+
+
+# PKG_CHECK_MODULES(VARIABLE-PREFIX, MODULES, [ACTION-IF-FOUND],
+# [ACTION-IF-NOT-FOUND])
+#
+#
+# Note that if there is a possibility the first call to
+# PKG_CHECK_MODULES might not happen, you should be sure to include an
+# explicit call to PKG_PROG_PKG_CONFIG in your configure.ac
+#
+#
+# --------------------------------------------------------------
+AC_DEFUN([PKG_CHECK_MODULES],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl
+AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl
+
+pkg_failed=no
+AC_MSG_CHECKING([for $1])
+
+_PKG_CONFIG([$1][_CFLAGS], [cflags], [$2])
+_PKG_CONFIG([$1][_LIBS], [libs], [$2])
+
+m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS
+and $1[]_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.])
+
+if test $pkg_failed = yes; then
+   	AC_MSG_RESULT([no])
+        _PKG_SHORT_ERRORS_SUPPORTED
+        if test $_pkg_short_errors_supported = yes; then
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1`
+        else 
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD
+
+	m4_default([$4], [AC_MSG_ERROR(
+[Package requirements ($2) were not met:
+
+$$1_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+_PKG_TEXT])[]dnl
+        ])
+elif test $pkg_failed = untried; then
+     	AC_MSG_RESULT([no])
+	m4_default([$4], [AC_MSG_FAILURE(
+[The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+_PKG_TEXT
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.])[]dnl
+        ])
+else
+	$1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS
+	$1[]_LIBS=$pkg_cv_[]$1[]_LIBS
+        AC_MSG_RESULT([yes])
+	$3
+fi[]dnl
+])# PKG_CHECK_MODULES
+
+# apertium.m4 - Macros to locate and utilise apertium libraries -*- Autoconf -*-
+# serial 1 (apertium-3.4.2)
+#
+# Copyright (C) 2013--2016 Universitat d'Alacant / Universidad de Alicante
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+
+# AP_CHECK_LING([ID], [MONOLINGUAL_PACKAGE])
+#
+# Check to see whether MONOLINGUAL_PACKAGE exists, and if so sets
+# AP_LIB[ID] and AP_SRC[ID].
+#
+# As an example, AP_CHECK_LING([1], [apertium-fie]) would check that
+# apertium-fie exists, and set AP_LIB1 and AP_SRC1 to the paths
+# containing the binaries and sources respectively of that monolingual
+# language package.
+#
+# Also sets up options --with-lang[ID] (e.g. --with-lang1) if the user
+# wants to use the source code checkout instead of installed files.
+# ------------------------------------------
+AC_DEFUN([AP_CHECK_LING],
+[
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+
+
+# AP_MKINCLUDE()
+#
+# Creates the file ap_include.am and sets the variable ap_include to
+# point to this path. Now in your Makefile.am you can include
+# ap_include.am by writing @ap_include@ on a line by itself.
+#
+# The file defines a pattern rule for making modes files, and a goal
+# for installing the ones that have install="yes" in modes.xml. To
+# generate modes, include a line like
+#
+#     noinst_DATA=modes/$(PREFIX1).mode
+#
+# in your Makefile.am with _at most one mode_ (the others will be
+# created even if you list only one, listing several will lead to
+# trouble with parallell make).
+# 
+# Install the modes by making install-data-local dependent on
+# install-modes, ie.
+#
+#     install-data-local: install-modes
+#
+# Also defined is a goal for making the .deps folder. If you want some
+# file to be built in a folder named .deps, just make that goal
+# dependent on .deps/.d, e.g.
+#
+#     .deps/intermediate.dix: original.dix .deps/.d
+# 
+# ------------------------------------------
+AC_DEFUN([AP_MKINCLUDE],
+[
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
+
+# Copyright (C) 2002-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_AUTOMAKE_VERSION(VERSION)
+# ----------------------------
+# Automake X.Y traces this macro to ensure aclocal.m4 has been
+# generated from the m4 files accompanying Automake X.Y.
+# (This private macro should not be called outside this file.)
+AC_DEFUN([AM_AUTOMAKE_VERSION],
+[am__api_version='1.14'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.14.1], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+
+# _AM_AUTOCONF_VERSION(VERSION)
+# -----------------------------
+# aclocal traces this macro to find the Autoconf version.
+# This is a private macro too.  Using m4_define simplifies
+# the logic in aclocal, which can simply ignore this definition.
+m4_define([_AM_AUTOCONF_VERSION], [])
+
+# AM_SET_CURRENT_AUTOMAKE_VERSION
+# -------------------------------
+# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
+# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
+AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
+[AM_AUTOMAKE_VERSION([1.14.1])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+
+# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
+# $ac_aux_dir to '$srcdir/foo'.  In other projects, it is set to
+# '$srcdir', '$srcdir/..', or '$srcdir/../..'.
+#
+# Of course, Automake must honor this variable whenever it calls a
+# tool from the auxiliary directory.  The problem is that $srcdir (and
+# therefore $ac_aux_dir as well) can be either absolute or relative,
+# depending on how configure is run.  This is pretty annoying, since
+# it makes $ac_aux_dir quite unusable in subdirectories: in the top
+# source directory, any form will work fine, but in subdirectories a
+# relative path needs to be adjusted first.
+#
+# $ac_aux_dir/missing
+#    fails when called from a subdirectory if $ac_aux_dir is relative
+# $top_srcdir/$ac_aux_dir/missing
+#    fails if $ac_aux_dir is absolute,
+#    fails when called from a subdirectory in a VPATH build with
+#          a relative $ac_aux_dir
+#
+# The reason of the latter failure is that $top_srcdir and $ac_aux_dir
+# are both prefixed by $srcdir.  In an in-source build this is usually
+# harmless because $srcdir is '.', but things will broke when you
+# start a VPATH build or use an absolute $srcdir.
+#
+# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
+# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:
+#   am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"`
+# and then we would define $MISSING as
+#   MISSING="\${SHELL} $am_aux_dir/missing"
+# This will work as long as MISSING is not called from configure, because
+# unfortunately $(top_srcdir) has no meaning in configure.
+# However there are other variables, like CC, which are often used in
+# configure, and could therefore not use this "fixed" $ac_aux_dir.
+#
+# Another solution, used here, is to always expand $ac_aux_dir to an
+# absolute PATH.  The drawback is that using absolute paths prevent a
+# configured tree to be moved without reconfiguration.
+
+AC_DEFUN([AM_AUX_DIR_EXPAND],
+[dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+
+# Do all the work for Automake.                             -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This macro actually does too much.  Some checks are only needed if
+# your package does certain things.  But this isn't really a big deal.
+
+dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O.
+m4_define([AC_PROG_CC],
+m4_defn([AC_PROG_CC])
+[_AM_PROG_CC_C_O
+])
+
+# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
+# AM_INIT_AUTOMAKE([OPTIONS])
+# -----------------------------------------------
+# The call with PACKAGE and VERSION arguments is the old style
+# call (pre autoconf-2.50), which is being phased out.  PACKAGE
+# and VERSION should now be passed to AC_INIT and removed from
+# the call to AM_INIT_AUTOMAKE.
+# We support both call styles for the transition.  After
+# the next Automake release, Autoconf can make the AC_INIT
+# arguments mandatory, and then we can depend on a new Autoconf
+# release and drop the old call support.
+AC_DEFUN([AM_INIT_AUTOMAKE],
+[AC_PREREQ([2.65])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[AC_DIAGNOSE([obsolete],
+             [$0: two- and three-arguments forms are deprecated.])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+AC_REQUIRE([AM_SILENT_RULES])dnl
+dnl The testsuite driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This
+dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])
+  fi
+fi])
+
+dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
+dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
+dnl mangled by Autoconf and run in a shell conditional statement.
+m4_define([_AC_COMPILER_EXEEXT],
+m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])
+
+# When config.status generates a header, we must update the stamp-h file.
+# This file resides in the same directory as the config header
+# that is generated.  The stamp files are numbered to have different names.
+
+# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the
+# loop where config.status creates the headers, so we can generate
+# our stamp files there.
+AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],
+[# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_PROG_INSTALL_SH
+# ------------------
+# Define $install_sh.
+AC_DEFUN([AM_PROG_INSTALL_SH],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST([install_sh])])
+
+# Copyright (C) 2003-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# Check whether the underlying file-system supports filenames
+# with a leading dot.  For instance MS-DOS doesn't.
+AC_DEFUN([AM_SET_LEADING_DOT],
+[rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+
+# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-
+
+# Copyright (C) 1997-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_MISSING_PROG(NAME, PROGRAM)
+# ------------------------------
+AC_DEFUN([AM_MISSING_PROG],
+[AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+
+# AM_MISSING_HAS_RUN
+# ------------------
+# Define MISSING if not defined so far and test if it is modern enough.
+# If it is, set am_missing_run to use it, otherwise, to nothing.
+AC_DEFUN([AM_MISSING_HAS_RUN],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  AC_MSG_WARN(['missing' script is too old or missing])
+fi
+])
+
+# Helper functions for option handling.                     -*- Autoconf -*-
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_MANGLE_OPTION(NAME)
+# -----------------------
+AC_DEFUN([_AM_MANGLE_OPTION],
+[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+
+# _AM_SET_OPTION(NAME)
+# --------------------
+# Set option NAME.  Presently that only means defining a flag for this option.
+AC_DEFUN([_AM_SET_OPTION],
+[m4_define(_AM_MANGLE_OPTION([$1]), [1])])
+
+# _AM_SET_OPTIONS(OPTIONS)
+# ------------------------
+# OPTIONS is a space-separated list of Automake options.
+AC_DEFUN([_AM_SET_OPTIONS],
+[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+
+# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])
+# -------------------------------------------
+# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
+AC_DEFUN([_AM_IF_OPTION],
+[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+
+# Check to make sure that the build environment is sane.    -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_SANITY_CHECK
+# ---------------
+AC_DEFUN([AM_SANITY_CHECK],
+[AC_MSG_CHECKING([whether build environment is sane])
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
+
+# Copyright (C) 2009-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_SILENT_RULES([DEFAULT])
+# --------------------------
+# Enable less verbose build rules; with the default set to DEFAULT
+# ("yes" being less verbose, "no" or empty being verbose).
+AC_DEFUN([AM_SILENT_RULES],
+[AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+esac
+dnl
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
+dnl do not support nested variable expansions.
+dnl See automake bug#9928 and bug#10237.
+am_make=${MAKE-make}
+AC_CACHE_CHECK([whether $am_make supports nested variables],
+   [am_cv_make_support_nested_variables],
+   [if AS_ECHO([['TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi])
+if test $am_cv_make_support_nested_variables = yes; then
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
+  AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AC_SUBST([AM_V])dnl
+AM_SUBST_NOTMAKE([AM_V])dnl
+AC_SUBST([AM_DEFAULT_V])dnl
+AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl
+AC_SUBST([AM_DEFAULT_VERBOSITY])dnl
+AM_BACKSLASH='\'
+AC_SUBST([AM_BACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
+])
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_PROG_INSTALL_STRIP
+# ---------------------
+# One issue with vendor 'install' (even GNU) is that you can't
+# specify the program used to strip binaries.  This is especially
+# annoying in cross-compiling environments, where the build's strip
+# is unlikely to handle the host's binaries.
+# Fortunately install-sh will honor a STRIPPROG variable, so we
+# always use install-sh in "make install-strip", and initialize
+# STRIPPROG with the value of the STRIP variable (set by the user).
+AC_DEFUN([AM_PROG_INSTALL_STRIP],
+[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+
+# Copyright (C) 2006-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_SUBST_NOTMAKE(VARIABLE)
+# ---------------------------
+# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
+# This macro is traced by Automake.
+AC_DEFUN([_AM_SUBST_NOTMAKE])
+
+# AM_SUBST_NOTMAKE(VARIABLE)
+# --------------------------
+# Public sister of _AM_SUBST_NOTMAKE.
+AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+
+# Check how to create a tarball.                            -*- Autoconf -*-
+
+# Copyright (C) 2004-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_PROG_TAR(FORMAT)
+# --------------------
+# Check how to create a tarball in format FORMAT.
+# FORMAT should be one of 'v7', 'ustar', or 'pax'.
+#
+# Substitute a variable $(am__tar) that is a command
+# writing to stdout a FORMAT-tarball containing the directory
+# $tardir.
+#     tardir=directory && $(am__tar) > result.tar
+#
+# Substitute a variable $(am__untar) that extract such
+# a tarball read from stdin.
+#     $(am__untar) < result.tar
+#
+AC_DEFUN([_AM_PROG_TAR],
+[# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+
+m4_if([$1], [v7],
+  [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+
+  [m4_case([$1],
+    [ustar],
+     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.
+      # There is notably a 21 bits limit for the UID and the GID.  In fact,
+      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343
+      # and bug#13588).
+      am_max_uid=2097151 # 2^21 - 1
+      am_max_gid=$am_max_uid
+      # The $UID and $GID variables are not portable, so we need to resort
+      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls
+      # below are definitely unexpected, so allow the users to see them
+      # (that is, avoid stderr redirection).
+      am_uid=`id -u || echo unknown`
+      am_gid=`id -g || echo unknown`
+      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])
+      if test $am_uid -le $am_max_uid; then
+         AC_MSG_RESULT([yes])
+      else
+         AC_MSG_RESULT([no])
+         _am_tools=none
+      fi
+      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])
+      if test $am_gid -le $am_max_gid; then
+         AC_MSG_RESULT([yes])
+      else
+        AC_MSG_RESULT([no])
+        _am_tools=none
+      fi],
+
+  [pax],
+    [],
+
+  [m4_fatal([Unknown tar format])])
+
+  AC_MSG_CHECKING([how to create a $1 tar archive])
+
+  # Go ahead even if we have the value already cached.  We do so because we
+  # need to set the values for the 'am__tar' and 'am__untar' variables.
+  _am_tools=${am_cv_prog_tar_$1-$_am_tools}
+
+  for _am_tool in $_am_tools; do
+    case $_am_tool in
+    gnutar)
+      for _am_tar in tar gnutar gtar; do
+        AM_RUN_LOG([$_am_tar --version]) && break
+      done
+      am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+      am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+      am__untar="$_am_tar -xf -"
+      ;;
+    plaintar)
+      # Must skip GNU tar: if it does not support --format= it doesn't create
+      # ustar tarball either.
+      (tar --version) >/dev/null 2>&1 && continue
+      am__tar='tar chf - "$$tardir"'
+      am__tar_='tar chf - "$tardir"'
+      am__untar='tar xf -'
+      ;;
+    pax)
+      am__tar='pax -L -x $1 -w "$$tardir"'
+      am__tar_='pax -L -x $1 -w "$tardir"'
+      am__untar='pax -r'
+      ;;
+    cpio)
+      am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+      am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+      am__untar='cpio -i -H $1 -d'
+      ;;
+    none)
+      am__tar=false
+      am__tar_=false
+      am__untar=false
+      ;;
+    esac
+
+    # If the value was cached, stop now.  We just wanted to have am__tar
+    # and am__untar set.
+    test -n "${am_cv_prog_tar_$1}" && break
+
+    # tar/untar a dummy directory, and stop if the command works.
+    rm -rf conftest.dir
+    mkdir conftest.dir
+    echo GrepMe > conftest.dir/file
+    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+    rm -rf conftest.dir
+    if test -s conftest.tar; then
+      AM_RUN_LOG([$am__untar <conftest.tar])
+      AM_RUN_LOG([cat conftest.dir/file])
+      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+    fi
+  done
+  rm -rf conftest.dir
+
+  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+  AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+]) # _AM_PROG_TAR
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/ap_include.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/ap_include.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/ap_include.am	(revision 70339)
@@ -0,0 +1,42 @@
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then mv $$modes modes/; fi
+
+apertium_modesdir=$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml $(prefix)/share/apertium/$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d $(DESTDIR)$(apertium_modesdir) || mkdir $(DESTDIR)$(apertium_modesdir)
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then \
+			$(INSTALL_DATA) $$modes $(DESTDIR)$(apertium_modesdir); \
+			rm $$modes; \
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch $@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; 	if $(am__make_keepgoing); then 	  failcom='fail=yes'; 	else 	  failcom='exit 1'; 	fi; 	dot_seen=no; 	list='$(AP_SUBDIRS)'; 	for subdir in $$list; do 	  echo "Making $$subdir"; 	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) all-am) 	  || eval $$failcom; 	done; 	$(MAKE) $(AM_MAKEFLAGS) all-am || exit 1; 	test -z "$$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/$*.autobil.att > .deps/$*.autobil.hfst
+	hfst-project -p upper .deps/$*.autobil.hfst > .deps/$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/$*.autobil.upper -2 .deps/$*.any-nonplus.hfst -o .deps/$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/$*.single-plus.hfst -2 .deps/$*.autobil.nonplussed -o .deps/$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/$*.autobil.postplus -o .deps/$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/$*.autobil.nonplussed -2 .deps/$*.autobil.postplus.0,3 -o $@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.acx
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.acx	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.acx	(revision 70339)
@@ -0,0 +1,5 @@
+<?xml version="1.0"?>
+<analysis-chars>
+  <!-- Describe equivalent characters in monodices here. See http://wiki.apertium.org/wiki/Acx for more information. -->
+</analysis-chars>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.rlx
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.rlx	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.rlx	(revision 70339)
@@ -0,0 +1,20 @@
+# Firstly, we need to define what tags should be considered sentence delimiters. For this example, only full stop is set as delimiter.
+DELIMITERS = "<.>" ;
+
+# We can define sets for common tag clusters
+LIST Case = (n s) (n p) ; # A set that matches either a Noun Singular or a Noun Plural
+
+SECTION
+# If there is a singular noun to the right, I cannot be a verb or noun.
+REMOVE (n) OR (v) IF (1 (n s)) ;
+
+# If there is a conjunction followed by a certain cohort of the same CASE as me, choose me.
+SELECT $$Case IF (1 (cnjcoo) LINK 1C $$Case) ;
+
+# Resources:
+# http://visl.sdu.dk/cg3.html
+# http://groups.google.com/group/constraint-grammar
+# http://kevindonnelly.org.uk/2010/05/constraint-grammar-tutorial/
+# http://wiki.apertium.org/wiki/Constraint_Grammar
+# http://wiki.apertium.org/wiki/Apertium_and_Constraint_Grammar
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.pc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.pc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.pc	(revision 70339)
@@ -0,0 +1,8 @@
+prefix=/usr/local
+exec_prefix=${prefix}
+srcdir=${prefix}/share/apertium/apertium-eng
+
+Name: apertium-eng
+Description: Finite-state morphological transducer and constraint grammar for English 
+Version: 0.1.0
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.pc.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.pc.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.pc.in	(revision 70339)
@@ -0,0 +1,8 @@
+prefix=@prefix@
+exec_prefix=${prefix}
+srcdir=@datarootdir@/apertium/apertium-eng
+
+Name: apertium-eng
+Description: Finite-state morphological transducer and constraint grammar for English 
+Version: @VERSION@
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.post-eng.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.post-eng.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/apertium-eng.post-eng.dix	(revision 70339)
@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+
+  <sdefs>
+    <sdef n="n" c="Noun"/>
+  </sdefs>
+
+  <pardefs>
+    <pardef n="vocals">
+      <e>
+        <i>a</i>
+      </e>
+      <e>
+        <i>e</i>
+      </e>
+      <e>
+        <i>i</i>
+      </e>
+      <e>
+        <i>o</i>
+      </e>
+      <e>
+        <i>u</i>
+      </e>
+    </pardef>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <!-- Define entries within <e> here. See http://wiki.apertium.org/wiki/Post-generator for more information.-->
+    <e>
+      <p>
+        <l><a/>a<b/></l>
+        <r>an<b/></r>
+      </p>
+      <par n="vocals"/>
+    </e>
+  </section>
+</dictionary>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autogen.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autogen.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autogen.sh	(revision 70339)
@@ -0,0 +1,36 @@
+#! /bin/sh
+
+# If the user specified a --prefix, take that, otherwise /usr/local/
+# is the default.
+PREFIX=/usr/local
+prefixnext=false
+for i in "$@"; do
+    case $i in
+        --prefix=*)		# equals separated:
+	    PREFIX="${i#*=}"
+	    ;;
+        --prefix)		# space separated:
+	    prefixnext=true
+	    ;;
+        *)
+	    $prefixnext && PREFIX="$i" && prefixnext=false
+	    ;;
+    esac
+done
+
+# Set the paths needed by libtool/pkg-config/aclocal etc. By inferring
+# them based on --prefix , users don't have to edit ~/.bashrc. We only
+# append, so if a user has some other preference, that will override.
+PATH="${PATH}:/usr/local/bin"
+export PATH
+LD_LIBRARY_PATH="${LD_LIBRARY_PATH}:${PREFIX}/lib"
+export LD_LIBRARY_PATH
+PKG_CONFIG_PATH="${PKG_CONFIG_PATH}:${PREFIX}/share/pkgconfig:${PREFIX}/lib/pkgconfig"
+export PKG_CONFIG_PATH
+ACLOCAL_PATH="${ACLOCAL_PATH}:${PREFIX}/share/aclocal"
+export ACLOCAL_PATH
+
+
+# Pass on all args to configure
+autoreconf -fi && ./configure "$@"
+

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autogen.sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/output.0
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/output.0	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/output.0	(revision 70339)
@@ -0,0 +1,4043 @@
+@%:@! /bin/sh
+@%:@ Guess values for system-dependent variables and create Makefiles.
+@%:@ Generated by GNU Autoconf 2.69 for Apertium {{languageName1}}-{{languageName2}} 0.1.0.
+@%:@
+@%:@ Report bugs to <super-antispam@ya.ru>.
+@%:@ 
+@%:@ 
+@%:@ Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+@%:@ 
+@%:@ 
+@%:@ This configure script is free software; the Free Software Foundation
+@%:@ gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+  
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+  
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in @%:@(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIB@&t@OBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+
+ac_subst_vars='LTLIBOBJS
+LIB@&t@OBJS
+CGCOMP
+LTTOOLBOX_LIBS
+LTTOOLBOX_CFLAGS
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+LTTOOLBOX_CFLAGS
+LTTOOLBOX_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium {{languageName1}}-{{languageName2}} 0.1.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          @<:@@S|@ac_default_prefix@:>@
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          @<:@PREFIX@:>@
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          @<:@DATAROOTDIR/doc/apertium-{{languageCode1}}-{{languageCode2}}@:>@
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium {{languageName1}}-{{languageName2}} 0.1.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH 
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR 
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS 
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS 
+              linker flags for APERTIUM, overriding pkg-config
+  LTTOOLBOX_CFLAGS 
+              C compiler flags for LTTOOLBOX, overriding pkg-config
+  LTTOOLBOX_LIBS 
+              linker flags for LTTOOLBOX, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium {{languageName1}}-{{languageName2}} configure 0.1.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in @%:@((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in @%:@((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+@%:@ Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules; 
+fi
+
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+ VERSION='0.1.0'
+
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE "$PACKAGE"
+_ACEOF
+
+ 
+cat >>confdefs.h <<_ACEOF
+@%:@define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for LTTOOLBOX" >&5
+$as_echo_n "checking for LTTOOLBOX... " >&6; }
+
+if test -n "$LTTOOLBOX_CFLAGS"; then
+    pkg_cv_LTTOOLBOX_CFLAGS="$LTTOOLBOX_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_CFLAGS=`$PKG_CONFIG --cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$LTTOOLBOX_LIBS"; then
+    pkg_cv_LTTOOLBOX_LIBS="$LTTOOLBOX_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_LIBS=`$PKG_CONFIG --libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        else 
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$LTTOOLBOX_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (lttoolbox >= 3.3.2) were not met:
+
+$LTTOOLBOX_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	LTTOOLBOX_CFLAGS=$pkg_cv_LTTOOLBOX_CFLAGS
+	LTTOOLBOX_LIBS=$pkg_cv_LTTOOLBOX_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+
+
+  
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile apertium-eng.pc"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIB@&t@OBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIB@&t@OBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE] 
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../@%:@@%:@ /;s/...$/ @%:@@%:@/;p;x;p;x' <<_ASBOX
+@%:@@%:@ Running $as_me. @%:@@%:@
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-eng.pc") CONFIG_FILES="$CONFIG_FILES apertium-eng.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F@<:@"&"@:>@="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  
+  
+  
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/output.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/output.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/output.1	(revision 70339)
@@ -0,0 +1,4043 @@
+@%:@! /bin/sh
+@%:@ Guess values for system-dependent variables and create Makefiles.
+@%:@ Generated by GNU Autoconf 2.69 for Apertium {{languageName1}}-{{languageName2}} 0.1.0.
+@%:@
+@%:@ Report bugs to <super-antispam@ya.ru>.
+@%:@ 
+@%:@ 
+@%:@ Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+@%:@ 
+@%:@ 
+@%:@ This configure script is free software; the Free Software Foundation
+@%:@ gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+  
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+  
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in @%:@(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIB@&t@OBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+
+ac_subst_vars='LTLIBOBJS
+LIB@&t@OBJS
+CGCOMP
+LTTOOLBOX_LIBS
+LTTOOLBOX_CFLAGS
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+LTTOOLBOX_CFLAGS
+LTTOOLBOX_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium {{languageName1}}-{{languageName2}} 0.1.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          @<:@@S|@ac_default_prefix@:>@
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          @<:@PREFIX@:>@
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          @<:@DATAROOTDIR/doc/apertium-{{languageCode1}}-{{languageCode2}}@:>@
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium {{languageName1}}-{{languageName2}} 0.1.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH 
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR 
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS 
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS 
+              linker flags for APERTIUM, overriding pkg-config
+  LTTOOLBOX_CFLAGS 
+              C compiler flags for LTTOOLBOX, overriding pkg-config
+  LTTOOLBOX_LIBS 
+              linker flags for LTTOOLBOX, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium {{languageName1}}-{{languageName2}} configure 0.1.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in @%:@((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in @%:@((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+@%:@ Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules; 
+fi
+
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+ VERSION='0.1.0'
+
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE "$PACKAGE"
+_ACEOF
+
+ 
+cat >>confdefs.h <<_ACEOF
+@%:@define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for LTTOOLBOX" >&5
+$as_echo_n "checking for LTTOOLBOX... " >&6; }
+
+if test -n "$LTTOOLBOX_CFLAGS"; then
+    pkg_cv_LTTOOLBOX_CFLAGS="$LTTOOLBOX_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_CFLAGS=`$PKG_CONFIG --cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$LTTOOLBOX_LIBS"; then
+    pkg_cv_LTTOOLBOX_LIBS="$LTTOOLBOX_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_LIBS=`$PKG_CONFIG --libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        else 
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$LTTOOLBOX_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (lttoolbox >= 3.3.2) were not met:
+
+$LTTOOLBOX_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	LTTOOLBOX_CFLAGS=$pkg_cv_LTTOOLBOX_CFLAGS
+	LTTOOLBOX_LIBS=$pkg_cv_LTTOOLBOX_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+
+
+  
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile apertium-eng.pc"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIB@&t@OBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIB@&t@OBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE] 
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../@%:@@%:@ /;s/...$/ @%:@@%:@/;p;x;p;x' <<_ASBOX
+@%:@@%:@ Running $as_me. @%:@@%:@
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-eng.pc") CONFIG_FILES="$CONFIG_FILES apertium-eng.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F@<:@"&"@:>@="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  
+  
+  
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/requests
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/requests	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/requests	(revision 70339)
@@ -0,0 +1,162 @@
+# This file was generated by Autom4te Thu Apr 10 10:06:43 UTC 2014.
+# It contains the lists of macros which have been traced.
+# It can be safely removed.
+
+@request = (
+             bless( [
+                      '0',
+                      1,
+                      [
+                        '/usr/share/autoconf'
+                      ],
+                      [
+                        '/usr/share/autoconf/autoconf/autoconf.m4f',
+                        '-',
+                        '/usr/share/aclocal-1.14/internal/ac-config-macro-dirs.m4',
+                        '/usr/share/aclocal/pkg.m4',
+                        '/usr/local/share/aclocal/apertium.m4',
+                        '/usr/share/aclocal-1.14/amversion.m4',
+                        '/usr/share/aclocal-1.14/auxdir.m4',
+                        '/usr/share/aclocal-1.14/cond.m4',
+                        '/usr/share/aclocal-1.14/depend.m4',
+                        '/usr/share/aclocal-1.14/depout.m4',
+                        '/usr/share/aclocal-1.14/init.m4',
+                        '/usr/share/aclocal-1.14/install-sh.m4',
+                        '/usr/share/aclocal-1.14/lead-dot.m4',
+                        '/usr/share/aclocal-1.14/make.m4',
+                        '/usr/share/aclocal-1.14/missing.m4',
+                        '/usr/share/aclocal-1.14/options.m4',
+                        '/usr/share/aclocal-1.14/prog-cc-c-o.m4',
+                        '/usr/share/aclocal-1.14/runlog.m4',
+                        '/usr/share/aclocal-1.14/sanity.m4',
+                        '/usr/share/aclocal-1.14/silent.m4',
+                        '/usr/share/aclocal-1.14/strip.m4',
+                        '/usr/share/aclocal-1.14/substnot.m4',
+                        '/usr/share/aclocal-1.14/tar.m4',
+                        'configure.ac'
+                      ],
+                      {
+                        'AM_SET_LEADING_DOT' => 1,
+                        'AM_INIT_AUTOMAKE' => 1,
+                        'PKG_CHECK_EXISTS' => 1,
+                        'include' => 1,
+                        '_AC_AM_CONFIG_HEADER_HOOK' => 1,
+                        '_AM_MANGLE_OPTION' => 1,
+                        '_AM_PROG_CC_C_O' => 1,
+                        '_AM_PROG_TAR' => 1,
+                        'AM_PROG_INSTALL_STRIP' => 1,
+                        'm4_include' => 1,
+                        'AC_DEFUN' => 1,
+                        'AM_SILENT_RULES' => 1,
+                        'AC_DEFUN_ONCE' => 1,
+                        'AM_MISSING_PROG' => 1,
+                        'AM_AUX_DIR_EXPAND' => 1,
+                        'AU_DEFUN' => 1,
+                        '_AM_SET_OPTION' => 1,
+                        '_PKG_SHORT_ERRORS_SUPPORTED' => 1,
+                        'AM_CONDITIONAL' => 1,
+                        'AC_CONFIG_MACRO_DIR_TRACE' => 1,
+                        'AM_AUTOMAKE_VERSION' => 1,
+                        'm4_pattern_allow' => 1,
+                        '_AM_OUTPUT_DEPENDENCY_COMMANDS' => 1,
+                        'AM_SANITY_CHECK' => 1,
+                        '_AM_DEPENDENCIES' => 1,
+                        'AM_SUBST_NOTMAKE' => 1,
+                        'AP_CHECK_LING' => 1,
+                        'AM_SET_CURRENT_AUTOMAKE_VERSION' => 1,
+                        'AM_SET_DEPDIR' => 1,
+                        'AC_CONFIG_MACRO_DIR' => 1,
+                        'AM_RUN_LOG' => 1,
+                        'PKG_CHECK_MODULES' => 1,
+                        'AM_MISSING_HAS_RUN' => 1,
+                        'm4_pattern_forbid' => 1,
+                        '_AM_SET_OPTIONS' => 1,
+                        'AM_MAKE_INCLUDE' => 1,
+                        'AM_DEP_TRACK' => 1,
+                        '_AM_IF_OPTION' => 1,
+                        '_AM_SUBST_NOTMAKE' => 1,
+                        'AP_MKINCLUDE' => 1,
+                        '_AM_CONFIG_MACRO_DIRS' => 1,
+                        'AM_PROG_INSTALL_SH' => 1,
+                        '_m4_warn' => 1,
+                        'AM_OUTPUT_DEPENDENCY_COMMANDS' => 1,
+                        'AM_PROG_CC_C_O' => 1,
+                        'PKG_PROG_PKG_CONFIG' => 1,
+                        '_AM_AUTOCONF_VERSION' => 1
+                      }
+                    ], 'Autom4te::Request' ),
+             bless( [
+                      '1',
+                      1,
+                      [
+                        '/usr/share/autoconf'
+                      ],
+                      [
+                        '/usr/share/autoconf/autoconf/autoconf.m4f',
+                        'aclocal.m4',
+                        'configure.ac'
+                      ],
+                      {
+                        'AM_PROG_CC_C_O' => 1,
+                        '_m4_warn' => 1,
+                        'AM_POT_TOOLS' => 1,
+                        'AM_XGETTEXT_OPTION' => 1,
+                        'AM_MAINTAINER_MODE' => 1,
+                        'AC_CONFIG_LINKS' => 1,
+                        'AM_GNU_GETTEXT_INTL_SUBDIR' => 1,
+                        'AC_REQUIRE_AUX_FILE' => 1,
+                        'AC_CANONICAL_BUILD' => 1,
+                        'AM_PROG_AR' => 1,
+                        'AC_FC_PP_DEFINE' => 1,
+                        'm4_pattern_forbid' => 1,
+                        '_AM_SUBST_NOTMAKE' => 1,
+                        '_LT_AC_TAGCONFIG' => 1,
+                        'AC_INIT' => 1,
+                        'AM_PATH_GUILE' => 1,
+                        'AC_CONFIG_FILES' => 1,
+                        '_AM_COND_IF' => 1,
+                        '_AM_MAKEFILE_INCLUDE' => 1,
+                        'AC_DEFINE_TRACE_LITERAL' => 1,
+                        'AC_FC_SRCEXT' => 1,
+                        '_AM_COND_ENDIF' => 1,
+                        'AC_LIBSOURCE' => 1,
+                        'AM_PROG_F77_C_O' => 1,
+                        'AH_OUTPUT' => 1,
+                        'AC_CANONICAL_SYSTEM' => 1,
+                        'm4_sinclude' => 1,
+                        '_AM_COND_ELSE' => 1,
+                        'm4_pattern_allow' => 1,
+                        'AM_PROG_MOC' => 1,
+                        'AM_MAKEFILE_INCLUDE' => 1,
+                        'AM_AUTOMAKE_VERSION' => 1,
+                        'AM_GNU_GETTEXT' => 1,
+                        'LT_INIT' => 1,
+                        'LT_SUPPORTED_TAG' => 1,
+                        'AM_EXTRA_RECURSIVE_TARGETS' => 1,
+                        'AC_CONFIG_AUX_DIR' => 1,
+                        'sinclude' => 1,
+                        'AM_PROG_CXX_C_O' => 1,
+                        'AC_CONFIG_SUBDIRS' => 1,
+                        'AM_PROG_MKDIR_P' => 1,
+                        'AM_CONDITIONAL' => 1,
+                        'AM_ENABLE_MULTILIB' => 1,
+                        'AC_PROG_LIBTOOL' => 1,
+                        'AM_NLS' => 1,
+                        'AM_PROG_FC_C_O' => 1,
+                        'AM_SILENT_RULES' => 1,
+                        'AC_CONFIG_LIBOBJ_DIR' => 1,
+                        'AC_SUBST_TRACE' => 1,
+                        'm4_include' => 1,
+                        'AC_CANONICAL_TARGET' => 1,
+                        'AC_CANONICAL_HOST' => 1,
+                        'AM_INIT_AUTOMAKE' => 1,
+                        'LT_CONFIG_LTDL_DIR' => 1,
+                        'AC_CONFIG_HEADERS' => 1,
+                        'AC_FC_FREEFORM' => 1,
+                        'AC_FC_PP_SRCEXT' => 1,
+                        'AC_SUBST' => 1,
+                        'include' => 1
+                      }
+                    ], 'Autom4te::Request' )
+           );
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/traces.0
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/traces.0	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/traces.0	(revision 70339)
@@ -0,0 +1,1092 @@
+m4trace:/usr/share/aclocal/pkg.m4:27: -1- AC_DEFUN([PKG_PROG_PKG_CONFIG], [m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility])
+AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path])
+AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path])
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	AC_PATH_TOOL([PKG_CONFIG], [pkg-config])
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=m4_default([$1], [0.9.0])
+	AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version])
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		AC_MSG_RESULT([yes])
+	else
+		AC_MSG_RESULT([no])
+		PKG_CONFIG=""
+	fi
+fi[]dnl
+])
+m4trace:/usr/share/aclocal/pkg.m4:60: -1- AC_DEFUN([PKG_CHECK_EXISTS], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+if test -n "$PKG_CONFIG" && \
+    AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then
+  m4_default([$2], [:])
+m4_ifvaln([$3], [else
+  $3])dnl
+fi])
+m4trace:/usr/share/aclocal/pkg.m4:86: -1- AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi[]dnl
+])
+m4trace:/usr/share/aclocal/pkg.m4:106: -1- AC_DEFUN([PKG_CHECK_MODULES], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl
+AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl
+
+pkg_failed=no
+AC_MSG_CHECKING([for $1])
+
+_PKG_CONFIG([$1][_CFLAGS], [cflags], [$2])
+_PKG_CONFIG([$1][_LIBS], [libs], [$2])
+
+m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS
+and $1[]_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.])
+
+if test $pkg_failed = yes; then
+   	AC_MSG_RESULT([no])
+        _PKG_SHORT_ERRORS_SUPPORTED
+        if test $_pkg_short_errors_supported = yes; then
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1`
+        else 
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD
+
+	m4_default([$4], [AC_MSG_ERROR(
+[Package requirements ($2) were not met:
+
+$$1_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+_PKG_TEXT])[]dnl
+        ])
+elif test $pkg_failed = untried; then
+     	AC_MSG_RESULT([no])
+	m4_default([$4], [AC_MSG_FAILURE(
+[The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+_PKG_TEXT
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.])[]dnl
+        ])
+else
+	$1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS
+	$1[]_LIBS=$pkg_cv_[]$1[]_LIBS
+        AC_MSG_RESULT([yes])
+	$3
+fi[]dnl
+])
+m4trace:/usr/local/share/aclocal/apertium.m4:33: -1- AC_DEFUN([AP_CHECK_LING], [
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+m4trace:/usr/local/share/aclocal/apertium.m4:91: -1- AC_DEFUN([AP_MKINCLUDE], [
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
+m4trace:/usr/share/aclocal-1.14/amversion.m4:14: -1- AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.14'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.14.1], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+m4trace:/usr/share/aclocal-1.14/amversion.m4:33: -1- AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.14.1])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+m4trace:/usr/share/aclocal-1.14/auxdir.m4:47: -1- AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+m4trace:/usr/share/aclocal-1.14/cond.m4:12: -1- AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl
+ m4_if([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
+       [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
+AC_SUBST([$1_TRUE])dnl
+AC_SUBST([$1_FALSE])dnl
+_AM_SUBST_NOTMAKE([$1_TRUE])dnl
+_AM_SUBST_NOTMAKE([$1_FALSE])dnl
+m4_define([_AM_COND_VALUE_$1], [$2])dnl
+if $2; then
+  $1_TRUE=
+  $1_FALSE='#'
+else
+  $1_TRUE='#'
+  $1_FALSE=
+fi
+AC_CONFIG_COMMANDS_PRE(
+[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then
+  AC_MSG_ERROR([[conditional "$1" was never defined.
+Usually this means the macro was only invoked conditionally.]])
+fi])])
+m4trace:/usr/share/aclocal-1.14/depend.m4:26: -1- AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl
+AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl
+AC_REQUIRE([AM_MAKE_INCLUDE])dnl
+AC_REQUIRE([AM_DEP_TRACK])dnl
+
+m4_if([$1], [CC],   [depcc="$CC"   am_compiler_list=],
+      [$1], [CXX],  [depcc="$CXX"  am_compiler_list=],
+      [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
+      [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'],
+      [$1], [UPC],  [depcc="$UPC"  am_compiler_list=],
+      [$1], [GCJ],  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
+                    [depcc="$$1"   am_compiler_list=])
+
+AC_CACHE_CHECK([dependency style of $depcc],
+               [am_cv_$1_dependencies_compiler_type],
+[if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
+  # We make a subdir and do the tests there.  Otherwise we can end up
+  # making bogus files that we don't know about and never remove.  For
+  # instance it was reported that on HP-UX the gcc test will end up
+  # making a dummy file named 'D' -- because '-MD' means "put the output
+  # in D".
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  # Copy depcomp to subdir because otherwise we won't find it if we're
+  # using a relative directory.
+  cp "$am_depcomp" conftest.dir
+  cd conftest.dir
+  # We will build objects and dependencies in a subdirectory because
+  # it helps to detect inapplicable dependency modes.  For instance
+  # both Tru64's cc and ICC support -MD to output dependencies as a
+  # side effect of compilation, but ICC will put the dependencies in
+  # the current directory while Tru64 will put them in the object
+  # directory.
+  mkdir sub
+
+  am_cv_$1_dependencies_compiler_type=none
+  if test "$am_compiler_list" = ""; then
+     am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp`
+  fi
+  am__universal=false
+  m4_case([$1], [CC],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac],
+    [CXX],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac])
+
+  for depmode in $am_compiler_list; do
+    # Setup a source with many dependencies, because some compilers
+    # like to wrap large dependency lists on column 80 (with \), and
+    # we should not choose a depcomp mode which is confused by this.
+    #
+    # We need to recreate these files for each test, as the compiler may
+    # overwrite some of them when testing with obscure command lines.
+    # This happens at least with the AIX C compiler.
+    : > sub/conftest.c
+    for i in 1 2 3 4 5 6; do
+      echo '#include "conftst'$i'.h"' >> sub/conftest.c
+      # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with
+      # Solaris 10 /bin/sh.
+      echo '/* dummy */' > sub/conftst$i.h
+    done
+    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
+
+    # We check with '-c' and '-o' for the sake of the "dashmstdout"
+    # mode.  It turns out that the SunPro C++ compiler does not properly
+    # handle '-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs.
+    am__obj=sub/conftest.${OBJEXT-o}
+    am__minus_obj="-o $am__obj"
+    case $depmode in
+    gcc)
+      # This depmode causes a compiler race in universal mode.
+      test "$am__universal" = false || continue
+      ;;
+    nosideeffect)
+      # After this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested.
+      if test "x$enable_dependency_tracking" = xyes; then
+	continue
+      else
+	break
+      fi
+      ;;
+    msvc7 | msvc7msys | msvisualcpp | msvcmsys)
+      # This compiler won't grok '-c -o', but also, the minuso test has
+      # not run yet.  These depmodes are late enough in the game, and
+      # so weak that their functioning should not be impacted.
+      am__obj=conftest.${OBJEXT-o}
+      am__minus_obj=
+      ;;
+    none) break ;;
+    esac
+    if depmode=$depmode \
+       source=sub/conftest.c object=$am__obj \
+       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
+       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
+         >/dev/null 2>conftest.err &&
+       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
+       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
+      # icc doesn't choke on unknown options, it will just issue warnings
+      # or remarks (even with -Werror).  So we grep stderr for any message
+      # that says an option was ignored or not supported.
+      # When given -MP, icc 7.0 and 7.1 complain thusly:
+      #   icc: Command line warning: ignoring option '-M'; no argument required
+      # The diagnosis changed in icc 8.0:
+      #   icc: Command line remark: option '-MP' not supported
+      if (grep 'ignoring option' conftest.err ||
+          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
+        am_cv_$1_dependencies_compiler_type=$depmode
+        break
+      fi
+    fi
+  done
+
+  cd ..
+  rm -rf conftest.dir
+else
+  am_cv_$1_dependencies_compiler_type=none
+fi
+])
+AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])
+AM_CONDITIONAL([am__fastdep$1], [
+  test "x$enable_dependency_tracking" != xno \
+  && test "$am_cv_$1_dependencies_compiler_type" = gcc3])
+])
+m4trace:/usr/share/aclocal-1.14/depend.m4:163: -1- AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
+])
+m4trace:/usr/share/aclocal-1.14/depend.m4:171: -1- AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE([dependency-tracking], [dnl
+AS_HELP_STRING(
+  [--enable-dependency-tracking],
+  [do not reject slow dependency extractors])
+AS_HELP_STRING(
+  [--disable-dependency-tracking],
+  [speeds up one-time build])])
+if test "x$enable_dependency_tracking" != xno; then
+  am_depcomp="$ac_aux_dir/depcomp"
+  AMDEPBACKSLASH='\'
+  am__nodep='_no'
+fi
+AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno])
+AC_SUBST([AMDEPBACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl
+AC_SUBST([am__nodep])dnl
+_AM_SUBST_NOTMAKE([am__nodep])dnl
+])
+m4trace:/usr/share/aclocal-1.14/depout.m4:12: -1- AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{
+  # Older Autoconf quotes --file arguments for eval, but not when files
+  # are listed without --file.  Let's play safe and only enable the eval
+  # if we detect the quoting.
+  case $CONFIG_FILES in
+  *\'*) eval set x "$CONFIG_FILES" ;;
+  *)   set x $CONFIG_FILES ;;
+  esac
+  shift
+  for mf
+  do
+    # Strip MF so we end up with the name of the file.
+    mf=`echo "$mf" | sed -e 's/:.*$//'`
+    # Check whether this is an Automake generated Makefile or not.
+    # We used to match only the files named 'Makefile.in', but
+    # some people rename them; so instead we look at the file content.
+    # Grep'ing the first line is not enough: some people post-process
+    # each Makefile.in and add a new line on top of each file to say so.
+    # Grep'ing the whole file is not good either: AIX grep has a line
+    # limit of 2048, but all sed's we know have understand at least 4000.
+    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
+      dirpart=`AS_DIRNAME("$mf")`
+    else
+      continue
+    fi
+    # Extract the definition of DEPDIR, am__include, and am__quote
+    # from the Makefile without running 'make'.
+    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
+    test -z "$DEPDIR" && continue
+    am__include=`sed -n 's/^am__include = //p' < "$mf"`
+    test -z "$am__include" && continue
+    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
+    # Find all dependency output files, they are included files with
+    # $(DEPDIR) in their names.  We invoke sed twice because it is the
+    # simplest approach to changing $(DEPDIR) to its actual value in the
+    # expansion.
+    for file in `sed -n "
+      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do
+      # Make sure the directory exists.
+      test -f "$dirpart/$file" && continue
+      fdir=`AS_DIRNAME(["$file"])`
+      AS_MKDIR_P([$dirpart/$fdir])
+      # echo "creating $dirpart/$file"
+      echo '# dummy' > "$dirpart/$file"
+    done
+  done
+}
+])
+m4trace:/usr/share/aclocal-1.14/depout.m4:71: -1- AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles],
+     [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS],
+     [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"])
+])
+m4trace:/usr/share/aclocal-1.14/init.m4:29: -1- AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.65])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[AC_DIAGNOSE([obsolete],
+             [$0: two- and three-arguments forms are deprecated.])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+AC_REQUIRE([AM_SILENT_RULES])dnl
+dnl The testsuite driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This
+dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])
+  fi
+fi])
+m4trace:/usr/share/aclocal-1.14/init.m4:182: -1- AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+m4trace:/usr/share/aclocal-1.14/install-sh.m4:11: -1- AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST([install_sh])])
+m4trace:/usr/share/aclocal-1.14/lead-dot.m4:10: -1- AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+m4trace:/usr/share/aclocal-1.14/make.m4:12: -1- AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make}
+cat > confinc << 'END'
+am__doit:
+	@echo this is the am__doit target
+.PHONY: am__doit
+END
+# If we don't find an include directive, just comment out the code.
+AC_MSG_CHECKING([for style of include used by $am_make])
+am__include="#"
+am__quote=
+_am_result=none
+# First try GNU make style include.
+echo "include confinc" > confmf
+# Ignore all kinds of additional output from 'make'.
+case `$am_make -s -f confmf 2> /dev/null` in #(
+*the\ am__doit\ target*)
+  am__include=include
+  am__quote=
+  _am_result=GNU
+  ;;
+esac
+# Now try BSD make style include.
+if test "$am__include" = "#"; then
+   echo '.include "confinc"' > confmf
+   case `$am_make -s -f confmf 2> /dev/null` in #(
+   *the\ am__doit\ target*)
+     am__include=.include
+     am__quote="\""
+     _am_result=BSD
+     ;;
+   esac
+fi
+AC_SUBST([am__include])
+AC_SUBST([am__quote])
+AC_MSG_RESULT([$_am_result])
+rm -f confinc confmf
+])
+m4trace:/usr/share/aclocal-1.14/missing.m4:11: -1- AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+m4trace:/usr/share/aclocal-1.14/missing.m4:20: -1- AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  AC_MSG_WARN(['missing' script is too old or missing])
+fi
+])
+m4trace:/usr/share/aclocal-1.14/options.m4:11: -1- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+m4trace:/usr/share/aclocal-1.14/options.m4:17: -1- AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), [1])])
+m4trace:/usr/share/aclocal-1.14/options.m4:23: -1- AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+m4trace:/usr/share/aclocal-1.14/options.m4:29: -1- AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+m4trace:/usr/share/aclocal-1.14/prog-cc-c-o.m4:12: -1- AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([compile])dnl
+AC_LANG_PUSH([C])dnl
+AC_CACHE_CHECK(
+  [whether $CC understands -c and -o together],
+  [am_cv_prog_cc_c_o],
+  [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])])
+  # Make sure it works both with $CC and with simple cc.
+  # Following AC_PROG_CC_C_O, we do the test twice because some
+  # compilers refuse to overwrite an existing .o file with -o,
+  # though they will create one.
+  am_cv_prog_cc_c_o=yes
+  for am_i in 1 2; do
+    if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \
+         && test -f conftest2.$ac_objext; then
+      : OK
+    else
+      am_cv_prog_cc_c_o=no
+      break
+    fi
+  done
+  rm -f core conftest*
+  unset am_i])
+if test "$am_cv_prog_cc_c_o" != yes; then
+   # Losing compiler, so override with the script.
+   # FIXME: It is wrong to rewrite CC.
+   # But if we don't then we get into trouble of one sort or another.
+   # A longer-term fix would be to have automake use am__CC in this case,
+   # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)"
+   CC="$am_aux_dir/compile $CC"
+fi
+AC_LANG_POP([C])])
+m4trace:/usr/share/aclocal-1.14/prog-cc-c-o.m4:47: -1- AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])])
+m4trace:/usr/share/aclocal-1.14/runlog.m4:12: -1- AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD
+   ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD
+   ac_status=$?
+   echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+   (exit $ac_status); }])
+m4trace:/usr/share/aclocal-1.14/sanity.m4:11: -1- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane])
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
+m4trace:/usr/share/aclocal-1.14/silent.m4:12: -1- AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+esac
+dnl
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
+dnl do not support nested variable expansions.
+dnl See automake bug#9928 and bug#10237.
+am_make=${MAKE-make}
+AC_CACHE_CHECK([whether $am_make supports nested variables],
+   [am_cv_make_support_nested_variables],
+   [if AS_ECHO([['TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi])
+if test $am_cv_make_support_nested_variables = yes; then
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
+  AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AC_SUBST([AM_V])dnl
+AM_SUBST_NOTMAKE([AM_V])dnl
+AC_SUBST([AM_DEFAULT_V])dnl
+AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl
+AC_SUBST([AM_DEFAULT_VERBOSITY])dnl
+AM_BACKSLASH='\'
+AC_SUBST([AM_BACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
+])
+m4trace:/usr/share/aclocal-1.14/strip.m4:17: -1- AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+m4trace:/usr/share/aclocal-1.14/substnot.m4:12: -1- AC_DEFUN([_AM_SUBST_NOTMAKE])
+m4trace:/usr/share/aclocal-1.14/substnot.m4:17: -1- AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+m4trace:/usr/share/aclocal-1.14/tar.m4:23: -1- AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+
+m4_if([$1], [v7],
+  [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+
+  [m4_case([$1],
+    [ustar],
+     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.
+      # There is notably a 21 bits limit for the UID and the GID.  In fact,
+      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343
+      # and bug#13588).
+      am_max_uid=2097151 # 2^21 - 1
+      am_max_gid=$am_max_uid
+      # The $UID and $GID variables are not portable, so we need to resort
+      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls
+      # below are definitely unexpected, so allow the users to see them
+      # (that is, avoid stderr redirection).
+      am_uid=`id -u || echo unknown`
+      am_gid=`id -g || echo unknown`
+      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])
+      if test $am_uid -le $am_max_uid; then
+         AC_MSG_RESULT([yes])
+      else
+         AC_MSG_RESULT([no])
+         _am_tools=none
+      fi
+      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])
+      if test $am_gid -le $am_max_gid; then
+         AC_MSG_RESULT([yes])
+      else
+        AC_MSG_RESULT([no])
+        _am_tools=none
+      fi],
+
+  [pax],
+    [],
+
+  [m4_fatal([Unknown tar format])])
+
+  AC_MSG_CHECKING([how to create a $1 tar archive])
+
+  # Go ahead even if we have the value already cached.  We do so because we
+  # need to set the values for the 'am__tar' and 'am__untar' variables.
+  _am_tools=${am_cv_prog_tar_$1-$_am_tools}
+
+  for _am_tool in $_am_tools; do
+    case $_am_tool in
+    gnutar)
+      for _am_tar in tar gnutar gtar; do
+        AM_RUN_LOG([$_am_tar --version]) && break
+      done
+      am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+      am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+      am__untar="$_am_tar -xf -"
+      ;;
+    plaintar)
+      # Must skip GNU tar: if it does not support --format= it doesn't create
+      # ustar tarball either.
+      (tar --version) >/dev/null 2>&1 && continue
+      am__tar='tar chf - "$$tardir"'
+      am__tar_='tar chf - "$tardir"'
+      am__untar='tar xf -'
+      ;;
+    pax)
+      am__tar='pax -L -x $1 -w "$$tardir"'
+      am__tar_='pax -L -x $1 -w "$tardir"'
+      am__untar='pax -r'
+      ;;
+    cpio)
+      am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+      am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+      am__untar='cpio -i -H $1 -d'
+      ;;
+    none)
+      am__tar=false
+      am__tar_=false
+      am__untar=false
+      ;;
+    esac
+
+    # If the value was cached, stop now.  We just wanted to have am__tar
+    # and am__untar set.
+    test -n "${am_cv_prog_tar_$1}" && break
+
+    # tar/untar a dummy directory, and stop if the command works.
+    rm -rf conftest.dir
+    mkdir conftest.dir
+    echo GrepMe > conftest.dir/file
+    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+    rm -rf conftest.dir
+    if test -s conftest.tar; then
+      AM_RUN_LOG([$am__untar <conftest.tar])
+      AM_RUN_LOG([cat conftest.dir/file])
+      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+    fi
+  done
+  rm -rf conftest.dir
+
+  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+  AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([_AC_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^AS_FLAGS$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?m4_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^dnl$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?AS_])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^SHELL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PATH_SEPARATOR$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^exec_prefix$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^prefix$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^program_transform_name$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^bindir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sbindir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libexecdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datarootdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datadir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sysconfdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sharedstatedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localstatedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^includedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^oldincludedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^docdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^infodir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^htmldir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^dvidir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^pdfdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^psdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^mandir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^DEFS$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_C$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_N$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_T$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^LIBS$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^build_alias$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^host_alias$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^target_alias$])
+m4trace:configure.ac:4: -1- AM_INIT_AUTOMAKE
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_[A-Z]+FLAGS$])
+m4trace:configure.ac:4: -1- AM_SET_CURRENT_AUTOMAKE_VERSION
+m4trace:configure.ac:4: -1- AM_AUTOMAKE_VERSION([1.14.1])
+m4trace:configure.ac:4: -1- _AM_AUTOCONF_VERSION([2.69])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_PROGRAM$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_SCRIPT$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_DATA$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__isrc$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([am__isrc])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^CYGPATH_W$])
+m4trace:configure.ac:4: -1- _AM_SET_OPTIONS([])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([no-define], [], [AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([no-define])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AM_SANITY_CHECK
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+m4trace:configure.ac:4: -1- AM_MISSING_HAS_RUN
+m4trace:configure.ac:4: -1- AM_AUX_DIR_EXPAND
+m4trace:configure.ac:4: -1- m4_pattern_allow([^ACLOCAL$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOCONF], [autoconf])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOCONF$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOMAKE$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOHEADER], [autoheader])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOHEADER$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([MAKEINFO], [makeinfo])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MAKEINFO$])
+m4trace:configure.ac:4: -1- AM_PROG_INSTALL_SH
+m4trace:configure.ac:4: -1- m4_pattern_allow([^install_sh$])
+m4trace:configure.ac:4: -1- AM_PROG_INSTALL_STRIP
+m4trace:configure.ac:4: -1- m4_pattern_allow([^STRIP$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_STRIP_PROGRAM$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MKDIR_P$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^mkdir_p$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^SET_MAKE$])
+m4trace:configure.ac:4: -1- AM_SET_LEADING_DOT
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__leading_dot$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([tar-ustar])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([tar-pax])
+m4trace:configure.ac:4: -1- _AM_PROG_TAR([v7])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AMTAR$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__tar$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__untar$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([no-dependencies], [], [AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([no-dependencies])
+m4trace:configure.ac:4: -1- AM_SILENT_RULES
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_V$])
+m4trace:configure.ac:4: -1- AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_V$])
+m4trace:configure.ac:4: -1- AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_VERBOSITY$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_BACKSLASH$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_BACKSLASH])
+m4trace:configure.ac:6: -1- m4_pattern_allow([^LN_S$])
+m4trace:configure.ac:7: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:12: -1- PKG_CHECK_MODULES([APERTIUM], [apertium >= 3.4.0])
+m4trace:configure.ac:12: -1- PKG_PROG_PKG_CONFIG
+m4trace:configure.ac:12: -1- m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_PATH$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_LIBDIR$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:12: -1- PKG_CHECK_EXISTS([apertium >= 3.4.0], [pkg_cv_[]APERTIUM_CFLAGS=`$PKG_CONFIG --[]cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:12: -1- PKG_CHECK_EXISTS([apertium >= 3.4.0], [pkg_cv_[]APERTIUM_LIBS=`$PKG_CONFIG --[]libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:12: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:13: -1- PKG_CHECK_MODULES([LTTOOLBOX], [lttoolbox >= 3.3.2])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_CFLAGS$])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_LIBS$])
+m4trace:configure.ac:13: -1- PKG_CHECK_EXISTS([lttoolbox >= 3.3.2], [pkg_cv_[]LTTOOLBOX_CFLAGS=`$PKG_CONFIG --[]cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:13: -1- PKG_CHECK_EXISTS([lttoolbox >= 3.3.2], [pkg_cv_[]LTTOOLBOX_LIBS=`$PKG_CONFIG --[]libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:13: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:15: -1- m4_pattern_allow([^CGCOMP$])
+m4trace:configure.ac:19: -1- AP_MKINCLUDE
+m4trace:configure.ac:19: -1- m4_pattern_allow([^ap_include$])
+m4trace:configure.ac:21: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
+You should run autoupdate.], [])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LIB@&t@OBJS$])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LTLIBOBJS$])
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/traces.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/traces.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/autom4te.cache/traces.1	(revision 70339)
@@ -0,0 +1,305 @@
+m4trace:configure.ac:3: -1- AC_INIT([Apertium {{languageName1}}-{{languageName2}}], [0.1.0], [super-antispam@ya.ru], [apertium-{{languageCode1}}-{{languageCode2}}], [http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([_AC_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^AS_FLAGS$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?m4_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^dnl$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?AS_])
+m4trace:configure.ac:3: -1- AC_SUBST([SHELL])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([SHELL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^SHELL$])
+m4trace:configure.ac:3: -1- AC_SUBST([PATH_SEPARATOR])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PATH_SEPARATOR])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PATH_SEPARATOR$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_NAME], [m4_ifdef([AC_PACKAGE_NAME],      ['AC_PACKAGE_NAME'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_NAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_TARNAME], [m4_ifdef([AC_PACKAGE_TARNAME],   ['AC_PACKAGE_TARNAME'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_VERSION], [m4_ifdef([AC_PACKAGE_VERSION],   ['AC_PACKAGE_VERSION'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_STRING], [m4_ifdef([AC_PACKAGE_STRING],    ['AC_PACKAGE_STRING'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_STRING])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_BUGREPORT], [m4_ifdef([AC_PACKAGE_BUGREPORT], ['AC_PACKAGE_BUGREPORT'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_URL], [m4_ifdef([AC_PACKAGE_URL],       ['AC_PACKAGE_URL'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_URL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- AC_SUBST([exec_prefix], [NONE])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([exec_prefix])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^exec_prefix$])
+m4trace:configure.ac:3: -1- AC_SUBST([prefix], [NONE])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([prefix])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^prefix$])
+m4trace:configure.ac:3: -1- AC_SUBST([program_transform_name], [s,x,x,])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([program_transform_name])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^program_transform_name$])
+m4trace:configure.ac:3: -1- AC_SUBST([bindir], ['${exec_prefix}/bin'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([bindir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^bindir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sbindir], ['${exec_prefix}/sbin'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sbindir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sbindir$])
+m4trace:configure.ac:3: -1- AC_SUBST([libexecdir], ['${exec_prefix}/libexec'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([libexecdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libexecdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([datarootdir], ['${prefix}/share'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([datarootdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datarootdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([datadir], ['${datarootdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([datadir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datadir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sysconfdir], ['${prefix}/etc'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sysconfdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sysconfdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sharedstatedir], ['${prefix}/com'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sharedstatedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sharedstatedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([localstatedir], ['${prefix}/var'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([localstatedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localstatedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([includedir], ['${prefix}/include'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([includedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^includedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([oldincludedir], ['/usr/include'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([oldincludedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^oldincludedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([docdir], [m4_ifset([AC_PACKAGE_TARNAME],
+				     ['${datarootdir}/doc/${PACKAGE_TARNAME}'],
+				     ['${datarootdir}/doc/${PACKAGE}'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([docdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^docdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([infodir], ['${datarootdir}/info'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([infodir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^infodir$])
+m4trace:configure.ac:3: -1- AC_SUBST([htmldir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([htmldir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^htmldir$])
+m4trace:configure.ac:3: -1- AC_SUBST([dvidir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([dvidir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^dvidir$])
+m4trace:configure.ac:3: -1- AC_SUBST([pdfdir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([pdfdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^pdfdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([psdir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([psdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^psdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([libdir], ['${exec_prefix}/lib'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([libdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([localedir], ['${datarootdir}/locale'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([localedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([mandir], ['${datarootdir}/man'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([mandir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^mandir$])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_NAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_NAME], [/* Define to the full name of this package. */
+@%:@undef PACKAGE_NAME])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_TARNAME], [/* Define to the one symbol short name of this package. */
+@%:@undef PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_VERSION], [/* Define to the version of this package. */
+@%:@undef PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_STRING])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_STRING], [/* Define to the full name and version of this package. */
+@%:@undef PACKAGE_STRING])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_BUGREPORT], [/* Define to the address where bug reports for this package should be sent. */
+@%:@undef PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_URL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_URL], [/* Define to the home page for this package. */
+@%:@undef PACKAGE_URL])
+m4trace:configure.ac:3: -1- AC_SUBST([DEFS])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([DEFS])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^DEFS$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_C])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_C])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_C$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_N])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_N])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_N$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_T])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_T])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_T$])
+m4trace:configure.ac:3: -1- AC_SUBST([LIBS])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([LIBS])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^LIBS$])
+m4trace:configure.ac:3: -1- AC_SUBST([build_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([build_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^build_alias$])
+m4trace:configure.ac:3: -1- AC_SUBST([host_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([host_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^host_alias$])
+m4trace:configure.ac:3: -1- AC_SUBST([target_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([target_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^target_alias$])
+m4trace:configure.ac:4: -1- AM_INIT_AUTOMAKE
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_[A-Z]+FLAGS$])
+m4trace:configure.ac:4: -1- AM_AUTOMAKE_VERSION([1.14.1])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([install-sh])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_PROGRAM])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_PROGRAM])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_PROGRAM$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_SCRIPT])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_SCRIPT])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_SCRIPT$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_DATA])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_DATA])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_DATA$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__isrc], [' -I$(srcdir)'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__isrc])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__isrc$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([am__isrc])
+m4trace:configure.ac:4: -1- AC_SUBST([CYGPATH_W])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([CYGPATH_W])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^CYGPATH_W$])
+m4trace:configure.ac:4: -1- AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([PACKAGE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([VERSION])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- AH_OUTPUT([PACKAGE], [/* Name of package */
+@%:@undef PACKAGE])
+m4trace:configure.ac:4: -1- AC_DEFINE_TRACE_LITERAL([VERSION])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AH_OUTPUT([VERSION], [/* Version number of package */
+@%:@undef VERSION])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([missing])
+m4trace:configure.ac:4: -1- AC_SUBST([ACLOCAL])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([ACLOCAL])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^ACLOCAL$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOCONF])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOCONF])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOCONF$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOMAKE])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOMAKE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOMAKE$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOHEADER])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOHEADER])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOHEADER$])
+m4trace:configure.ac:4: -1- AC_SUBST([MAKEINFO])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([MAKEINFO])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MAKEINFO$])
+m4trace:configure.ac:4: -1- AC_SUBST([install_sh])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([install_sh])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^install_sh$])
+m4trace:configure.ac:4: -1- AC_SUBST([STRIP])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([STRIP])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^STRIP$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_STRIP_PROGRAM])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_STRIP_PROGRAM])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_STRIP_PROGRAM$])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([install-sh])
+m4trace:configure.ac:4: -1- AC_SUBST([MKDIR_P])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([MKDIR_P])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MKDIR_P$])
+m4trace:configure.ac:4: -1- AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([mkdir_p])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^mkdir_p$])
+m4trace:configure.ac:4: -1- AC_SUBST([AWK])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AWK])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:4: -1- AC_SUBST([SET_MAKE])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([SET_MAKE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^SET_MAKE$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__leading_dot])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__leading_dot])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__leading_dot$])
+m4trace:configure.ac:4: -1- AC_SUBST([AMTAR], ['$${TAR-tar}'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AMTAR])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AMTAR$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__tar])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__tar])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__tar$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__untar])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__untar])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__untar$])
+m4trace:configure.ac:4: -1- AM_SILENT_RULES
+m4trace:configure.ac:4: -1- AC_SUBST([AM_V])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_V$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_V$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_DEFAULT_VERBOSITY])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_DEFAULT_VERBOSITY])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_VERBOSITY$])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_BACKSLASH])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_BACKSLASH])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_BACKSLASH$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_BACKSLASH])
+m4trace:configure.ac:6: -1- AC_SUBST([LN_S], [$as_ln_s])
+m4trace:configure.ac:6: -1- AC_SUBST_TRACE([LN_S])
+m4trace:configure.ac:6: -1- m4_pattern_allow([^LN_S$])
+m4trace:configure.ac:7: -1- AC_SUBST([AWK])
+m4trace:configure.ac:7: -1- AC_SUBST_TRACE([AWK])
+m4trace:configure.ac:7: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:12: -1- m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG_PATH])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG_PATH])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_PATH$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG_LIBDIR])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG_LIBDIR])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_LIBDIR$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- AC_SUBST([APERTIUM_CFLAGS])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([APERTIUM_CFLAGS])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:12: -1- AC_SUBST([APERTIUM_LIBS])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([APERTIUM_LIBS])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:13: -1- AC_SUBST([LTTOOLBOX_CFLAGS])
+m4trace:configure.ac:13: -1- AC_SUBST_TRACE([LTTOOLBOX_CFLAGS])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_CFLAGS$])
+m4trace:configure.ac:13: -1- AC_SUBST([LTTOOLBOX_LIBS])
+m4trace:configure.ac:13: -1- AC_SUBST_TRACE([LTTOOLBOX_LIBS])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_LIBS$])
+m4trace:configure.ac:15: -1- AC_SUBST([CGCOMP])
+m4trace:configure.ac:15: -1- AC_SUBST_TRACE([CGCOMP])
+m4trace:configure.ac:15: -1- m4_pattern_allow([^CGCOMP$])
+m4trace:configure.ac:19: -1- m4_pattern_allow([^ap_include$])
+m4trace:configure.ac:21: -1- AC_CONFIG_FILES([Makefile apertium-eng.pc])
+m4trace:configure.ac:21: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
+You should run autoupdate.], [])
+m4trace:configure.ac:21: -1- AC_SUBST([LIB@&t@OBJS], [$ac_libobjs])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([LIB@&t@OBJS])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LIB@&t@OBJS$])
+m4trace:configure.ac:21: -1- AC_SUBST([LTLIBOBJS], [$ac_ltlibobjs])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([LTLIBOBJS])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LTLIBOBJS$])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([top_builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([top_build_prefix])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([top_srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_top_srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_top_builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([INSTALL])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([MKDIR_P])
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.log
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.log	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.log	(revision 70339)
@@ -0,0 +1,241 @@
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} configure 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ ./configure 
+
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = NM-HP
+uname -m = x86_64
+uname -r = 3.13.0-30-generic
+uname -s = Linux
+uname -v = #55-Ubuntu SMP Fri Jul 4 21:40:53 UTC 2014
+
+/usr/bin/uname -p = unknown
+/bin/uname -X     = unknown
+
+/bin/arch              = unknown
+/usr/bin/arch -k       = unknown
+/usr/convex/getsysinfo = unknown
+/usr/bin/hostinfo      = unknown
+/bin/machine           = unknown
+/usr/bin/oslevel       = unknown
+/bin/universe          = unknown
+
+PATH: /usr/local/sbin
+PATH: /usr/local/bin
+PATH: /usr/sbin
+PATH: /usr/bin
+PATH: /sbin
+PATH: /bin
+PATH: /usr/games
+PATH: /usr/local/games
+PATH: /usr/local/bin
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+configure:1788: checking for a BSD-compatible install
+configure:1856: result: /usr/bin/install -c
+configure:1867: checking whether build environment is sane
+configure:1922: result: yes
+configure:2073: checking for a thread-safe mkdir -p
+configure:2112: result: /bin/mkdir -p
+configure:2119: checking for gawk
+configure:2135: found /usr/bin/gawk
+configure:2146: result: gawk
+configure:2157: checking whether make sets $(MAKE)
+configure:2179: result: yes
+configure:2208: checking whether make supports nested variables
+configure:2225: result: yes
+configure:2351: checking whether ln -s works
+configure:2355: result: yes
+configure:2366: checking for gawk
+configure:2393: result: gawk
+configure:2462: checking for pkg-config
+configure:2480: found /usr/bin/pkg-config
+configure:2492: result: /usr/bin/pkg-config
+configure:2517: checking pkg-config is at least version 0.9.0
+configure:2520: result: yes
+configure:2530: checking for APERTIUM
+configure:2537: $PKG_CONFIG --exists --print-errors "apertium >= 3.4.0"
+configure:2540: $? = 0
+configure:2554: $PKG_CONFIG --exists --print-errors "apertium >= 3.4.0"
+configure:2557: $? = 0
+configure:2615: result: yes
+configure:2621: checking for LTTOOLBOX
+configure:2628: $PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2"
+configure:2631: $? = 0
+configure:2645: $PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2"
+configure:2648: $? = 0
+configure:2706: result: yes
+configure:2713: checking for cg-comp
+configure:2731: found /usr/bin/cg-comp
+configure:2744: result: /usr/bin/cg-comp
+configure:2969: checking that generated files are newer than configure
+configure:2975: result: done
+configure:2983: creating ./config.status
+
+## ---------------------- ##
+## Running config.status. ##
+## ---------------------- ##
+
+This file was extended by Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = 
+  CONFIG_HEADERS  = 
+  CONFIG_LINKS    = 
+  CONFIG_COMMANDS = 
+  $ ./config.status 
+
+on NM-HP
+
+config.status:782: creating Makefile
+config.status:782: creating apertium-eng.pc
+
+## ---------------- ##
+## Cache variables. ##
+## ---------------- ##
+
+ac_cv_env_APERTIUM_CFLAGS_set=
+ac_cv_env_APERTIUM_CFLAGS_value=
+ac_cv_env_APERTIUM_LIBS_set=
+ac_cv_env_APERTIUM_LIBS_value=
+ac_cv_env_LTTOOLBOX_CFLAGS_set=
+ac_cv_env_LTTOOLBOX_CFLAGS_value=
+ac_cv_env_LTTOOLBOX_LIBS_set=
+ac_cv_env_LTTOOLBOX_LIBS_value=
+ac_cv_env_PKG_CONFIG_LIBDIR_set=
+ac_cv_env_PKG_CONFIG_LIBDIR_value=
+ac_cv_env_PKG_CONFIG_PATH_set=set
+ac_cv_env_PKG_CONFIG_PATH_value=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig
+ac_cv_env_PKG_CONFIG_set=
+ac_cv_env_PKG_CONFIG_value=
+ac_cv_env_build_alias_set=
+ac_cv_env_build_alias_value=
+ac_cv_env_host_alias_set=
+ac_cv_env_host_alias_value=
+ac_cv_env_target_alias_set=
+ac_cv_env_target_alias_value=
+ac_cv_path_CGCOMP=/usr/bin/cg-comp
+ac_cv_path_ac_pt_PKG_CONFIG=/usr/bin/pkg-config
+ac_cv_path_install='/usr/bin/install -c'
+ac_cv_path_mkdir=/bin/mkdir
+ac_cv_prog_AWK=gawk
+ac_cv_prog_make_make_set=yes
+am_cv_make_support_nested_variables=yes
+pkg_cv_APERTIUM_CFLAGS='-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+pkg_cv_APERTIUM_LIBS='-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  '
+pkg_cv_LTTOOLBOX_CFLAGS='-I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+pkg_cv_LTTOOLBOX_LIBS='-L/usr/local/lib -llttoolbox3 -lxml2  '
+
+## ----------------- ##
+## Output variables. ##
+## ----------------- ##
+
+ACLOCAL='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing aclocal-1.14'
+AMTAR='$${TAR-tar}'
+AM_BACKSLASH='\'
+AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+AM_DEFAULT_VERBOSITY='1'
+AM_V='$(V)'
+APERTIUM_CFLAGS='-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+APERTIUM_LIBS='-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  '
+AUTOCONF='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing autoconf'
+AUTOHEADER='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing autoheader'
+AUTOMAKE='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing automake-1.14'
+AWK='gawk'
+CGCOMP='/usr/bin/cg-comp'
+CYGPATH_W='echo'
+DEFS='-DPACKAGE_NAME=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\" -DPACKAGE_TARNAME=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE_VERSION=\"0.1.0\" -DPACKAGE_STRING=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\ 0.1.0\" -DPACKAGE_BUGREPORT=\"super-antispam@ya.ru\" -DPACKAGE_URL=\"http://wiki.apertium.org/wiki/Apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DVERSION=\"0.1.0\"'
+ECHO_C=''
+ECHO_N='-n'
+ECHO_T=''
+INSTALL_DATA='${INSTALL} -m 644'
+INSTALL_PROGRAM='${INSTALL}'
+INSTALL_SCRIPT='${INSTALL}'
+INSTALL_STRIP_PROGRAM='$(install_sh) -c -s'
+LIBOBJS=''
+LIBS=''
+LN_S='ln -s'
+LTLIBOBJS=''
+LTTOOLBOX_CFLAGS='-I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+LTTOOLBOX_LIBS='-L/usr/local/lib -llttoolbox3 -lxml2  '
+MAKEINFO='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing makeinfo'
+MKDIR_P='/bin/mkdir -p'
+PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PATH_SEPARATOR=':'
+PKG_CONFIG='/usr/bin/pkg-config'
+PKG_CONFIG_LIBDIR=''
+PKG_CONFIG_PATH='/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig'
+SET_MAKE=''
+SHELL='/bin/bash'
+STRIP=''
+VERSION='0.1.0'
+am__isrc=''
+am__leading_dot='.'
+am__tar='$${TAR-tar} chof - "$$tardir"'
+am__untar='$${TAR-tar} xf -'
+bindir='${exec_prefix}/bin'
+build_alias=''
+datadir='${datarootdir}'
+datarootdir='${prefix}/share'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+dvidir='${docdir}'
+exec_prefix='${prefix}'
+host_alias=''
+htmldir='${docdir}'
+includedir='${prefix}/include'
+infodir='${datarootdir}/info'
+install_sh='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/install-sh'
+libdir='${exec_prefix}/lib'
+libexecdir='${exec_prefix}/libexec'
+localedir='${datarootdir}/locale'
+localstatedir='${prefix}/var'
+mandir='${datarootdir}/man'
+mkdir_p='$(MKDIR_P)'
+oldincludedir='/usr/include'
+pdfdir='${docdir}'
+prefix='/usr/local'
+program_transform_name='s,x,x,'
+psdir='${docdir}'
+sbindir='${exec_prefix}/sbin'
+sharedstatedir='${prefix}/com'
+sysconfdir='${prefix}/etc'
+target_alias=''
+
+## ------------------- ##
+## File substitutions. ##
+## ------------------- ##
+
+ap_include='./ap_include.am'
+
+## ----------- ##
+## confdefs.h. ##
+## ----------- ##
+
+/* confdefs.h */
+#define PACKAGE_NAME "Apertium {{languageName1}}-{{languageName2}}"
+#define PACKAGE_TARNAME "apertium-{{languageCode1}}-{{languageCode2}}"
+#define PACKAGE_VERSION "0.1.0"
+#define PACKAGE_STRING "Apertium {{languageName1}}-{{languageName2}} 0.1.0"
+#define PACKAGE_BUGREPORT "super-antispam@ya.ru"
+#define PACKAGE_URL "http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}"
+#define PACKAGE "apertium-{{languageCode1}}-{{languageCode2}}"
+#define VERSION "0.1.0"
+
+configure: exit 0
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.status
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.status	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.status	(revision 70339)
@@ -0,0 +1,965 @@
+#! /bin/bash
+# Generated by configure.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=${CONFIG_SHELL-/bin/bash}
+export SHELL
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+# Files that config.status was made for.
+config_files=" Makefile apertium-eng.pc"
+
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+ac_cs_config="'PKG_CONFIG_PATH=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig'"
+ac_cs_version="\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by ./configure, generated by GNU Autoconf 2.69,
+  with options \"$ac_cs_config\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng'
+srcdir='.'
+INSTALL='/usr/bin/install -c'
+MKDIR_P='/bin/mkdir -p'
+AWK='gawk'
+test -n "$AWK" || AWK=awk
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+if $ac_cs_recheck; then
+  set X /bin/bash './configure'  'PKG_CONFIG_PATH=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig' $ac_configure_extra_args --no-create --no-recursion
+  shift
+  $as_echo "running CONFIG_SHELL=/bin/bash $*" >&6
+  CONFIG_SHELL='/bin/bash'
+  export CONFIG_SHELL
+  exec "$@"
+fi
+
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-eng.pc") CONFIG_FILES="$CONFIG_FILES apertium-eng.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+cat >>"$ac_tmp/subs1.awk" <<\_ACAWK &&
+F["ap_include"]="./ap_include.am"
+_ACAWK
+cat >>"$ac_tmp/subs1.awk" <<\_ACAWK &&
+S["LTLIBOBJS"]=""
+S["LIBOBJS"]=""
+S["CGCOMP"]="/usr/bin/cg-comp"
+S["LTTOOLBOX_LIBS"]="-L/usr/local/lib -llttoolbox3 -lxml2  "
+S["LTTOOLBOX_CFLAGS"]="-I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  "
+S["APERTIUM_LIBS"]="-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  "
+S["APERTIUM_CFLAGS"]="-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I"\
+"/usr/include/libxml2  "
+S["PKG_CONFIG_LIBDIR"]=""
+S["PKG_CONFIG_PATH"]="/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig"
+S["PKG_CONFIG"]="/usr/bin/pkg-config"
+S["LN_S"]="ln -s"
+S["AM_BACKSLASH"]="\\"
+S["AM_DEFAULT_VERBOSITY"]="1"
+S["AM_DEFAULT_V"]="$(AM_DEFAULT_VERBOSITY)"
+S["AM_V"]="$(V)"
+S["am__untar"]="$${TAR-tar} xf -"
+S["am__tar"]="$${TAR-tar} chof - \"$$tardir\""
+S["AMTAR"]="$${TAR-tar}"
+S["am__leading_dot"]="."
+S["SET_MAKE"]=""
+S["AWK"]="gawk"
+S["mkdir_p"]="$(MKDIR_P)"
+S["MKDIR_P"]="/bin/mkdir -p"
+S["INSTALL_STRIP_PROGRAM"]="$(install_sh) -c -s"
+S["STRIP"]=""
+S["install_sh"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/install-sh"
+S["MAKEINFO"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing makeinfo"
+S["AUTOHEADER"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing autoheader"
+S["AUTOMAKE"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing automake-1.14"
+S["AUTOCONF"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing autoconf"
+S["ACLOCAL"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/missing aclocal-1.14"
+S["VERSION"]="0.1.0"
+S["PACKAGE"]="apertium-{{languageCode1}}-{{languageCode2}}"
+S["CYGPATH_W"]="echo"
+S["am__isrc"]=""
+S["INSTALL_DATA"]="${INSTALL} -m 644"
+S["INSTALL_SCRIPT"]="${INSTALL}"
+S["INSTALL_PROGRAM"]="${INSTALL}"
+S["target_alias"]=""
+S["host_alias"]=""
+S["build_alias"]=""
+S["LIBS"]=""
+S["ECHO_T"]=""
+S["ECHO_N"]="-n"
+S["ECHO_C"]=""
+S["DEFS"]="-DPACKAGE_NAME=\\\"Apertium\\ \\{\\{languageName1\\}\\}-\\{\\{languageName2\\}\\}\\\" -DPACKAGE_TARNAME=\\\"apertium-\\{\\{languageCode1\\}\\}-\\{\\{languageCode2\\}\\}\\\" "\
+"-DPACKAGE_VERSION=\\\"0.1.0\\\" -DPACKAGE_STRING=\\\"Apertium\\ \\{\\{languageName1\\}\\}-\\{\\{languageName2\\}\\}\\ 0.1.0\\\" -DPACKAGE_BUGREPORT=\\\"super-antispam@y"\
+"a.ru\\\" -DPACKAGE_URL=\\\"http://wiki.apertium.org/wiki/Apertium-\\{\\{languageCode1\\}\\}-\\{\\{languageCode2\\}\\}\\\" -DPACKAGE=\\\"apertium-\\{\\{languageCode1\\}"\
+"\\}-\\{\\{languageCode2\\}\\}\\\" -DVERSION=\\\"0.1.0\\\""
+S["mandir"]="${datarootdir}/man"
+S["localedir"]="${datarootdir}/locale"
+S["libdir"]="${exec_prefix}/lib"
+S["psdir"]="${docdir}"
+S["pdfdir"]="${docdir}"
+S["dvidir"]="${docdir}"
+S["htmldir"]="${docdir}"
+S["infodir"]="${datarootdir}/info"
+S["docdir"]="${datarootdir}/doc/${PACKAGE_TARNAME}"
+S["oldincludedir"]="/usr/include"
+S["includedir"]="${prefix}/include"
+S["localstatedir"]="${prefix}/var"
+S["sharedstatedir"]="${prefix}/com"
+S["sysconfdir"]="${prefix}/etc"
+S["datadir"]="${datarootdir}"
+S["datarootdir"]="${prefix}/share"
+S["libexecdir"]="${exec_prefix}/libexec"
+S["sbindir"]="${exec_prefix}/sbin"
+S["bindir"]="${exec_prefix}/bin"
+S["program_transform_name"]="s,x,x,"
+S["prefix"]="/usr/local"
+S["exec_prefix"]="${prefix}"
+S["PACKAGE_URL"]="http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}"
+S["PACKAGE_BUGREPORT"]="super-antispam@ya.ru"
+S["PACKAGE_STRING"]="Apertium {{languageName1}}-{{languageName2}} 0.1.0"
+S["PACKAGE_VERSION"]="0.1.0"
+S["PACKAGE_TARNAME"]="apertium-{{languageCode1}}-{{languageCode2}}"
+S["PACKAGE_NAME"]="Apertium {{languageName1}}-{{languageName2}}"
+S["PATH_SEPARATOR"]=":"
+S["SHELL"]="/bin/bash"
+_ACAWK
+cat >>"$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  $ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      $ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+$ac_cs_awk_pipe_fini
+_ACAWK
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+  ac_datarootdir_hack='
+  s&@datadir@&${datarootdir}&g
+  s&@docdir@&${datarootdir}/doc/${PACKAGE_TARNAME}&g
+  s&@infodir@&${datarootdir}/info&g
+  s&@localedir@&${datarootdir}/locale&g
+  s&@mandir@&${datarootdir}/man&g
+  s&\${datarootdir}&${prefix}/share&g' ;;
+esac
+ac_sed_extra="/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}
+
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+
+
+
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/config.status
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure	(revision 70339)
@@ -0,0 +1,4043 @@
+#! /bin/sh
+# Guess values for system-dependent variables and create Makefiles.
+# Generated by GNU Autoconf 2.69 for Apertium {{languageName1}}-{{languageName2}} 0.1.0.
+#
+# Report bugs to <super-antispam@ya.ru>.
+#
+#
+# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+#
+#
+# This configure script is free software; the Free Software Foundation
+# gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in #(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIBOBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+
+ac_subst_vars='LTLIBOBJS
+LIBOBJS
+CGCOMP
+LTTOOLBOX_LIBS
+LTTOOLBOX_CFLAGS
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+LTTOOLBOX_CFLAGS
+LTTOOLBOX_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium {{languageName1}}-{{languageName2}} 0.1.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          [$ac_default_prefix]
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          [PREFIX]
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          [DATAROOTDIR/doc/apertium-{{languageCode1}}-{{languageCode2}}]
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium {{languageName1}}-{{languageName2}} 0.1.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS
+              linker flags for APERTIUM, overriding pkg-config
+  LTTOOLBOX_CFLAGS
+              C compiler flags for LTTOOLBOX, overriding pkg-config
+  LTTOOLBOX_LIBS
+              linker flags for LTTOOLBOX, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium {{languageName1}}-{{languageName2}} configure 0.1.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in #((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in #((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+# Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules;
+fi
+
+case $enable_silent_rules in # (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+ VERSION='0.1.0'
+
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE "$PACKAGE"
+_ACEOF
+
+
+cat >>confdefs.h <<_ACEOF
+#define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for LTTOOLBOX" >&5
+$as_echo_n "checking for LTTOOLBOX... " >&6; }
+
+if test -n "$LTTOOLBOX_CFLAGS"; then
+    pkg_cv_LTTOOLBOX_CFLAGS="$LTTOOLBOX_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_CFLAGS=`$PKG_CONFIG --cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$LTTOOLBOX_LIBS"; then
+    pkg_cv_LTTOOLBOX_LIBS="$LTTOOLBOX_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_LIBS=`$PKG_CONFIG --libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        else
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$LTTOOLBOX_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (lttoolbox >= 3.3.2) were not met:
+
+$LTTOOLBOX_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	LTTOOLBOX_CFLAGS=$pkg_cv_LTTOOLBOX_CFLAGS
+	LTTOOLBOX_LIBS=$pkg_cv_LTTOOLBOX_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+
+
+
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\$*.autobil.att > .deps/\$*.autobil.hfst
+	hfst-project -p upper .deps/\$*.autobil.hfst > .deps/\$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/\$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\$*.autobil.upper -2 .deps/\$*.any-nonplus.hfst -o .deps/\$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\$*.single-plus.hfst -2 .deps/\$*.autobil.nonplussed -o .deps/\$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\$*.autobil.postplus -o .deps/\$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\$*.autobil.nonplussed -2 .deps/\$*.autobil.postplus.0,3 -o \$@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile apertium-eng.pc"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIBOBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-eng.pc") CONFIG_FILES="$CONFIG_FILES apertium-eng.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F["&"]="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+
+
+
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure.ac
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure.ac	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/configure.ac	(revision 70339)
@@ -0,0 +1,22 @@
+AC_PREREQ(2.52)
+
+AC_INIT([Apertium {{languageName1}}-{{languageName2}}], [0.1.0], [super-antispam@ya.ru], [apertium-{{languageCode1}}-{{languageCode2}}], [http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}])
+AM_INIT_AUTOMAKE
+
+AC_PROG_LN_S
+AC_PROG_AWK
+
+m4_define([required_apertium_version], [3.4.0])
+m4_define([required_lttoolbox_version], [3.3.2])
+
+PKG_CHECK_MODULES(APERTIUM, apertium >= required_apertium_version)
+PKG_CHECK_MODULES(LTTOOLBOX, lttoolbox >= required_lttoolbox_version)
+
+AC_PATH_PROG([CGCOMP], [cg-comp], [false], [$PATH$PATH_SEPARATOR$with_cg_comp/bin])
+AS_IF([test x$CGCOMP = xfalse], [AC_MSG_ERROR([You don't have cg-comp installed])])
+
+
+AP_MKINCLUDE
+
+AC_OUTPUT([Makefile apertium-eng.pc])
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.att.gz
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.att.gz
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.att.gz	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.att.gz	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.att.gz
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autogen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.att.gz
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.att.gz
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.att.gz	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.att.gz	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.att.gz
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autopgen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autopgen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autopgen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autopgen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.autopgen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.prob
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.prob	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.prob	(revision 70339)
@@ -0,0 +1,50 @@
+$































**7	
+80 0!11!22 
+@B@T@A@G@_@L@P@A@R@T@A@G@_@R@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@C@M@T@A@G@_@S@E@N@T@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F
+@E@V@E@R@Y@T@H@I@N@G@V@A@N@A@D@V@T@E@P@R@E@A@D@V@D@E@H@E@T@N@O@U@N@N@O@U@N@P@L@N@O@U@N@M@N@O@U@N@F@N@O@U@N@M@F@N@O@U@N@N@T@N@O@U@N@A@C@R@A@D@J@P@R@E@D@A@D@J@A@T@T@R@A@D@J@P@A@R@T@A@D@J@A@D@J@S@I@N@T@P@R@E@D@A@D@J@S@I@N@T@A@T@T@R@A@D@J@S@I@N@T@A@D@V@V@B@L@E@X@I@M@P@V@B@L@E@X@I@N@F@V@B@L@E@X@V@E@R@B@V@E@R@B@P1@V@E@R@B@P2@V@E@R@B@P3@V@A@U@X@V@B@M@O@D@V@B@S@E@R@V@B@H@A@V@E@R@V@B@S@E@P@C@N@J@C@O@O@C@N@J@S@U@B@C@N@J@A@D@V@P@R@N@N@P@A@N@T@N@P@T@O@P@N@P@C@O@G@N@P@A@L@P@R	@P@R@N@S@U@B@J@P1	@P@R@N@S@U@B@J@P2	@P@R@N@S@U@B@J@P3@R@E@L@P@R@E@A@D@V@I@J@N@U@M@D@E@T@D@E@T@D@E@F@D@E@T@I@N@D@P@U@N@C@k@M@O@T@k@D@O@L@L@A@R@k@B@A@R@R@A@k@M@A@S@k@I@G@N@O@R@A@R@k@B@E@G@I@N@k@U@N@K@N@O@W@N;@T@A@G@_@A@D@J@T@A@G@_@A@D@J@A@T@T@R@T@A@G@_@A@D@J@P@A@R@T@T@A@G@_@A@D@J@P@R@E@D@T@A@G@_@A@D@J@S@I@N@T@T@A@G@_@A@D@J@S@I@N@T@A@T@T@R@T@A@G@_@A@D@J@S@I@N@T@P@R@E@D@T@A@G@_@A@D@V@T@A@G@_@C@M
+@T@A@G@_@C@N@J@A@D@V)
+@T@A@G@_@C@N@J@C@O@O'
+@T@A@G@_@C@N@J@S@U@B(@T@A@G@_@D@E
+@T@A@G@_@D@E@T7
+@T@A@G@_@D@E@T@D@E@F8
+@T@A@G@_@D@E@T@I@N@D9@T@A@G@_@E@V@E@R@Y@T@H@I@N@G@T@A@G@_@H@E@T@T@A@G@_@I@J5@T@A@G@_@L@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@N@O@U@N@T@A@G@_@N@O@U@N@A@C@R	@T@A@G@_@N@O@U@N@F	@T@A@G@_@N@O@U@N@M
+@T@A@G@_@N@O@U@N@M@F
+@T@A@G@_@N@O@U@N@N@T
+@T@A@G@_@N@O@U@N@P@L
+@T@A@G@_@N@P@A@L.	@T@A@G@_@N@P@A@N@T+	@T@A@G@_@N@P@C@O@G-	@T@A@G@_@N@P@T@O@P,@T@A@G@_@N@U@M6@T@A@G@_@P@R/
+@T@A@G@_@P@R@E@A@D@V4@T@A@G@_@P@R@N*
+@T@A@G@_@P@R@N@S@U@B@J@P10
+@T@A@G@_@P@R@N@S@U@B@J@P21
+@T@A@G@_@P@R@N@S@U@B@J@P32@T@A@G@_@P@U@N@C:@T@A@G@_@R@E@L3@T@A@G@_@R@P@A@R
@T@A@G@_@S@E@N@T@T@A@G@_@T@E@P@R@E@A@D@V	
+@T@A@G@_@V@A@N@A@D@V@T@A@G@_@V@A@U@X"@T@A@G@_@V@B@H@A@V@E@R%	@T@A@G@_@V@B@L@E@X@T@A@G@_@V@B@L@E@X@I@M@P@T@A@G@_@V@B@L@E@X@I@N@F	@T@A@G@_@V@B@M@O@D#	@T@A@G@_@V@B@S@E@P&	@T@A@G@_@V@B@S@E@R$@T@A@G@_@V@E@R@B
+@T@A@G@_@V@E@R@B@P1
+@T@A@G@_@V@E@R@B@P2 
+@T@A@G@_@V@E@R@B@P3!@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F@k@B@A@R@R@A=@k@B@E@G@I@N@@@k@D@O@L@L@A@R<@k@I@G@N@O@R@A@R?@k@M@A@S>@k@M@O@T;@k@U@N@K@N@O@W@N@A<






$	
+
+ !"#&+,-.56



	

+



+


















 
!
"
#
$
%
&
'
(
)
*
+
,
-
.
/
0
1
2
3
4
5
6
7
8
9
:;<?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'�8�8�8�8�8?��8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́?��}�&Q=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'@_?�
?�?�?�
?�?�?�?�?�?�	?�	?�	
+?�
+?�
+?�?�?�?�
+?�
+?�
+?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?� ?� ?� !?�!?�!"?�"?�"#?�#?�#$?�$%?�%&?�&?�&'?�'(?�()?�)*?�*+?�+?�+,?�,?�,-?�-?�-.?�.?�./?�/0?�01?�12?�23?�34?�45?�5?�56?�6?�67?�78?�89?�9:?�:;?�>@A@N@Y@_@T@A@G@A@N@Y@_@C@H@A@R@Q@U@E@U@E@a@d@v@p@r@e@a@d@v@d@e@t@d@e@f@m@f@s@g@m@f@n@p@l@n@t
@n
@m
@f@a@c@r@a@d@j@p@r@e@d@s@i@n@t@c@o@m@p@s@u@p@a@t@t@r@p@a@r@t@v@b@l@e@x@i@m@p@s@e@p@i@n@f@p@a@s@t@p@r@e@s@p@r@s@p@p@r@s@p@p@v@b@a@u@x@v@b@m@o@d@v@b@s@e@r@v@b@h@a@v@e@r@p1@p2@p3@v@a@u@x@c@n@j@c@o@o@c@n@j@s@u@b@c@n@j@a@d@v@p@r@n@n@p@a@n@t@t@o@p@c@o@g@a@l@p@r@s@u@b@j@r@e@l@i@j@n@u@m@i@n@d@a@p@o@s@g@u@i@o@c@m@l@p@a@r@r@p@a@r@l@q@u@e@s@t@s@e@n@t
>>
@t@a@g@g@e@r@�




















































































































@�<
@�@N@@	???
??@�?@�@@@�?@�?@�@@@�@C@�?@�?@�?@�?@�?@�@B@{?@x?@u?@r@G@W@E9@B#@E@�?@�?@S@@?@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<
@�

@�

:
@^
@A
@z

<
@�

9
@^
@A
@z

<
@�

8

7
2@@@@

5
@^
@A
@z

<
3
@^
@A
@z

<
5
@^
@A
@z

<.?
+?@@@B
+@E
3@H@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<'?@A?
@^
@A
@z

<'???@@
@O@^
@A
@z

<(
+@B
@^
@A
@z

<(	@B
@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<	???????
@V
=
=@_
@A
@z

<#@@
@V@S
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@p
=@_
@A
@z

<
+???

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<??

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=@_
@A
@z

<@n@D
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@�

	
+
+		
+
+
+ 
+"#%&'
+(
+)
+*
+,-/0235689;<>?@A@B@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@Z@[@^@_@`@a@b@c@e@f@h@i@k@l@m@n@o@p@q@r@t@u@w@x@z@{@}@~@�@�@�@�@�@�@�@�@�@�@� @� @� @� @� @� @� @� @� @� @�!@�!@�!@�!@�!@�!@�!@�!@�!@�!@�"@�"@�&@�&@�'@�'@�(@�(@�)@�)@�*@�*@�+@�+@�,@�,@�-@�-@�.@�.@�/@�/@�0@�0@�1@�1@�2@�2@�3@�3@�4@�4@�5@�5@�6@�6@�6@�6@�7@�7@�8@�8@�9@�9@�:@�:@�:@�:
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.rlx.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.rlx.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.rlx.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.rlx.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/eng.rlx.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/install-sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/install-sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/install-sh	(revision 70339)
@@ -0,0 +1,527 @@
+#!/bin/sh
+# install - install a program, script, or datafile
+
+scriptversion=2011-11-20.07; # UTC
+
+# This originates from X11R5 (mit/util/scripts/install.sh), which was
+# later released in X11R6 (xc/config/util/install.sh) with the
+# following copyright and license.
+#
+# Copyright (C) 1994 X Consortium
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to
+# deal in the Software without restriction, including without limitation the
+# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+# sell copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
+# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+# Except as contained in this notice, the name of the X Consortium shall not
+# be used in advertising or otherwise to promote the sale, use or other deal-
+# ings in this Software without prior written authorization from the X Consor-
+# tium.
+#
+#
+# FSF changes to this file are in the public domain.
+#
+# Calling this script install-sh is preferred over install.sh, to prevent
+# 'make' implicit rules from creating a file called install from it
+# when there is no Makefile.
+#
+# This script is compatible with the BSD install script, but was written
+# from scratch.
+
+nl='
+'
+IFS=" ""	$nl"
+
+# set DOITPROG to echo to test this script
+
+# Don't use :- since 4.3BSD and earlier shells don't like it.
+doit=${DOITPROG-}
+if test -z "$doit"; then
+  doit_exec=exec
+else
+  doit_exec=$doit
+fi
+
+# Put in absolute file names if you don't have them in your path;
+# or use environment vars.
+
+chgrpprog=${CHGRPPROG-chgrp}
+chmodprog=${CHMODPROG-chmod}
+chownprog=${CHOWNPROG-chown}
+cmpprog=${CMPPROG-cmp}
+cpprog=${CPPROG-cp}
+mkdirprog=${MKDIRPROG-mkdir}
+mvprog=${MVPROG-mv}
+rmprog=${RMPROG-rm}
+stripprog=${STRIPPROG-strip}
+
+posix_glob='?'
+initialize_posix_glob='
+  test "$posix_glob" != "?" || {
+    if (set -f) 2>/dev/null; then
+      posix_glob=
+    else
+      posix_glob=:
+    fi
+  }
+'
+
+posix_mkdir=
+
+# Desired mode of installed file.
+mode=0755
+
+chgrpcmd=
+chmodcmd=$chmodprog
+chowncmd=
+mvcmd=$mvprog
+rmcmd="$rmprog -f"
+stripcmd=
+
+src=
+dst=
+dir_arg=
+dst_arg=
+
+copy_on_change=false
+no_target_directory=
+
+usage="\
+Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
+   or: $0 [OPTION]... SRCFILES... DIRECTORY
+   or: $0 [OPTION]... -t DIRECTORY SRCFILES...
+   or: $0 [OPTION]... -d DIRECTORIES...
+
+In the 1st form, copy SRCFILE to DSTFILE.
+In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
+In the 4th, create DIRECTORIES.
+
+Options:
+     --help     display this help and exit.
+     --version  display version info and exit.
+
+  -c            (ignored)
+  -C            install only if different (preserve the last data modification time)
+  -d            create directories instead of installing files.
+  -g GROUP      $chgrpprog installed files to GROUP.
+  -m MODE       $chmodprog installed files to MODE.
+  -o USER       $chownprog installed files to USER.
+  -s            $stripprog installed files.
+  -t DIRECTORY  install into DIRECTORY.
+  -T            report an error if DSTFILE is a directory.
+
+Environment variables override the default commands:
+  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
+  RMPROG STRIPPROG
+"
+
+while test $# -ne 0; do
+  case $1 in
+    -c) ;;
+
+    -C) copy_on_change=true;;
+
+    -d) dir_arg=true;;
+
+    -g) chgrpcmd="$chgrpprog $2"
+	shift;;
+
+    --help) echo "$usage"; exit $?;;
+
+    -m) mode=$2
+	case $mode in
+	  *' '* | *'	'* | *'
+'*	  | *'*'* | *'?'* | *'['*)
+	    echo "$0: invalid mode: $mode" >&2
+	    exit 1;;
+	esac
+	shift;;
+
+    -o) chowncmd="$chownprog $2"
+	shift;;
+
+    -s) stripcmd=$stripprog;;
+
+    -t) dst_arg=$2
+	# Protect names problematic for 'test' and other utilities.
+	case $dst_arg in
+	  -* | [=\(\)!]) dst_arg=./$dst_arg;;
+	esac
+	shift;;
+
+    -T) no_target_directory=true;;
+
+    --version) echo "$0 $scriptversion"; exit $?;;
+
+    --)	shift
+	break;;
+
+    -*)	echo "$0: invalid option: $1" >&2
+	exit 1;;
+
+    *)  break;;
+  esac
+  shift
+done
+
+if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
+  # When -d is used, all remaining arguments are directories to create.
+  # When -t is used, the destination is already specified.
+  # Otherwise, the last argument is the destination.  Remove it from $@.
+  for arg
+  do
+    if test -n "$dst_arg"; then
+      # $@ is not empty: it contains at least $arg.
+      set fnord "$@" "$dst_arg"
+      shift # fnord
+    fi
+    shift # arg
+    dst_arg=$arg
+    # Protect names problematic for 'test' and other utilities.
+    case $dst_arg in
+      -* | [=\(\)!]) dst_arg=./$dst_arg;;
+    esac
+  done
+fi
+
+if test $# -eq 0; then
+  if test -z "$dir_arg"; then
+    echo "$0: no input file specified." >&2
+    exit 1
+  fi
+  # It's OK to call 'install-sh -d' without argument.
+  # This can happen when creating conditional directories.
+  exit 0
+fi
+
+if test -z "$dir_arg"; then
+  do_exit='(exit $ret); exit $ret'
+  trap "ret=129; $do_exit" 1
+  trap "ret=130; $do_exit" 2
+  trap "ret=141; $do_exit" 13
+  trap "ret=143; $do_exit" 15
+
+  # Set umask so as not to create temps with too-generous modes.
+  # However, 'strip' requires both read and write access to temps.
+  case $mode in
+    # Optimize common cases.
+    *644) cp_umask=133;;
+    *755) cp_umask=22;;
+
+    *[0-7])
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw='% 200'
+      fi
+      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
+    *)
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw=,u+rw
+      fi
+      cp_umask=$mode$u_plus_rw;;
+  esac
+fi
+
+for src
+do
+  # Protect names problematic for 'test' and other utilities.
+  case $src in
+    -* | [=\(\)!]) src=./$src;;
+  esac
+
+  if test -n "$dir_arg"; then
+    dst=$src
+    dstdir=$dst
+    test -d "$dstdir"
+    dstdir_status=$?
+  else
+
+    # Waiting for this to be detected by the "$cpprog $src $dsttmp" command
+    # might cause directories to be created, which would be especially bad
+    # if $src (and thus $dsttmp) contains '*'.
+    if test ! -f "$src" && test ! -d "$src"; then
+      echo "$0: $src does not exist." >&2
+      exit 1
+    fi
+
+    if test -z "$dst_arg"; then
+      echo "$0: no destination specified." >&2
+      exit 1
+    fi
+    dst=$dst_arg
+
+    # If destination is a directory, append the input filename; won't work
+    # if double slashes aren't ignored.
+    if test -d "$dst"; then
+      if test -n "$no_target_directory"; then
+	echo "$0: $dst_arg: Is a directory" >&2
+	exit 1
+      fi
+      dstdir=$dst
+      dst=$dstdir/`basename "$src"`
+      dstdir_status=0
+    else
+      # Prefer dirname, but fall back on a substitute if dirname fails.
+      dstdir=`
+	(dirname "$dst") 2>/dev/null ||
+	expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	     X"$dst" : 'X\(//\)[^/]' \| \
+	     X"$dst" : 'X\(//\)$' \| \
+	     X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
+	echo X"$dst" |
+	    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)[^/].*/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\).*/{
+		   s//\1/
+		   q
+		 }
+		 s/.*/./; q'
+      `
+
+      test -d "$dstdir"
+      dstdir_status=$?
+    fi
+  fi
+
+  obsolete_mkdir_used=false
+
+  if test $dstdir_status != 0; then
+    case $posix_mkdir in
+      '')
+	# Create intermediate dirs using mode 755 as modified by the umask.
+	# This is like FreeBSD 'install' as of 1997-10-28.
+	umask=`umask`
+	case $stripcmd.$umask in
+	  # Optimize common cases.
+	  *[2367][2367]) mkdir_umask=$umask;;
+	  .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
+
+	  *[0-7])
+	    mkdir_umask=`expr $umask + 22 \
+	      - $umask % 100 % 40 + $umask % 20 \
+	      - $umask % 10 % 4 + $umask % 2
+	    `;;
+	  *) mkdir_umask=$umask,go-w;;
+	esac
+
+	# With -d, create the new directory with the user-specified mode.
+	# Otherwise, rely on $mkdir_umask.
+	if test -n "$dir_arg"; then
+	  mkdir_mode=-m$mode
+	else
+	  mkdir_mode=
+	fi
+
+	posix_mkdir=false
+	case $umask in
+	  *[123567][0-7][0-7])
+	    # POSIX mkdir -p sets u+wx bits regardless of umask, which
+	    # is incompatible with FreeBSD 'install' when (umask & 300) != 0.
+	    ;;
+	  *)
+	    tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
+	    trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
+
+	    if (umask $mkdir_umask &&
+		exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
+	    then
+	      if test -z "$dir_arg" || {
+		   # Check for POSIX incompatibilities with -m.
+		   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
+		   # other-writable bit of parent directory when it shouldn't.
+		   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
+		   ls_ld_tmpdir=`ls -ld "$tmpdir"`
+		   case $ls_ld_tmpdir in
+		     d????-?r-*) different_mode=700;;
+		     d????-?--*) different_mode=755;;
+		     *) false;;
+		   esac &&
+		   $mkdirprog -m$different_mode -p -- "$tmpdir" && {
+		     ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
+		     test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
+		   }
+		 }
+	      then posix_mkdir=:
+	      fi
+	      rmdir "$tmpdir/d" "$tmpdir"
+	    else
+	      # Remove any dirs left behind by ancient mkdir implementations.
+	      rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
+	    fi
+	    trap '' 0;;
+	esac;;
+    esac
+
+    if
+      $posix_mkdir && (
+	umask $mkdir_umask &&
+	$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
+      )
+    then :
+    else
+
+      # The umask is ridiculous, or mkdir does not conform to POSIX,
+      # or it failed possibly due to a race condition.  Create the
+      # directory the slow way, step by step, checking for races as we go.
+
+      case $dstdir in
+	/*) prefix='/';;
+	[-=\(\)!]*) prefix='./';;
+	*)  prefix='';;
+      esac
+
+      eval "$initialize_posix_glob"
+
+      oIFS=$IFS
+      IFS=/
+      $posix_glob set -f
+      set fnord $dstdir
+      shift
+      $posix_glob set +f
+      IFS=$oIFS
+
+      prefixes=
+
+      for d
+      do
+	test X"$d" = X && continue
+
+	prefix=$prefix$d
+	if test -d "$prefix"; then
+	  prefixes=
+	else
+	  if $posix_mkdir; then
+	    (umask=$mkdir_umask &&
+	     $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
+	    # Don't fail if two instances are running concurrently.
+	    test -d "$prefix" || exit 1
+	  else
+	    case $prefix in
+	      *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
+	      *) qprefix=$prefix;;
+	    esac
+	    prefixes="$prefixes '$qprefix'"
+	  fi
+	fi
+	prefix=$prefix/
+      done
+
+      if test -n "$prefixes"; then
+	# Don't fail if two instances are running concurrently.
+	(umask $mkdir_umask &&
+	 eval "\$doit_exec \$mkdirprog $prefixes") ||
+	  test -d "$dstdir" || exit 1
+	obsolete_mkdir_used=true
+      fi
+    fi
+  fi
+
+  if test -n "$dir_arg"; then
+    { test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
+    { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
+      test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
+  else
+
+    # Make a couple of temp file names in the proper directory.
+    dsttmp=$dstdir/_inst.$$_
+    rmtmp=$dstdir/_rm.$$_
+
+    # Trap to clean up those temp files at exit.
+    trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
+
+    # Copy the file name to the temp name.
+    (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
+
+    # and set any options; do chmod last to preserve setuid bits.
+    #
+    # If any of these fail, we abort the whole thing.  If we want to
+    # ignore errors from any of these, just make sure not to ignore
+    # errors from the above "$doit $cpprog $src $dsttmp" command.
+    #
+    { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
+    { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
+    { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
+
+    # If -C, don't bother to copy if it wouldn't change the file.
+    if $copy_on_change &&
+       old=`LC_ALL=C ls -dlL "$dst"	2>/dev/null` &&
+       new=`LC_ALL=C ls -dlL "$dsttmp"	2>/dev/null` &&
+
+       eval "$initialize_posix_glob" &&
+       $posix_glob set -f &&
+       set X $old && old=:$2:$4:$5:$6 &&
+       set X $new && new=:$2:$4:$5:$6 &&
+       $posix_glob set +f &&
+
+       test "$old" = "$new" &&
+       $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
+    then
+      rm -f "$dsttmp"
+    else
+      # Rename the file to the real destination.
+      $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
+
+      # The rename failed, perhaps because mv can't rename something else
+      # to itself, or perhaps because mv is so ancient that it does not
+      # support -f.
+      {
+	# Now remove or move aside any old file at destination location.
+	# We try this two ways since rm can't unlink itself on some
+	# systems and the destination file might be busy for other
+	# reasons.  In this case, the final cleanup might fail but the new
+	# file should still install successfully.
+	{
+	  test ! -f "$dst" ||
+	  $doit $rmcmd -f "$dst" 2>/dev/null ||
+	  { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
+	    { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
+	  } ||
+	  { echo "$0: cannot unlink or rename $dst" >&2
+	    (exit 1); exit 1
+	  }
+	} &&
+
+	# Now rename the file to the real destination.
+	$doit $mvcmd "$dsttmp" "$dst"
+      }
+    fi || exit 1
+
+    trap '' 0
+  fi
+done
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/install-sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/missing
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/missing	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/missing	(revision 70339)
@@ -0,0 +1,215 @@
+#! /bin/sh
+# Common wrapper for a few potentially missing GNU programs.
+
+scriptversion=2013-10-28.13; # UTC
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+# Originally written by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
+
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2, or (at your option)
+# any later version.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+if test $# -eq 0; then
+  echo 1>&2 "Try '$0 --help' for more information"
+  exit 1
+fi
+
+case $1 in
+
+  --is-lightweight)
+    # Used by our autoconf macros to check whether the available missing
+    # script is modern enough.
+    exit 0
+    ;;
+
+  --run)
+    # Back-compat with the calling convention used by older automake.
+    shift
+    ;;
+
+  -h|--h|--he|--hel|--help)
+    echo "\
+$0 [OPTION]... PROGRAM [ARGUMENT]...
+
+Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due
+to PROGRAM being missing or too old.
+
+Options:
+  -h, --help      display this help and exit
+  -v, --version   output version information and exit
+
+Supported PROGRAM values:
+  aclocal   autoconf  autoheader   autom4te  automake  makeinfo
+  bison     yacc      flex         lex       help2man
+
+Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and
+'g' are ignored when checking the name.
+
+Send bug reports to <bug-automake@gnu.org>."
+    exit $?
+    ;;
+
+  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)
+    echo "missing $scriptversion (GNU Automake)"
+    exit $?
+    ;;
+
+  -*)
+    echo 1>&2 "$0: unknown '$1' option"
+    echo 1>&2 "Try '$0 --help' for more information"
+    exit 1
+    ;;
+
+esac
+
+# Run the given program, remember its exit status.
+"$@"; st=$?
+
+# If it succeeded, we are done.
+test $st -eq 0 && exit 0
+
+# Also exit now if we it failed (or wasn't found), and '--version' was
+# passed; such an option is passed most likely to detect whether the
+# program is present and works.
+case $2 in --version|--help) exit $st;; esac
+
+# Exit code 63 means version mismatch.  This often happens when the user
+# tries to use an ancient version of a tool on a file that requires a
+# minimum version.
+if test $st -eq 63; then
+  msg="probably too old"
+elif test $st -eq 127; then
+  # Program was missing.
+  msg="missing on your system"
+else
+  # Program was found and executed, but failed.  Give up.
+  exit $st
+fi
+
+perl_URL=http://www.perl.org/
+flex_URL=http://flex.sourceforge.net/
+gnu_software_URL=http://www.gnu.org/software
+
+program_details ()
+{
+  case $1 in
+    aclocal|automake)
+      echo "The '$1' program is part of the GNU Automake package:"
+      echo "<$gnu_software_URL/automake>"
+      echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:"
+      echo "<$gnu_software_URL/autoconf>"
+      echo "<$gnu_software_URL/m4/>"
+      echo "<$perl_URL>"
+      ;;
+    autoconf|autom4te|autoheader)
+      echo "The '$1' program is part of the GNU Autoconf package:"
+      echo "<$gnu_software_URL/autoconf/>"
+      echo "It also requires GNU m4 and Perl in order to run:"
+      echo "<$gnu_software_URL/m4/>"
+      echo "<$perl_URL>"
+      ;;
+  esac
+}
+
+give_advice ()
+{
+  # Normalize program name to check for.
+  normalized_program=`echo "$1" | sed '
+    s/^gnu-//; t
+    s/^gnu//; t
+    s/^g//; t'`
+
+  printf '%s\n' "'$1' is $msg."
+
+  configure_deps="'configure.ac' or m4 files included by 'configure.ac'"
+  case $normalized_program in
+    autoconf*)
+      echo "You should only need it if you modified 'configure.ac',"
+      echo "or m4 files included by it."
+      program_details 'autoconf'
+      ;;
+    autoheader*)
+      echo "You should only need it if you modified 'acconfig.h' or"
+      echo "$configure_deps."
+      program_details 'autoheader'
+      ;;
+    automake*)
+      echo "You should only need it if you modified 'Makefile.am' or"
+      echo "$configure_deps."
+      program_details 'automake'
+      ;;
+    aclocal*)
+      echo "You should only need it if you modified 'acinclude.m4' or"
+      echo "$configure_deps."
+      program_details 'aclocal'
+      ;;
+   autom4te*)
+      echo "You might have modified some maintainer files that require"
+      echo "the 'autom4te' program to be rebuilt."
+      program_details 'autom4te'
+      ;;
+    bison*|yacc*)
+      echo "You should only need it if you modified a '.y' file."
+      echo "You may want to install the GNU Bison package:"
+      echo "<$gnu_software_URL/bison/>"
+      ;;
+    lex*|flex*)
+      echo "You should only need it if you modified a '.l' file."
+      echo "You may want to install the Fast Lexical Analyzer package:"
+      echo "<$flex_URL>"
+      ;;
+    help2man*)
+      echo "You should only need it if you modified a dependency" \
+           "of a man page."
+      echo "You may want to install the GNU Help2man package:"
+      echo "<$gnu_software_URL/help2man/>"
+    ;;
+    makeinfo*)
+      echo "You should only need it if you modified a '.texi' file, or"
+      echo "any other file indirectly affecting the aspect of the manual."
+      echo "You might want to install the Texinfo package:"
+      echo "<$gnu_software_URL/texinfo/>"
+      echo "The spurious makeinfo call might also be the consequence of"
+      echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might"
+      echo "want to install GNU make:"
+      echo "<$gnu_software_URL/make/>"
+      ;;
+    *)
+      echo "You might have modified some files without having the proper"
+      echo "tools for further handling them.  Check the 'README' file, it"
+      echo "often tells you about the needed prerequisites for installing"
+      echo "this package.  You may also peek at any GNU archive site, in"
+      echo "case some other package contains this missing '$1' program."
+      ;;
+  esac
+}
+
+give_advice "$1" | sed -e '1s/^/WARNING: /' \
+                       -e '2,$s/^/         /' >&2
+
+# Propagate the correct exit status (expected to be 127 for a program
+# not found, 63 for a program that failed due to version mismatch).
+exit $st
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/missing
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-disam.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-disam.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-disam.mode	(revision 70339)
@@ -0,0 +1,5 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/eng.automorf.bin' | cg-conv -a -l| vislcg3 --trace -g '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/apertium-eng.eng.rlx' 
+  
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-gener.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-gener.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-gener.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -g '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/eng.autogen.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-morph.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-morph.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-morph.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/eng.automorf.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-tagger.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-tagger.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes/eng-tagger.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-eng/eng.rlx.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-eng/modes.xml	(revision 70339)
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<modes>
+
+  <mode name="eng-morph">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng.automorf.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-gener">
+    <pipeline>
+      <program name="lt-proc -g">
+        <file name="eng.autogen.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-tagger">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng.automorf.bin"/>
+      </program>
+      <program name="cg-proc -w">
+        <file name="eng.rlx.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-disam">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng.automorf.bin"/>
+      </program>
+      <program name="cg-conv -a -l" />
+      <program name="vislcg3 --trace -g">
+        <file name="apertium-eng.eng.rlx"/>
+      </program>
+    </pipeline>
+  </mode>
+
+</modes>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x	(revision 70339)
@@ -0,0 +1,295 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<transfer default="chunk">
+  <section-def-cats>
+    <def-cat n="nom">
+      <cat-item tags="n.*"/>
+    </def-cat>
+    <def-cat n="nom_gen">
+      <cat-item tags="n.*.gen"/>
+    </def-cat>
+    <def-cat n="adj_gen">
+      <cat-item tags="adj.*.gen"/>
+      <cat-item tags="num.*.gen"/>
+      <!--cat-item tags="num.*.acc"/>
+      <cat-item tags="adj.*.acc"/-->
+    </def-cat>
+    <def-cat n="sent">
+      <cat-item tags="sent"/>
+    </def-cat>
+  </section-def-cats>
+
+  <section-def-attrs>
+  <def-attr n="a_nom">
+    <attr-item tags="n"/>
+  </def-attr>
+  <def-attr n="a_adj">
+    <attr-item tags="adj"/>
+    <attr-item tags="num"/>
+  </def-attr>
+  <def-attr n="nbr">
+    <attr-item tags="sg"/>
+    <attr-item tags="pl"/>
+  </def-attr>
+  </section-def-attrs>
+
+  <section-def-vars>
+    <def-var n="number"/>
+    <def-var n="case"/>
+  </section-def-vars>
+
+  <section-def-macros>
+    <def-macro n="test" npar="1">
+          <let>
+            <var n="number"/>
+            <lit v=""/>
+          </let>
+    </def-macro>
+  </section-def-macros>
+
+  <section-rules>
+    <rule comment="single noun">
+      <pattern>
+        <pattern-item n="nom"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule id="two_pt_poss" comment="possessive case">
+      <pattern>
+        <pattern-item n="nom"/>
+        <pattern-item n="nom_gen"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom_pos_nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="2" side="tl" part="lem"/>
+              <clip pos="2" side="tl" part="a_nom"/>
+              <clip pos="2" side="tl" part="nbr"/>
+              <lit-tag v="pos"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule id="two_pt_attr" comment="attributive noun construction retaining sg/pl">
+      <pattern>
+        <pattern-item n="nom"/>
+        <pattern-item n="nom_gen"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom_pos_nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="2" side="tl" part="lem"/>
+              <clip pos="2" side="tl" part="a_nom"/>
+              <clip pos="2" side="tl" part="nbr"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule id="two_pt_of" comment="of-construction">
+      <pattern>
+        <pattern-item n="nom"/>
+        <pattern-item n="nom_gen"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom_of_nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+            <b/>
+            <lu>
+              <lit v="of"/>
+              <lit-tag v="pr"/>
+            </lu>
+            <b/>
+            <!--lu>
+              <lit v="a"/>
+              <lit-tag v="det.ind"/>
+            </lu>
+            <b/-->
+            <lu>
+              <clip pos="2" side="tl" part="lem"/>
+              <clip pos="2" side="tl" part="a_nom"/>
+              <clip pos="2" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule id="three_pt_poss" comment="possessive case with adj">
+      <pattern>
+        <pattern-item n="nom"/>
+        <pattern-item n="adj_gen"/>
+        <pattern-item n="nom_gen"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom_pos_adj_nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="2" side="tl" part="lem"/>
+              <clip pos="2" side="tl" part="a_adj"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="3" side="tl" part="lem"/>
+              <clip pos="3" side="tl" part="a_nom"/>
+              <clip pos="3" side="tl" part="nbr"/>
+              <lit-tag v="pos"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule id="three_pt_attr" comment="attributive construction with adj retaining sg/pl">
+      <pattern>
+        <pattern-item n="nom"/>
+        <pattern-item n="adj_gen"/>
+        <pattern-item n="nom_gen"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom_pos_adj_nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="2" side="tl" part="lem"/>
+              <clip pos="2" side="tl" part="a_adj"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="3" side="tl" part="lem"/>
+              <clip pos="3" side="tl" part="a_nom"/>
+              <clip pos="3" side="tl" part="nbr"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule id="three_pt_of" comment="of-construction with adj">
+      <pattern>
+        <pattern-item n="nom"/>
+        <pattern-item n="adj_gen"/>
+        <pattern-item n="nom_gen"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="nom_of_adj_nom" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SN"/></tag>
+            </tags>
+            <lu>
+              <clip pos="1" side="tl" part="lem"/>
+              <clip pos="1" side="tl" part="a_nom"/>
+              <clip pos="1" side="tl" part="nbr"/>
+            </lu>
+            <b/>
+            <lu>
+              <lit v="of"/>
+              <lit-tag v="pr"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="2" side="tl" part="lem"/>
+              <clip pos="2" side="tl" part="a_adj"/>
+            </lu>
+            <b/>
+            <lu>
+              <clip pos="3" side="tl" part="lem"/>
+              <clip pos="3" side="tl" part="a_nom"/>
+              <clip pos="3" side="tl" part="nbr"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+
+    <rule comment="REGLA: SENT">
+      <pattern>
+        <pattern-item n="sent"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="sent" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SENT"/></tag>
+            </tags>
+            <lu>
+              <clip pos="1" side="tl" part="whole"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+  </section-rules>
+</transfer>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Chunking:_A_full_example
+    http://wiki.apertium.org/wiki/Chunking
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Transfer_rules
+    http://wiki.apertium.org/wiki/A_long_introduction_to_transfer_rules
+    http://wiki.apertium.org/wiki/Transfer#Adding_structural_transfer_.28grammar.29_rules
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.w1x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.w1x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.w1x	(revision 70339)
@@ -0,0 +1,84 @@
+<?xml version='1.0' encoding='UTF-8'?>
+<transfer-weights>
+  <rule-group>
+    <rule id="two_pt_poss" comment="possessive case" md5="c28391b3328137d15b61ba833a5e69a5">
+      <pattern weight="0.9">
+        <pattern-item tags="n.*"/>
+        <pattern-item lemma="мертвец" tags="n.*.gen"/>
+      </pattern>
+      <pattern weight="1.0">
+        <pattern-item lemma="пара" tags="n.*"/>
+        <pattern-item lemma="мертвец" tags="n.sg.gen"/>
+      </pattern>
+      <pattern weight="1.0">
+        <pattern-item lemma="пара" tags="n.*"/>
+        <pattern-item tags="n.sg.gen"/>
+      </pattern>
+    </rule>
+    <rule id="two_pt_attr" comment="attributive noun construction retaining sg/pl" md5="673433d932d4b5d7f7b094cd847ab80e">
+      <pattern weight="0.9">
+        <pattern-item tags="n.*"/>
+        <pattern-item lemma="замок" tags="n.*.gen"/>
+      </pattern>
+      <pattern weight="0.9">
+        <pattern-item tags="n.*"/>
+        <pattern-item lemma="сундук" tags="n.*.gen"/>
+      </pattern>
+      <pattern weight="0.9">
+        <pattern-item tags="n.*"/>
+        <pattern-item lemma="сапог" tags="n.*.gen"/>
+      </pattern>
+      <pattern weight="0.9">
+        <pattern-item tags="n.*"/>
+        <pattern-item lemma="носок" tags="n.*.gen"/>
+      </pattern>
+    </rule>
+    <rule id="two_pt_of" comment="of-construction" md5="b6c1b7a4af3f540f13e25e12c8f07393">
+    <pattern weight="0.1">
+      <pattern-item tags="n.*"/>
+      <pattern-item lemma="мертвец" tags="n.*.gen"/>
+    </pattern>
+      <pattern weight="1.0">
+        <pattern-item lemma="пара" tags="n.*"/>
+        <pattern-item tags="n.pl.gen"/>
+      </pattern>
+      <pattern weight="1.0">
+        <pattern-item lemma="пара" tags="n.*"/>
+        <pattern-item lemma="мертвец" tags="n.pl.gen"/>
+      </pattern>
+    </rule>
+  </rule-group>
+  <rule-group>
+    <rule id="three_pt_poss" comment="possessive case with adj" md5="bf48a7ee556d3003276d66826b01c246">
+      <pattern weight="0.25">
+        <pattern-item tags="n.*"/>
+        <pattern-item tags="adj.*.gen"/>
+        <pattern-item tags="n.*.gen"/>
+      </pattern>
+      <pattern weight="0.1">
+        <pattern-item tags="n.*"/>
+        <pattern-item tags="num.*.gen"/>
+        <pattern-item tags="n.*.gen"/>
+      </pattern>
+    </rule>
+    <rule id="three_pt_attr" comment="attributive construction with adj retaining sg/pl" md5="181873e44e073d713a121de76d871f79">
+      <pattern weight="0.25">
+        <pattern-item tags="n.*"/>
+        <pattern-item tags="adj.*.gen"/>
+        <pattern-item tags="n.*.gen"/>
+      </pattern>
+    </rule>
+    <rule id="three_pt_of" comment="of-construction with adj" md5="7f5a99c6b5c6e9be29148e2405674bfa">
+      <pattern weight="0.25">
+        <pattern-item tags="n.*"/>
+        <pattern-item tags="adj.*.gen"/>
+        <pattern-item tags="n.*.gen"/>
+      </pattern>
+      <pattern weight="1.0">
+        <pattern-item tags="n.*"/>
+        <pattern-item tags="num.*.gen"/>
+        <pattern-item tags="n.*.gen"/>
+      </pattern>
+    </rule>
+  </rule-group>
+</transfer-weights>
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.dix	(revision 70339)
@@ -0,0 +1,134 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+   <!-- Define the alphabet below. -->
+  <alphabet>ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzАБВГДЕЁЖЗИЙКЛМНОМПРСТУФХЦЧШЩЪЫЬЭЮЯабвгдеёжзиклмнопрстуфхцчшщьыъэюя</alphabet>
+
+  <sdefs>
+    <!-- Define symbol definitions within <sdef> here. -->
+    <sdef n="n"               c="Noun"/>
+    <sdef n="np"              c="Proper noun"/>
+    <sdef n="vblex"           c="Verb, lexical"/>
+    <sdef n="vbmod"           c="Modal verb"/>
+    <sdef n="vaux"            c="Auxiliary verb"/>
+    <sdef n="vbser"           c="'To be' verb"/>
+    <sdef n="vbhaver"         c="'To have' verb"/>
+    <sdef n="cnjsub"          c="Subordinating conjunction"/>
+    <sdef n="cnjcoo"          c="Co-ordinating conjunction"/>
+    <sdef n="cnjadv"          c="Adverbial conjunction"/>
+    <sdef n="pr"              c="Preposition"/>
+    <sdef n="adv"             c="Adverb"/>
+    <sdef n="ij"              c="Interjection"/>
+    <sdef n="adj"             c="Adjective"/>
+    <sdef n="prn"             c="Pronoun"/>
+
+    <sdef n="attr"            c="Attributive"/>
+    <sdef n="top"             c="Toponym"/>
+    <sdef n="ant"             c="Anthroponym"/>
+    <sdef n="cog"             c="Cognomen"/>
+    <sdef n="org"             c="Organisation"/>
+    <sdef n="al"              c="Altres / misc proper nouns"/>
+
+    <sdef n="pers"            c="Personal pronoun"/>
+    <sdef n="ref"             c="Reflexive pronoun"/>
+    <sdef n="res"             c="Reciprocal pronoun"/>
+
+    <sdef n="det"             c="Determiner"/>
+    <sdef n="pos"             c="Possessive"/>
+
+    <sdef n="p1"              c="1st person"/>
+    <sdef n="p2"              c="2nd person"/>
+    <sdef n="p3"              c="3rd person"/>
+
+    <sdef n="nt"              c="Neuter"/>
+    <sdef n="ut"              c="Utrum"/>
+    <sdef n="f"               c="Feminine"/>
+    <sdef n="m"               c="Masculine"/>
+    <sdef n="un"              c="No gender"/>
+
+    <sdef n="sg"              c="Singular"/>
+    <sdef n="du"              c="Dual"/>
+    <sdef n="pl"              c="Plural"/>
+    <sdef n="sp"              c="Singular / plural"/>
+
+    <sdef n="ind"             c="Indefinite"/>
+    <sdef n="def"             c="Definite"/>
+
+    <sdef n="nom"             c="Nominative"/>
+    <sdef n="gen"             c="Genitive"/>
+    <sdef n="acc"             c="Accusative"/>
+    <sdef n="dat"             c="Dative"/>
+    <sdef n="ins"             c="Instrumentalis"/>
+    <sdef n="loc"             c="Locative"/>
+
+    <sdef n="dem"             c="Demonstrative"/>
+    <sdef n="itg"             c="Question word / interrogative"/>
+    <sdef n="qnt"             c="Quantifier"/>
+    <sdef n="neg"             c="Negative"/>
+    <sdef n="emph"            c="Emphatic"/>
+
+    <sdef n="inf"             c="Infinitive"/>
+    <sdef n="pres"            c="Present"/>
+    <sdef n="imp"             c="Imperative"/>
+    <sdef n="pret"            c="Preterite"/>
+    <sdef n="pp"              c="Perfect participle"/>
+    <sdef n="pprs"            c="Present participle"/>
+    <sdef n="pasv"            c="Passive"/>
+    <sdef n="actv"            c="Active voice"/>
+
+    <sdef n="sint"            c="Synthetic (of adjectives)"/>
+    <sdef n="pst"             c="Positive"/>
+    <sdef n="comp"            c="Comparative"/>
+    <sdef n="sup"             c="Superlative"/>
+
+    <sdef n="ord"             c="Ordinal"/>
+    <sdef n="acr"             c="Acronym"/>
+    <sdef n="unc"             c="Uncountable"/>
+
+    <sdef n="num"             c="Numeral"/>
+    <sdef n="sent"            c="Sentence end"/>
+    <sdef n="cm"              c="Comma"/>
+    <sdef n="apos"            c="Apostrophe"/>
+    <sdef n="guio"            c="Dash"/>
+    <sdef n="lpar"            c="Left parenthesis"/>
+    <sdef n="rpar"            c="Right parenthesis"/>
+    <sdef n="lquot"           c="Left quote"/>
+    <sdef n="rquot"           c="Right quote"/>
+
+    <sdef n="compound-only-L" c="May only be the left-side of a compound"/>
+    <sdef n="compound-R"      c="May be the right-side of a compound, or a full word"/>
+  </sdefs>
+
+   <section id="main" type="standard">
+      <!-- Define entries within <e> here. -->
+      <e><p><l>сапог<s n="n"/></l><r>boot<s n="n"/></r></p></e>
+      <e><p><l>сундук<s n="n"/></l><r>chest<s n="n"/></r></p></e>
+      <e><p><l>замок<s n="n"/></l><r>lock<s n="n"/></r></p></e>
+      <e><p><l>носок<s n="n"/></l><r>sock<s n="n"/></r></p></e>
+      <e><p><l>остров<s n="n"/></l><r>island<s n="n"/></r></p></e>
+      <e><p><l>мертвец<s n="n"/></l><r>dead<b/>man<s n="n"/></r></p></e>
+      <e><p><l>море<s n="n"/></l><r>sea<s n="n"/></r></p></e>
+      <e><p><l>пара<s n="n"/></l><r>pair<s n="n"/></r></p></e>
+      <e><p><l>день<s n="n"/></l><r>day<s n="n"/></r></p></e>
+      <e><p><l>большой<s n="adj"/></l><r>big<s n="adj"/></r></p></e>
+      <e><p><l>новый<s n="adj"/></l><r>new<s n="adj"/></r></p></e>
+      <e><p><l>первый<s n="num"/></l><r>the<b/>first<s n="num"/></r></p></e>
+      <e><p><l>второй<s n="num"/></l><r>the<b/>second<s n="num"/></r></p></e>
+      <e><p><l>третий<s n="num"/></l><r>the<b/>third<s n="num"/></r></p></e>
+      <e><p><l>четвертый<s n="num"/></l><r>the<b/>fourth<s n="num"/></r></p></e>
+      <e><p><l>пятый<s n="num"/></l><r>the<b/>fifth<s n="num"/></r></p></e>
+      <e><p><l>шестой<s n="num"/></l><r>the<b/>sixth<s n="num"/></r></p></e>
+      <e><p><l>седьмой<s n="num"/></l><r>the<b/>seventh<s n="num"/></r></p></e>
+      <e><p><l>восьмой<s n="num"/></l><r>the<b/>eighth<s n="num"/></r></p></e>
+      <e><p><l>девятый<s n="num"/></l><r>the<b/>ninth<s n="num"/></r></p></e>
+      <e><p><l>десятый<s n="num"/></l><r>the<b/>tenth<s n="num"/></r></p></e>
+
+      <e><re>[.\?;:!…¿¶]</re><p><l><s n="sent"/></l><r><s n="sent"/></r></p></e>
+      <e><re>,</re>          <p><l><s n="cm"/></l>  <r><s n="cm"/></r></p></e>
+   </section>
+</dictionary>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Bilingual_dictionary
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Bilingual_dictionary
+-->
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin	(revision 70339)
@@ -0,0 +1,24 @@
+@v@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@zDDDDDDD
DDDDDDDDDDDD D!D"D#D$D%D&D'D(D)D*D+D,D-D.D/D0D1D2D3D4D5DQD6D7D8D:D;D<D=D>D?D@DADBDCDDDEDFDGDHDIDLDKDJDMDNDO@M
@n@n@p@v@b@l@e@x@v@b@m@o@d@v@a@u@x@v@b@s@e@r@v@b@h@a@v@e@r@c@n@j@s@u@b@c@n@j@c@o@o@c@n@j@a@d@v@p@r@a@d@v@i@j@a@d@j@p@r@n@a@t@t@r@t@o@p@a@n@t@c@o@g@o@r@g@a@l@p@e@r@s@r@e@f@r@e@s@d@e@t@p@o@s@p1@p2@p3@n@t@u@t
@f
@m@u@n@s@g@d@u@p@l@s@p@i@n@d@d@e@f@n@o@m@g@e@n@a@c@c@d@a@t@i@n@s@l@o@c@d@e@m@i@t@g@q@n@t@n@e@g@e@m@p@h@i@n@f@p@r@e@s@i@m@p@p@r@e@t@p@p@p@p@r@s@p@a@s@v@a@c@t@v@s@i@n@t@p@s@t@c@o@m@p@s@u@p@o@r@d@a@c@r@u@n@c@n@u@m@s@e@n@t@c@m@a@p@o@s@g@u@i@o@l@p@a@r@r@p@a@r@l@q@u@o@t@r@q@u@o@t@c@o@m@p@o@u@n@d-@o@n@l@y-@L
+@c@o@m@p@o@u@n@d-@R@z@M@M@�D�@�D}@�D�@�D�@LD�@M@L@�D�@�D�@�D�@�D�@�D�@LD�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D@L@L@�D�@�D�@�D�@mD@�D�@�D�@�@L@L@M@�D�@�D�@LD�@�D�@�D}@�D�@�D}@�D�@�D�@�D�@LD�@�D~@�D�?D�@MD�@MD�@MD�@M?@�D�@�D?D�@�D�@�D�@�D�@�D�@�D�@�
+@�@M@�@M
+@M@�D@�D�@mD�@�D�@�D�@�
+@�@M@�@M@�@M@�D�@�D�@mD�@�D�@�D�@�
+@�@M@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�
+@�D�@mD�@�D�@�@M@�@M@�D�@�D�@�
+@�D�@�D�@mD�@�D�@�
+@�D�@�D�@�D�@�D�@�D@mD�@�D�@�D�@�D�@�
+@�D�@n@n@{@{@�@�@�@�@�@�AAAA`s`s		@y@y

+@m@a@i@n@@@s@t@a@n@d@a@r@d
)@{

	
+	
+	
+













"
%
)

"7 @@$
@I
7
7
7
7
@w
@y

	





&
*
-
4
8
@P
"
@]

@P
@]
@`@]


+



#
'
+
.
5

@X
@A
@a
@J

@J
@a
@i
@i






@a
@`
/
1
9
@Y
@B
@e
@K
@Q
@B
!
@H
@j
@n

+
0@n
2@P
:
@M
@C

@L
@R
:
"
@n
@k
+

+
;
+
@Z
+
@D
+
@f
+
@M
+
@S
+
@^
@b	
@l	
	
<	
=	
@E	
@V@y
@N
@T
@c
@m
 2
=
@[
@F

@G
@U
@F@n
>+
@V@z
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin	(revision 70339)
@@ -0,0 +1,24 @@
+@v@A@B@C@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@X@Y@Z@a@b@c@d@e@f@g@h@i@j@k@l@m@n@o@p@q@r@s@t@u@v@w@x@y@zDDDDDDD
DDDDDDDDDDDD D!D"D#D$D%D&D'D(D)D*D+D,D-D.D/D0D1D2D3D4D5DQD6D7D8D:D;D<D=D>D?D@DADBDCDDDEDFDGDHDIDLDKDJDMDNDO@M
@n@n@p@v@b@l@e@x@v@b@m@o@d@v@a@u@x@v@b@s@e@r@v@b@h@a@v@e@r@c@n@j@s@u@b@c@n@j@c@o@o@c@n@j@a@d@v@p@r@a@d@v@i@j@a@d@j@p@r@n@a@t@t@r@t@o@p@a@n@t@c@o@g@o@r@g@a@l@p@e@r@s@r@e@f@r@e@s@d@e@t@p@o@s@p1@p2@p3@n@t@u@t
@f
@m@u@n@s@g@d@u@p@l@s@p@i@n@d@d@e@f@n@o@m@g@e@n@a@c@c@d@a@t@i@n@s@l@o@c@d@e@m@i@t@g@q@n@t@n@e@g@e@m@p@h@i@n@f@p@r@e@s@i@m@p@p@r@e@t@p@p@p@p@r@s@p@a@s@v@a@c@t@v@s@i@n@t@p@s@t@c@o@m@p@s@u@p@o@r@d@a@c@r@u@n@c@n@u@m@s@e@n@t@c@m@a@p@o@s@g@u@i@o@l@p@a@r@r@p@a@r@l@q@u@o@t@r@q@u@o@t@c@o@m@p@o@u@n@d-@o@n@l@y-@L
+@c@o@m@p@o@u@n@d-@R@z@M@MD�@�D}@�D�@�D�@�D�@L@L@MD�@�D�@�D�@�D�@�D�@�D�@LD�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�D@�@L@LD�@�D�@�D�@�D@mD�@�D�@�@L@�@M@LD�@�D�@�D�@LD�@�D}@�D�@�D}@�D�@�D�@�D�@�D�@LD~@�D�@�D�?D�@MD�@MD�@M?@MD�@�D@�D�?D�@�D�@�D�@�D�@�D�@�
+@�@M@�@M@�@M
+D@�D�@�D�@mD�@�D�@�
+@�@M@�@M@�@M@�D�@�D�@�D�@mD�@�D�@�
+@�@M@�D�@�D�@�D�@�D�@�D�@�D�@�D�@�
+@�D�@�D�@mD�@�@M@�@M@�D�@�D�@�
+@�D�@�D�@�D�@mD�@�
+@�D�@�D�@�D�@�D�@�D@�D�@mD�@�D�@�D�@�
+@�D�@�@n@n@{@{@�@�@�@�@�@�AAAA`s`s		@y@y

+@m@a@i@n@@@s@t@a@n@d@a@r@d
)@{

	
+	
+	
+













"
%
)

"7 @@$
@I
7
7
7
7
@w
@y

	





&
*
-
4
8
@P
"
@]

@P
@]
@`@]


+



#
'
+
.
5

@X
@A
@a
@J

@J
@a
@i
@i






@a
@`
/
1
9
@Y
@B
@e
@K
@Q
@B
!
@H
@j
@n

+
0@n
2@P
:
@M
@C

@L
@R
:
"
@n
@k
+

+
;
+
@Z
+
@D
+
@f
+
@M
+
@S
+
@^
@b	
@l	
	
<	
=	
@E	
@V@y
@N
@T
@c
@m
 2
=
@[
@F

@G
@U
@F@n
>+
@V@z
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t3x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t3x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t3x	(revision 70339)
@@ -0,0 +1,62 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<postchunk>
+  <section-def-cats>
+    <def-cat n="sent">
+      <cat-item name="sent"/>
+    </def-cat>
+
+    <def-cat n="SN">
+      <cat-item tags="SN"/>
+      <cat-item tags="SN.*"/>
+    </def-cat>
+
+  </section-def-cats>
+
+  <section-def-attrs>
+    <def-attr n="nbr">
+      <attr-item tags="sg"/>
+    </def-attr>
+  </section-def-attrs>
+
+  <section-def-vars>
+    <def-var n="paraula"/>
+  </section-def-vars>
+
+  <section-rules>
+    <rule comment="CHUNK: SN">
+      <pattern>
+        <pattern-item n="SN"/>
+      </pattern>
+      <action>
+        <out>
+          <!--clip pos="1" part="lem"/>
+          <clip pos="1" part="tags"/-->
+          <clip pos="1" part="chcontent"/>
+        </out>
+      </action>
+    </rule>
+
+    <rule comment="CHUNK: sent">
+      <pattern>
+        <pattern-item n="sent"/>
+      </pattern>
+      <action>
+        <out>
+          <lu>
+            <clip pos="1" part="whole"/>
+          </lu>
+        </out>
+      </action>
+    </rule>
+  </section-rules>
+</postchunk>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Chunking:_A_full_example
+    http://wiki.apertium.org/wiki/Chunking
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Transfer_rules
+    http://wiki.apertium.org/wiki/A_long_introduction_to_transfer_rules
+    http://wiki.apertium.org/wiki/Transfer#Adding_structural_transfer_.28grammar.29_rules
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/.d
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/eng.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/eng.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/eng.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/eng.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/eng.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/rus.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/rus.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/rus.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/rus.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/.deps/rus.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/AUTHORS
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/COPYING
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/COPYING	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/COPYING	(revision 70339)
@@ -0,0 +1,675 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/ChangeLog
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/INSTALL
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/INSTALL	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/INSTALL	(revision 70339)
@@ -0,0 +1,370 @@
+Installation Instructions
+*************************
+
+Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation,
+Inc.
+
+   Copying and distribution of this file, with or without modification,
+are permitted in any medium without royalty provided the copyright
+notice and this notice are preserved.  This file is offered as-is,
+without warranty of any kind.
+
+Basic Installation
+==================
+
+   Briefly, the shell command `./configure && make && make install'
+should configure, build, and install this package.  The following
+more-detailed instructions are generic; see the `README' file for
+instructions specific to this package.  Some packages provide this
+`INSTALL' file but do not implement all of the features documented
+below.  The lack of an optional feature in a given package is not
+necessarily a bug.  More recommendations for GNU packages can be found
+in *note Makefile Conventions: (standards)Makefile Conventions.
+
+   The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation.  It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions.  Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, and a
+file `config.log' containing compiler output (useful mainly for
+debugging `configure').
+
+   It can also use an optional file (typically called `config.cache'
+and enabled with `--cache-file=config.cache' or simply `-C') that saves
+the results of its tests to speed up reconfiguring.  Caching is
+disabled by default to prevent problems with accidental use of stale
+cache files.
+
+   If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release.  If you are using the cache, and at
+some point `config.cache' contains results you don't want to keep, you
+may remove or edit it.
+
+   The file `configure.ac' (or `configure.in') is used to create
+`configure' by a program called `autoconf'.  You need `configure.ac' if
+you want to change it or regenerate `configure' using a newer version
+of `autoconf'.
+
+   The simplest way to compile this package is:
+
+  1. `cd' to the directory containing the package's source code and type
+     `./configure' to configure the package for your system.
+
+     Running `configure' might take a while.  While running, it prints
+     some messages telling which features it is checking for.
+
+  2. Type `make' to compile the package.
+
+  3. Optionally, type `make check' to run any self-tests that come with
+     the package, generally using the just-built uninstalled binaries.
+
+  4. Type `make install' to install the programs and any data files and
+     documentation.  When installing into a prefix owned by root, it is
+     recommended that the package be configured and built as a regular
+     user, and only the `make install' phase executed with root
+     privileges.
+
+  5. Optionally, type `make installcheck' to repeat any self-tests, but
+     this time using the binaries in their final installed location.
+     This target does not install anything.  Running this target as a
+     regular user, particularly if the prior `make install' required
+     root privileges, verifies that the installation completed
+     correctly.
+
+  6. You can remove the program binaries and object files from the
+     source code directory by typing `make clean'.  To also remove the
+     files that `configure' created (so you can compile the package for
+     a different kind of computer), type `make distclean'.  There is
+     also a `make maintainer-clean' target, but that is intended mainly
+     for the package's developers.  If you use it, you may have to get
+     all sorts of other programs in order to regenerate files that came
+     with the distribution.
+
+  7. Often, you can also type `make uninstall' to remove the installed
+     files again.  In practice, not all packages have tested that
+     uninstallation works correctly, even though it is required by the
+     GNU Coding Standards.
+
+  8. Some packages, particularly those that use Automake, provide `make
+     distcheck', which can by used by developers to test that all other
+     targets like `make install' and `make uninstall' work correctly.
+     This target is generally not run by end users.
+
+Compilers and Options
+=====================
+
+   Some systems require unusual options for compilation or linking that
+the `configure' script does not know about.  Run `./configure --help'
+for details on some of the pertinent environment variables.
+
+   You can give `configure' initial values for configuration parameters
+by setting variables in the command line or in the environment.  Here
+is an example:
+
+     ./configure CC=c99 CFLAGS=-g LIBS=-lposix
+
+   *Note Defining Variables::, for more details.
+
+Compiling For Multiple Architectures
+====================================
+
+   You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory.  To do this, you can use GNU `make'.  `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script.  `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.  This
+is known as a "VPATH" build.
+
+   With a non-GNU `make', it is safer to compile the package for one
+architecture at a time in the source code directory.  After you have
+installed the package for one architecture, use `make distclean' before
+reconfiguring for another architecture.
+
+   On MacOS X 10.5 and later systems, you can create libraries and
+executables that work on multiple system types--known as "fat" or
+"universal" binaries--by specifying multiple `-arch' options to the
+compiler but only a single `-arch' option to the preprocessor.  Like
+this:
+
+     ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CPP="gcc -E" CXXCPP="g++ -E"
+
+   This is not guaranteed to produce working output in all cases, you
+may have to build one architecture at a time and combine the results
+using the `lipo' tool if you have problems.
+
+Installation Names
+==================
+
+   By default, `make install' installs the package's commands under
+`/usr/local/bin', include files under `/usr/local/include', etc.  You
+can specify an installation prefix other than `/usr/local' by giving
+`configure' the option `--prefix=PREFIX', where PREFIX must be an
+absolute file name.
+
+   You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files.  If you
+pass the option `--exec-prefix=PREFIX' to `configure', the package uses
+PREFIX as the prefix for installing programs and libraries.
+Documentation and other data files still use the regular prefix.
+
+   In addition, if you use an unusual directory layout you can give
+options like `--bindir=DIR' to specify different values for particular
+kinds of files.  Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.  In general, the
+default for these options is expressed in terms of `${prefix}', so that
+specifying just `--prefix' will affect all of the other directory
+specifications that were not explicitly provided.
+
+   The most portable way to affect installation locations is to pass the
+correct locations to `configure'; however, many packages provide one or
+both of the following shortcuts of passing variable assignments to the
+`make install' command line to change installation locations without
+having to reconfigure or recompile.
+
+   The first method involves providing an override variable for each
+affected directory.  For example, `make install
+prefix=/alternate/directory' will choose an alternate location for all
+directory configuration variables that were expressed in terms of
+`${prefix}'.  Any directories that were specified during `configure',
+but not in terms of `${prefix}', must each be overridden at install
+time for the entire installation to be relocated.  The approach of
+makefile variable overrides for each directory variable is required by
+the GNU Coding Standards, and ideally causes no recompilation.
+However, some platforms have known limitations with the semantics of
+shared libraries that end up requiring recompilation when using this
+method, particularly noticeable in packages that use GNU Libtool.
+
+   The second method involves providing the `DESTDIR' variable.  For
+example, `make install DESTDIR=/alternate/directory' will prepend
+`/alternate/directory' before all installation names.  The approach of
+`DESTDIR' overrides is not required by the GNU Coding Standards, and
+does not work on platforms that have drive letters.  On the other hand,
+it does better at avoiding recompilation issues, and works well even
+when some directory options were not specified in terms of `${prefix}'
+at `configure' time.
+
+Optional Features
+=================
+
+   If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+   Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System).  The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+   For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+   Some packages offer the ability to configure how verbose the
+execution of `make' will be.  For these packages, running `./configure
+--enable-silent-rules' sets the default to minimal output, which can be
+overridden with `make V=1'; while running `./configure
+--disable-silent-rules' sets the default to verbose, which can be
+overridden with `make V=0'.
+
+Particular systems
+==================
+
+   On HP-UX, the default C compiler is not ANSI C compatible.  If GNU
+CC is not installed, it is recommended to use the following options in
+order to use an ANSI C compiler:
+
+     ./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
+
+and if that doesn't work, install pre-built binaries of GCC for HP-UX.
+
+   HP-UX `make' updates targets which have the same time stamps as
+their prerequisites, which makes it generally unusable when shipped
+generated files such as `configure' are involved.  Use GNU `make'
+instead.
+
+   On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
+parse its `<wchar.h>' header file.  The option `-nodtk' can be used as
+a workaround.  If GNU CC is not installed, it is therefore recommended
+to try
+
+     ./configure CC="cc"
+
+and if that doesn't work, try
+
+     ./configure CC="cc -nodtk"
+
+   On Solaris, don't put `/usr/ucb' early in your `PATH'.  This
+directory contains several dysfunctional programs; working variants of
+these programs are available in `/usr/bin'.  So, if you need `/usr/ucb'
+in your `PATH', put it _after_ `/usr/bin'.
+
+   On Haiku, software installed for all users goes in `/boot/common',
+not `/usr/local'.  It is recommended to use the following options:
+
+     ./configure --prefix=/boot/common
+
+Specifying the System Type
+==========================
+
+   There may be some features `configure' cannot figure out
+automatically, but needs to determine by the type of machine the package
+will run on.  Usually, assuming the package is built to be run on the
+_same_ architectures, `configure' can figure that out, but if it prints
+a message saying it cannot guess the machine type, give it the
+`--build=TYPE' option.  TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name which has the form:
+
+     CPU-COMPANY-SYSTEM
+
+where SYSTEM can have one of these forms:
+
+     OS
+     KERNEL-OS
+
+   See the file `config.sub' for the possible values of each field.  If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the machine type.
+
+   If you are _building_ compiler tools for cross-compiling, you should
+use the option `--target=TYPE' to select the type of system they will
+produce code for.
+
+   If you want to _use_ a cross compiler, that generates code for a
+platform different from the build platform, you should specify the
+"host" platform (i.e., that on which the generated programs will
+eventually be run) with `--host=TYPE'.
+
+Sharing Defaults
+================
+
+   If you want to set default values for `configure' scripts to share,
+you can create a site shell script called `config.site' that gives
+default values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists.  Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Defining Variables
+==================
+
+   Variables not defined in a site shell script can be set in the
+environment passed to `configure'.  However, some packages may run
+configure again during the build, and the customized values of these
+variables may be lost.  In order to avoid this problem, you should set
+them in the `configure' command line, using `VAR=value'.  For example:
+
+     ./configure CC=/usr/local2/bin/gcc
+
+causes the specified `gcc' to be used as the C compiler (unless it is
+overridden in the site shell script).
+
+Unfortunately, this technique does not work for `CONFIG_SHELL' due to
+an Autoconf limitation.  Until the limitation is lifted, you can use
+this workaround:
+
+     CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash
+
+`configure' Invocation
+======================
+
+   `configure' recognizes the following options to control how it
+operates.
+
+`--help'
+`-h'
+     Print a summary of all of the options to `configure', and exit.
+
+`--help=short'
+`--help=recursive'
+     Print a summary of the options unique to this package's
+     `configure', and exit.  The `short' variant lists options used
+     only in the top level, while the `recursive' variant lists options
+     also present in any nested packages.
+
+`--version'
+`-V'
+     Print the version of Autoconf used to generate the `configure'
+     script, and exit.
+
+`--cache-file=FILE'
+     Enable the cache: use and save the results of the tests in FILE,
+     traditionally `config.cache'.  FILE defaults to `/dev/null' to
+     disable caching.
+
+`--config-cache'
+`-C'
+     Alias for `--cache-file=config.cache'.
+
+`--quiet'
+`--silent'
+`-q'
+     Do not print messages saying which checks are being made.  To
+     suppress all normal output, redirect it to `/dev/null' (any error
+     messages will still be shown).
+
+`--srcdir=DIR'
+     Look for the package's source code in directory DIR.  Usually
+     `configure' can determine that directory automatically.
+
+`--prefix=DIR'
+     Use DIR as the installation prefix.  *note Installation Names::
+     for more details, including other options available for fine-tuning
+     the installation locations.
+
+`--no-create'
+`-n'
+     Run the configure checks, but stop before creating any output
+     files.
+
+`configure' also accepts some other, not widely useful, options.  Run
+`configure --help' for more details.
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile	(revision 70339)
@@ -0,0 +1,845 @@
+# Makefile.in generated by automake 1.14.1 from Makefile.am.
+# Makefile.  Generated from Makefile.in by configure.
+
+# Copyright (C) 1994-2013 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+
+
+###############################################################################
+###############################################################################
+
+
+am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/apertium-rus-eng
+pkgincludedir = $(includedir)/apertium-rus-eng
+pkglibdir = $(libdir)/apertium-rus-eng
+pkglibexecdir = $(libexecdir)/apertium-rus-eng
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+subdir = .
+DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \
+	$(srcdir)/Makefile.in $(srcdir)/Makefile.am \
+	$(top_srcdir)/configure $(am__configure_deps) COPYING \
+	install-sh missing
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_$(V))
+am__v_P_ = $(am__v_P_$(AM_DEFAULT_VERBOSITY))
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_$(V))
+am__v_GEN_ = $(am__v_GEN_$(AM_DEFAULT_VERBOSITY))
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_$(V))
+am__v_at_ = $(am__v_at_$(AM_DEFAULT_VERBOSITY))
+am__v_at_0 = @
+am__v_at_1 = 
+SOURCES =
+DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(apertium_rus_engdir)"
+DATA = $(apertium_rus_eng_DATA) $(noinst_DATA)
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+DIST_TARGETS = dist-gzip
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing aclocal-1.14
+AMTAR = $${TAR-tar}
+AM_DEFAULT_VERBOSITY = 1
+APERTIUM_CFLAGS = -I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  
+APERTIUM_ENG_CFLAGS = 
+APERTIUM_ENG_LIBS = 
+APERTIUM_LIBS = -L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  
+APERTIUM_RUS_CFLAGS = 
+APERTIUM_RUS_LIBS = 
+AP_LIB1 = ../apertium-rus
+AP_LIB2 = ../apertium-eng
+AP_SRC1 = ../apertium-rus
+AP_SRC2 = ../apertium-eng
+AP_SUBDIRS =  ../apertium-rus ../apertium-eng
+AUTOCONF = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing autoconf
+AUTOHEADER = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing autoheader
+AUTOMAKE = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing automake-1.14
+AWK = gawk
+CGCOMP = /usr/bin/cg-comp
+CGPROC = /usr/bin/cg-proc
+CYGPATH_W = echo
+DEFS = -DPACKAGE_NAME=\"Apertium\ Russian-English\" -DPACKAGE_TARNAME=\"apertium-rus-eng\" -DPACKAGE_VERSION=\"0.2.0\" -DPACKAGE_STRING=\"Apertium\ Russian-English\ 0.2.0\" -DPACKAGE_BUGREPORT=\"super-antispam@ya.ru\" -DPACKAGE_URL=\"http://wiki.apertium.org/wiki/Apertium-rus-eng\" -DPACKAGE=\"apertium-rus-eng\" -DVERSION=\"0.2.0\"
+ECHO_C = 
+ECHO_N = -n
+ECHO_T = 
+INSTALL = /usr/bin/install -c
+INSTALL_DATA = ${INSTALL} -m 644
+INSTALL_PROGRAM = ${INSTALL}
+INSTALL_SCRIPT = ${INSTALL}
+INSTALL_STRIP_PROGRAM = $(install_sh) -c -s
+LIBOBJS = 
+LIBS = 
+LN_S = ln -s
+LRXCOMP = /usr/local/bin/lrx-comp
+LRXPROC = /usr/local/bin/lrx-proc
+LTLIBOBJS = 
+MAKEINFO = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing makeinfo
+MKDIR_P = /bin/mkdir -p
+PACKAGE = apertium-rus-eng
+PACKAGE_BUGREPORT = super-antispam@ya.ru
+PACKAGE_NAME = Apertium Russian-English
+PACKAGE_STRING = Apertium Russian-English 0.2.0
+PACKAGE_TARNAME = apertium-rus-eng
+PACKAGE_URL = http://wiki.apertium.org/wiki/Apertium-rus-eng
+PACKAGE_VERSION = 0.2.0
+PATH_SEPARATOR = :
+PKG_CONFIG = /usr/bin/pkg-config
+PKG_CONFIG_LIBDIR = 
+PKG_CONFIG_PATH = /usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig
+SET_MAKE = 
+SHELL = /bin/bash
+STRIP = 
+VERSION = 0.1.0
+ZCAT = /bin/zcat
+abs_builddir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng
+abs_srcdir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng
+abs_top_builddir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng
+abs_top_srcdir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng
+am__leading_dot = .
+am__tar = $${TAR-tar} chof - "$$tardir"
+am__untar = $${TAR-tar} xf -
+bindir = ${exec_prefix}/bin
+build_alias = 
+builddir = .
+datadir = ${datarootdir}
+datarootdir = ${prefix}/share
+docdir = ${datarootdir}/doc/${PACKAGE_TARNAME}
+dvidir = ${docdir}
+exec_prefix = ${prefix}
+host_alias = 
+htmldir = ${docdir}
+includedir = ${prefix}/include
+infodir = ${datarootdir}/info
+install_sh = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/install-sh
+libdir = ${exec_prefix}/lib
+libexecdir = ${exec_prefix}/libexec
+localedir = ${datarootdir}/locale
+localstatedir = ${prefix}/var
+mandir = ${datarootdir}/man
+mkdir_p = $(MKDIR_P)
+oldincludedir = /usr/include
+pdfdir = ${docdir}
+prefix = /usr/local
+program_transform_name = s,x,x,
+psdir = ${docdir}
+sbindir = ${exec_prefix}/sbin
+sharedstatedir = ${prefix}/com
+srcdir = .
+sysconfdir = ${prefix}/etc
+target_alias = 
+top_build_prefix = 
+top_builddir = .
+top_srcdir = .
+LANG1 = rus
+LANG2 = eng
+PREFIX1 = $(LANG1)-$(LANG2)
+PREFIX2 = $(LANG2)-$(LANG1)
+BASENAME = apertium-$(PREFIX1)
+TARGETS_COMMON = \
+	$(PREFIX1).automorf.bin	\
+	$(PREFIX1).prob		\
+	$(PREFIX1).rlx.bin	\
+	$(PREFIX1).autobil.bin	\
+	$(PREFIX1).autolex.bin	\
+	$(PREFIX1).autogen.bin	\
+	$(PREFIX1).autopgen.bin	\
+	$(PREFIX1).t1x.bin	\
+	$(PREFIX1).t2x.bin	\
+	$(PREFIX1).t3x.bin	\
+	$(PREFIX2).automorf.bin	\
+	$(PREFIX2).prob		\
+	$(PREFIX2).rlx.bin	\
+	$(PREFIX2).autobil.bin	\
+	$(PREFIX2).autolex.bin	\
+	$(PREFIX2).autogen.bin	\
+	$(PREFIX2).autopgen.bin	\
+	$(PREFIX2).t1x.bin	\
+	$(PREFIX2).t2x.bin	\
+	$(PREFIX2).t3x.bin
+
+
+###############################################################################
+###############################################################################
+EXTRA_DIST = \
+		$(BASENAME).$(PREFIX1).lrx	\
+		$(BASENAME).$(PREFIX1).dix	\
+		$(BASENAME).$(PREFIX2).lrx	\
+		$(BASENAME).$(PREFIX1).t1x	\
+		$(BASENAME).$(PREFIX1).t2x	\
+		$(BASENAME).$(PREFIX1).t3x	\
+		$(BASENAME).$(PREFIX2).t1x	\
+		$(BASENAME).$(PREFIX2).t2x	\
+		$(BASENAME).$(PREFIX2).t3x	\
+		modes.xml
+
+
+###############################################################################
+###############################################################################
+apertium_rus_engdir = $(prefix)/share/apertium/$(BASENAME)/
+
+# Files which should be installed to $(prefix)/share/apertium/$(BASENAME)/:
+apertium_rus_eng_DATA = \
+	$(TARGETS_COMMON)				\
+	$(BASENAME).$(PREFIX1).t1x			\
+	$(BASENAME).$(PREFIX1).t2x			\
+	$(BASENAME).$(PREFIX1).t3x			\
+	$(BASENAME).$(PREFIX2).t1x			\
+	$(BASENAME).$(PREFIX2).t2x			\
+	$(BASENAME).$(PREFIX2).t3x
+
+
+# All modes are created by the same goal, listing several will just give problems with make -j2
+noinst_DATA = modes/$(PREFIX1).mode
+
+###############################################################################
+###############################################################################
+CLEANFILES = $(TARGETS_COMMON)
+all: all-am
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+install-apertium_rus_engDATA: $(apertium_rus_eng_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(apertium_rus_eng_DATA)'; test -n "$(apertium_rus_engdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(apertium_rus_engdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(apertium_rus_engdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(apertium_rus_engdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(apertium_rus_engdir)" || exit $$?; \
+	done
+
+uninstall-apertium_rus_engDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(apertium_rus_eng_DATA)'; test -n "$(apertium_rus_engdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(apertium_rus_engdir)'; $(am__uninstall_files_from_dir)
+tags TAGS:
+
+ctags CTAGS:
+
+cscope cscopelist:
+
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__post_remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__post_remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__post_remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__post_remove_distdir)
+
+dist-tarZ: distdir
+	@echo WARNING: "Support for shar distribution archives is" \
+	               "deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__post_remove_distdir)
+
+dist-shar: distdir
+	@echo WARNING: "Support for distribution archives compressed with" \
+		       "legacy program 'compress' is deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__post_remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__post_remove_distdir)
+
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	    --srcdir=.. --prefix="$$dc_install_base" \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__post_remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-am
+all-am: Makefile $(DATA)
+installdirs:
+	for dir in "$(DESTDIR)$(apertium_rus_engdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+
+clean-generic:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am: install-apertium_rus_engDATA install-data-local
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-apertium_rus_engDATA
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am am--refresh check check-am clean clean-generic \
+	clean-local cscopelist-am ctags-am dist dist-all dist-bzip2 \
+	dist-gzip dist-lzip dist-shar dist-tarZ dist-xz dist-zip \
+	distcheck distclean distclean-generic distcleancheck distdir \
+	distuninstallcheck dvi dvi-am html html-am info info-am \
+	install install-am install-apertium_rus_engDATA install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-ps install-ps-am install-strip \
+	installcheck installcheck-am installdirs maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-generic pdf \
+	pdf-am ps ps-am tags-am uninstall uninstall-am \
+	uninstall-apertium_rus_engDATA
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then mv $$modes modes/; fi
+
+apertium_modesdir=$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml $(prefix)/share/apertium/$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d $(DESTDIR)$(apertium_modesdir) || mkdir $(DESTDIR)$(apertium_modesdir)
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then \
+			$(INSTALL_DATA) $$modes $(DESTDIR)$(apertium_modesdir); \
+			rm $$modes; \
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch $@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; 	if $(am__make_keepgoing); then 	  failcom='fail=yes'; 	else 	  failcom='exit 1'; 	fi; 	dot_seen=no; 	list='$(AP_SUBDIRS)'; 	for subdir in $$list; do 	  echo "Making $$subdir"; 	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) all-am) 	  || eval $$failcom; 	done; 	$(MAKE) $(AM_MAKEFLAGS) all-am || exit 1; 	test -z "$$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/$*.autobil.att > .deps/$*.autobil.hfst
+	hfst-project -p upper .deps/$*.autobil.hfst > .deps/$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/$*.autobil.upper -2 .deps/$*.any-nonplus.hfst -o .deps/$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/$*.single-plus.hfst -2 .deps/$*.autobil.nonplussed -o .deps/$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/$*.autobil.postplus -o .deps/$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/$*.autobil.nonplussed -2 .deps/$*.autobil.postplus.0,3 -o $@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+
+###############################################################################
+###############################################################################
+
+# -------------------
+# Russian analysis:
+# -------------------
+
+.deps/$(LANG1).automorf.bin: $(AP_SRC1)/$(LANG1).automorf.bin .deps/.d
+	cp $< $@
+
+$(PREFIX1).automorf.bin: .deps/$(LANG1).automorf.bin $(PREFIX1).autobil.bin
+	lt-trim $^ $@
+
+# -------------------
+# Russian generation:
+# ---------------------
+
+$(PREFIX2).autogen.bin: $(AP_SRC1)/$(LANG1).autogen.bin
+	cp $< $@
+
+# -------------------
+# English analysis:
+# -------------------
+
+.deps/$(LANG2).automorf.bin: $(AP_SRC2)/$(LANG2).automorf.bin .deps/.d
+	cp $< $@
+
+$(PREFIX2).automorf.bin: .deps/$(LANG2).automorf.bin $(PREFIX2).autobil.bin
+	lt-trim $^ $@
+
+# -------------------
+# English generation:
+# ---------------------
+
+$(PREFIX1).autogen.bin: $(AP_SRC2)/$(LANG2).autogen.bin
+	cp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).prob: $(AP_SRC1)/$(LANG1).prob
+	cp $< $@
+
+$(PREFIX2).prob: $(AP_SRC2)/$(LANG2).prob
+	cp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).rlx.bin: $(AP_SRC1)/apertium-$(LANG1).$(LANG1).rlx
+	cg-comp $< $@
+
+$(PREFIX2).rlx.bin: $(AP_SRC2)/apertium-$(LANG2).$(LANG2).rlx
+	cg-comp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).autobil.bin: $(BASENAME).$(PREFIX1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@
+
+$(PREFIX2).autobil.bin: $(BASENAME).$(PREFIX1).dix
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).autolex.bin: $(BASENAME).$(PREFIX1).lrx
+	lrx-comp $< $@
+
+$(PREFIX2).autolex.bin: $(BASENAME).$(PREFIX2).lrx
+	lrx-comp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).t1x.bin: $(BASENAME).$(PREFIX1).t1x
+	apertium-validate-transfer $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX1).t2x.bin: $(BASENAME).$(PREFIX1).t2x
+	apertium-validate-interchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX1).t3x.bin: $(BASENAME).$(PREFIX1).t3x
+	apertium-validate-postchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t1x.bin: $(BASENAME).$(PREFIX2).t1x
+	apertium-validate-transfer $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t2x.bin: $(BASENAME).$(PREFIX2).t2x
+	apertium-validate-interchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t3x.bin: $(BASENAME).$(PREFIX2).t3x
+	apertium-validate-postchunk $<
+	apertium-preprocess-transfer $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).autopgen.bin: $(AP_SRC2)/$(LANG2).autopgen.bin
+	cp $< $@
+
+$(PREFIX2).autopgen.bin: $(AP_SRC1)/$(LANG1).autopgen.bin
+	cp $< $@
+
+install-data-local: install-modes
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+###############################################################################
+
+test: all
+	echo "house" | apertium -d . rus-eng | tee .test-mt
+	@echo "house" > .test-ref
+	@diff .test-ref .test-mt
+	echo "house" | apertium -d . eng-rus | tee .test-mt
+	@echo "house" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile.am	(revision 70339)
@@ -0,0 +1,217 @@
+###############################################################################
+## Makefile for Russian--English
+###############################################################################
+
+VERSION=0.1.0
+LANG1=rus
+LANG2=eng
+PREFIX1=$(LANG1)-$(LANG2)
+PREFIX2=$(LANG2)-$(LANG1)
+
+BASENAME=apertium-$(PREFIX1)
+
+TARGETS_COMMON =		\
+	$(PREFIX1).automorf.bin	\
+	$(PREFIX1).prob		\
+	$(PREFIX1).rlx.bin	\
+	$(PREFIX1).autobil.bin	\
+	$(PREFIX1).autolex.bin	\
+	$(PREFIX1).autogen.bin	\
+	$(PREFIX1).autopgen.bin	\
+	$(PREFIX1).t1x.bin	\
+	$(PREFIX1).t2x.bin	\
+	$(PREFIX1).t3x.bin	\
+	$(PREFIX2).automorf.bin	\
+	$(PREFIX2).prob		\
+	$(PREFIX2).rlx.bin	\
+	$(PREFIX2).autobil.bin	\
+	$(PREFIX2).autolex.bin	\
+	$(PREFIX2).autogen.bin	\
+	$(PREFIX2).autopgen.bin	\
+	$(PREFIX2).t1x.bin	\
+	$(PREFIX2).t2x.bin	\
+	$(PREFIX2).t3x.bin
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+@ap_include@
+
+###############################################################################
+## Monolingual transducers
+###############################################################################
+
+# -------------------
+# Russian analysis:
+# -------------------
+
+.deps/$(LANG1).automorf.bin: $(AP_SRC1)/$(LANG1).automorf.bin .deps/.d
+	cp $< $@
+
+$(PREFIX1).automorf.bin: .deps/$(LANG1).automorf.bin $(PREFIX1).autobil.bin
+	lt-trim $^ $@
+
+# -------------------
+# Russian generation:
+# ---------------------
+
+
+$(PREFIX2).autogen.bin: $(AP_SRC1)/$(LANG1).autogen.bin
+	cp $< $@
+
+# -------------------
+# English analysis:
+# -------------------
+
+.deps/$(LANG2).automorf.bin: $(AP_SRC2)/$(LANG2).automorf.bin .deps/.d
+	cp $< $@
+
+$(PREFIX2).automorf.bin: .deps/$(LANG2).automorf.bin $(PREFIX2).autobil.bin
+	lt-trim $^ $@
+
+# -------------------
+# English generation:
+# ---------------------
+
+
+$(PREFIX1).autogen.bin: $(AP_SRC2)/$(LANG2).autogen.bin
+	cp $< $@
+
+###############################################################################
+## Tagger models
+###############################################################################
+
+$(PREFIX1).prob: $(AP_SRC1)/$(LANG1).prob
+	cp $< $@
+
+$(PREFIX2).prob: $(AP_SRC2)/$(LANG2).prob
+	cp $< $@
+
+###############################################################################
+## Disambiguation rules
+###############################################################################
+
+$(PREFIX1).rlx.bin: $(AP_SRC1)/apertium-$(LANG1).$(LANG1).rlx
+	cg-comp $< $@
+
+$(PREFIX2).rlx.bin: $(AP_SRC2)/apertium-$(LANG2).$(LANG2).rlx
+	cg-comp $< $@
+
+###############################################################################
+## Bilingual dictionaries
+###############################################################################
+
+$(PREFIX1).autobil.bin: $(BASENAME).$(PREFIX1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@
+
+$(PREFIX2).autobil.bin: $(BASENAME).$(PREFIX1).dix
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@
+
+###############################################################################
+## Lexical selection rules
+###############################################################################
+
+$(PREFIX1).autolex.bin: $(BASENAME).$(PREFIX1).lrx
+	lrx-comp $< $@
+
+$(PREFIX2).autolex.bin: $(BASENAME).$(PREFIX2).lrx
+	lrx-comp $< $@
+
+###############################################################################
+## Structural transfer rules
+###############################################################################
+
+$(PREFIX1).t1x.bin: $(BASENAME).$(PREFIX1).t1x
+	apertium-validate-transfer $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX1).t2x.bin: $(BASENAME).$(PREFIX1).t2x
+	apertium-validate-interchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX1).t3x.bin: $(BASENAME).$(PREFIX1).t3x
+	apertium-validate-postchunk $<
+	apertium-preprocess-transfer $< $@
+
+
+$(PREFIX2).t1x.bin: $(BASENAME).$(PREFIX2).t1x
+	apertium-validate-transfer $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t2x.bin: $(BASENAME).$(PREFIX2).t2x
+	apertium-validate-interchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t3x.bin: $(BASENAME).$(PREFIX2).t3x
+	apertium-validate-postchunk $<
+	apertium-preprocess-transfer $< $@
+
+###############################################################################
+## Postgeneration dictionaries
+###############################################################################
+
+$(PREFIX1).autopgen.bin: $(AP_SRC2)/$(LANG2).autopgen.bin
+	cp $< $@
+
+$(PREFIX2).autopgen.bin: $(AP_SRC1)/$(LANG1).autopgen.bin
+	cp $< $@
+
+###############################################################################
+## Distribution
+###############################################################################
+
+EXTRA_DIST=					\
+		$(BASENAME).$(PREFIX1).lrx	\
+		$(BASENAME).$(PREFIX1).dix	\
+		$(BASENAME).$(PREFIX2).lrx	\
+		$(BASENAME).$(PREFIX1).t1x	\
+		$(BASENAME).$(PREFIX1).t2x	\
+		$(BASENAME).$(PREFIX1).t3x	\
+		$(BASENAME).$(PREFIX2).t1x	\
+		$(BASENAME).$(PREFIX2).t2x	\
+		$(BASENAME).$(PREFIX2).t3x	\
+		modes.xml
+
+###############################################################################
+## Installation
+###############################################################################
+
+apertium_rus_engdir=$(prefix)/share/apertium/$(BASENAME)/
+
+# Files which should be installed to $(prefix)/share/apertium/$(BASENAME)/:
+apertium_rus_eng_DATA=	\
+	$(TARGETS_COMMON)				\
+	$(BASENAME).$(PREFIX1).t1x			\
+	$(BASENAME).$(PREFIX1).t2x			\
+	$(BASENAME).$(PREFIX1).t3x			\
+	$(BASENAME).$(PREFIX2).t1x			\
+	$(BASENAME).$(PREFIX2).t2x			\
+	$(BASENAME).$(PREFIX2).t3x
+
+# All modes are created by the same goal, listing several will just give problems with make -j2
+noinst_DATA=modes/$(PREFIX1).mode
+
+install-data-local: install-modes
+
+###############################################################################
+## Cleanup
+###############################################################################
+
+CLEANFILES = $(TARGETS_COMMON)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+## Test
+###############################################################################
+
+test: all
+	echo "house" | apertium -d . rus-eng | tee .test-mt
+	@echo "house" > .test-ref
+	@diff .test-ref .test-mt
+	echo "house" | apertium -d . eng-rus | tee .test-mt
+	@echo "house" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/Makefile.in	(revision 70339)
@@ -0,0 +1,804 @@
+# Makefile.in generated by automake 1.14.1 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994-2013 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+
+###############################################################################
+###############################################################################
+
+VPATH = @srcdir@
+am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkglibexecdir = $(libexecdir)/@PACKAGE@
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+subdir = .
+DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \
+	$(srcdir)/Makefile.in $(srcdir)/Makefile.am \
+	$(top_srcdir)/configure $(am__configure_deps) COPYING \
+	install-sh missing
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES =
+CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_@AM_V@)
+am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_@AM_V@)
+am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_@AM_V@)
+am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
+SOURCES =
+DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(apertium_rus_engdir)"
+DATA = $(apertium_rus_eng_DATA) $(noinst_DATA)
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+DIST_TARGETS = dist-gzip
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
+APERTIUM_CFLAGS = @APERTIUM_CFLAGS@
+APERTIUM_ENG_CFLAGS = @APERTIUM_ENG_CFLAGS@
+APERTIUM_ENG_LIBS = @APERTIUM_ENG_LIBS@
+APERTIUM_LIBS = @APERTIUM_LIBS@
+APERTIUM_RUS_CFLAGS = @APERTIUM_RUS_CFLAGS@
+APERTIUM_RUS_LIBS = @APERTIUM_RUS_LIBS@
+AP_LIB1 = @AP_LIB1@
+AP_LIB2 = @AP_LIB2@
+AP_SRC1 = @AP_SRC1@
+AP_SRC2 = @AP_SRC2@
+AP_SUBDIRS = @AP_SUBDIRS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CGCOMP = @CGCOMP@
+CGPROC = @CGPROC@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LN_S = @LN_S@
+LRXCOMP = @LRXCOMP@
+LRXPROC = @LRXPROC@
+LTLIBOBJS = @LTLIBOBJS@
+MAKEINFO = @MAKEINFO@
+MKDIR_P = @MKDIR_P@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_URL = @PACKAGE_URL@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+PKG_CONFIG = @PKG_CONFIG@
+PKG_CONFIG_LIBDIR = @PKG_CONFIG_LIBDIR@
+PKG_CONFIG_PATH = @PKG_CONFIG_PATH@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = 0.1.0
+ZCAT = @ZCAT@
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+am__leading_dot = @am__leading_dot@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build_alias = @build_alias@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host_alias = @host_alias@
+htmldir = @htmldir@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localedir = @localedir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+pdfdir = @pdfdir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+psdir = @psdir@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+srcdir = @srcdir@
+sysconfdir = @sysconfdir@
+target_alias = @target_alias@
+top_build_prefix = @top_build_prefix@
+top_builddir = @top_builddir@
+top_srcdir = @top_srcdir@
+LANG1 = rus
+LANG2 = eng
+PREFIX1 = $(LANG1)-$(LANG2)
+PREFIX2 = $(LANG2)-$(LANG1)
+BASENAME = apertium-$(PREFIX1)
+TARGETS_COMMON = \
+	$(PREFIX1).automorf.bin	\
+	$(PREFIX1).prob		\
+	$(PREFIX1).rlx.bin	\
+	$(PREFIX1).autobil.bin	\
+	$(PREFIX1).autolex.bin	\
+	$(PREFIX1).autogen.bin	\
+	$(PREFIX1).autopgen.bin	\
+	$(PREFIX1).t1x.bin	\
+	$(PREFIX1).t2x.bin	\
+	$(PREFIX1).t3x.bin	\
+	$(PREFIX2).automorf.bin	\
+	$(PREFIX2).prob		\
+	$(PREFIX2).rlx.bin	\
+	$(PREFIX2).autobil.bin	\
+	$(PREFIX2).autolex.bin	\
+	$(PREFIX2).autogen.bin	\
+	$(PREFIX2).autopgen.bin	\
+	$(PREFIX2).t1x.bin	\
+	$(PREFIX2).t2x.bin	\
+	$(PREFIX2).t3x.bin
+
+
+###############################################################################
+###############################################################################
+EXTRA_DIST = \
+		$(BASENAME).$(PREFIX1).lrx	\
+		$(BASENAME).$(PREFIX1).dix	\
+		$(BASENAME).$(PREFIX2).lrx	\
+		$(BASENAME).$(PREFIX1).t1x	\
+		$(BASENAME).$(PREFIX1).t2x	\
+		$(BASENAME).$(PREFIX1).t3x	\
+		$(BASENAME).$(PREFIX2).t1x	\
+		$(BASENAME).$(PREFIX2).t2x	\
+		$(BASENAME).$(PREFIX2).t3x	\
+		modes.xml
+
+
+###############################################################################
+###############################################################################
+apertium_rus_engdir = $(prefix)/share/apertium/$(BASENAME)/
+
+# Files which should be installed to $(prefix)/share/apertium/$(BASENAME)/:
+apertium_rus_eng_DATA = \
+	$(TARGETS_COMMON)				\
+	$(BASENAME).$(PREFIX1).t1x			\
+	$(BASENAME).$(PREFIX1).t2x			\
+	$(BASENAME).$(PREFIX1).t3x			\
+	$(BASENAME).$(PREFIX2).t1x			\
+	$(BASENAME).$(PREFIX2).t2x			\
+	$(BASENAME).$(PREFIX2).t3x
+
+
+# All modes are created by the same goal, listing several will just give problems with make -j2
+noinst_DATA = modes/$(PREFIX1).mode
+
+###############################################################################
+###############################################################################
+CLEANFILES = $(TARGETS_COMMON)
+all: all-am
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+install-apertium_rus_engDATA: $(apertium_rus_eng_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(apertium_rus_eng_DATA)'; test -n "$(apertium_rus_engdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(apertium_rus_engdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(apertium_rus_engdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(apertium_rus_engdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(apertium_rus_engdir)" || exit $$?; \
+	done
+
+uninstall-apertium_rus_engDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(apertium_rus_eng_DATA)'; test -n "$(apertium_rus_engdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(apertium_rus_engdir)'; $(am__uninstall_files_from_dir)
+tags TAGS:
+
+ctags CTAGS:
+
+cscope cscopelist:
+
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__post_remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__post_remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__post_remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__post_remove_distdir)
+
+dist-tarZ: distdir
+	@echo WARNING: "Support for shar distribution archives is" \
+	               "deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__post_remove_distdir)
+
+dist-shar: distdir
+	@echo WARNING: "Support for distribution archives compressed with" \
+		       "legacy program 'compress' is deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__post_remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__post_remove_distdir)
+
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	    --srcdir=.. --prefix="$$dc_install_base" \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__post_remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-am
+all-am: Makefile $(DATA)
+installdirs:
+	for dir in "$(DESTDIR)$(apertium_rus_engdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+
+clean-generic:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am: install-apertium_rus_engDATA install-data-local
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-apertium_rus_engDATA
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am am--refresh check check-am clean clean-generic \
+	clean-local cscopelist-am ctags-am dist dist-all dist-bzip2 \
+	dist-gzip dist-lzip dist-shar dist-tarZ dist-xz dist-zip \
+	distcheck distclean distclean-generic distcleancheck distdir \
+	distuninstallcheck dvi dvi-am html html-am info info-am \
+	install install-am install-apertium_rus_engDATA install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-ps install-ps-am install-strip \
+	installcheck installcheck-am installdirs maintainer-clean \
+	maintainer-clean-generic mostlyclean mostlyclean-generic pdf \
+	pdf-am ps ps-am tags-am uninstall uninstall-am \
+	uninstall-apertium_rus_engDATA
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+@ap_include@
+
+###############################################################################
+###############################################################################
+
+# -------------------
+# Russian analysis:
+# -------------------
+
+.deps/$(LANG1).automorf.bin: $(AP_SRC1)/$(LANG1).automorf.bin .deps/.d
+	cp $< $@
+
+$(PREFIX1).automorf.bin: .deps/$(LANG1).automorf.bin $(PREFIX1).autobil.bin
+	lt-trim $^ $@
+
+# -------------------
+# Russian generation:
+# ---------------------
+
+$(PREFIX2).autogen.bin: $(AP_SRC1)/$(LANG1).autogen.bin
+	cp $< $@
+
+# -------------------
+# English analysis:
+# -------------------
+
+.deps/$(LANG2).automorf.bin: $(AP_SRC2)/$(LANG2).automorf.bin .deps/.d
+	cp $< $@
+
+$(PREFIX2).automorf.bin: .deps/$(LANG2).automorf.bin $(PREFIX2).autobil.bin
+	lt-trim $^ $@
+
+# -------------------
+# English generation:
+# ---------------------
+
+$(PREFIX1).autogen.bin: $(AP_SRC2)/$(LANG2).autogen.bin
+	cp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).prob: $(AP_SRC1)/$(LANG1).prob
+	cp $< $@
+
+$(PREFIX2).prob: $(AP_SRC2)/$(LANG2).prob
+	cp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).rlx.bin: $(AP_SRC1)/apertium-$(LANG1).$(LANG1).rlx
+	cg-comp $< $@
+
+$(PREFIX2).rlx.bin: $(AP_SRC2)/apertium-$(LANG2).$(LANG2).rlx
+	cg-comp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).autobil.bin: $(BASENAME).$(PREFIX1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@
+
+$(PREFIX2).autobil.bin: $(BASENAME).$(PREFIX1).dix
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).autolex.bin: $(BASENAME).$(PREFIX1).lrx
+	lrx-comp $< $@
+
+$(PREFIX2).autolex.bin: $(BASENAME).$(PREFIX2).lrx
+	lrx-comp $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).t1x.bin: $(BASENAME).$(PREFIX1).t1x
+	apertium-validate-transfer $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX1).t2x.bin: $(BASENAME).$(PREFIX1).t2x
+	apertium-validate-interchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX1).t3x.bin: $(BASENAME).$(PREFIX1).t3x
+	apertium-validate-postchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t1x.bin: $(BASENAME).$(PREFIX2).t1x
+	apertium-validate-transfer $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t2x.bin: $(BASENAME).$(PREFIX2).t2x
+	apertium-validate-interchunk $<
+	apertium-preprocess-transfer $< $@
+
+$(PREFIX2).t3x.bin: $(BASENAME).$(PREFIX2).t3x
+	apertium-validate-postchunk $<
+	apertium-preprocess-transfer $< $@
+
+###############################################################################
+###############################################################################
+
+$(PREFIX1).autopgen.bin: $(AP_SRC2)/$(LANG2).autopgen.bin
+	cp $< $@
+
+$(PREFIX2).autopgen.bin: $(AP_SRC1)/$(LANG1).autopgen.bin
+	cp $< $@
+
+install-data-local: install-modes
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+###############################################################################
+
+test: all
+	echo "house" | apertium -d . rus-eng | tee .test-mt
+	@echo "house" > .test-ref
+	@diff .test-ref .test-mt
+	echo "house" | apertium -d . eng-rus | tee .test-mt
+	@echo "house" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/NEWS
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/README
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/README	(revision 70339)
@@ -0,0 +1,88 @@
+Russian and English
+
+                            apertium-rus-eng
+===============================================================================
+
+This is an Apertium language pair for translating between Russian and
+English. What you can use this language package for:
+
+* Translating between Russian and English
+* Morphological analysis of Russian and English
+* Part-of-speech tagging of Russian and English
+
+For information on the latter two points, see subheading "For more
+information" below
+
+Requirements
+===============================================================================
+
+You will need the following software installed:
+
+* lttoolbox (>= 3.3.0)
+* apertium (>= 3.3.0)
+* vislcg3 (>= 0.9.9.10297)
+* apertium-rus
+* apertium-eng
+
+If this does not make any sense, we recommend you look at: www.apertium.org
+
+Compiling
+===============================================================================
+
+Given the requirements being installed, you should be able to just run:
+
+$ ./configure
+$ make
+# make install
+
+You can use ./autogen.sh instead of ./configure you're compiling from
+SVN. If you installed any prerequisite language packages using a --prefix
+to ./configure, make sure to give the same --prefix to ./configure here.
+
+Testing
+===============================================================================
+
+If you are in the source directory after running make, the following
+commands should work:
+
+$  echo "TODO test sentence 1" | apertium -d . rus-eng
+TODO test translated sentence 1
+
+$ echo "TODO test sentence 2" | apertium -d . eng-rus
+TODO test translated sentence 2
+
+After installing somewhere in $PATH, you should be able to do e.g.
+
+$  echo "TODO test sentence 1" | apertium rus-eng
+TODO test translated sentence 1
+
+Files and data
+===============================================================================
+
+* apertium-rus-eng.rus-eng.dix  - Bilingual dictionary
+* apertium-rus-eng.rus-eng.t1x  - Chunking rules for translating into English
+* apertium-rus-eng.eng-rus.t1x  - Chunking rules for translating into Russian
+* apertium-rus-eng.rus-eng.t2x  - Interchunk rules for translating into English
+* apertium-rus-eng.eng-rus.t2x  - Interchunk rules for translating into Russian
+* apertium-rus-eng.rus-eng.t3x  - Postchunk rules for translating into English
+* apertium-rus-eng.eng-rus.t3x  - Postchunk rules for translating into Russian
+* apertium-rus-eng.rus-eng.lrx  - Lexical selection rules for translating into English
+* apertium-rus-eng.eng-rus.lrx  - Lexical selection rules for translating into Russian
+* modes.xml                     - Translation modes
+
+For more information
+===============================================================================
+
+* http://wiki.apertium.org/wiki/Installation
+* http://wiki.apertium.org/wiki/apertium-rus-eng
+* http://wiki.apertium.org/wiki/Using_an_lttoolbox_dictionary
+
+Help and support
+===============================================================================
+
+If you need help using this language pair or data, you can contact:
+
+* Mailing list: apertium-stuff@lists.sourceforge.net
+* IRC: #apertium on irc.freenode.net
+
+See also the file AUTHORS included in this distribution.
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/aclocal.m4
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/aclocal.m4	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/aclocal.m4	(revision 70339)
@@ -0,0 +1,1053 @@
+# generated automatically by aclocal 1.14.1 -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+m4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])])
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],,
+[m4_warning([this file was generated for autoconf 2.69.
+You have another version of autoconf.  It may work, but is not guaranteed to.
+If you have problems, you may need to regenerate the build system entirely.
+To do so, use the procedure documented by the package, typically 'autoreconf'.])])
+
+# pkg.m4 - Macros to locate and utilise pkg-config.            -*- Autoconf -*-
+# serial 1 (pkg-config-0.24)
+# 
+# Copyright © 2004 Scott James Remnant <scott@netsplit.com>.
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+# PKG_PROG_PKG_CONFIG([MIN-VERSION])
+# ----------------------------------
+AC_DEFUN([PKG_PROG_PKG_CONFIG],
+[m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility])
+AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path])
+AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path])
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	AC_PATH_TOOL([PKG_CONFIG], [pkg-config])
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=m4_default([$1], [0.9.0])
+	AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version])
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		AC_MSG_RESULT([yes])
+	else
+		AC_MSG_RESULT([no])
+		PKG_CONFIG=""
+	fi
+fi[]dnl
+])# PKG_PROG_PKG_CONFIG
+
+# PKG_CHECK_EXISTS(MODULES, [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND])
+#
+# Check to see whether a particular set of modules exists.  Similar
+# to PKG_CHECK_MODULES(), but does not set variables or print errors.
+#
+# Please remember that m4 expands AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+# only at the first occurence in configure.ac, so if the first place
+# it's called might be skipped (such as if it is within an "if", you
+# have to call PKG_CHECK_EXISTS manually
+# --------------------------------------------------------------
+AC_DEFUN([PKG_CHECK_EXISTS],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+if test -n "$PKG_CONFIG" && \
+    AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then
+  m4_default([$2], [:])
+m4_ifvaln([$3], [else
+  $3])dnl
+fi])
+
+# _PKG_CONFIG([VARIABLE], [COMMAND], [MODULES])
+# ---------------------------------------------
+m4_define([_PKG_CONFIG],
+[if test -n "$$1"; then
+    pkg_cv_[]$1="$$1"
+ elif test -n "$PKG_CONFIG"; then
+    PKG_CHECK_EXISTS([$3],
+                     [pkg_cv_[]$1=`$PKG_CONFIG --[]$2 "$3" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ],
+		     [pkg_failed=yes])
+ else
+    pkg_failed=untried
+fi[]dnl
+])# _PKG_CONFIG
+
+# _PKG_SHORT_ERRORS_SUPPORTED
+# -----------------------------
+AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi[]dnl
+])# _PKG_SHORT_ERRORS_SUPPORTED
+
+
+# PKG_CHECK_MODULES(VARIABLE-PREFIX, MODULES, [ACTION-IF-FOUND],
+# [ACTION-IF-NOT-FOUND])
+#
+#
+# Note that if there is a possibility the first call to
+# PKG_CHECK_MODULES might not happen, you should be sure to include an
+# explicit call to PKG_PROG_PKG_CONFIG in your configure.ac
+#
+#
+# --------------------------------------------------------------
+AC_DEFUN([PKG_CHECK_MODULES],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl
+AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl
+
+pkg_failed=no
+AC_MSG_CHECKING([for $1])
+
+_PKG_CONFIG([$1][_CFLAGS], [cflags], [$2])
+_PKG_CONFIG([$1][_LIBS], [libs], [$2])
+
+m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS
+and $1[]_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.])
+
+if test $pkg_failed = yes; then
+   	AC_MSG_RESULT([no])
+        _PKG_SHORT_ERRORS_SUPPORTED
+        if test $_pkg_short_errors_supported = yes; then
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1`
+        else 
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD
+
+	m4_default([$4], [AC_MSG_ERROR(
+[Package requirements ($2) were not met:
+
+$$1_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+_PKG_TEXT])[]dnl
+        ])
+elif test $pkg_failed = untried; then
+     	AC_MSG_RESULT([no])
+	m4_default([$4], [AC_MSG_FAILURE(
+[The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+_PKG_TEXT
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.])[]dnl
+        ])
+else
+	$1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS
+	$1[]_LIBS=$pkg_cv_[]$1[]_LIBS
+        AC_MSG_RESULT([yes])
+	$3
+fi[]dnl
+])# PKG_CHECK_MODULES
+
+# apertium.m4 - Macros to locate and utilise apertium libraries -*- Autoconf -*-
+# serial 1 (apertium-3.4.2)
+#
+# Copyright (C) 2013--2016 Universitat d'Alacant / Universidad de Alicante
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+
+# AP_CHECK_LING([ID], [MONOLINGUAL_PACKAGE])
+#
+# Check to see whether MONOLINGUAL_PACKAGE exists, and if so sets
+# AP_LIB[ID] and AP_SRC[ID].
+#
+# As an example, AP_CHECK_LING([1], [apertium-fie]) would check that
+# apertium-fie exists, and set AP_LIB1 and AP_SRC1 to the paths
+# containing the binaries and sources respectively of that monolingual
+# language package.
+#
+# Also sets up options --with-lang[ID] (e.g. --with-lang1) if the user
+# wants to use the source code checkout instead of installed files.
+# ------------------------------------------
+AC_DEFUN([AP_CHECK_LING],
+[
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+
+
+# AP_MKINCLUDE()
+#
+# Creates the file ap_include.am and sets the variable ap_include to
+# point to this path. Now in your Makefile.am you can include
+# ap_include.am by writing @ap_include@ on a line by itself.
+#
+# The file defines a pattern rule for making modes files, and a goal
+# for installing the ones that have install="yes" in modes.xml. To
+# generate modes, include a line like
+#
+#     noinst_DATA=modes/$(PREFIX1).mode
+#
+# in your Makefile.am with _at most one mode_ (the others will be
+# created even if you list only one, listing several will lead to
+# trouble with parallell make).
+# 
+# Install the modes by making install-data-local dependent on
+# install-modes, ie.
+#
+#     install-data-local: install-modes
+#
+# Also defined is a goal for making the .deps folder. If you want some
+# file to be built in a folder named .deps, just make that goal
+# dependent on .deps/.d, e.g.
+#
+#     .deps/intermediate.dix: original.dix .deps/.d
+# 
+# ------------------------------------------
+AC_DEFUN([AP_MKINCLUDE],
+[
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
+
+# Copyright (C) 2002-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_AUTOMAKE_VERSION(VERSION)
+# ----------------------------
+# Automake X.Y traces this macro to ensure aclocal.m4 has been
+# generated from the m4 files accompanying Automake X.Y.
+# (This private macro should not be called outside this file.)
+AC_DEFUN([AM_AUTOMAKE_VERSION],
+[am__api_version='1.14'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.14.1], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+
+# _AM_AUTOCONF_VERSION(VERSION)
+# -----------------------------
+# aclocal traces this macro to find the Autoconf version.
+# This is a private macro too.  Using m4_define simplifies
+# the logic in aclocal, which can simply ignore this definition.
+m4_define([_AM_AUTOCONF_VERSION], [])
+
+# AM_SET_CURRENT_AUTOMAKE_VERSION
+# -------------------------------
+# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
+# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
+AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
+[AM_AUTOMAKE_VERSION([1.14.1])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+
+# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
+# $ac_aux_dir to '$srcdir/foo'.  In other projects, it is set to
+# '$srcdir', '$srcdir/..', or '$srcdir/../..'.
+#
+# Of course, Automake must honor this variable whenever it calls a
+# tool from the auxiliary directory.  The problem is that $srcdir (and
+# therefore $ac_aux_dir as well) can be either absolute or relative,
+# depending on how configure is run.  This is pretty annoying, since
+# it makes $ac_aux_dir quite unusable in subdirectories: in the top
+# source directory, any form will work fine, but in subdirectories a
+# relative path needs to be adjusted first.
+#
+# $ac_aux_dir/missing
+#    fails when called from a subdirectory if $ac_aux_dir is relative
+# $top_srcdir/$ac_aux_dir/missing
+#    fails if $ac_aux_dir is absolute,
+#    fails when called from a subdirectory in a VPATH build with
+#          a relative $ac_aux_dir
+#
+# The reason of the latter failure is that $top_srcdir and $ac_aux_dir
+# are both prefixed by $srcdir.  In an in-source build this is usually
+# harmless because $srcdir is '.', but things will broke when you
+# start a VPATH build or use an absolute $srcdir.
+#
+# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
+# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:
+#   am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"`
+# and then we would define $MISSING as
+#   MISSING="\${SHELL} $am_aux_dir/missing"
+# This will work as long as MISSING is not called from configure, because
+# unfortunately $(top_srcdir) has no meaning in configure.
+# However there are other variables, like CC, which are often used in
+# configure, and could therefore not use this "fixed" $ac_aux_dir.
+#
+# Another solution, used here, is to always expand $ac_aux_dir to an
+# absolute PATH.  The drawback is that using absolute paths prevent a
+# configured tree to be moved without reconfiguration.
+
+AC_DEFUN([AM_AUX_DIR_EXPAND],
+[dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+
+# Do all the work for Automake.                             -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This macro actually does too much.  Some checks are only needed if
+# your package does certain things.  But this isn't really a big deal.
+
+dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O.
+m4_define([AC_PROG_CC],
+m4_defn([AC_PROG_CC])
+[_AM_PROG_CC_C_O
+])
+
+# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
+# AM_INIT_AUTOMAKE([OPTIONS])
+# -----------------------------------------------
+# The call with PACKAGE and VERSION arguments is the old style
+# call (pre autoconf-2.50), which is being phased out.  PACKAGE
+# and VERSION should now be passed to AC_INIT and removed from
+# the call to AM_INIT_AUTOMAKE.
+# We support both call styles for the transition.  After
+# the next Automake release, Autoconf can make the AC_INIT
+# arguments mandatory, and then we can depend on a new Autoconf
+# release and drop the old call support.
+AC_DEFUN([AM_INIT_AUTOMAKE],
+[AC_PREREQ([2.65])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[AC_DIAGNOSE([obsolete],
+             [$0: two- and three-arguments forms are deprecated.])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+AC_REQUIRE([AM_SILENT_RULES])dnl
+dnl The testsuite driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This
+dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])
+  fi
+fi])
+
+dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
+dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
+dnl mangled by Autoconf and run in a shell conditional statement.
+m4_define([_AC_COMPILER_EXEEXT],
+m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])
+
+# When config.status generates a header, we must update the stamp-h file.
+# This file resides in the same directory as the config header
+# that is generated.  The stamp files are numbered to have different names.
+
+# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the
+# loop where config.status creates the headers, so we can generate
+# our stamp files there.
+AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],
+[# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_PROG_INSTALL_SH
+# ------------------
+# Define $install_sh.
+AC_DEFUN([AM_PROG_INSTALL_SH],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST([install_sh])])
+
+# Copyright (C) 2003-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# Check whether the underlying file-system supports filenames
+# with a leading dot.  For instance MS-DOS doesn't.
+AC_DEFUN([AM_SET_LEADING_DOT],
+[rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+
+# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-
+
+# Copyright (C) 1997-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_MISSING_PROG(NAME, PROGRAM)
+# ------------------------------
+AC_DEFUN([AM_MISSING_PROG],
+[AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+
+# AM_MISSING_HAS_RUN
+# ------------------
+# Define MISSING if not defined so far and test if it is modern enough.
+# If it is, set am_missing_run to use it, otherwise, to nothing.
+AC_DEFUN([AM_MISSING_HAS_RUN],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  AC_MSG_WARN(['missing' script is too old or missing])
+fi
+])
+
+# Helper functions for option handling.                     -*- Autoconf -*-
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_MANGLE_OPTION(NAME)
+# -----------------------
+AC_DEFUN([_AM_MANGLE_OPTION],
+[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+
+# _AM_SET_OPTION(NAME)
+# --------------------
+# Set option NAME.  Presently that only means defining a flag for this option.
+AC_DEFUN([_AM_SET_OPTION],
+[m4_define(_AM_MANGLE_OPTION([$1]), [1])])
+
+# _AM_SET_OPTIONS(OPTIONS)
+# ------------------------
+# OPTIONS is a space-separated list of Automake options.
+AC_DEFUN([_AM_SET_OPTIONS],
+[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+
+# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])
+# -------------------------------------------
+# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
+AC_DEFUN([_AM_IF_OPTION],
+[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+
+# Check to make sure that the build environment is sane.    -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_SANITY_CHECK
+# ---------------
+AC_DEFUN([AM_SANITY_CHECK],
+[AC_MSG_CHECKING([whether build environment is sane])
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
+
+# Copyright (C) 2009-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_SILENT_RULES([DEFAULT])
+# --------------------------
+# Enable less verbose build rules; with the default set to DEFAULT
+# ("yes" being less verbose, "no" or empty being verbose).
+AC_DEFUN([AM_SILENT_RULES],
+[AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+esac
+dnl
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
+dnl do not support nested variable expansions.
+dnl See automake bug#9928 and bug#10237.
+am_make=${MAKE-make}
+AC_CACHE_CHECK([whether $am_make supports nested variables],
+   [am_cv_make_support_nested_variables],
+   [if AS_ECHO([['TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi])
+if test $am_cv_make_support_nested_variables = yes; then
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
+  AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AC_SUBST([AM_V])dnl
+AM_SUBST_NOTMAKE([AM_V])dnl
+AC_SUBST([AM_DEFAULT_V])dnl
+AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl
+AC_SUBST([AM_DEFAULT_VERBOSITY])dnl
+AM_BACKSLASH='\'
+AC_SUBST([AM_BACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
+])
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_PROG_INSTALL_STRIP
+# ---------------------
+# One issue with vendor 'install' (even GNU) is that you can't
+# specify the program used to strip binaries.  This is especially
+# annoying in cross-compiling environments, where the build's strip
+# is unlikely to handle the host's binaries.
+# Fortunately install-sh will honor a STRIPPROG variable, so we
+# always use install-sh in "make install-strip", and initialize
+# STRIPPROG with the value of the STRIP variable (set by the user).
+AC_DEFUN([AM_PROG_INSTALL_STRIP],
+[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+
+# Copyright (C) 2006-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_SUBST_NOTMAKE(VARIABLE)
+# ---------------------------
+# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
+# This macro is traced by Automake.
+AC_DEFUN([_AM_SUBST_NOTMAKE])
+
+# AM_SUBST_NOTMAKE(VARIABLE)
+# --------------------------
+# Public sister of _AM_SUBST_NOTMAKE.
+AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+
+# Check how to create a tarball.                            -*- Autoconf -*-
+
+# Copyright (C) 2004-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_PROG_TAR(FORMAT)
+# --------------------
+# Check how to create a tarball in format FORMAT.
+# FORMAT should be one of 'v7', 'ustar', or 'pax'.
+#
+# Substitute a variable $(am__tar) that is a command
+# writing to stdout a FORMAT-tarball containing the directory
+# $tardir.
+#     tardir=directory && $(am__tar) > result.tar
+#
+# Substitute a variable $(am__untar) that extract such
+# a tarball read from stdin.
+#     $(am__untar) < result.tar
+#
+AC_DEFUN([_AM_PROG_TAR],
+[# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+
+m4_if([$1], [v7],
+  [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+
+  [m4_case([$1],
+    [ustar],
+     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.
+      # There is notably a 21 bits limit for the UID and the GID.  In fact,
+      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343
+      # and bug#13588).
+      am_max_uid=2097151 # 2^21 - 1
+      am_max_gid=$am_max_uid
+      # The $UID and $GID variables are not portable, so we need to resort
+      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls
+      # below are definitely unexpected, so allow the users to see them
+      # (that is, avoid stderr redirection).
+      am_uid=`id -u || echo unknown`
+      am_gid=`id -g || echo unknown`
+      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])
+      if test $am_uid -le $am_max_uid; then
+         AC_MSG_RESULT([yes])
+      else
+         AC_MSG_RESULT([no])
+         _am_tools=none
+      fi
+      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])
+      if test $am_gid -le $am_max_gid; then
+         AC_MSG_RESULT([yes])
+      else
+        AC_MSG_RESULT([no])
+        _am_tools=none
+      fi],
+
+  [pax],
+    [],
+
+  [m4_fatal([Unknown tar format])])
+
+  AC_MSG_CHECKING([how to create a $1 tar archive])
+
+  # Go ahead even if we have the value already cached.  We do so because we
+  # need to set the values for the 'am__tar' and 'am__untar' variables.
+  _am_tools=${am_cv_prog_tar_$1-$_am_tools}
+
+  for _am_tool in $_am_tools; do
+    case $_am_tool in
+    gnutar)
+      for _am_tar in tar gnutar gtar; do
+        AM_RUN_LOG([$_am_tar --version]) && break
+      done
+      am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+      am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+      am__untar="$_am_tar -xf -"
+      ;;
+    plaintar)
+      # Must skip GNU tar: if it does not support --format= it doesn't create
+      # ustar tarball either.
+      (tar --version) >/dev/null 2>&1 && continue
+      am__tar='tar chf - "$$tardir"'
+      am__tar_='tar chf - "$tardir"'
+      am__untar='tar xf -'
+      ;;
+    pax)
+      am__tar='pax -L -x $1 -w "$$tardir"'
+      am__tar_='pax -L -x $1 -w "$tardir"'
+      am__untar='pax -r'
+      ;;
+    cpio)
+      am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+      am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+      am__untar='cpio -i -H $1 -d'
+      ;;
+    none)
+      am__tar=false
+      am__tar_=false
+      am__untar=false
+      ;;
+    esac
+
+    # If the value was cached, stop now.  We just wanted to have am__tar
+    # and am__untar set.
+    test -n "${am_cv_prog_tar_$1}" && break
+
+    # tar/untar a dummy directory, and stop if the command works.
+    rm -rf conftest.dir
+    mkdir conftest.dir
+    echo GrepMe > conftest.dir/file
+    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+    rm -rf conftest.dir
+    if test -s conftest.tar; then
+      AM_RUN_LOG([$am__untar <conftest.tar])
+      AM_RUN_LOG([cat conftest.dir/file])
+      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+    fi
+  done
+  rm -rf conftest.dir
+
+  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+  AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+]) # _AM_PROG_TAR
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/ap_include.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/ap_include.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/ap_include.am	(revision 70339)
@@ -0,0 +1,42 @@
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then mv $$modes modes/; fi
+
+apertium_modesdir=$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml $(prefix)/share/apertium/$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d $(DESTDIR)$(apertium_modesdir) || mkdir $(DESTDIR)$(apertium_modesdir)
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then \
+			$(INSTALL_DATA) $$modes $(DESTDIR)$(apertium_modesdir); \
+			rm $$modes; \
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch $@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; 	if $(am__make_keepgoing); then 	  failcom='fail=yes'; 	else 	  failcom='exit 1'; 	fi; 	dot_seen=no; 	list='$(AP_SUBDIRS)'; 	for subdir in $$list; do 	  echo "Making $$subdir"; 	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) all-am) 	  || eval $$failcom; 	done; 	$(MAKE) $(AM_MAKEFLAGS) all-am || exit 1; 	test -z "$$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/$*.autobil.att > .deps/$*.autobil.hfst
+	hfst-project -p upper .deps/$*.autobil.hfst > .deps/$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/$*.autobil.upper -2 .deps/$*.any-nonplus.hfst -o .deps/$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/$*.single-plus.hfst -2 .deps/$*.autobil.nonplussed -o .deps/$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/$*.autobil.postplus -o .deps/$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/$*.autobil.nonplussed -2 .deps/$*.autobil.postplus.0,3 -o $@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.lrx
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.lrx	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.lrx	(revision 70339)
@@ -0,0 +1,22 @@
+<rules>
+  <!-- 
+    This rule chooses "energía" as the translation of "power" when it is preceded by "wind". 
+    Add your own rules within <rule> here, using the resources below as a guide 
+  -->
+
+  <rule>
+    <match lemma="wind"/>
+    <match lemma="power" tags="n.*">
+      <select lemma="energía" tags="n.*"/>
+    </match>
+  </rule>
+</rules>
+
+<!-- 
+Resources: 
+    http://wiki.apertium.org/wiki/How_to_get_started_with_lexical_selection_rules
+    http://wiki.apertium.org/wiki/Constraint-based_lexical_selection
+    http://wiki.apertium.org/wiki/Lexical_selection
+    http://wiki.apertium.org/wiki/Learning_rules_from_parallel_and_non-parallel_corpora
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x	(revision 70339)
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<transfer default="chunk">
+  <section-def-cats>
+    <def-cat n="nom">
+      <cat-item tags="n.*"/>
+    </def-cat>
+    <def-cat n="sent">
+      <cat-item tags="sent"/>
+    </def-cat>
+  </section-def-cats>
+
+  <section-def-attrs>
+    <def-attr n="a_cas">
+      <attr-item tags="nom"/>
+    </def-attr>
+  </section-def-attrs>
+
+  <section-def-vars>
+    <def-var n="number"/>
+  </section-def-vars>
+
+  <section-def-macros>
+    <def-macro n="test" npar="1">
+          <let>
+            <var n="number"/>
+            <lit v=""/>
+          </let>
+    </def-macro>
+  </section-def-macros>
+
+  <section-rules>
+    <rule comment="REGLA: SENT">
+      <pattern>
+        <pattern-item n="sent"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk name="sent" case="caseFirstWord">
+            <tags>
+              <tag><lit-tag v="SENT"/></tag>
+            </tags>
+            <lu>
+              <clip pos="1" side="tl" part="whole"/>
+            </lu>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+  </section-rules>
+</transfer>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Chunking:_A_full_example
+    http://wiki.apertium.org/wiki/Chunking
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Transfer_rules
+    http://wiki.apertium.org/wiki/A_long_introduction_to_transfer_rules
+    http://wiki.apertium.org/wiki/Transfer#Adding_structural_transfer_.28grammar.29_rules
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x	(revision 70339)
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<interchunk>
+  <section-def-cats>
+    <def-cat n="SN">
+      <cat-item tags="SN"/>
+      <cat-item tags="SN.*"/>
+    </def-cat>
+  </section-def-cats>
+
+  <section-def-attrs>
+    <def-attr n="a_nbr">
+      <attr-item tags="sg"/>
+    </def-attr>
+  </section-def-attrs>
+
+  <section-def-vars>
+    <def-var n="number"/>
+  </section-def-vars>
+
+  <section-def-macros>
+    <def-macro n="test1" npar="1">
+      <let>
+        <var n="number"/>
+        <lit v=""/>
+      </let>
+    </def-macro>
+  </section-def-macros>
+
+  <section-rules>
+    <rule comment="REGLA: SN">
+      <pattern>
+        <pattern-item n="SN"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk>
+            <clip pos="1" part="lem"/>
+            <clip pos="1" part="tags"/>
+            <clip pos="1" part="chcontent"/>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+  </section-rules>
+</interchunk>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Chunking:_A_full_example
+    http://wiki.apertium.org/wiki/Chunking
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Transfer_rules
+    http://wiki.apertium.org/wiki/A_long_introduction_to_transfer_rules
+    http://wiki.apertium.org/wiki/Transfer#Adding_structural_transfer_.28grammar.29_rules
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t3x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t3x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t3x	(revision 70339)
@@ -0,0 +1,43 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<postchunk>
+  <section-def-cats>
+    <def-cat n="sent">
+      <cat-item name="punt"/>
+    </def-cat>
+  </section-def-cats>
+
+  <section-def-attrs>
+    <def-attr n="nbr">
+      <attr-item tags="sg"/>
+    </def-attr>
+  </section-def-attrs>
+
+  <section-def-vars>
+    <def-var n="paraula"/>
+  </section-def-vars>
+
+  <section-rules>
+    <rule comment="CHUNK:">
+      <pattern>
+        <pattern-item n="sent"/>
+      </pattern>
+      <action>
+        <out>
+          <lu>
+            <clip pos="1" part="whole"/>
+          </lu>
+        </out>
+      </action>
+    </rule>
+  </section-rules>
+</postchunk>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Chunking:_A_full_example
+    http://wiki.apertium.org/wiki/Chunking
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Transfer_rules
+    http://wiki.apertium.org/wiki/A_long_introduction_to_transfer_rules
+    http://wiki.apertium.org/wiki/Transfer#Adding_structural_transfer_.28grammar.29_rules
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.lrx
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.lrx	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.lrx	(revision 70339)
@@ -0,0 +1,22 @@
+<rules>
+  <!-- 
+    This rule chooses "energía" as the translation of "power" when it is preceded by "wind". 
+    Add your own rules within <rule> here, using the resources below as a guide 
+  -->
+
+  <rule>
+    <match lemma="wind"/>
+    <match lemma="power" tags="n.*">
+      <select lemma="energía" tags="n.*"/>
+    </match>
+  </rule>
+</rules>
+
+<!-- 
+Resources: 
+    http://wiki.apertium.org/wiki/How_to_get_started_with_lexical_selection_rules
+    http://wiki.apertium.org/wiki/Constraint-based_lexical_selection
+    http://wiki.apertium.org/wiki/Lexical_selection
+    http://wiki.apertium.org/wiki/Learning_rules_from_parallel_and_non-parallel_corpora
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x	(revision 70339)
@@ -0,0 +1,55 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<interchunk>
+  <section-def-cats>
+    <def-cat n="SN">
+      <cat-item tags="SN"/>
+      <cat-item tags="SN.*"/>
+    </def-cat>
+  </section-def-cats>
+
+  <section-def-attrs>
+    <def-attr n="a_nbr">
+      <attr-item tags="sg"/>
+    </def-attr>
+  </section-def-attrs>
+
+  <section-def-vars>
+    <def-var n="number"/>
+  </section-def-vars>
+
+  <section-def-macros>
+    <def-macro n="test1" npar="1">
+      <let>
+        <var n="number"/>
+        <lit v=""/>
+      </let>
+    </def-macro>
+  </section-def-macros>
+
+  <section-rules>
+    <rule comment="REGLA: SN">
+      <pattern>
+        <pattern-item n="SN"/>
+      </pattern>
+      <action>
+        <out>
+          <chunk>
+            <clip pos="1" part="lem"/>
+            <clip pos="1" part="tags"/>
+            <clip pos="1" part="chcontent"/>
+          </chunk>
+        </out>
+      </action>
+    </rule>
+  </section-rules>
+</interchunk>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Chunking:_A_full_example
+    http://wiki.apertium.org/wiki/Chunking
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Transfer_rules
+    http://wiki.apertium.org/wiki/A_long_introduction_to_transfer_rules
+    http://wiki.apertium.org/wiki/Transfer#Adding_structural_transfer_.28grammar.29_rules
+-->
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autogen.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autogen.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autogen.sh	(revision 70339)
@@ -0,0 +1,36 @@
+#! /bin/sh
+
+# If the user specified a --prefix, take that, otherwise /usr/local/
+# is the default.
+PREFIX=/usr/local
+prefixnext=false
+for i in "$@"; do
+    case $i in
+        --prefix=*)		# equals separated:
+	    PREFIX="${i#*=}"
+	    ;;
+        --prefix)		# space separated:
+	    prefixnext=true
+	    ;;
+        *)
+	    $prefixnext && PREFIX="$i" && prefixnext=false
+	    ;;
+    esac
+done
+
+# Set the paths needed by libtool/pkg-config/aclocal etc. By inferring
+# them based on --prefix , users don't have to edit ~/.bashrc. We only
+# append, so if a user has some other preference, that will override.
+PATH="${PATH}:/usr/local/bin"
+export PATH
+LD_LIBRARY_PATH="${LD_LIBRARY_PATH}:${PREFIX}/lib"
+export LD_LIBRARY_PATH
+PKG_CONFIG_PATH="${PKG_CONFIG_PATH}:${PREFIX}/share/pkgconfig:${PREFIX}/lib/pkgconfig"
+export PKG_CONFIG_PATH
+ACLOCAL_PATH="${ACLOCAL_PATH}:${PREFIX}/share/aclocal"
+export ACLOCAL_PATH
+
+
+# Pass on all args to configure
+autoreconf -fi && ./configure "$@"
+

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autogen.sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/output.0
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/output.0	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/output.0	(revision 70339)
@@ -0,0 +1,4580 @@
+@%:@! /bin/sh
+@%:@ Guess values for system-dependent variables and create Makefiles.
+@%:@ Generated by GNU Autoconf 2.69 for Apertium Russian-English 0.2.0.
+@%:@
+@%:@ Report bugs to <super-antispam@ya.ru>.
+@%:@ 
+@%:@ 
+@%:@ Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+@%:@ 
+@%:@ 
+@%:@ This configure script is free software; the Free Software Foundation
+@%:@ gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+  
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+  
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in @%:@(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIB@&t@OBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium Russian-English'
+PACKAGE_TARNAME='apertium-rus-eng'
+PACKAGE_VERSION='0.2.0'
+PACKAGE_STRING='Apertium Russian-English 0.2.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-rus-eng'
+
+ac_subst_vars='LTLIBOBJS
+LIB@&t@OBJS
+APERTIUM_ENG_LIBS
+APERTIUM_ENG_CFLAGS
+AP_LIB2
+AP_SRC2
+APERTIUM_RUS_LIBS
+APERTIUM_RUS_CFLAGS
+AP_SUBDIRS
+AP_LIB1
+AP_SRC1
+ZCAT
+LRXPROC
+LRXCOMP
+CGPROC
+CGCOMP
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+with_lang1
+with_lang2
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+AP_SRC1
+AP_LIB1
+AP_SUBDIRS
+APERTIUM_RUS_CFLAGS
+APERTIUM_RUS_LIBS
+AP_SRC2
+AP_LIB2
+APERTIUM_ENG_CFLAGS
+APERTIUM_ENG_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium Russian-English 0.2.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          @<:@@S|@ac_default_prefix@:>@
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          @<:@PREFIX@:>@
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          @<:@DATAROOTDIR/doc/apertium-rus-eng@:>@
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium Russian-English 0.2.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Optional Packages:
+  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]
+  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)
+  --with-lang1            Uninstalled source directory for apertium-rus,
+                          defines AP_SRC1 and AP_LIB1 for Makefile, otherwise
+                          these are set to paths of installed files.
+    
+  --with-lang2            Uninstalled source directory for apertium-eng,
+                          defines AP_SRC2 and AP_LIB2 for Makefile, otherwise
+                          these are set to paths of installed files.
+    
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH 
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR 
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS 
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS 
+              linker flags for APERTIUM, overriding pkg-config
+  AP_SRC1     Path to apertium-rus sources, same as AP_LIB1 if --with-lang1
+              set
+  AP_LIB1     Path to apertium-rus binaries, same as AP_SRC1 if --with-lang1
+              set
+  AP_SUBDIRS  List of all --with-lang dirs; add it to SUBDIRS to make
+              configure-specified dependencies recursively
+  APERTIUM_RUS_CFLAGS 
+              C compiler flags for APERTIUM_RUS, overriding pkg-config
+  APERTIUM_RUS_LIBS 
+              linker flags for APERTIUM_RUS, overriding pkg-config
+  AP_SRC2     Path to apertium-eng sources, same as AP_LIB2 if --with-lang2
+              set
+  AP_LIB2     Path to apertium-eng binaries, same as AP_SRC2 if --with-lang2
+              set
+  APERTIUM_ENG_CFLAGS 
+              C compiler flags for APERTIUM_ENG, overriding pkg-config
+  APERTIUM_ENG_LIBS 
+              linker flags for APERTIUM_ENG, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium Russian-English configure 0.2.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in @%:@((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in @%:@((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+@%:@ Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules; 
+fi
+
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-rus-eng'
+ VERSION='0.2.0'
+
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE "$PACKAGE"
+_ACEOF
+
+ 
+cat >>confdefs.h <<_ACEOF
+@%:@define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-3.2 >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-3.2 >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+# Extract the first word of "cg-proc", so it can be a program name with args.
+set dummy cg-proc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGPROC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGPROC in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGPROC="$CGPROC" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_proc/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGPROC="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGPROC" && ac_cv_path_CGPROC="false"
+  ;;
+esac
+fi
+CGPROC=$ac_cv_path_CGPROC
+if test -n "$CGPROC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGPROC" >&5
+$as_echo "$CGPROC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGPROC = xfalse; then :
+  as_fn_error $? "You don't have cg-proc installed" "$LINENO" 5
+fi
+
+# Extract the first word of "lrx-comp", so it can be a program name with args.
+set dummy lrx-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_LRXCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $LRXCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_LRXCOMP="$LRXCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_lrx_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_LRXCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_LRXCOMP" && ac_cv_path_LRXCOMP="false"
+  ;;
+esac
+fi
+LRXCOMP=$ac_cv_path_LRXCOMP
+if test -n "$LRXCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LRXCOMP" >&5
+$as_echo "$LRXCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$LRXCOMP = xfalse; then :
+  as_fn_error $? "You don't have lrx-comp installed" "$LINENO" 5
+fi
+
+# Extract the first word of "lrx-proc", so it can be a program name with args.
+set dummy lrx-proc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_LRXPROC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $LRXPROC in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_LRXPROC="$LRXPROC" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_lrx_proc/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_LRXPROC="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_LRXPROC" && ac_cv_path_LRXPROC="false"
+  ;;
+esac
+fi
+LRXPROC=$ac_cv_path_LRXPROC
+if test -n "$LRXPROC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LRXPROC" >&5
+$as_echo "$LRXPROC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$LRXPROC = xfalse; then :
+  as_fn_error $? "You don't have lrx-proc installed" "$LINENO" 5
+fi
+
+for ac_prog in gzcat zcat
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ZCAT+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ZCAT in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ZCAT="$ZCAT" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ZCAT="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ZCAT=$ac_cv_path_ZCAT
+if test -n "$ZCAT"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ZCAT" >&5
+$as_echo "$ZCAT" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ZCAT" && break
+done
+test -n "$ZCAT" || ZCAT="false"
+
+if test x$ZCAT = xfalse; then :
+  as_fn_error $? "You don't have zcat nor gzcat installed" "$LINENO" 5
+fi
+
+
+
+
+  
+  
+  
+  
+@%:@ Check whether --with-lang1 was given.
+if test "${with_lang1+set}" = set; then :
+  withval=$with_lang1; 
+      AP_LIB1=$withval
+      AP_SRC1=$withval
+      echo "Using apertium-rus from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    
+else
+  
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM_RUS" >&5
+$as_echo_n "checking for APERTIUM_RUS... " >&6; }
+
+if test -n "$APERTIUM_RUS_CFLAGS"; then
+    pkg_cv_APERTIUM_RUS_CFLAGS="$APERTIUM_RUS_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-rus\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-rus") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_RUS_CFLAGS=`$PKG_CONFIG --cflags "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_RUS_LIBS"; then
+    pkg_cv_APERTIUM_RUS_LIBS="$APERTIUM_RUS_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-rus\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-rus") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_RUS_LIBS=`$PKG_CONFIG --libs "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_RUS_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-rus" 2>&1`
+        else 
+	        APERTIUM_RUS_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-rus" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_RUS_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-rus) were not met:
+
+$APERTIUM_RUS_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_RUS_CFLAGS
+and APERTIUM_RUS_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_RUS_CFLAGS
+and APERTIUM_RUS_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_RUS_CFLAGS=$pkg_cv_APERTIUM_RUS_CFLAGS
+	APERTIUM_RUS_LIBS=$pkg_cv_APERTIUM_RUS_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+      AP_LIB1=`pkg-config --variable=dir apertium-rus`
+      AP_SRC1=`pkg-config --variable=srcdir apertium-rus`
+    
+fi
+
+  if test -z "$AP_SRC1" || ! test -d "$AP_SRC1"; then
+    as_fn_error $? "Could not find sources dir for apertium-rus (AP_SRC1=\"$AP_SRC1\")" "$LINENO" 5
+  fi
+
+
+  
+  
+  
+  
+@%:@ Check whether --with-lang2 was given.
+if test "${with_lang2+set}" = set; then :
+  withval=$with_lang2; 
+      AP_LIB2=$withval
+      AP_SRC2=$withval
+      echo "Using apertium-eng from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    
+else
+  
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM_ENG" >&5
+$as_echo_n "checking for APERTIUM_ENG... " >&6; }
+
+if test -n "$APERTIUM_ENG_CFLAGS"; then
+    pkg_cv_APERTIUM_ENG_CFLAGS="$APERTIUM_ENG_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-eng\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-eng") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_ENG_CFLAGS=`$PKG_CONFIG --cflags "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_ENG_LIBS"; then
+    pkg_cv_APERTIUM_ENG_LIBS="$APERTIUM_ENG_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-eng\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-eng") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_ENG_LIBS=`$PKG_CONFIG --libs "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_ENG_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-eng" 2>&1`
+        else 
+	        APERTIUM_ENG_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-eng" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_ENG_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-eng) were not met:
+
+$APERTIUM_ENG_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_ENG_CFLAGS
+and APERTIUM_ENG_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_ENG_CFLAGS
+and APERTIUM_ENG_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_ENG_CFLAGS=$pkg_cv_APERTIUM_ENG_CFLAGS
+	APERTIUM_ENG_LIBS=$pkg_cv_APERTIUM_ENG_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+      AP_LIB2=`pkg-config --variable=dir apertium-eng`
+      AP_SRC2=`pkg-config --variable=srcdir apertium-eng`
+    
+fi
+
+  if test -z "$AP_SRC2" || ! test -d "$AP_SRC2"; then
+    as_fn_error $? "Could not find sources dir for apertium-eng (AP_SRC2=\"$AP_SRC2\")" "$LINENO" 5
+  fi
+
+
+
+  
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIB@&t@OBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIB@&t@OBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE] 
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium Russian-English config.status 0.2.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../@%:@@%:@ /;s/...$/ @%:@@%:@/;p;x;p;x' <<_ASBOX
+@%:@@%:@ Running $as_me. @%:@@%:@
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F@<:@"&"@:>@="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  
+  
+  
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/output.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/output.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/output.1	(revision 70339)
@@ -0,0 +1,4580 @@
+@%:@! /bin/sh
+@%:@ Guess values for system-dependent variables and create Makefiles.
+@%:@ Generated by GNU Autoconf 2.69 for Apertium Russian-English 0.2.0.
+@%:@
+@%:@ Report bugs to <super-antispam@ya.ru>.
+@%:@ 
+@%:@ 
+@%:@ Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+@%:@ 
+@%:@ 
+@%:@ This configure script is free software; the Free Software Foundation
+@%:@ gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+  
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+  
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in @%:@(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIB@&t@OBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium Russian-English'
+PACKAGE_TARNAME='apertium-rus-eng'
+PACKAGE_VERSION='0.2.0'
+PACKAGE_STRING='Apertium Russian-English 0.2.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-rus-eng'
+
+ac_subst_vars='LTLIBOBJS
+LIB@&t@OBJS
+APERTIUM_ENG_LIBS
+APERTIUM_ENG_CFLAGS
+AP_LIB2
+AP_SRC2
+APERTIUM_RUS_LIBS
+APERTIUM_RUS_CFLAGS
+AP_SUBDIRS
+AP_LIB1
+AP_SRC1
+ZCAT
+LRXPROC
+LRXCOMP
+CGPROC
+CGCOMP
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+with_lang1
+with_lang2
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+AP_SRC1
+AP_LIB1
+AP_SUBDIRS
+APERTIUM_RUS_CFLAGS
+APERTIUM_RUS_LIBS
+AP_SRC2
+AP_LIB2
+APERTIUM_ENG_CFLAGS
+APERTIUM_ENG_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium Russian-English 0.2.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          @<:@@S|@ac_default_prefix@:>@
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          @<:@PREFIX@:>@
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          @<:@DATAROOTDIR/doc/apertium-rus-eng@:>@
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium Russian-English 0.2.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Optional Packages:
+  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]
+  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)
+  --with-lang1            Uninstalled source directory for apertium-rus,
+                          defines AP_SRC1 and AP_LIB1 for Makefile, otherwise
+                          these are set to paths of installed files.
+    
+  --with-lang2            Uninstalled source directory for apertium-eng,
+                          defines AP_SRC2 and AP_LIB2 for Makefile, otherwise
+                          these are set to paths of installed files.
+    
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH 
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR 
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS 
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS 
+              linker flags for APERTIUM, overriding pkg-config
+  AP_SRC1     Path to apertium-rus sources, same as AP_LIB1 if --with-lang1
+              set
+  AP_LIB1     Path to apertium-rus binaries, same as AP_SRC1 if --with-lang1
+              set
+  AP_SUBDIRS  List of all --with-lang dirs; add it to SUBDIRS to make
+              configure-specified dependencies recursively
+  APERTIUM_RUS_CFLAGS 
+              C compiler flags for APERTIUM_RUS, overriding pkg-config
+  APERTIUM_RUS_LIBS 
+              linker flags for APERTIUM_RUS, overriding pkg-config
+  AP_SRC2     Path to apertium-eng sources, same as AP_LIB2 if --with-lang2
+              set
+  AP_LIB2     Path to apertium-eng binaries, same as AP_SRC2 if --with-lang2
+              set
+  APERTIUM_ENG_CFLAGS 
+              C compiler flags for APERTIUM_ENG, overriding pkg-config
+  APERTIUM_ENG_LIBS 
+              linker flags for APERTIUM_ENG, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium Russian-English configure 0.2.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in @%:@((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in @%:@((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+@%:@ Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules; 
+fi
+
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-rus-eng'
+ VERSION='0.2.0'
+
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE "$PACKAGE"
+_ACEOF
+
+ 
+cat >>confdefs.h <<_ACEOF
+@%:@define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-3.2 >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-3.2 >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+# Extract the first word of "cg-proc", so it can be a program name with args.
+set dummy cg-proc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGPROC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGPROC in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGPROC="$CGPROC" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_proc/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGPROC="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGPROC" && ac_cv_path_CGPROC="false"
+  ;;
+esac
+fi
+CGPROC=$ac_cv_path_CGPROC
+if test -n "$CGPROC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGPROC" >&5
+$as_echo "$CGPROC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGPROC = xfalse; then :
+  as_fn_error $? "You don't have cg-proc installed" "$LINENO" 5
+fi
+
+# Extract the first word of "lrx-comp", so it can be a program name with args.
+set dummy lrx-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_LRXCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $LRXCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_LRXCOMP="$LRXCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_lrx_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_LRXCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_LRXCOMP" && ac_cv_path_LRXCOMP="false"
+  ;;
+esac
+fi
+LRXCOMP=$ac_cv_path_LRXCOMP
+if test -n "$LRXCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LRXCOMP" >&5
+$as_echo "$LRXCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$LRXCOMP = xfalse; then :
+  as_fn_error $? "You don't have lrx-comp installed" "$LINENO" 5
+fi
+
+# Extract the first word of "lrx-proc", so it can be a program name with args.
+set dummy lrx-proc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_LRXPROC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $LRXPROC in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_LRXPROC="$LRXPROC" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_lrx_proc/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_LRXPROC="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_LRXPROC" && ac_cv_path_LRXPROC="false"
+  ;;
+esac
+fi
+LRXPROC=$ac_cv_path_LRXPROC
+if test -n "$LRXPROC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LRXPROC" >&5
+$as_echo "$LRXPROC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$LRXPROC = xfalse; then :
+  as_fn_error $? "You don't have lrx-proc installed" "$LINENO" 5
+fi
+
+for ac_prog in gzcat zcat
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ZCAT+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ZCAT in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ZCAT="$ZCAT" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ZCAT="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ZCAT=$ac_cv_path_ZCAT
+if test -n "$ZCAT"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ZCAT" >&5
+$as_echo "$ZCAT" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ZCAT" && break
+done
+test -n "$ZCAT" || ZCAT="false"
+
+if test x$ZCAT = xfalse; then :
+  as_fn_error $? "You don't have zcat nor gzcat installed" "$LINENO" 5
+fi
+
+
+
+
+  
+  
+  
+  
+@%:@ Check whether --with-lang1 was given.
+if test "${with_lang1+set}" = set; then :
+  withval=$with_lang1; 
+      AP_LIB1=$withval
+      AP_SRC1=$withval
+      echo "Using apertium-rus from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    
+else
+  
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM_RUS" >&5
+$as_echo_n "checking for APERTIUM_RUS... " >&6; }
+
+if test -n "$APERTIUM_RUS_CFLAGS"; then
+    pkg_cv_APERTIUM_RUS_CFLAGS="$APERTIUM_RUS_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-rus\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-rus") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_RUS_CFLAGS=`$PKG_CONFIG --cflags "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_RUS_LIBS"; then
+    pkg_cv_APERTIUM_RUS_LIBS="$APERTIUM_RUS_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-rus\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-rus") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_RUS_LIBS=`$PKG_CONFIG --libs "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_RUS_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-rus" 2>&1`
+        else 
+	        APERTIUM_RUS_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-rus" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_RUS_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-rus) were not met:
+
+$APERTIUM_RUS_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_RUS_CFLAGS
+and APERTIUM_RUS_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_RUS_CFLAGS
+and APERTIUM_RUS_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_RUS_CFLAGS=$pkg_cv_APERTIUM_RUS_CFLAGS
+	APERTIUM_RUS_LIBS=$pkg_cv_APERTIUM_RUS_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+      AP_LIB1=`pkg-config --variable=dir apertium-rus`
+      AP_SRC1=`pkg-config --variable=srcdir apertium-rus`
+    
+fi
+
+  if test -z "$AP_SRC1" || ! test -d "$AP_SRC1"; then
+    as_fn_error $? "Could not find sources dir for apertium-rus (AP_SRC1=\"$AP_SRC1\")" "$LINENO" 5
+  fi
+
+
+  
+  
+  
+  
+@%:@ Check whether --with-lang2 was given.
+if test "${with_lang2+set}" = set; then :
+  withval=$with_lang2; 
+      AP_LIB2=$withval
+      AP_SRC2=$withval
+      echo "Using apertium-eng from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    
+else
+  
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM_ENG" >&5
+$as_echo_n "checking for APERTIUM_ENG... " >&6; }
+
+if test -n "$APERTIUM_ENG_CFLAGS"; then
+    pkg_cv_APERTIUM_ENG_CFLAGS="$APERTIUM_ENG_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-eng\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-eng") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_ENG_CFLAGS=`$PKG_CONFIG --cflags "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_ENG_LIBS"; then
+    pkg_cv_APERTIUM_ENG_LIBS="$APERTIUM_ENG_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-eng\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-eng") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_ENG_LIBS=`$PKG_CONFIG --libs "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_ENG_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-eng" 2>&1`
+        else 
+	        APERTIUM_ENG_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-eng" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_ENG_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-eng) were not met:
+
+$APERTIUM_ENG_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_ENG_CFLAGS
+and APERTIUM_ENG_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_ENG_CFLAGS
+and APERTIUM_ENG_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_ENG_CFLAGS=$pkg_cv_APERTIUM_ENG_CFLAGS
+	APERTIUM_ENG_LIBS=$pkg_cv_APERTIUM_ENG_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+      AP_LIB2=`pkg-config --variable=dir apertium-eng`
+      AP_SRC2=`pkg-config --variable=srcdir apertium-eng`
+    
+fi
+
+  if test -z "$AP_SRC2" || ! test -d "$AP_SRC2"; then
+    as_fn_error $? "Could not find sources dir for apertium-eng (AP_SRC2=\"$AP_SRC2\")" "$LINENO" 5
+  fi
+
+
+
+  
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIB@&t@OBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIB@&t@OBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE] 
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium Russian-English config.status 0.2.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../@%:@@%:@ /;s/...$/ @%:@@%:@/;p;x;p;x' <<_ASBOX
+@%:@@%:@ Running $as_me. @%:@@%:@
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F@<:@"&"@:>@="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  
+  
+  
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/requests
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/requests	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/requests	(revision 70339)
@@ -0,0 +1,162 @@
+# This file was generated by Autom4te Thu Apr 10 10:06:43 UTC 2014.
+# It contains the lists of macros which have been traced.
+# It can be safely removed.
+
+@request = (
+             bless( [
+                      '0',
+                      1,
+                      [
+                        '/usr/share/autoconf'
+                      ],
+                      [
+                        '/usr/share/autoconf/autoconf/autoconf.m4f',
+                        '-',
+                        '/usr/share/aclocal-1.14/internal/ac-config-macro-dirs.m4',
+                        '/usr/share/aclocal/pkg.m4',
+                        '/usr/local/share/aclocal/apertium.m4',
+                        '/usr/share/aclocal-1.14/amversion.m4',
+                        '/usr/share/aclocal-1.14/auxdir.m4',
+                        '/usr/share/aclocal-1.14/cond.m4',
+                        '/usr/share/aclocal-1.14/depend.m4',
+                        '/usr/share/aclocal-1.14/depout.m4',
+                        '/usr/share/aclocal-1.14/init.m4',
+                        '/usr/share/aclocal-1.14/install-sh.m4',
+                        '/usr/share/aclocal-1.14/lead-dot.m4',
+                        '/usr/share/aclocal-1.14/make.m4',
+                        '/usr/share/aclocal-1.14/missing.m4',
+                        '/usr/share/aclocal-1.14/options.m4',
+                        '/usr/share/aclocal-1.14/prog-cc-c-o.m4',
+                        '/usr/share/aclocal-1.14/runlog.m4',
+                        '/usr/share/aclocal-1.14/sanity.m4',
+                        '/usr/share/aclocal-1.14/silent.m4',
+                        '/usr/share/aclocal-1.14/strip.m4',
+                        '/usr/share/aclocal-1.14/substnot.m4',
+                        '/usr/share/aclocal-1.14/tar.m4',
+                        'configure.ac'
+                      ],
+                      {
+                        '_AM_CONFIG_MACRO_DIRS' => 1,
+                        '_AM_MANGLE_OPTION' => 1,
+                        'AM_SILENT_RULES' => 1,
+                        '_AM_DEPENDENCIES' => 1,
+                        '_AM_SUBST_NOTMAKE' => 1,
+                        'AC_DEFUN_ONCE' => 1,
+                        '_AM_OUTPUT_DEPENDENCY_COMMANDS' => 1,
+                        'AM_MAKE_INCLUDE' => 1,
+                        'AM_MISSING_HAS_RUN' => 1,
+                        'AP_CHECK_LING' => 1,
+                        'AM_SET_LEADING_DOT' => 1,
+                        'AM_PROG_INSTALL_STRIP' => 1,
+                        'AM_SET_DEPDIR' => 1,
+                        'AC_DEFUN' => 1,
+                        '_AM_SET_OPTION' => 1,
+                        'AP_MKINCLUDE' => 1,
+                        'AM_AUX_DIR_EXPAND' => 1,
+                        'include' => 1,
+                        '_AC_AM_CONFIG_HEADER_HOOK' => 1,
+                        'm4_pattern_allow' => 1,
+                        'AM_AUTOMAKE_VERSION' => 1,
+                        'AM_PROG_INSTALL_SH' => 1,
+                        '_AM_PROG_CC_C_O' => 1,
+                        'AM_SET_CURRENT_AUTOMAKE_VERSION' => 1,
+                        'm4_pattern_forbid' => 1,
+                        '_AM_PROG_TAR' => 1,
+                        'AM_SUBST_NOTMAKE' => 1,
+                        'AM_DEP_TRACK' => 1,
+                        'AC_CONFIG_MACRO_DIR_TRACE' => 1,
+                        'AM_INIT_AUTOMAKE' => 1,
+                        'AC_CONFIG_MACRO_DIR' => 1,
+                        'PKG_CHECK_MODULES' => 1,
+                        'AM_SANITY_CHECK' => 1,
+                        'PKG_CHECK_EXISTS' => 1,
+                        'm4_include' => 1,
+                        'AM_RUN_LOG' => 1,
+                        'AM_PROG_CC_C_O' => 1,
+                        '_AM_AUTOCONF_VERSION' => 1,
+                        'AU_DEFUN' => 1,
+                        'AM_MISSING_PROG' => 1,
+                        '_PKG_SHORT_ERRORS_SUPPORTED' => 1,
+                        'AM_OUTPUT_DEPENDENCY_COMMANDS' => 1,
+                        '_m4_warn' => 1,
+                        '_AM_SET_OPTIONS' => 1,
+                        'AM_CONDITIONAL' => 1,
+                        'PKG_PROG_PKG_CONFIG' => 1,
+                        '_AM_IF_OPTION' => 1
+                      }
+                    ], 'Autom4te::Request' ),
+             bless( [
+                      '1',
+                      1,
+                      [
+                        '/usr/share/autoconf'
+                      ],
+                      [
+                        '/usr/share/autoconf/autoconf/autoconf.m4f',
+                        'aclocal.m4',
+                        'configure.ac'
+                      ],
+                      {
+                        'AM_INIT_AUTOMAKE' => 1,
+                        'AM_GNU_GETTEXT' => 1,
+                        'AC_CANONICAL_HOST' => 1,
+                        '_AM_COND_ELSE' => 1,
+                        'AC_INIT' => 1,
+                        'AC_LIBSOURCE' => 1,
+                        'AC_CONFIG_SUBDIRS' => 1,
+                        'AC_CONFIG_LIBOBJ_DIR' => 1,
+                        'AC_FC_FREEFORM' => 1,
+                        'AM_MAINTAINER_MODE' => 1,
+                        'AM_PROG_F77_C_O' => 1,
+                        'AM_MAKEFILE_INCLUDE' => 1,
+                        'm4_include' => 1,
+                        'LT_SUPPORTED_TAG' => 1,
+                        'AM_PROG_MKDIR_P' => 1,
+                        'AM_PROG_CC_C_O' => 1,
+                        'AC_FC_PP_DEFINE' => 1,
+                        'AM_PATH_GUILE' => 1,
+                        'AM_ENABLE_MULTILIB' => 1,
+                        'AC_REQUIRE_AUX_FILE' => 1,
+                        '_m4_warn' => 1,
+                        'AM_CONDITIONAL' => 1,
+                        'm4_sinclude' => 1,
+                        'AC_CONFIG_FILES' => 1,
+                        '_AM_COND_IF' => 1,
+                        'AM_POT_TOOLS' => 1,
+                        'AC_DEFINE_TRACE_LITERAL' => 1,
+                        'AC_CANONICAL_TARGET' => 1,
+                        'AC_FC_SRCEXT' => 1,
+                        'AM_PROG_CXX_C_O' => 1,
+                        '_AM_MAKEFILE_INCLUDE' => 1,
+                        'AM_SILENT_RULES' => 1,
+                        '_AM_SUBST_NOTMAKE' => 1,
+                        'AC_CONFIG_AUX_DIR' => 1,
+                        'AH_OUTPUT' => 1,
+                        'LT_INIT' => 1,
+                        'AM_PROG_FC_C_O' => 1,
+                        '_LT_AC_TAGCONFIG' => 1,
+                        'AC_SUBST_TRACE' => 1,
+                        'AM_PROG_AR' => 1,
+                        'AC_CONFIG_LINKS' => 1,
+                        'sinclude' => 1,
+                        'LT_CONFIG_LTDL_DIR' => 1,
+                        'AC_PROG_LIBTOOL' => 1,
+                        'AM_XGETTEXT_OPTION' => 1,
+                        'AC_SUBST' => 1,
+                        'AC_CONFIG_HEADERS' => 1,
+                        'AC_FC_PP_SRCEXT' => 1,
+                        'include' => 1,
+                        'AC_CANONICAL_BUILD' => 1,
+                        'm4_pattern_allow' => 1,
+                        'AM_AUTOMAKE_VERSION' => 1,
+                        'AM_GNU_GETTEXT_INTL_SUBDIR' => 1,
+                        'AM_EXTRA_RECURSIVE_TARGETS' => 1,
+                        '_AM_COND_ENDIF' => 1,
+                        'AM_NLS' => 1,
+                        'm4_pattern_forbid' => 1,
+                        'AM_PROG_MOC' => 1,
+                        'AC_CANONICAL_SYSTEM' => 1
+                      }
+                    ], 'Autom4te::Request' )
+           );
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/traces.0
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/traces.0	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/traces.0	(revision 70339)
@@ -0,0 +1,1128 @@
+m4trace:/usr/share/aclocal/pkg.m4:27: -1- AC_DEFUN([PKG_PROG_PKG_CONFIG], [m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility])
+AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path])
+AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path])
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	AC_PATH_TOOL([PKG_CONFIG], [pkg-config])
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=m4_default([$1], [0.9.0])
+	AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version])
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		AC_MSG_RESULT([yes])
+	else
+		AC_MSG_RESULT([no])
+		PKG_CONFIG=""
+	fi
+fi[]dnl
+])
+m4trace:/usr/share/aclocal/pkg.m4:60: -1- AC_DEFUN([PKG_CHECK_EXISTS], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+if test -n "$PKG_CONFIG" && \
+    AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then
+  m4_default([$2], [:])
+m4_ifvaln([$3], [else
+  $3])dnl
+fi])
+m4trace:/usr/share/aclocal/pkg.m4:86: -1- AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi[]dnl
+])
+m4trace:/usr/share/aclocal/pkg.m4:106: -1- AC_DEFUN([PKG_CHECK_MODULES], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl
+AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl
+
+pkg_failed=no
+AC_MSG_CHECKING([for $1])
+
+_PKG_CONFIG([$1][_CFLAGS], [cflags], [$2])
+_PKG_CONFIG([$1][_LIBS], [libs], [$2])
+
+m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS
+and $1[]_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.])
+
+if test $pkg_failed = yes; then
+   	AC_MSG_RESULT([no])
+        _PKG_SHORT_ERRORS_SUPPORTED
+        if test $_pkg_short_errors_supported = yes; then
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1`
+        else 
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD
+
+	m4_default([$4], [AC_MSG_ERROR(
+[Package requirements ($2) were not met:
+
+$$1_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+_PKG_TEXT])[]dnl
+        ])
+elif test $pkg_failed = untried; then
+     	AC_MSG_RESULT([no])
+	m4_default([$4], [AC_MSG_FAILURE(
+[The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+_PKG_TEXT
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.])[]dnl
+        ])
+else
+	$1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS
+	$1[]_LIBS=$pkg_cv_[]$1[]_LIBS
+        AC_MSG_RESULT([yes])
+	$3
+fi[]dnl
+])
+m4trace:/usr/local/share/aclocal/apertium.m4:33: -1- AC_DEFUN([AP_CHECK_LING], [
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+m4trace:/usr/local/share/aclocal/apertium.m4:91: -1- AC_DEFUN([AP_MKINCLUDE], [
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
+m4trace:/usr/share/aclocal-1.14/amversion.m4:14: -1- AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.14'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.14.1], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+m4trace:/usr/share/aclocal-1.14/amversion.m4:33: -1- AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.14.1])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+m4trace:/usr/share/aclocal-1.14/auxdir.m4:47: -1- AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+m4trace:/usr/share/aclocal-1.14/cond.m4:12: -1- AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl
+ m4_if([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
+       [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
+AC_SUBST([$1_TRUE])dnl
+AC_SUBST([$1_FALSE])dnl
+_AM_SUBST_NOTMAKE([$1_TRUE])dnl
+_AM_SUBST_NOTMAKE([$1_FALSE])dnl
+m4_define([_AM_COND_VALUE_$1], [$2])dnl
+if $2; then
+  $1_TRUE=
+  $1_FALSE='#'
+else
+  $1_TRUE='#'
+  $1_FALSE=
+fi
+AC_CONFIG_COMMANDS_PRE(
+[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then
+  AC_MSG_ERROR([[conditional "$1" was never defined.
+Usually this means the macro was only invoked conditionally.]])
+fi])])
+m4trace:/usr/share/aclocal-1.14/depend.m4:26: -1- AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl
+AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl
+AC_REQUIRE([AM_MAKE_INCLUDE])dnl
+AC_REQUIRE([AM_DEP_TRACK])dnl
+
+m4_if([$1], [CC],   [depcc="$CC"   am_compiler_list=],
+      [$1], [CXX],  [depcc="$CXX"  am_compiler_list=],
+      [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
+      [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'],
+      [$1], [UPC],  [depcc="$UPC"  am_compiler_list=],
+      [$1], [GCJ],  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
+                    [depcc="$$1"   am_compiler_list=])
+
+AC_CACHE_CHECK([dependency style of $depcc],
+               [am_cv_$1_dependencies_compiler_type],
+[if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
+  # We make a subdir and do the tests there.  Otherwise we can end up
+  # making bogus files that we don't know about and never remove.  For
+  # instance it was reported that on HP-UX the gcc test will end up
+  # making a dummy file named 'D' -- because '-MD' means "put the output
+  # in D".
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  # Copy depcomp to subdir because otherwise we won't find it if we're
+  # using a relative directory.
+  cp "$am_depcomp" conftest.dir
+  cd conftest.dir
+  # We will build objects and dependencies in a subdirectory because
+  # it helps to detect inapplicable dependency modes.  For instance
+  # both Tru64's cc and ICC support -MD to output dependencies as a
+  # side effect of compilation, but ICC will put the dependencies in
+  # the current directory while Tru64 will put them in the object
+  # directory.
+  mkdir sub
+
+  am_cv_$1_dependencies_compiler_type=none
+  if test "$am_compiler_list" = ""; then
+     am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp`
+  fi
+  am__universal=false
+  m4_case([$1], [CC],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac],
+    [CXX],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac])
+
+  for depmode in $am_compiler_list; do
+    # Setup a source with many dependencies, because some compilers
+    # like to wrap large dependency lists on column 80 (with \), and
+    # we should not choose a depcomp mode which is confused by this.
+    #
+    # We need to recreate these files for each test, as the compiler may
+    # overwrite some of them when testing with obscure command lines.
+    # This happens at least with the AIX C compiler.
+    : > sub/conftest.c
+    for i in 1 2 3 4 5 6; do
+      echo '#include "conftst'$i'.h"' >> sub/conftest.c
+      # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with
+      # Solaris 10 /bin/sh.
+      echo '/* dummy */' > sub/conftst$i.h
+    done
+    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
+
+    # We check with '-c' and '-o' for the sake of the "dashmstdout"
+    # mode.  It turns out that the SunPro C++ compiler does not properly
+    # handle '-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs.
+    am__obj=sub/conftest.${OBJEXT-o}
+    am__minus_obj="-o $am__obj"
+    case $depmode in
+    gcc)
+      # This depmode causes a compiler race in universal mode.
+      test "$am__universal" = false || continue
+      ;;
+    nosideeffect)
+      # After this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested.
+      if test "x$enable_dependency_tracking" = xyes; then
+	continue
+      else
+	break
+      fi
+      ;;
+    msvc7 | msvc7msys | msvisualcpp | msvcmsys)
+      # This compiler won't grok '-c -o', but also, the minuso test has
+      # not run yet.  These depmodes are late enough in the game, and
+      # so weak that their functioning should not be impacted.
+      am__obj=conftest.${OBJEXT-o}
+      am__minus_obj=
+      ;;
+    none) break ;;
+    esac
+    if depmode=$depmode \
+       source=sub/conftest.c object=$am__obj \
+       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
+       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
+         >/dev/null 2>conftest.err &&
+       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
+       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
+      # icc doesn't choke on unknown options, it will just issue warnings
+      # or remarks (even with -Werror).  So we grep stderr for any message
+      # that says an option was ignored or not supported.
+      # When given -MP, icc 7.0 and 7.1 complain thusly:
+      #   icc: Command line warning: ignoring option '-M'; no argument required
+      # The diagnosis changed in icc 8.0:
+      #   icc: Command line remark: option '-MP' not supported
+      if (grep 'ignoring option' conftest.err ||
+          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
+        am_cv_$1_dependencies_compiler_type=$depmode
+        break
+      fi
+    fi
+  done
+
+  cd ..
+  rm -rf conftest.dir
+else
+  am_cv_$1_dependencies_compiler_type=none
+fi
+])
+AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])
+AM_CONDITIONAL([am__fastdep$1], [
+  test "x$enable_dependency_tracking" != xno \
+  && test "$am_cv_$1_dependencies_compiler_type" = gcc3])
+])
+m4trace:/usr/share/aclocal-1.14/depend.m4:163: -1- AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
+])
+m4trace:/usr/share/aclocal-1.14/depend.m4:171: -1- AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE([dependency-tracking], [dnl
+AS_HELP_STRING(
+  [--enable-dependency-tracking],
+  [do not reject slow dependency extractors])
+AS_HELP_STRING(
+  [--disable-dependency-tracking],
+  [speeds up one-time build])])
+if test "x$enable_dependency_tracking" != xno; then
+  am_depcomp="$ac_aux_dir/depcomp"
+  AMDEPBACKSLASH='\'
+  am__nodep='_no'
+fi
+AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno])
+AC_SUBST([AMDEPBACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl
+AC_SUBST([am__nodep])dnl
+_AM_SUBST_NOTMAKE([am__nodep])dnl
+])
+m4trace:/usr/share/aclocal-1.14/depout.m4:12: -1- AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{
+  # Older Autoconf quotes --file arguments for eval, but not when files
+  # are listed without --file.  Let's play safe and only enable the eval
+  # if we detect the quoting.
+  case $CONFIG_FILES in
+  *\'*) eval set x "$CONFIG_FILES" ;;
+  *)   set x $CONFIG_FILES ;;
+  esac
+  shift
+  for mf
+  do
+    # Strip MF so we end up with the name of the file.
+    mf=`echo "$mf" | sed -e 's/:.*$//'`
+    # Check whether this is an Automake generated Makefile or not.
+    # We used to match only the files named 'Makefile.in', but
+    # some people rename them; so instead we look at the file content.
+    # Grep'ing the first line is not enough: some people post-process
+    # each Makefile.in and add a new line on top of each file to say so.
+    # Grep'ing the whole file is not good either: AIX grep has a line
+    # limit of 2048, but all sed's we know have understand at least 4000.
+    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
+      dirpart=`AS_DIRNAME("$mf")`
+    else
+      continue
+    fi
+    # Extract the definition of DEPDIR, am__include, and am__quote
+    # from the Makefile without running 'make'.
+    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
+    test -z "$DEPDIR" && continue
+    am__include=`sed -n 's/^am__include = //p' < "$mf"`
+    test -z "$am__include" && continue
+    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
+    # Find all dependency output files, they are included files with
+    # $(DEPDIR) in their names.  We invoke sed twice because it is the
+    # simplest approach to changing $(DEPDIR) to its actual value in the
+    # expansion.
+    for file in `sed -n "
+      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do
+      # Make sure the directory exists.
+      test -f "$dirpart/$file" && continue
+      fdir=`AS_DIRNAME(["$file"])`
+      AS_MKDIR_P([$dirpart/$fdir])
+      # echo "creating $dirpart/$file"
+      echo '# dummy' > "$dirpart/$file"
+    done
+  done
+}
+])
+m4trace:/usr/share/aclocal-1.14/depout.m4:71: -1- AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles],
+     [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS],
+     [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"])
+])
+m4trace:/usr/share/aclocal-1.14/init.m4:29: -1- AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.65])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[AC_DIAGNOSE([obsolete],
+             [$0: two- and three-arguments forms are deprecated.])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+AC_REQUIRE([AM_SILENT_RULES])dnl
+dnl The testsuite driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This
+dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])
+  fi
+fi])
+m4trace:/usr/share/aclocal-1.14/init.m4:182: -1- AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+m4trace:/usr/share/aclocal-1.14/install-sh.m4:11: -1- AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST([install_sh])])
+m4trace:/usr/share/aclocal-1.14/lead-dot.m4:10: -1- AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+m4trace:/usr/share/aclocal-1.14/make.m4:12: -1- AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make}
+cat > confinc << 'END'
+am__doit:
+	@echo this is the am__doit target
+.PHONY: am__doit
+END
+# If we don't find an include directive, just comment out the code.
+AC_MSG_CHECKING([for style of include used by $am_make])
+am__include="#"
+am__quote=
+_am_result=none
+# First try GNU make style include.
+echo "include confinc" > confmf
+# Ignore all kinds of additional output from 'make'.
+case `$am_make -s -f confmf 2> /dev/null` in #(
+*the\ am__doit\ target*)
+  am__include=include
+  am__quote=
+  _am_result=GNU
+  ;;
+esac
+# Now try BSD make style include.
+if test "$am__include" = "#"; then
+   echo '.include "confinc"' > confmf
+   case `$am_make -s -f confmf 2> /dev/null` in #(
+   *the\ am__doit\ target*)
+     am__include=.include
+     am__quote="\""
+     _am_result=BSD
+     ;;
+   esac
+fi
+AC_SUBST([am__include])
+AC_SUBST([am__quote])
+AC_MSG_RESULT([$_am_result])
+rm -f confinc confmf
+])
+m4trace:/usr/share/aclocal-1.14/missing.m4:11: -1- AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+m4trace:/usr/share/aclocal-1.14/missing.m4:20: -1- AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  AC_MSG_WARN(['missing' script is too old or missing])
+fi
+])
+m4trace:/usr/share/aclocal-1.14/options.m4:11: -1- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+m4trace:/usr/share/aclocal-1.14/options.m4:17: -1- AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), [1])])
+m4trace:/usr/share/aclocal-1.14/options.m4:23: -1- AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+m4trace:/usr/share/aclocal-1.14/options.m4:29: -1- AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+m4trace:/usr/share/aclocal-1.14/prog-cc-c-o.m4:12: -1- AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([compile])dnl
+AC_LANG_PUSH([C])dnl
+AC_CACHE_CHECK(
+  [whether $CC understands -c and -o together],
+  [am_cv_prog_cc_c_o],
+  [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])])
+  # Make sure it works both with $CC and with simple cc.
+  # Following AC_PROG_CC_C_O, we do the test twice because some
+  # compilers refuse to overwrite an existing .o file with -o,
+  # though they will create one.
+  am_cv_prog_cc_c_o=yes
+  for am_i in 1 2; do
+    if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \
+         && test -f conftest2.$ac_objext; then
+      : OK
+    else
+      am_cv_prog_cc_c_o=no
+      break
+    fi
+  done
+  rm -f core conftest*
+  unset am_i])
+if test "$am_cv_prog_cc_c_o" != yes; then
+   # Losing compiler, so override with the script.
+   # FIXME: It is wrong to rewrite CC.
+   # But if we don't then we get into trouble of one sort or another.
+   # A longer-term fix would be to have automake use am__CC in this case,
+   # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)"
+   CC="$am_aux_dir/compile $CC"
+fi
+AC_LANG_POP([C])])
+m4trace:/usr/share/aclocal-1.14/prog-cc-c-o.m4:47: -1- AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])])
+m4trace:/usr/share/aclocal-1.14/runlog.m4:12: -1- AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD
+   ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD
+   ac_status=$?
+   echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+   (exit $ac_status); }])
+m4trace:/usr/share/aclocal-1.14/sanity.m4:11: -1- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane])
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
+m4trace:/usr/share/aclocal-1.14/silent.m4:12: -1- AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+esac
+dnl
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
+dnl do not support nested variable expansions.
+dnl See automake bug#9928 and bug#10237.
+am_make=${MAKE-make}
+AC_CACHE_CHECK([whether $am_make supports nested variables],
+   [am_cv_make_support_nested_variables],
+   [if AS_ECHO([['TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi])
+if test $am_cv_make_support_nested_variables = yes; then
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
+  AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AC_SUBST([AM_V])dnl
+AM_SUBST_NOTMAKE([AM_V])dnl
+AC_SUBST([AM_DEFAULT_V])dnl
+AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl
+AC_SUBST([AM_DEFAULT_VERBOSITY])dnl
+AM_BACKSLASH='\'
+AC_SUBST([AM_BACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
+])
+m4trace:/usr/share/aclocal-1.14/strip.m4:17: -1- AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+m4trace:/usr/share/aclocal-1.14/substnot.m4:12: -1- AC_DEFUN([_AM_SUBST_NOTMAKE])
+m4trace:/usr/share/aclocal-1.14/substnot.m4:17: -1- AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+m4trace:/usr/share/aclocal-1.14/tar.m4:23: -1- AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+
+m4_if([$1], [v7],
+  [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+
+  [m4_case([$1],
+    [ustar],
+     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.
+      # There is notably a 21 bits limit for the UID and the GID.  In fact,
+      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343
+      # and bug#13588).
+      am_max_uid=2097151 # 2^21 - 1
+      am_max_gid=$am_max_uid
+      # The $UID and $GID variables are not portable, so we need to resort
+      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls
+      # below are definitely unexpected, so allow the users to see them
+      # (that is, avoid stderr redirection).
+      am_uid=`id -u || echo unknown`
+      am_gid=`id -g || echo unknown`
+      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])
+      if test $am_uid -le $am_max_uid; then
+         AC_MSG_RESULT([yes])
+      else
+         AC_MSG_RESULT([no])
+         _am_tools=none
+      fi
+      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])
+      if test $am_gid -le $am_max_gid; then
+         AC_MSG_RESULT([yes])
+      else
+        AC_MSG_RESULT([no])
+        _am_tools=none
+      fi],
+
+  [pax],
+    [],
+
+  [m4_fatal([Unknown tar format])])
+
+  AC_MSG_CHECKING([how to create a $1 tar archive])
+
+  # Go ahead even if we have the value already cached.  We do so because we
+  # need to set the values for the 'am__tar' and 'am__untar' variables.
+  _am_tools=${am_cv_prog_tar_$1-$_am_tools}
+
+  for _am_tool in $_am_tools; do
+    case $_am_tool in
+    gnutar)
+      for _am_tar in tar gnutar gtar; do
+        AM_RUN_LOG([$_am_tar --version]) && break
+      done
+      am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+      am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+      am__untar="$_am_tar -xf -"
+      ;;
+    plaintar)
+      # Must skip GNU tar: if it does not support --format= it doesn't create
+      # ustar tarball either.
+      (tar --version) >/dev/null 2>&1 && continue
+      am__tar='tar chf - "$$tardir"'
+      am__tar_='tar chf - "$tardir"'
+      am__untar='tar xf -'
+      ;;
+    pax)
+      am__tar='pax -L -x $1 -w "$$tardir"'
+      am__tar_='pax -L -x $1 -w "$tardir"'
+      am__untar='pax -r'
+      ;;
+    cpio)
+      am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+      am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+      am__untar='cpio -i -H $1 -d'
+      ;;
+    none)
+      am__tar=false
+      am__tar_=false
+      am__untar=false
+      ;;
+    esac
+
+    # If the value was cached, stop now.  We just wanted to have am__tar
+    # and am__untar set.
+    test -n "${am_cv_prog_tar_$1}" && break
+
+    # tar/untar a dummy directory, and stop if the command works.
+    rm -rf conftest.dir
+    mkdir conftest.dir
+    echo GrepMe > conftest.dir/file
+    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+    rm -rf conftest.dir
+    if test -s conftest.tar; then
+      AM_RUN_LOG([$am__untar <conftest.tar])
+      AM_RUN_LOG([cat conftest.dir/file])
+      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+    fi
+  done
+  rm -rf conftest.dir
+
+  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+  AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([_AC_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^AS_FLAGS$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?m4_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^dnl$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?AS_])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^SHELL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PATH_SEPARATOR$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^exec_prefix$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^prefix$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^program_transform_name$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^bindir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sbindir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libexecdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datarootdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datadir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sysconfdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sharedstatedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localstatedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^includedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^oldincludedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^docdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^infodir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^htmldir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^dvidir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^pdfdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^psdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^mandir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^DEFS$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_C$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_N$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_T$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^LIBS$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^build_alias$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^host_alias$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^target_alias$])
+m4trace:configure.ac:4: -1- AM_INIT_AUTOMAKE
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_[A-Z]+FLAGS$])
+m4trace:configure.ac:4: -1- AM_SET_CURRENT_AUTOMAKE_VERSION
+m4trace:configure.ac:4: -1- AM_AUTOMAKE_VERSION([1.14.1])
+m4trace:configure.ac:4: -1- _AM_AUTOCONF_VERSION([2.69])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_PROGRAM$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_SCRIPT$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_DATA$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__isrc$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([am__isrc])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^CYGPATH_W$])
+m4trace:configure.ac:4: -1- _AM_SET_OPTIONS([])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([no-define], [], [AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([no-define])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AM_SANITY_CHECK
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+m4trace:configure.ac:4: -1- AM_MISSING_HAS_RUN
+m4trace:configure.ac:4: -1- AM_AUX_DIR_EXPAND
+m4trace:configure.ac:4: -1- m4_pattern_allow([^ACLOCAL$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOCONF], [autoconf])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOCONF$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOMAKE$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOHEADER], [autoheader])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOHEADER$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([MAKEINFO], [makeinfo])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MAKEINFO$])
+m4trace:configure.ac:4: -1- AM_PROG_INSTALL_SH
+m4trace:configure.ac:4: -1- m4_pattern_allow([^install_sh$])
+m4trace:configure.ac:4: -1- AM_PROG_INSTALL_STRIP
+m4trace:configure.ac:4: -1- m4_pattern_allow([^STRIP$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_STRIP_PROGRAM$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MKDIR_P$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^mkdir_p$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^SET_MAKE$])
+m4trace:configure.ac:4: -1- AM_SET_LEADING_DOT
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__leading_dot$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([tar-ustar])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([tar-pax])
+m4trace:configure.ac:4: -1- _AM_PROG_TAR([v7])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AMTAR$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__tar$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__untar$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([no-dependencies], [], [AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([no-dependencies])
+m4trace:configure.ac:4: -1- AM_SILENT_RULES
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_V$])
+m4trace:configure.ac:4: -1- AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_V$])
+m4trace:configure.ac:4: -1- AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_VERBOSITY$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_BACKSLASH$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_BACKSLASH])
+m4trace:configure.ac:6: -1- m4_pattern_allow([^LN_S$])
+m4trace:configure.ac:7: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:10: -1- PKG_CHECK_MODULES([APERTIUM], [apertium >= 3.4.0], [], [PKG_CHECK_MODULES(APERTIUM, apertium-3.2 >= required_apertium_version)])
+m4trace:configure.ac:10: -1- PKG_PROG_PKG_CONFIG
+m4trace:configure.ac:10: -1- m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG_PATH$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG_LIBDIR$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:10: -1- PKG_CHECK_EXISTS([apertium >= 3.4.0], [pkg_cv_[]APERTIUM_CFLAGS=`$PKG_CONFIG --[]cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:10: -1- PKG_CHECK_EXISTS([apertium >= 3.4.0], [pkg_cv_[]APERTIUM_LIBS=`$PKG_CONFIG --[]libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:10: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:10: -1- PKG_CHECK_MODULES([APERTIUM], [apertium-3.2 >= 3.4.0])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:10: -1- PKG_CHECK_EXISTS([apertium-3.2 >= 3.4.0], [pkg_cv_[]APERTIUM_CFLAGS=`$PKG_CONFIG --[]cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:10: -1- PKG_CHECK_EXISTS([apertium-3.2 >= 3.4.0], [pkg_cv_[]APERTIUM_LIBS=`$PKG_CONFIG --[]libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:10: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:10: -1- PKG_CHECK_MODULES([APERTIUM], [apertium-3.2 >= 3.4.0])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:10: -1- PKG_CHECK_EXISTS([apertium-3.2 >= 3.4.0], [pkg_cv_[]APERTIUM_CFLAGS=`$PKG_CONFIG --[]cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:10: -1- PKG_CHECK_EXISTS([apertium-3.2 >= 3.4.0], [pkg_cv_[]APERTIUM_LIBS=`$PKG_CONFIG --[]libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:10: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:14: -1- m4_pattern_allow([^CGCOMP$])
+m4trace:configure.ac:17: -1- m4_pattern_allow([^CGPROC$])
+m4trace:configure.ac:20: -1- m4_pattern_allow([^LRXCOMP$])
+m4trace:configure.ac:23: -1- m4_pattern_allow([^LRXPROC$])
+m4trace:configure.ac:26: -1- m4_pattern_allow([^ZCAT$])
+m4trace:configure.ac:31: -1- AP_CHECK_LING([1], [apertium-rus])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^AP_SRC1$])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^AP_LIB1$])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^AP_SUBDIRS$])
+m4trace:configure.ac:31: -1- PKG_CHECK_MODULES([APERTIUM_RUS], [apertium-rus])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^APERTIUM_RUS_CFLAGS$])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^APERTIUM_RUS_LIBS$])
+m4trace:configure.ac:31: -1- PKG_CHECK_EXISTS([apertium-rus], [pkg_cv_[]APERTIUM_RUS_CFLAGS=`$PKG_CONFIG --[]cflags "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:31: -1- PKG_CHECK_EXISTS([apertium-rus], [pkg_cv_[]APERTIUM_RUS_LIBS=`$PKG_CONFIG --[]libs "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:31: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:32: -1- AP_CHECK_LING([2], [apertium-eng])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^AP_SRC2$])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^AP_LIB2$])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^AP_SUBDIRS$])
+m4trace:configure.ac:32: -1- PKG_CHECK_MODULES([APERTIUM_ENG], [apertium-eng])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^APERTIUM_ENG_CFLAGS$])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^APERTIUM_ENG_LIBS$])
+m4trace:configure.ac:32: -1- PKG_CHECK_EXISTS([apertium-eng], [pkg_cv_[]APERTIUM_ENG_CFLAGS=`$PKG_CONFIG --[]cflags "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:32: -1- PKG_CHECK_EXISTS([apertium-eng], [pkg_cv_[]APERTIUM_ENG_LIBS=`$PKG_CONFIG --[]libs "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:32: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:34: -1- AP_MKINCLUDE
+m4trace:configure.ac:34: -1- m4_pattern_allow([^ap_include$])
+m4trace:configure.ac:36: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
+You should run autoupdate.], [])
+m4trace:configure.ac:36: -1- m4_pattern_allow([^LIB@&t@OBJS$])
+m4trace:configure.ac:36: -1- m4_pattern_allow([^LTLIBOBJS$])
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/traces.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/traces.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/autom4te.cache/traces.1	(revision 70339)
@@ -0,0 +1,353 @@
+m4trace:configure.ac:3: -1- AC_INIT([Apertium Russian-English], [0.2.0], [super-antispam@ya.ru], [apertium-rus-eng], [http://wiki.apertium.org/wiki/Apertium-rus-eng])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([_AC_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^AS_FLAGS$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?m4_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^dnl$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?AS_])
+m4trace:configure.ac:3: -1- AC_SUBST([SHELL])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([SHELL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^SHELL$])
+m4trace:configure.ac:3: -1- AC_SUBST([PATH_SEPARATOR])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PATH_SEPARATOR])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PATH_SEPARATOR$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_NAME], [m4_ifdef([AC_PACKAGE_NAME],      ['AC_PACKAGE_NAME'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_NAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_TARNAME], [m4_ifdef([AC_PACKAGE_TARNAME],   ['AC_PACKAGE_TARNAME'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_VERSION], [m4_ifdef([AC_PACKAGE_VERSION],   ['AC_PACKAGE_VERSION'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_STRING], [m4_ifdef([AC_PACKAGE_STRING],    ['AC_PACKAGE_STRING'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_STRING])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_BUGREPORT], [m4_ifdef([AC_PACKAGE_BUGREPORT], ['AC_PACKAGE_BUGREPORT'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_URL], [m4_ifdef([AC_PACKAGE_URL],       ['AC_PACKAGE_URL'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_URL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- AC_SUBST([exec_prefix], [NONE])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([exec_prefix])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^exec_prefix$])
+m4trace:configure.ac:3: -1- AC_SUBST([prefix], [NONE])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([prefix])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^prefix$])
+m4trace:configure.ac:3: -1- AC_SUBST([program_transform_name], [s,x,x,])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([program_transform_name])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^program_transform_name$])
+m4trace:configure.ac:3: -1- AC_SUBST([bindir], ['${exec_prefix}/bin'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([bindir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^bindir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sbindir], ['${exec_prefix}/sbin'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sbindir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sbindir$])
+m4trace:configure.ac:3: -1- AC_SUBST([libexecdir], ['${exec_prefix}/libexec'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([libexecdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libexecdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([datarootdir], ['${prefix}/share'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([datarootdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datarootdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([datadir], ['${datarootdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([datadir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datadir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sysconfdir], ['${prefix}/etc'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sysconfdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sysconfdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sharedstatedir], ['${prefix}/com'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sharedstatedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sharedstatedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([localstatedir], ['${prefix}/var'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([localstatedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localstatedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([includedir], ['${prefix}/include'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([includedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^includedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([oldincludedir], ['/usr/include'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([oldincludedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^oldincludedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([docdir], [m4_ifset([AC_PACKAGE_TARNAME],
+				     ['${datarootdir}/doc/${PACKAGE_TARNAME}'],
+				     ['${datarootdir}/doc/${PACKAGE}'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([docdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^docdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([infodir], ['${datarootdir}/info'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([infodir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^infodir$])
+m4trace:configure.ac:3: -1- AC_SUBST([htmldir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([htmldir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^htmldir$])
+m4trace:configure.ac:3: -1- AC_SUBST([dvidir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([dvidir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^dvidir$])
+m4trace:configure.ac:3: -1- AC_SUBST([pdfdir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([pdfdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^pdfdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([psdir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([psdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^psdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([libdir], ['${exec_prefix}/lib'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([libdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([localedir], ['${datarootdir}/locale'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([localedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([mandir], ['${datarootdir}/man'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([mandir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^mandir$])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_NAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_NAME], [/* Define to the full name of this package. */
+@%:@undef PACKAGE_NAME])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_TARNAME], [/* Define to the one symbol short name of this package. */
+@%:@undef PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_VERSION], [/* Define to the version of this package. */
+@%:@undef PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_STRING])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_STRING], [/* Define to the full name and version of this package. */
+@%:@undef PACKAGE_STRING])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_BUGREPORT], [/* Define to the address where bug reports for this package should be sent. */
+@%:@undef PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_URL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_URL], [/* Define to the home page for this package. */
+@%:@undef PACKAGE_URL])
+m4trace:configure.ac:3: -1- AC_SUBST([DEFS])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([DEFS])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^DEFS$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_C])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_C])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_C$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_N])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_N])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_N$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_T])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_T])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_T$])
+m4trace:configure.ac:3: -1- AC_SUBST([LIBS])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([LIBS])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^LIBS$])
+m4trace:configure.ac:3: -1- AC_SUBST([build_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([build_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^build_alias$])
+m4trace:configure.ac:3: -1- AC_SUBST([host_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([host_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^host_alias$])
+m4trace:configure.ac:3: -1- AC_SUBST([target_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([target_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^target_alias$])
+m4trace:configure.ac:4: -1- AM_INIT_AUTOMAKE
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_[A-Z]+FLAGS$])
+m4trace:configure.ac:4: -1- AM_AUTOMAKE_VERSION([1.14.1])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([install-sh])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_PROGRAM])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_PROGRAM])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_PROGRAM$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_SCRIPT])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_SCRIPT])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_SCRIPT$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_DATA])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_DATA])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_DATA$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__isrc], [' -I$(srcdir)'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__isrc])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__isrc$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([am__isrc])
+m4trace:configure.ac:4: -1- AC_SUBST([CYGPATH_W])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([CYGPATH_W])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^CYGPATH_W$])
+m4trace:configure.ac:4: -1- AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([PACKAGE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([VERSION])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- AH_OUTPUT([PACKAGE], [/* Name of package */
+@%:@undef PACKAGE])
+m4trace:configure.ac:4: -1- AC_DEFINE_TRACE_LITERAL([VERSION])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AH_OUTPUT([VERSION], [/* Version number of package */
+@%:@undef VERSION])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([missing])
+m4trace:configure.ac:4: -1- AC_SUBST([ACLOCAL])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([ACLOCAL])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^ACLOCAL$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOCONF])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOCONF])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOCONF$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOMAKE])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOMAKE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOMAKE$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOHEADER])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOHEADER])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOHEADER$])
+m4trace:configure.ac:4: -1- AC_SUBST([MAKEINFO])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([MAKEINFO])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MAKEINFO$])
+m4trace:configure.ac:4: -1- AC_SUBST([install_sh])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([install_sh])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^install_sh$])
+m4trace:configure.ac:4: -1- AC_SUBST([STRIP])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([STRIP])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^STRIP$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_STRIP_PROGRAM])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_STRIP_PROGRAM])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_STRIP_PROGRAM$])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([install-sh])
+m4trace:configure.ac:4: -1- AC_SUBST([MKDIR_P])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([MKDIR_P])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MKDIR_P$])
+m4trace:configure.ac:4: -1- AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([mkdir_p])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^mkdir_p$])
+m4trace:configure.ac:4: -1- AC_SUBST([AWK])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AWK])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:4: -1- AC_SUBST([SET_MAKE])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([SET_MAKE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^SET_MAKE$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__leading_dot])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__leading_dot])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__leading_dot$])
+m4trace:configure.ac:4: -1- AC_SUBST([AMTAR], ['$${TAR-tar}'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AMTAR])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AMTAR$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__tar])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__tar])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__tar$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__untar])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__untar])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__untar$])
+m4trace:configure.ac:4: -1- AM_SILENT_RULES
+m4trace:configure.ac:4: -1- AC_SUBST([AM_V])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_V$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_V$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_DEFAULT_VERBOSITY])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_DEFAULT_VERBOSITY])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_VERBOSITY$])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_BACKSLASH])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_BACKSLASH])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_BACKSLASH$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_BACKSLASH])
+m4trace:configure.ac:6: -1- AC_SUBST([LN_S], [$as_ln_s])
+m4trace:configure.ac:6: -1- AC_SUBST_TRACE([LN_S])
+m4trace:configure.ac:6: -1- m4_pattern_allow([^LN_S$])
+m4trace:configure.ac:7: -1- AC_SUBST([AWK])
+m4trace:configure.ac:7: -1- AC_SUBST_TRACE([AWK])
+m4trace:configure.ac:7: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:10: -1- m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+m4trace:configure.ac:10: -1- AC_SUBST([PKG_CONFIG])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([PKG_CONFIG])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:10: -1- AC_SUBST([PKG_CONFIG_PATH])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([PKG_CONFIG_PATH])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG_PATH$])
+m4trace:configure.ac:10: -1- AC_SUBST([PKG_CONFIG_LIBDIR])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([PKG_CONFIG_LIBDIR])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG_LIBDIR$])
+m4trace:configure.ac:10: -1- AC_SUBST([PKG_CONFIG])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([PKG_CONFIG])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:10: -1- AC_SUBST([APERTIUM_CFLAGS])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([APERTIUM_CFLAGS])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:10: -1- AC_SUBST([APERTIUM_LIBS])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([APERTIUM_LIBS])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:10: -1- AC_SUBST([APERTIUM_CFLAGS])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([APERTIUM_CFLAGS])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:10: -1- AC_SUBST([APERTIUM_LIBS])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([APERTIUM_LIBS])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:10: -1- AC_SUBST([APERTIUM_CFLAGS])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([APERTIUM_CFLAGS])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:10: -1- AC_SUBST([APERTIUM_LIBS])
+m4trace:configure.ac:10: -1- AC_SUBST_TRACE([APERTIUM_LIBS])
+m4trace:configure.ac:10: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:14: -1- AC_SUBST([CGCOMP])
+m4trace:configure.ac:14: -1- AC_SUBST_TRACE([CGCOMP])
+m4trace:configure.ac:14: -1- m4_pattern_allow([^CGCOMP$])
+m4trace:configure.ac:17: -1- AC_SUBST([CGPROC])
+m4trace:configure.ac:17: -1- AC_SUBST_TRACE([CGPROC])
+m4trace:configure.ac:17: -1- m4_pattern_allow([^CGPROC$])
+m4trace:configure.ac:20: -1- AC_SUBST([LRXCOMP])
+m4trace:configure.ac:20: -1- AC_SUBST_TRACE([LRXCOMP])
+m4trace:configure.ac:20: -1- m4_pattern_allow([^LRXCOMP$])
+m4trace:configure.ac:23: -1- AC_SUBST([LRXPROC])
+m4trace:configure.ac:23: -1- AC_SUBST_TRACE([LRXPROC])
+m4trace:configure.ac:23: -1- m4_pattern_allow([^LRXPROC$])
+m4trace:configure.ac:26: -1- AC_SUBST([ZCAT])
+m4trace:configure.ac:26: -1- AC_SUBST_TRACE([ZCAT])
+m4trace:configure.ac:26: -1- m4_pattern_allow([^ZCAT$])
+m4trace:configure.ac:31: -1- AC_SUBST([AP_SRC1])
+m4trace:configure.ac:31: -1- AC_SUBST_TRACE([AP_SRC1])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^AP_SRC1$])
+m4trace:configure.ac:31: -1- AC_SUBST([AP_LIB1])
+m4trace:configure.ac:31: -1- AC_SUBST_TRACE([AP_LIB1])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^AP_LIB1$])
+m4trace:configure.ac:31: -1- AC_SUBST([AP_SUBDIRS])
+m4trace:configure.ac:31: -1- AC_SUBST_TRACE([AP_SUBDIRS])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^AP_SUBDIRS$])
+m4trace:configure.ac:31: -1- AC_SUBST([APERTIUM_RUS_CFLAGS])
+m4trace:configure.ac:31: -1- AC_SUBST_TRACE([APERTIUM_RUS_CFLAGS])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^APERTIUM_RUS_CFLAGS$])
+m4trace:configure.ac:31: -1- AC_SUBST([APERTIUM_RUS_LIBS])
+m4trace:configure.ac:31: -1- AC_SUBST_TRACE([APERTIUM_RUS_LIBS])
+m4trace:configure.ac:31: -1- m4_pattern_allow([^APERTIUM_RUS_LIBS$])
+m4trace:configure.ac:32: -1- AC_SUBST([AP_SRC2])
+m4trace:configure.ac:32: -1- AC_SUBST_TRACE([AP_SRC2])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^AP_SRC2$])
+m4trace:configure.ac:32: -1- AC_SUBST([AP_LIB2])
+m4trace:configure.ac:32: -1- AC_SUBST_TRACE([AP_LIB2])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^AP_LIB2$])
+m4trace:configure.ac:32: -1- AC_SUBST([AP_SUBDIRS])
+m4trace:configure.ac:32: -1- AC_SUBST_TRACE([AP_SUBDIRS])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^AP_SUBDIRS$])
+m4trace:configure.ac:32: -1- AC_SUBST([APERTIUM_ENG_CFLAGS])
+m4trace:configure.ac:32: -1- AC_SUBST_TRACE([APERTIUM_ENG_CFLAGS])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^APERTIUM_ENG_CFLAGS$])
+m4trace:configure.ac:32: -1- AC_SUBST([APERTIUM_ENG_LIBS])
+m4trace:configure.ac:32: -1- AC_SUBST_TRACE([APERTIUM_ENG_LIBS])
+m4trace:configure.ac:32: -1- m4_pattern_allow([^APERTIUM_ENG_LIBS$])
+m4trace:configure.ac:34: -1- m4_pattern_allow([^ap_include$])
+m4trace:configure.ac:36: -1- AC_CONFIG_FILES([Makefile])
+m4trace:configure.ac:36: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
+You should run autoupdate.], [])
+m4trace:configure.ac:36: -1- AC_SUBST([LIB@&t@OBJS], [$ac_libobjs])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([LIB@&t@OBJS])
+m4trace:configure.ac:36: -1- m4_pattern_allow([^LIB@&t@OBJS$])
+m4trace:configure.ac:36: -1- AC_SUBST([LTLIBOBJS], [$ac_ltlibobjs])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([LTLIBOBJS])
+m4trace:configure.ac:36: -1- m4_pattern_allow([^LTLIBOBJS$])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([top_builddir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([top_build_prefix])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([srcdir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([abs_srcdir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([top_srcdir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([abs_top_srcdir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([builddir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([abs_builddir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([abs_top_builddir])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([INSTALL])
+m4trace:configure.ac:36: -1- AC_SUBST_TRACE([MKDIR_P])
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.log
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.log	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.log	(revision 70339)
@@ -0,0 +1,275 @@
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium Russian-English configure 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ ./configure --with-lang1=../apertium-rus --with-lang2=../apertium-eng
+
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = NM-HP
+uname -m = x86_64
+uname -r = 3.13.0-30-generic
+uname -s = Linux
+uname -v = #55-Ubuntu SMP Fri Jul 4 21:40:53 UTC 2014
+
+/usr/bin/uname -p = unknown
+/bin/uname -X     = unknown
+
+/bin/arch              = unknown
+/usr/bin/arch -k       = unknown
+/usr/convex/getsysinfo = unknown
+/usr/bin/hostinfo      = unknown
+/bin/machine           = unknown
+/usr/bin/oslevel       = unknown
+/bin/universe          = unknown
+
+PATH: /usr/local/sbin
+PATH: /usr/local/bin
+PATH: /usr/sbin
+PATH: /usr/bin
+PATH: /sbin
+PATH: /bin
+PATH: /usr/games
+PATH: /usr/local/games
+PATH: /usr/local/bin
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+configure:1834: checking for a BSD-compatible install
+configure:1902: result: /usr/bin/install -c
+configure:1913: checking whether build environment is sane
+configure:1968: result: yes
+configure:2119: checking for a thread-safe mkdir -p
+configure:2158: result: /bin/mkdir -p
+configure:2165: checking for gawk
+configure:2181: found /usr/bin/gawk
+configure:2192: result: gawk
+configure:2203: checking whether make sets $(MAKE)
+configure:2225: result: yes
+configure:2254: checking whether make supports nested variables
+configure:2271: result: yes
+configure:2397: checking whether ln -s works
+configure:2401: result: yes
+configure:2412: checking for gawk
+configure:2439: result: gawk
+configure:2506: checking for pkg-config
+configure:2524: found /usr/bin/pkg-config
+configure:2536: result: /usr/bin/pkg-config
+configure:2561: checking pkg-config is at least version 0.9.0
+configure:2564: result: yes
+configure:2574: checking for APERTIUM
+configure:2581: $PKG_CONFIG --exists --print-errors "apertium >= 3.4.0"
+configure:2584: $? = 0
+configure:2598: $PKG_CONFIG --exists --print-errors "apertium >= 3.4.0"
+configure:2601: $? = 0
+configure:2819: result: yes
+configure:2828: checking for cg-comp
+configure:2846: found /usr/bin/cg-comp
+configure:2859: result: /usr/bin/cg-comp
+configure:2873: checking for cg-proc
+configure:2891: found /usr/bin/cg-proc
+configure:2904: result: /usr/bin/cg-proc
+configure:2918: checking for lrx-comp
+configure:2936: found /usr/local/bin/lrx-comp
+configure:2949: result: /usr/local/bin/lrx-comp
+configure:2963: checking for lrx-proc
+configure:2981: found /usr/local/bin/lrx-proc
+configure:2994: result: /usr/local/bin/lrx-proc
+configure:3010: checking for gzcat
+configure:3043: result: no
+configure:3010: checking for zcat
+configure:3028: found /bin/zcat
+configure:3040: result: /bin/zcat
+configure:3507: checking that generated files are newer than configure
+configure:3513: result: done
+configure:3521: creating ./config.status
+
+## ---------------------- ##
+## Running config.status. ##
+## ---------------------- ##
+
+This file was extended by Apertium Russian-English config.status 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = 
+  CONFIG_HEADERS  = 
+  CONFIG_LINKS    = 
+  CONFIG_COMMANDS = 
+  $ ./config.status 
+
+on NM-HP
+
+config.status:791: creating Makefile
+
+## ---------------- ##
+## Cache variables. ##
+## ---------------- ##
+
+ac_cv_env_APERTIUM_CFLAGS_set=
+ac_cv_env_APERTIUM_CFLAGS_value=
+ac_cv_env_APERTIUM_ENG_CFLAGS_set=
+ac_cv_env_APERTIUM_ENG_CFLAGS_value=
+ac_cv_env_APERTIUM_ENG_LIBS_set=
+ac_cv_env_APERTIUM_ENG_LIBS_value=
+ac_cv_env_APERTIUM_LIBS_set=
+ac_cv_env_APERTIUM_LIBS_value=
+ac_cv_env_APERTIUM_RUS_CFLAGS_set=
+ac_cv_env_APERTIUM_RUS_CFLAGS_value=
+ac_cv_env_APERTIUM_RUS_LIBS_set=
+ac_cv_env_APERTIUM_RUS_LIBS_value=
+ac_cv_env_AP_LIB1_set=
+ac_cv_env_AP_LIB1_value=
+ac_cv_env_AP_LIB2_set=
+ac_cv_env_AP_LIB2_value=
+ac_cv_env_AP_SRC1_set=
+ac_cv_env_AP_SRC1_value=
+ac_cv_env_AP_SRC2_set=
+ac_cv_env_AP_SRC2_value=
+ac_cv_env_AP_SUBDIRS_set=
+ac_cv_env_AP_SUBDIRS_value=
+ac_cv_env_PKG_CONFIG_LIBDIR_set=
+ac_cv_env_PKG_CONFIG_LIBDIR_value=
+ac_cv_env_PKG_CONFIG_PATH_set=set
+ac_cv_env_PKG_CONFIG_PATH_value=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig
+ac_cv_env_PKG_CONFIG_set=
+ac_cv_env_PKG_CONFIG_value=
+ac_cv_env_build_alias_set=
+ac_cv_env_build_alias_value=
+ac_cv_env_host_alias_set=
+ac_cv_env_host_alias_value=
+ac_cv_env_target_alias_set=
+ac_cv_env_target_alias_value=
+ac_cv_path_CGCOMP=/usr/bin/cg-comp
+ac_cv_path_CGPROC=/usr/bin/cg-proc
+ac_cv_path_LRXCOMP=/usr/local/bin/lrx-comp
+ac_cv_path_LRXPROC=/usr/local/bin/lrx-proc
+ac_cv_path_ZCAT=/bin/zcat
+ac_cv_path_ac_pt_PKG_CONFIG=/usr/bin/pkg-config
+ac_cv_path_install='/usr/bin/install -c'
+ac_cv_path_mkdir=/bin/mkdir
+ac_cv_prog_AWK=gawk
+ac_cv_prog_make_make_set=yes
+am_cv_make_support_nested_variables=yes
+pkg_cv_APERTIUM_CFLAGS='-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+pkg_cv_APERTIUM_LIBS='-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  '
+
+## ----------------- ##
+## Output variables. ##
+## ----------------- ##
+
+ACLOCAL='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing aclocal-1.14'
+AMTAR='$${TAR-tar}'
+AM_BACKSLASH='\'
+AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+AM_DEFAULT_VERBOSITY='1'
+AM_V='$(V)'
+APERTIUM_CFLAGS='-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+APERTIUM_ENG_CFLAGS=''
+APERTIUM_ENG_LIBS=''
+APERTIUM_LIBS='-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  '
+APERTIUM_RUS_CFLAGS=''
+APERTIUM_RUS_LIBS=''
+AP_LIB1='../apertium-rus'
+AP_LIB2='../apertium-eng'
+AP_SRC1='../apertium-rus'
+AP_SRC2='../apertium-eng'
+AP_SUBDIRS=' ../apertium-rus ../apertium-eng'
+AUTOCONF='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing autoconf'
+AUTOHEADER='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing autoheader'
+AUTOMAKE='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing automake-1.14'
+AWK='gawk'
+CGCOMP='/usr/bin/cg-comp'
+CGPROC='/usr/bin/cg-proc'
+CYGPATH_W='echo'
+DEFS='-DPACKAGE_NAME=\"Apertium\ Russian-English\" -DPACKAGE_TARNAME=\"apertium-rus-eng\" -DPACKAGE_VERSION=\"0.2.0\" -DPACKAGE_STRING=\"Apertium\ Russian-English\ 0.2.0\" -DPACKAGE_BUGREPORT=\"super-antispam@ya.ru\" -DPACKAGE_URL=\"http://wiki.apertium.org/wiki/Apertium-rus-eng\" -DPACKAGE=\"apertium-rus-eng\" -DVERSION=\"0.2.0\"'
+ECHO_C=''
+ECHO_N='-n'
+ECHO_T=''
+INSTALL_DATA='${INSTALL} -m 644'
+INSTALL_PROGRAM='${INSTALL}'
+INSTALL_SCRIPT='${INSTALL}'
+INSTALL_STRIP_PROGRAM='$(install_sh) -c -s'
+LIBOBJS=''
+LIBS=''
+LN_S='ln -s'
+LRXCOMP='/usr/local/bin/lrx-comp'
+LRXPROC='/usr/local/bin/lrx-proc'
+LTLIBOBJS=''
+MAKEINFO='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing makeinfo'
+MKDIR_P='/bin/mkdir -p'
+PACKAGE='apertium-rus-eng'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_NAME='Apertium Russian-English'
+PACKAGE_STRING='Apertium Russian-English 0.2.0'
+PACKAGE_TARNAME='apertium-rus-eng'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-rus-eng'
+PACKAGE_VERSION='0.2.0'
+PATH_SEPARATOR=':'
+PKG_CONFIG='/usr/bin/pkg-config'
+PKG_CONFIG_LIBDIR=''
+PKG_CONFIG_PATH='/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig'
+SET_MAKE=''
+SHELL='/bin/bash'
+STRIP=''
+VERSION='0.2.0'
+ZCAT='/bin/zcat'
+am__isrc=''
+am__leading_dot='.'
+am__tar='$${TAR-tar} chof - "$$tardir"'
+am__untar='$${TAR-tar} xf -'
+bindir='${exec_prefix}/bin'
+build_alias=''
+datadir='${datarootdir}'
+datarootdir='${prefix}/share'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+dvidir='${docdir}'
+exec_prefix='${prefix}'
+host_alias=''
+htmldir='${docdir}'
+includedir='${prefix}/include'
+infodir='${datarootdir}/info'
+install_sh='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/install-sh'
+libdir='${exec_prefix}/lib'
+libexecdir='${exec_prefix}/libexec'
+localedir='${datarootdir}/locale'
+localstatedir='${prefix}/var'
+mandir='${datarootdir}/man'
+mkdir_p='$(MKDIR_P)'
+oldincludedir='/usr/include'
+pdfdir='${docdir}'
+prefix='/usr/local'
+program_transform_name='s,x,x,'
+psdir='${docdir}'
+sbindir='${exec_prefix}/sbin'
+sharedstatedir='${prefix}/com'
+sysconfdir='${prefix}/etc'
+target_alias=''
+
+## ------------------- ##
+## File substitutions. ##
+## ------------------- ##
+
+ap_include='./ap_include.am'
+
+## ----------- ##
+## confdefs.h. ##
+## ----------- ##
+
+/* confdefs.h */
+#define PACKAGE_NAME "Apertium Russian-English"
+#define PACKAGE_TARNAME "apertium-rus-eng"
+#define PACKAGE_VERSION "0.2.0"
+#define PACKAGE_STRING "Apertium Russian-English 0.2.0"
+#define PACKAGE_BUGREPORT "super-antispam@ya.ru"
+#define PACKAGE_URL "http://wiki.apertium.org/wiki/Apertium-rus-eng"
+#define PACKAGE "apertium-rus-eng"
+#define VERSION "0.2.0"
+
+configure: exit 0
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.status
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.status	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.status	(revision 70339)
@@ -0,0 +1,974 @@
+#! /bin/bash
+# Generated by configure.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=${CONFIG_SHELL-/bin/bash}
+export SHELL
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+# Files that config.status was made for.
+config_files=" Makefile"
+
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>."
+
+ac_cs_config="'--with-lang1=../apertium-rus' '--with-lang2=../apertium-eng' 'PKG_CONFIG_PATH=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig'"
+ac_cs_version="\
+Apertium Russian-English config.status 0.2.0
+configured by ./configure, generated by GNU Autoconf 2.69,
+  with options \"$ac_cs_config\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng'
+srcdir='.'
+INSTALL='/usr/bin/install -c'
+MKDIR_P='/bin/mkdir -p'
+AWK='gawk'
+test -n "$AWK" || AWK=awk
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+if $ac_cs_recheck; then
+  set X /bin/bash './configure'  '--with-lang1=../apertium-rus' '--with-lang2=../apertium-eng' 'PKG_CONFIG_PATH=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig' $ac_configure_extra_args --no-create --no-recursion
+  shift
+  $as_echo "running CONFIG_SHELL=/bin/bash $*" >&6
+  CONFIG_SHELL='/bin/bash'
+  export CONFIG_SHELL
+  exec "$@"
+fi
+
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+cat >>"$ac_tmp/subs1.awk" <<\_ACAWK &&
+F["ap_include"]="./ap_include.am"
+_ACAWK
+cat >>"$ac_tmp/subs1.awk" <<\_ACAWK &&
+S["LTLIBOBJS"]=""
+S["LIBOBJS"]=""
+S["APERTIUM_ENG_LIBS"]=""
+S["APERTIUM_ENG_CFLAGS"]=""
+S["AP_LIB2"]="../apertium-eng"
+S["AP_SRC2"]="../apertium-eng"
+S["APERTIUM_RUS_LIBS"]=""
+S["APERTIUM_RUS_CFLAGS"]=""
+S["AP_SUBDIRS"]=" ../apertium-rus ../apertium-eng"
+S["AP_LIB1"]="../apertium-rus"
+S["AP_SRC1"]="../apertium-rus"
+S["ZCAT"]="/bin/zcat"
+S["LRXPROC"]="/usr/local/bin/lrx-proc"
+S["LRXCOMP"]="/usr/local/bin/lrx-comp"
+S["CGPROC"]="/usr/bin/cg-proc"
+S["CGCOMP"]="/usr/bin/cg-comp"
+S["APERTIUM_LIBS"]="-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  "
+S["APERTIUM_CFLAGS"]="-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I"\
+"/usr/include/libxml2  "
+S["PKG_CONFIG_LIBDIR"]=""
+S["PKG_CONFIG_PATH"]="/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig"
+S["PKG_CONFIG"]="/usr/bin/pkg-config"
+S["LN_S"]="ln -s"
+S["AM_BACKSLASH"]="\\"
+S["AM_DEFAULT_VERBOSITY"]="1"
+S["AM_DEFAULT_V"]="$(AM_DEFAULT_VERBOSITY)"
+S["AM_V"]="$(V)"
+S["am__untar"]="$${TAR-tar} xf -"
+S["am__tar"]="$${TAR-tar} chof - \"$$tardir\""
+S["AMTAR"]="$${TAR-tar}"
+S["am__leading_dot"]="."
+S["SET_MAKE"]=""
+S["AWK"]="gawk"
+S["mkdir_p"]="$(MKDIR_P)"
+S["MKDIR_P"]="/bin/mkdir -p"
+S["INSTALL_STRIP_PROGRAM"]="$(install_sh) -c -s"
+S["STRIP"]=""
+S["install_sh"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/install-sh"
+S["MAKEINFO"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing makeinfo"
+S["AUTOHEADER"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing autoheader"
+S["AUTOMAKE"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing automake-1.14"
+S["AUTOCONF"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing autoconf"
+S["ACLOCAL"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/missing aclocal-1.14"
+S["VERSION"]="0.2.0"
+S["PACKAGE"]="apertium-rus-eng"
+S["CYGPATH_W"]="echo"
+S["am__isrc"]=""
+S["INSTALL_DATA"]="${INSTALL} -m 644"
+S["INSTALL_SCRIPT"]="${INSTALL}"
+S["INSTALL_PROGRAM"]="${INSTALL}"
+S["target_alias"]=""
+S["host_alias"]=""
+S["build_alias"]=""
+S["LIBS"]=""
+S["ECHO_T"]=""
+S["ECHO_N"]="-n"
+S["ECHO_C"]=""
+S["DEFS"]="-DPACKAGE_NAME=\\\"Apertium\\ Russian-English\\\" -DPACKAGE_TARNAME=\\\"apertium-rus-eng\\\" -DPACKAGE_VERSION=\\\"0.2.0\\\" -DPACKAGE_STRING=\\\"Apertium\\ Russian"\
+"-English\\ 0.2.0\\\" -DPACKAGE_BUGREPORT=\\\"super-antispam@ya.ru\\\" -DPACKAGE_URL=\\\"http://wiki.apertium.org/wiki/Apertium-rus-eng\\\" -DPACKAGE=\\\"apertium"\
+"-rus-eng\\\" -DVERSION=\\\"0.2.0\\\""
+S["mandir"]="${datarootdir}/man"
+S["localedir"]="${datarootdir}/locale"
+S["libdir"]="${exec_prefix}/lib"
+S["psdir"]="${docdir}"
+S["pdfdir"]="${docdir}"
+S["dvidir"]="${docdir}"
+S["htmldir"]="${docdir}"
+S["infodir"]="${datarootdir}/info"
+S["docdir"]="${datarootdir}/doc/${PACKAGE_TARNAME}"
+S["oldincludedir"]="/usr/include"
+S["includedir"]="${prefix}/include"
+S["localstatedir"]="${prefix}/var"
+S["sharedstatedir"]="${prefix}/com"
+S["sysconfdir"]="${prefix}/etc"
+S["datadir"]="${datarootdir}"
+S["datarootdir"]="${prefix}/share"
+S["libexecdir"]="${exec_prefix}/libexec"
+S["sbindir"]="${exec_prefix}/sbin"
+S["bindir"]="${exec_prefix}/bin"
+S["program_transform_name"]="s,x,x,"
+S["prefix"]="/usr/local"
+S["exec_prefix"]="${prefix}"
+S["PACKAGE_URL"]="http://wiki.apertium.org/wiki/Apertium-rus-eng"
+S["PACKAGE_BUGREPORT"]="super-antispam@ya.ru"
+S["PACKAGE_STRING"]="Apertium Russian-English 0.2.0"
+S["PACKAGE_VERSION"]="0.2.0"
+S["PACKAGE_TARNAME"]="apertium-rus-eng"
+S["PACKAGE_NAME"]="Apertium Russian-English"
+S["PATH_SEPARATOR"]=":"
+S["SHELL"]="/bin/bash"
+_ACAWK
+cat >>"$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  $ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      $ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+$ac_cs_awk_pipe_fini
+_ACAWK
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+  ac_datarootdir_hack='
+  s&@datadir@&${datarootdir}&g
+  s&@docdir@&${datarootdir}/doc/${PACKAGE_TARNAME}&g
+  s&@infodir@&${datarootdir}/info&g
+  s&@localedir@&${datarootdir}/locale&g
+  s&@mandir@&${datarootdir}/man&g
+  s&\${datarootdir}&${prefix}/share&g' ;;
+esac
+ac_sed_extra="/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}
+
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+
+
+
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/config.status
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure	(revision 70339)
@@ -0,0 +1,4580 @@
+#! /bin/sh
+# Guess values for system-dependent variables and create Makefiles.
+# Generated by GNU Autoconf 2.69 for Apertium Russian-English 0.2.0.
+#
+# Report bugs to <super-antispam@ya.ru>.
+#
+#
+# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+#
+#
+# This configure script is free software; the Free Software Foundation
+# gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in #(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIBOBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium Russian-English'
+PACKAGE_TARNAME='apertium-rus-eng'
+PACKAGE_VERSION='0.2.0'
+PACKAGE_STRING='Apertium Russian-English 0.2.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-rus-eng'
+
+ac_subst_vars='LTLIBOBJS
+LIBOBJS
+APERTIUM_ENG_LIBS
+APERTIUM_ENG_CFLAGS
+AP_LIB2
+AP_SRC2
+APERTIUM_RUS_LIBS
+APERTIUM_RUS_CFLAGS
+AP_SUBDIRS
+AP_LIB1
+AP_SRC1
+ZCAT
+LRXPROC
+LRXCOMP
+CGPROC
+CGCOMP
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+with_lang1
+with_lang2
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+AP_SRC1
+AP_LIB1
+AP_SUBDIRS
+APERTIUM_RUS_CFLAGS
+APERTIUM_RUS_LIBS
+AP_SRC2
+AP_LIB2
+APERTIUM_ENG_CFLAGS
+APERTIUM_ENG_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium Russian-English 0.2.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          [$ac_default_prefix]
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          [PREFIX]
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          [DATAROOTDIR/doc/apertium-rus-eng]
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium Russian-English 0.2.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Optional Packages:
+  --with-PACKAGE[=ARG]    use PACKAGE [ARG=yes]
+  --without-PACKAGE       do not use PACKAGE (same as --with-PACKAGE=no)
+  --with-lang1            Uninstalled source directory for apertium-rus,
+                          defines AP_SRC1 and AP_LIB1 for Makefile, otherwise
+                          these are set to paths of installed files.
+
+  --with-lang2            Uninstalled source directory for apertium-eng,
+                          defines AP_SRC2 and AP_LIB2 for Makefile, otherwise
+                          these are set to paths of installed files.
+
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS
+              linker flags for APERTIUM, overriding pkg-config
+  AP_SRC1     Path to apertium-rus sources, same as AP_LIB1 if --with-lang1
+              set
+  AP_LIB1     Path to apertium-rus binaries, same as AP_SRC1 if --with-lang1
+              set
+  AP_SUBDIRS  List of all --with-lang dirs; add it to SUBDIRS to make
+              configure-specified dependencies recursively
+  APERTIUM_RUS_CFLAGS
+              C compiler flags for APERTIUM_RUS, overriding pkg-config
+  APERTIUM_RUS_LIBS
+              linker flags for APERTIUM_RUS, overriding pkg-config
+  AP_SRC2     Path to apertium-eng sources, same as AP_LIB2 if --with-lang2
+              set
+  AP_LIB2     Path to apertium-eng binaries, same as AP_SRC2 if --with-lang2
+              set
+  APERTIUM_ENG_CFLAGS
+              C compiler flags for APERTIUM_ENG, overriding pkg-config
+  APERTIUM_ENG_LIBS
+              linker flags for APERTIUM_ENG, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium Russian-English configure 0.2.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in #((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in #((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+# Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules;
+fi
+
+case $enable_silent_rules in # (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-rus-eng'
+ VERSION='0.2.0'
+
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE "$PACKAGE"
+_ACEOF
+
+
+cat >>confdefs.h <<_ACEOF
+#define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        else
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-3.2 >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-3.2 >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-3.2 >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium-3.2 >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        else
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-3.2 >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-3.2 >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+
+
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+# Extract the first word of "cg-proc", so it can be a program name with args.
+set dummy cg-proc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGPROC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGPROC in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGPROC="$CGPROC" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_proc/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGPROC="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGPROC" && ac_cv_path_CGPROC="false"
+  ;;
+esac
+fi
+CGPROC=$ac_cv_path_CGPROC
+if test -n "$CGPROC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGPROC" >&5
+$as_echo "$CGPROC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGPROC = xfalse; then :
+  as_fn_error $? "You don't have cg-proc installed" "$LINENO" 5
+fi
+
+# Extract the first word of "lrx-comp", so it can be a program name with args.
+set dummy lrx-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_LRXCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $LRXCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_LRXCOMP="$LRXCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_lrx_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_LRXCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_LRXCOMP" && ac_cv_path_LRXCOMP="false"
+  ;;
+esac
+fi
+LRXCOMP=$ac_cv_path_LRXCOMP
+if test -n "$LRXCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LRXCOMP" >&5
+$as_echo "$LRXCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$LRXCOMP = xfalse; then :
+  as_fn_error $? "You don't have lrx-comp installed" "$LINENO" 5
+fi
+
+# Extract the first word of "lrx-proc", so it can be a program name with args.
+set dummy lrx-proc; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_LRXPROC+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $LRXPROC in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_LRXPROC="$LRXPROC" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_lrx_proc/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_LRXPROC="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_LRXPROC" && ac_cv_path_LRXPROC="false"
+  ;;
+esac
+fi
+LRXPROC=$ac_cv_path_LRXPROC
+if test -n "$LRXPROC"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $LRXPROC" >&5
+$as_echo "$LRXPROC" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$LRXPROC = xfalse; then :
+  as_fn_error $? "You don't have lrx-proc installed" "$LINENO" 5
+fi
+
+for ac_prog in gzcat zcat
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ZCAT+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ZCAT in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ZCAT="$ZCAT" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ZCAT="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ZCAT=$ac_cv_path_ZCAT
+if test -n "$ZCAT"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ZCAT" >&5
+$as_echo "$ZCAT" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$ZCAT" && break
+done
+test -n "$ZCAT" || ZCAT="false"
+
+if test x$ZCAT = xfalse; then :
+  as_fn_error $? "You don't have zcat nor gzcat installed" "$LINENO" 5
+fi
+
+
+
+
+
+
+
+
+# Check whether --with-lang1 was given.
+if test "${with_lang1+set}" = set; then :
+  withval=$with_lang1;
+      AP_LIB1=$withval
+      AP_SRC1=$withval
+      echo "Using apertium-rus from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+
+else
+
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM_RUS" >&5
+$as_echo_n "checking for APERTIUM_RUS... " >&6; }
+
+if test -n "$APERTIUM_RUS_CFLAGS"; then
+    pkg_cv_APERTIUM_RUS_CFLAGS="$APERTIUM_RUS_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-rus\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-rus") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_RUS_CFLAGS=`$PKG_CONFIG --cflags "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_RUS_LIBS"; then
+    pkg_cv_APERTIUM_RUS_LIBS="$APERTIUM_RUS_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-rus\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-rus") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_RUS_LIBS=`$PKG_CONFIG --libs "apertium-rus" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_RUS_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-rus" 2>&1`
+        else
+	        APERTIUM_RUS_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-rus" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_RUS_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-rus) were not met:
+
+$APERTIUM_RUS_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_RUS_CFLAGS
+and APERTIUM_RUS_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_RUS_CFLAGS
+and APERTIUM_RUS_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	APERTIUM_RUS_CFLAGS=$pkg_cv_APERTIUM_RUS_CFLAGS
+	APERTIUM_RUS_LIBS=$pkg_cv_APERTIUM_RUS_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+      AP_LIB1=`pkg-config --variable=dir apertium-rus`
+      AP_SRC1=`pkg-config --variable=srcdir apertium-rus`
+
+fi
+
+  if test -z "$AP_SRC1" || ! test -d "$AP_SRC1"; then
+    as_fn_error $? "Could not find sources dir for apertium-rus (AP_SRC1=\"$AP_SRC1\")" "$LINENO" 5
+  fi
+
+
+
+
+
+
+# Check whether --with-lang2 was given.
+if test "${with_lang2+set}" = set; then :
+  withval=$with_lang2;
+      AP_LIB2=$withval
+      AP_SRC2=$withval
+      echo "Using apertium-eng from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+
+else
+
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM_ENG" >&5
+$as_echo_n "checking for APERTIUM_ENG... " >&6; }
+
+if test -n "$APERTIUM_ENG_CFLAGS"; then
+    pkg_cv_APERTIUM_ENG_CFLAGS="$APERTIUM_ENG_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-eng\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-eng") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_ENG_CFLAGS=`$PKG_CONFIG --cflags "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_ENG_LIBS"; then
+    pkg_cv_APERTIUM_ENG_LIBS="$APERTIUM_ENG_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium-eng\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium-eng") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_ENG_LIBS=`$PKG_CONFIG --libs "apertium-eng" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_ENG_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium-eng" 2>&1`
+        else
+	        APERTIUM_ENG_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium-eng" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_ENG_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium-eng) were not met:
+
+$APERTIUM_ENG_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_ENG_CFLAGS
+and APERTIUM_ENG_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_ENG_CFLAGS
+and APERTIUM_ENG_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	APERTIUM_ENG_CFLAGS=$pkg_cv_APERTIUM_ENG_CFLAGS
+	APERTIUM_ENG_LIBS=$pkg_cv_APERTIUM_ENG_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+      AP_LIB2=`pkg-config --variable=dir apertium-eng`
+      AP_SRC2=`pkg-config --variable=srcdir apertium-eng`
+
+fi
+
+  if test -z "$AP_SRC2" || ! test -d "$AP_SRC2"; then
+    as_fn_error $? "Could not find sources dir for apertium-eng (AP_SRC2=\"$AP_SRC2\")" "$LINENO" 5
+  fi
+
+
+
+
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\$*.autobil.att > .deps/\$*.autobil.hfst
+	hfst-project -p upper .deps/\$*.autobil.hfst > .deps/\$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/\$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\$*.autobil.upper -2 .deps/\$*.any-nonplus.hfst -o .deps/\$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\$*.single-plus.hfst -2 .deps/\$*.autobil.nonplussed -o .deps/\$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\$*.autobil.postplus -o .deps/\$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\$*.autobil.nonplussed -2 .deps/\$*.autobil.postplus.0,3 -o \$@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIBOBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium Russian-English $as_me 0.2.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium Russian-English home page: <http://wiki.apertium.org/wiki/Apertium-rus-eng>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium Russian-English config.status 0.2.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F["&"]="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+
+
+
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure.ac
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure.ac	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/configure.ac	(revision 70339)
@@ -0,0 +1,37 @@
+AC_PREREQ(2.52)
+
+AC_INIT([Apertium Russian-English], [0.2.0], [super-antispam@ya.ru], [apertium-rus-eng], [http://wiki.apertium.org/wiki/Apertium-rus-eng])
+AM_INIT_AUTOMAKE
+
+AC_PROG_LN_S
+AC_PROG_AWK
+
+m4_define([required_apertium_version], [3.4.0])
+PKG_CHECK_MODULES(APERTIUM, apertium >= required_apertium_version, [], [PKG_CHECK_MODULES(APERTIUM, apertium-3.2 >= required_apertium_version)])
+
+
+
+AC_PATH_PROG([CGCOMP], [cg-comp], [false], [$PATH$PATH_SEPARATOR$with_cg_comp/bin])
+AS_IF([test x$CGCOMP = xfalse], [AC_MSG_ERROR([You don't have cg-comp installed])])
+
+AC_PATH_PROG([CGPROC], [cg-proc], [false], [$PATH$PATH_SEPARATOR$with_cg_proc/bin])
+AS_IF([test x$CGPROC = xfalse], [AC_MSG_ERROR([You don't have cg-proc installed])])
+
+AC_PATH_PROG([LRXCOMP], [lrx-comp], [false], [$PATH$PATH_SEPARATOR$with_lrx_comp/bin])
+AS_IF([test x$LRXCOMP = xfalse], [AC_MSG_ERROR([You don't have lrx-comp installed])])
+
+AC_PATH_PROG([LRXPROC], [lrx-proc], [false], [$PATH$PATH_SEPARATOR$with_lrx_proc/bin])
+AS_IF([test x$LRXPROC = xfalse], [AC_MSG_ERROR([You don't have lrx-proc installed])])
+
+AC_PATH_PROGS(ZCAT, [gzcat zcat], [false])
+AS_IF([test x$ZCAT = xfalse], [AC_MSG_ERROR([You don't have zcat nor gzcat installed])])
+
+m4_ifdef([AP_CHECK_LING],[],[AC_MSG_ERROR([AP_CHECK_LING not defined, is apertium.m4 in ACLOCAL_PATH? See: http://wiki.apertium.org/wiki/Installation_troubleshooting])])
+
+AP_CHECK_LING([1], [apertium-rus])
+AP_CHECK_LING([2], [apertium-eng])
+
+AP_MKINCLUDE
+
+AC_OUTPUT([Makefile])
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autopgen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autopgen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autopgen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autopgen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autopgen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob	(revision 70339)
@@ -0,0 +1,50 @@
+$































**7	
+80 0!11!22 
+@B@T@A@G@_@L@P@A@R@T@A@G@_@R@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@C@M@T@A@G@_@S@E@N@T@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F
+@E@V@E@R@Y@T@H@I@N@G@V@A@N@A@D@V@T@E@P@R@E@A@D@V@D@E@H@E@T@N@O@U@N@N@O@U@N@P@L@N@O@U@N@M@N@O@U@N@F@N@O@U@N@M@F@N@O@U@N@N@T@N@O@U@N@A@C@R@A@D@J@P@R@E@D@A@D@J@A@T@T@R@A@D@J@P@A@R@T@A@D@J@A@D@J@S@I@N@T@P@R@E@D@A@D@J@S@I@N@T@A@T@T@R@A@D@J@S@I@N@T@A@D@V@V@B@L@E@X@I@M@P@V@B@L@E@X@I@N@F@V@B@L@E@X@V@E@R@B@V@E@R@B@P1@V@E@R@B@P2@V@E@R@B@P3@V@A@U@X@V@B@M@O@D@V@B@S@E@R@V@B@H@A@V@E@R@V@B@S@E@P@C@N@J@C@O@O@C@N@J@S@U@B@C@N@J@A@D@V@P@R@N@N@P@A@N@T@N@P@T@O@P@N@P@C@O@G@N@P@A@L@P@R	@P@R@N@S@U@B@J@P1	@P@R@N@S@U@B@J@P2	@P@R@N@S@U@B@J@P3@R@E@L@P@R@E@A@D@V@I@J@N@U@M@D@E@T@D@E@T@D@E@F@D@E@T@I@N@D@P@U@N@C@k@M@O@T@k@D@O@L@L@A@R@k@B@A@R@R@A@k@M@A@S@k@I@G@N@O@R@A@R@k@B@E@G@I@N@k@U@N@K@N@O@W@N;@T@A@G@_@A@D@J@T@A@G@_@A@D@J@A@T@T@R@T@A@G@_@A@D@J@P@A@R@T@T@A@G@_@A@D@J@P@R@E@D@T@A@G@_@A@D@J@S@I@N@T@T@A@G@_@A@D@J@S@I@N@T@A@T@T@R@T@A@G@_@A@D@J@S@I@N@T@P@R@E@D@T@A@G@_@A@D@V@T@A@G@_@C@M
+@T@A@G@_@C@N@J@A@D@V)
+@T@A@G@_@C@N@J@C@O@O'
+@T@A@G@_@C@N@J@S@U@B(@T@A@G@_@D@E
+@T@A@G@_@D@E@T7
+@T@A@G@_@D@E@T@D@E@F8
+@T@A@G@_@D@E@T@I@N@D9@T@A@G@_@E@V@E@R@Y@T@H@I@N@G@T@A@G@_@H@E@T@T@A@G@_@I@J5@T@A@G@_@L@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@N@O@U@N@T@A@G@_@N@O@U@N@A@C@R	@T@A@G@_@N@O@U@N@F	@T@A@G@_@N@O@U@N@M
+@T@A@G@_@N@O@U@N@M@F
+@T@A@G@_@N@O@U@N@N@T
+@T@A@G@_@N@O@U@N@P@L
+@T@A@G@_@N@P@A@L.	@T@A@G@_@N@P@A@N@T+	@T@A@G@_@N@P@C@O@G-	@T@A@G@_@N@P@T@O@P,@T@A@G@_@N@U@M6@T@A@G@_@P@R/
+@T@A@G@_@P@R@E@A@D@V4@T@A@G@_@P@R@N*
+@T@A@G@_@P@R@N@S@U@B@J@P10
+@T@A@G@_@P@R@N@S@U@B@J@P21
+@T@A@G@_@P@R@N@S@U@B@J@P32@T@A@G@_@P@U@N@C:@T@A@G@_@R@E@L3@T@A@G@_@R@P@A@R
@T@A@G@_@S@E@N@T@T@A@G@_@T@E@P@R@E@A@D@V	
+@T@A@G@_@V@A@N@A@D@V@T@A@G@_@V@A@U@X"@T@A@G@_@V@B@H@A@V@E@R%	@T@A@G@_@V@B@L@E@X@T@A@G@_@V@B@L@E@X@I@M@P@T@A@G@_@V@B@L@E@X@I@N@F	@T@A@G@_@V@B@M@O@D#	@T@A@G@_@V@B@S@E@P&	@T@A@G@_@V@B@S@E@R$@T@A@G@_@V@E@R@B
+@T@A@G@_@V@E@R@B@P1
+@T@A@G@_@V@E@R@B@P2 
+@T@A@G@_@V@E@R@B@P3!@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F@k@B@A@R@R@A=@k@B@E@G@I@N@@@k@D@O@L@L@A@R<@k@I@G@N@O@R@A@R?@k@M@A@S>@k@M@O@T;@k@U@N@K@N@O@W@N@A<






$	
+
+ !"#&+,-.56



	

+



+


















 
!
"
#
$
%
&
'
(
)
*
+
,
-
.
/
0
1
2
3
4
5
6
7
8
9
:;<?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'�8�8�8�8�8?��8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́?��}�&Q=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'@_?�
?�?�?�
?�?�?�?�?�?�	?�	?�	
+?�
+?�
+?�?�?�?�
+?�
+?�
+?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?� ?� ?� !?�!?�!"?�"?�"#?�#?�#$?�$%?�%&?�&?�&'?�'(?�()?�)*?�*+?�+?�+,?�,?�,-?�-?�-.?�.?�./?�/0?�01?�12?�23?�34?�45?�5?�56?�6?�67?�78?�89?�9:?�:;?�>@A@N@Y@_@T@A@G@A@N@Y@_@C@H@A@R@Q@U@E@U@E@a@d@v@p@r@e@a@d@v@d@e@t@d@e@f@m@f@s@g@m@f@n@p@l@n@t
@n
@m
@f@a@c@r@a@d@j@p@r@e@d@s@i@n@t@c@o@m@p@s@u@p@a@t@t@r@p@a@r@t@v@b@l@e@x@i@m@p@s@e@p@i@n@f@p@a@s@t@p@r@e@s@p@r@s@p@p@r@s@p@p@v@b@a@u@x@v@b@m@o@d@v@b@s@e@r@v@b@h@a@v@e@r@p1@p2@p3@v@a@u@x@c@n@j@c@o@o@c@n@j@s@u@b@c@n@j@a@d@v@p@r@n@n@p@a@n@t@t@o@p@c@o@g@a@l@p@r@s@u@b@j@r@e@l@i@j@n@u@m@i@n@d@a@p@o@s@g@u@i@o@c@m@l@p@a@r@r@p@a@r@l@q@u@e@s@t@s@e@n@t
>>
@t@a@g@g@e@r@�




















































































































@�<
@�@N@@	???
??@�?@�@@@�?@�?@�@@@�@C@�?@�?@�?@�?@�?@�@B@{?@x?@u?@r@G@W@E9@B#@E@�?@�?@S@@?@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<
@�

@�

:
@^
@A
@z

<
@�

9
@^
@A
@z

<
@�

8

7
2@@@@

5
@^
@A
@z

<
3
@^
@A
@z

<
5
@^
@A
@z

<.?
+?@@@B
+@E
3@H@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<'?@A?
@^
@A
@z

<'???@@
@O@^
@A
@z

<(
+@B
@^
@A
@z

<(	@B
@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<	???????
@V
=
=@_
@A
@z

<#@@
@V@S
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@p
=@_
@A
@z

<
+???

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<??

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=@_
@A
@z

<@n@D
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@�

	
+
+		
+
+
+ 
+"#%&'
+(
+)
+*
+,-/0235689;<>?@A@B@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@Z@[@^@_@`@a@b@c@e@f@h@i@k@l@m@n@o@p@q@r@t@u@w@x@z@{@}@~@�@�@�@�@�@�@�@�@�@�@� @� @� @� @� @� @� @� @� @� @�!@�!@�!@�!@�!@�!@�!@�!@�!@�!@�"@�"@�&@�&@�'@�'@�(@�(@�)@�)@�*@�*@�+@�+@�,@�,@�-@�-@�.@�.@�/@�/@�0@�0@�1@�1@�2@�2@�3@�3@�4@�4@�5@�5@�6@�6@�6@�6@�7@�7@�8@�8@�9@�9@�:@�:@�:@�:
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/install-sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/install-sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/install-sh	(revision 70339)
@@ -0,0 +1,527 @@
+#!/bin/sh
+# install - install a program, script, or datafile
+
+scriptversion=2011-11-20.07; # UTC
+
+# This originates from X11R5 (mit/util/scripts/install.sh), which was
+# later released in X11R6 (xc/config/util/install.sh) with the
+# following copyright and license.
+#
+# Copyright (C) 1994 X Consortium
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to
+# deal in the Software without restriction, including without limitation the
+# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+# sell copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
+# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+# Except as contained in this notice, the name of the X Consortium shall not
+# be used in advertising or otherwise to promote the sale, use or other deal-
+# ings in this Software without prior written authorization from the X Consor-
+# tium.
+#
+#
+# FSF changes to this file are in the public domain.
+#
+# Calling this script install-sh is preferred over install.sh, to prevent
+# 'make' implicit rules from creating a file called install from it
+# when there is no Makefile.
+#
+# This script is compatible with the BSD install script, but was written
+# from scratch.
+
+nl='
+'
+IFS=" ""	$nl"
+
+# set DOITPROG to echo to test this script
+
+# Don't use :- since 4.3BSD and earlier shells don't like it.
+doit=${DOITPROG-}
+if test -z "$doit"; then
+  doit_exec=exec
+else
+  doit_exec=$doit
+fi
+
+# Put in absolute file names if you don't have them in your path;
+# or use environment vars.
+
+chgrpprog=${CHGRPPROG-chgrp}
+chmodprog=${CHMODPROG-chmod}
+chownprog=${CHOWNPROG-chown}
+cmpprog=${CMPPROG-cmp}
+cpprog=${CPPROG-cp}
+mkdirprog=${MKDIRPROG-mkdir}
+mvprog=${MVPROG-mv}
+rmprog=${RMPROG-rm}
+stripprog=${STRIPPROG-strip}
+
+posix_glob='?'
+initialize_posix_glob='
+  test "$posix_glob" != "?" || {
+    if (set -f) 2>/dev/null; then
+      posix_glob=
+    else
+      posix_glob=:
+    fi
+  }
+'
+
+posix_mkdir=
+
+# Desired mode of installed file.
+mode=0755
+
+chgrpcmd=
+chmodcmd=$chmodprog
+chowncmd=
+mvcmd=$mvprog
+rmcmd="$rmprog -f"
+stripcmd=
+
+src=
+dst=
+dir_arg=
+dst_arg=
+
+copy_on_change=false
+no_target_directory=
+
+usage="\
+Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
+   or: $0 [OPTION]... SRCFILES... DIRECTORY
+   or: $0 [OPTION]... -t DIRECTORY SRCFILES...
+   or: $0 [OPTION]... -d DIRECTORIES...
+
+In the 1st form, copy SRCFILE to DSTFILE.
+In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
+In the 4th, create DIRECTORIES.
+
+Options:
+     --help     display this help and exit.
+     --version  display version info and exit.
+
+  -c            (ignored)
+  -C            install only if different (preserve the last data modification time)
+  -d            create directories instead of installing files.
+  -g GROUP      $chgrpprog installed files to GROUP.
+  -m MODE       $chmodprog installed files to MODE.
+  -o USER       $chownprog installed files to USER.
+  -s            $stripprog installed files.
+  -t DIRECTORY  install into DIRECTORY.
+  -T            report an error if DSTFILE is a directory.
+
+Environment variables override the default commands:
+  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
+  RMPROG STRIPPROG
+"
+
+while test $# -ne 0; do
+  case $1 in
+    -c) ;;
+
+    -C) copy_on_change=true;;
+
+    -d) dir_arg=true;;
+
+    -g) chgrpcmd="$chgrpprog $2"
+	shift;;
+
+    --help) echo "$usage"; exit $?;;
+
+    -m) mode=$2
+	case $mode in
+	  *' '* | *'	'* | *'
+'*	  | *'*'* | *'?'* | *'['*)
+	    echo "$0: invalid mode: $mode" >&2
+	    exit 1;;
+	esac
+	shift;;
+
+    -o) chowncmd="$chownprog $2"
+	shift;;
+
+    -s) stripcmd=$stripprog;;
+
+    -t) dst_arg=$2
+	# Protect names problematic for 'test' and other utilities.
+	case $dst_arg in
+	  -* | [=\(\)!]) dst_arg=./$dst_arg;;
+	esac
+	shift;;
+
+    -T) no_target_directory=true;;
+
+    --version) echo "$0 $scriptversion"; exit $?;;
+
+    --)	shift
+	break;;
+
+    -*)	echo "$0: invalid option: $1" >&2
+	exit 1;;
+
+    *)  break;;
+  esac
+  shift
+done
+
+if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
+  # When -d is used, all remaining arguments are directories to create.
+  # When -t is used, the destination is already specified.
+  # Otherwise, the last argument is the destination.  Remove it from $@.
+  for arg
+  do
+    if test -n "$dst_arg"; then
+      # $@ is not empty: it contains at least $arg.
+      set fnord "$@" "$dst_arg"
+      shift # fnord
+    fi
+    shift # arg
+    dst_arg=$arg
+    # Protect names problematic for 'test' and other utilities.
+    case $dst_arg in
+      -* | [=\(\)!]) dst_arg=./$dst_arg;;
+    esac
+  done
+fi
+
+if test $# -eq 0; then
+  if test -z "$dir_arg"; then
+    echo "$0: no input file specified." >&2
+    exit 1
+  fi
+  # It's OK to call 'install-sh -d' without argument.
+  # This can happen when creating conditional directories.
+  exit 0
+fi
+
+if test -z "$dir_arg"; then
+  do_exit='(exit $ret); exit $ret'
+  trap "ret=129; $do_exit" 1
+  trap "ret=130; $do_exit" 2
+  trap "ret=141; $do_exit" 13
+  trap "ret=143; $do_exit" 15
+
+  # Set umask so as not to create temps with too-generous modes.
+  # However, 'strip' requires both read and write access to temps.
+  case $mode in
+    # Optimize common cases.
+    *644) cp_umask=133;;
+    *755) cp_umask=22;;
+
+    *[0-7])
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw='% 200'
+      fi
+      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
+    *)
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw=,u+rw
+      fi
+      cp_umask=$mode$u_plus_rw;;
+  esac
+fi
+
+for src
+do
+  # Protect names problematic for 'test' and other utilities.
+  case $src in
+    -* | [=\(\)!]) src=./$src;;
+  esac
+
+  if test -n "$dir_arg"; then
+    dst=$src
+    dstdir=$dst
+    test -d "$dstdir"
+    dstdir_status=$?
+  else
+
+    # Waiting for this to be detected by the "$cpprog $src $dsttmp" command
+    # might cause directories to be created, which would be especially bad
+    # if $src (and thus $dsttmp) contains '*'.
+    if test ! -f "$src" && test ! -d "$src"; then
+      echo "$0: $src does not exist." >&2
+      exit 1
+    fi
+
+    if test -z "$dst_arg"; then
+      echo "$0: no destination specified." >&2
+      exit 1
+    fi
+    dst=$dst_arg
+
+    # If destination is a directory, append the input filename; won't work
+    # if double slashes aren't ignored.
+    if test -d "$dst"; then
+      if test -n "$no_target_directory"; then
+	echo "$0: $dst_arg: Is a directory" >&2
+	exit 1
+      fi
+      dstdir=$dst
+      dst=$dstdir/`basename "$src"`
+      dstdir_status=0
+    else
+      # Prefer dirname, but fall back on a substitute if dirname fails.
+      dstdir=`
+	(dirname "$dst") 2>/dev/null ||
+	expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	     X"$dst" : 'X\(//\)[^/]' \| \
+	     X"$dst" : 'X\(//\)$' \| \
+	     X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
+	echo X"$dst" |
+	    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)[^/].*/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\).*/{
+		   s//\1/
+		   q
+		 }
+		 s/.*/./; q'
+      `
+
+      test -d "$dstdir"
+      dstdir_status=$?
+    fi
+  fi
+
+  obsolete_mkdir_used=false
+
+  if test $dstdir_status != 0; then
+    case $posix_mkdir in
+      '')
+	# Create intermediate dirs using mode 755 as modified by the umask.
+	# This is like FreeBSD 'install' as of 1997-10-28.
+	umask=`umask`
+	case $stripcmd.$umask in
+	  # Optimize common cases.
+	  *[2367][2367]) mkdir_umask=$umask;;
+	  .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
+
+	  *[0-7])
+	    mkdir_umask=`expr $umask + 22 \
+	      - $umask % 100 % 40 + $umask % 20 \
+	      - $umask % 10 % 4 + $umask % 2
+	    `;;
+	  *) mkdir_umask=$umask,go-w;;
+	esac
+
+	# With -d, create the new directory with the user-specified mode.
+	# Otherwise, rely on $mkdir_umask.
+	if test -n "$dir_arg"; then
+	  mkdir_mode=-m$mode
+	else
+	  mkdir_mode=
+	fi
+
+	posix_mkdir=false
+	case $umask in
+	  *[123567][0-7][0-7])
+	    # POSIX mkdir -p sets u+wx bits regardless of umask, which
+	    # is incompatible with FreeBSD 'install' when (umask & 300) != 0.
+	    ;;
+	  *)
+	    tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
+	    trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
+
+	    if (umask $mkdir_umask &&
+		exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
+	    then
+	      if test -z "$dir_arg" || {
+		   # Check for POSIX incompatibilities with -m.
+		   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
+		   # other-writable bit of parent directory when it shouldn't.
+		   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
+		   ls_ld_tmpdir=`ls -ld "$tmpdir"`
+		   case $ls_ld_tmpdir in
+		     d????-?r-*) different_mode=700;;
+		     d????-?--*) different_mode=755;;
+		     *) false;;
+		   esac &&
+		   $mkdirprog -m$different_mode -p -- "$tmpdir" && {
+		     ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
+		     test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
+		   }
+		 }
+	      then posix_mkdir=:
+	      fi
+	      rmdir "$tmpdir/d" "$tmpdir"
+	    else
+	      # Remove any dirs left behind by ancient mkdir implementations.
+	      rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
+	    fi
+	    trap '' 0;;
+	esac;;
+    esac
+
+    if
+      $posix_mkdir && (
+	umask $mkdir_umask &&
+	$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
+      )
+    then :
+    else
+
+      # The umask is ridiculous, or mkdir does not conform to POSIX,
+      # or it failed possibly due to a race condition.  Create the
+      # directory the slow way, step by step, checking for races as we go.
+
+      case $dstdir in
+	/*) prefix='/';;
+	[-=\(\)!]*) prefix='./';;
+	*)  prefix='';;
+      esac
+
+      eval "$initialize_posix_glob"
+
+      oIFS=$IFS
+      IFS=/
+      $posix_glob set -f
+      set fnord $dstdir
+      shift
+      $posix_glob set +f
+      IFS=$oIFS
+
+      prefixes=
+
+      for d
+      do
+	test X"$d" = X && continue
+
+	prefix=$prefix$d
+	if test -d "$prefix"; then
+	  prefixes=
+	else
+	  if $posix_mkdir; then
+	    (umask=$mkdir_umask &&
+	     $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
+	    # Don't fail if two instances are running concurrently.
+	    test -d "$prefix" || exit 1
+	  else
+	    case $prefix in
+	      *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
+	      *) qprefix=$prefix;;
+	    esac
+	    prefixes="$prefixes '$qprefix'"
+	  fi
+	fi
+	prefix=$prefix/
+      done
+
+      if test -n "$prefixes"; then
+	# Don't fail if two instances are running concurrently.
+	(umask $mkdir_umask &&
+	 eval "\$doit_exec \$mkdirprog $prefixes") ||
+	  test -d "$dstdir" || exit 1
+	obsolete_mkdir_used=true
+      fi
+    fi
+  fi
+
+  if test -n "$dir_arg"; then
+    { test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
+    { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
+      test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
+  else
+
+    # Make a couple of temp file names in the proper directory.
+    dsttmp=$dstdir/_inst.$$_
+    rmtmp=$dstdir/_rm.$$_
+
+    # Trap to clean up those temp files at exit.
+    trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
+
+    # Copy the file name to the temp name.
+    (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
+
+    # and set any options; do chmod last to preserve setuid bits.
+    #
+    # If any of these fail, we abort the whole thing.  If we want to
+    # ignore errors from any of these, just make sure not to ignore
+    # errors from the above "$doit $cpprog $src $dsttmp" command.
+    #
+    { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
+    { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
+    { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
+
+    # If -C, don't bother to copy if it wouldn't change the file.
+    if $copy_on_change &&
+       old=`LC_ALL=C ls -dlL "$dst"	2>/dev/null` &&
+       new=`LC_ALL=C ls -dlL "$dsttmp"	2>/dev/null` &&
+
+       eval "$initialize_posix_glob" &&
+       $posix_glob set -f &&
+       set X $old && old=:$2:$4:$5:$6 &&
+       set X $new && new=:$2:$4:$5:$6 &&
+       $posix_glob set +f &&
+
+       test "$old" = "$new" &&
+       $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
+    then
+      rm -f "$dsttmp"
+    else
+      # Rename the file to the real destination.
+      $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
+
+      # The rename failed, perhaps because mv can't rename something else
+      # to itself, or perhaps because mv is so ancient that it does not
+      # support -f.
+      {
+	# Now remove or move aside any old file at destination location.
+	# We try this two ways since rm can't unlink itself on some
+	# systems and the destination file might be busy for other
+	# reasons.  In this case, the final cleanup might fail but the new
+	# file should still install successfully.
+	{
+	  test ! -f "$dst" ||
+	  $doit $rmcmd -f "$dst" 2>/dev/null ||
+	  { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
+	    { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
+	  } ||
+	  { echo "$0: cannot unlink or rename $dst" >&2
+	    (exit 1); exit 1
+	  }
+	} &&
+
+	# Now rename the file to the real destination.
+	$doit $mvcmd "$dsttmp" "$dst"
+      }
+    fi || exit 1
+
+    trap '' 0
+  fi
+done
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/install-sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/missing
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/missing	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/missing	(revision 70339)
@@ -0,0 +1,215 @@
+#! /bin/sh
+# Common wrapper for a few potentially missing GNU programs.
+
+scriptversion=2013-10-28.13; # UTC
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+# Originally written by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
+
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2, or (at your option)
+# any later version.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+if test $# -eq 0; then
+  echo 1>&2 "Try '$0 --help' for more information"
+  exit 1
+fi
+
+case $1 in
+
+  --is-lightweight)
+    # Used by our autoconf macros to check whether the available missing
+    # script is modern enough.
+    exit 0
+    ;;
+
+  --run)
+    # Back-compat with the calling convention used by older automake.
+    shift
+    ;;
+
+  -h|--h|--he|--hel|--help)
+    echo "\
+$0 [OPTION]... PROGRAM [ARGUMENT]...
+
+Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due
+to PROGRAM being missing or too old.
+
+Options:
+  -h, --help      display this help and exit
+  -v, --version   output version information and exit
+
+Supported PROGRAM values:
+  aclocal   autoconf  autoheader   autom4te  automake  makeinfo
+  bison     yacc      flex         lex       help2man
+
+Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and
+'g' are ignored when checking the name.
+
+Send bug reports to <bug-automake@gnu.org>."
+    exit $?
+    ;;
+
+  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)
+    echo "missing $scriptversion (GNU Automake)"
+    exit $?
+    ;;
+
+  -*)
+    echo 1>&2 "$0: unknown '$1' option"
+    echo 1>&2 "Try '$0 --help' for more information"
+    exit 1
+    ;;
+
+esac
+
+# Run the given program, remember its exit status.
+"$@"; st=$?
+
+# If it succeeded, we are done.
+test $st -eq 0 && exit 0
+
+# Also exit now if we it failed (or wasn't found), and '--version' was
+# passed; such an option is passed most likely to detect whether the
+# program is present and works.
+case $2 in --version|--help) exit $st;; esac
+
+# Exit code 63 means version mismatch.  This often happens when the user
+# tries to use an ancient version of a tool on a file that requires a
+# minimum version.
+if test $st -eq 63; then
+  msg="probably too old"
+elif test $st -eq 127; then
+  # Program was missing.
+  msg="missing on your system"
+else
+  # Program was found and executed, but failed.  Give up.
+  exit $st
+fi
+
+perl_URL=http://www.perl.org/
+flex_URL=http://flex.sourceforge.net/
+gnu_software_URL=http://www.gnu.org/software
+
+program_details ()
+{
+  case $1 in
+    aclocal|automake)
+      echo "The '$1' program is part of the GNU Automake package:"
+      echo "<$gnu_software_URL/automake>"
+      echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:"
+      echo "<$gnu_software_URL/autoconf>"
+      echo "<$gnu_software_URL/m4/>"
+      echo "<$perl_URL>"
+      ;;
+    autoconf|autom4te|autoheader)
+      echo "The '$1' program is part of the GNU Autoconf package:"
+      echo "<$gnu_software_URL/autoconf/>"
+      echo "It also requires GNU m4 and Perl in order to run:"
+      echo "<$gnu_software_URL/m4/>"
+      echo "<$perl_URL>"
+      ;;
+  esac
+}
+
+give_advice ()
+{
+  # Normalize program name to check for.
+  normalized_program=`echo "$1" | sed '
+    s/^gnu-//; t
+    s/^gnu//; t
+    s/^g//; t'`
+
+  printf '%s\n' "'$1' is $msg."
+
+  configure_deps="'configure.ac' or m4 files included by 'configure.ac'"
+  case $normalized_program in
+    autoconf*)
+      echo "You should only need it if you modified 'configure.ac',"
+      echo "or m4 files included by it."
+      program_details 'autoconf'
+      ;;
+    autoheader*)
+      echo "You should only need it if you modified 'acconfig.h' or"
+      echo "$configure_deps."
+      program_details 'autoheader'
+      ;;
+    automake*)
+      echo "You should only need it if you modified 'Makefile.am' or"
+      echo "$configure_deps."
+      program_details 'automake'
+      ;;
+    aclocal*)
+      echo "You should only need it if you modified 'acinclude.m4' or"
+      echo "$configure_deps."
+      program_details 'aclocal'
+      ;;
+   autom4te*)
+      echo "You might have modified some maintainer files that require"
+      echo "the 'autom4te' program to be rebuilt."
+      program_details 'autom4te'
+      ;;
+    bison*|yacc*)
+      echo "You should only need it if you modified a '.y' file."
+      echo "You may want to install the GNU Bison package:"
+      echo "<$gnu_software_URL/bison/>"
+      ;;
+    lex*|flex*)
+      echo "You should only need it if you modified a '.l' file."
+      echo "You may want to install the Fast Lexical Analyzer package:"
+      echo "<$flex_URL>"
+      ;;
+    help2man*)
+      echo "You should only need it if you modified a dependency" \
+           "of a man page."
+      echo "You may want to install the GNU Help2man package:"
+      echo "<$gnu_software_URL/help2man/>"
+    ;;
+    makeinfo*)
+      echo "You should only need it if you modified a '.texi' file, or"
+      echo "any other file indirectly affecting the aspect of the manual."
+      echo "You might want to install the Texinfo package:"
+      echo "<$gnu_software_URL/texinfo/>"
+      echo "The spurious makeinfo call might also be the consequence of"
+      echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might"
+      echo "want to install GNU make:"
+      echo "<$gnu_software_URL/make/>"
+      ;;
+    *)
+      echo "You might have modified some files without having the proper"
+      echo "tools for further handling them.  Check the 'README' file, it"
+      echo "often tells you about the needed prerequisites for installing"
+      echo "this package.  You may also peek at any GNU archive site, in"
+      echo "case some other package contains this missing '$1' program."
+      ;;
+  esac
+}
+
+give_advice "$1" | sed -e '1s/^/WARNING: /' \
+                       -e '2,$s/^/         /' >&2
+
+# Propagate the correct exit status (expected to be 127 for a program
+# not found, 63 for a program that failed due to version mismatch).
+exit $st
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/missing
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-biltrans.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-biltrans.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-biltrans.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-dgen.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-dgen.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-dgen.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin' | apertium-interchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin' | apertium-postchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t3x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin' | lt-proc -d '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-disam.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-disam.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-disam.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-conv -a| vislcg3 --trace --grammar '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-interchunk.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-interchunk.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-interchunk.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin' | apertium-interchunk -t '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-lex.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-lex.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-lex.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' | lrx-proc '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-morph.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-morph.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-morph.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-postchunk.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-postchunk.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-postchunk.mode	(revision 70339)
@@ -0,0 +1,4 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin' | apertium-interchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin' | apertium-postchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t3x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin' 
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-pretransfer.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-pretransfer.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-pretransfer.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-tagger.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-tagger.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-tagger.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-transfer.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-transfer.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus-transfer.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' | apertium-transfer -b -t '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/eng-rus.mode	(revision 70339)
@@ -0,0 +1,4 @@
+
+      
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autobil.bin' | lrx-proc '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autolex.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t1x.bin' | apertium-interchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t2x.bin' | apertium-postchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.eng-rus.t3x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.t3x.bin' | lt-proc $1 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autogen.bin' | lt-proc -p '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/eng-rus.autopgen.bin' 
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-biltrans.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-biltrans.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-biltrans.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-dgen.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-dgen.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-dgen.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin' | apertium-interchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin' | apertium-postchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t3x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin' | lt-proc -d '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-disam.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-disam.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-disam.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-conv -a| vislcg3 --trace --grammar '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-interchunk.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-interchunk.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-interchunk.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' | lrx-proc '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin' | apertium-interchunk -t '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-lex.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-lex.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-lex.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' | lrx-proc -t '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-morph.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-morph.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-morph.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-postchunk.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-postchunk.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-postchunk.mode	(revision 70339)
@@ -0,0 +1,8 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' | lrx-proc '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin' | apertium-interchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin' | apertium-postchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t3x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin' 
+  
+
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-pretransfer.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-pretransfer.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-pretransfer.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-tagger.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-tagger.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-tagger.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-transfer.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-transfer.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng-transfer.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' | lrx-proc '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin' | apertium-transfer -b -t '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes/rus-eng.mode	(revision 70339)
@@ -0,0 +1,4 @@
+
+      
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin' | apertium-tagger -g $2 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob' | apertium-pretransfer| lt-proc -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autobil.bin' | lrx-proc '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin' | apertium-transfer -b '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t1x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t1x.bin' | apertium-interchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t2x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin' | apertium-postchunk '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/apertium-rus-eng.rus-eng.t3x'  '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t3x.bin' | lt-proc $1 '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin' | lt-proc -p '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autopgen.bin' 
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/modes.xml	(revision 70339)
@@ -0,0 +1,531 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<modes>
+
+  <!-- rus → eng -->
+
+  <mode name="rus-eng" install="yes">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+      <program name="lrx-proc">
+        <file name="rus-eng.autolex.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.rus-eng.t1x"/>
+        <file name="rus-eng.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk">
+        <file name="apertium-rus-eng.rus-eng.t2x"/>
+        <file name="rus-eng.t2x.bin"/>
+      </program>
+      <program name="apertium-postchunk">
+        <file name="apertium-rus-eng.rus-eng.t3x"/>
+        <file name="rus-eng.t3x.bin"/>
+      </program>
+      <program name="lt-proc $1">
+        <file name="rus-eng.autogen.bin"/>
+      </program>
+
+      <program name="lt-proc -p">
+        <file name="rus-eng.autopgen.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-dgen" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.rus-eng.t1x"/>
+        <file name="rus-eng.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk">
+        <file name="apertium-rus-eng.rus-eng.t2x"/>
+        <file name="rus-eng.t2x.bin"/>
+      </program>
+      <program name="apertium-postchunk">
+        <file name="apertium-rus-eng.rus-eng.t3x"/>
+        <file name="rus-eng.t3x.bin"/>
+      </program>
+      <program name="lt-proc -d">
+        <file name="rus-eng.autogen.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-morph" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-disam" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+      <program name="cg-conv -a"/>
+      <program name="vislcg3 --trace --grammar">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-tagger" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-pretransfer" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-biltrans" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-lex" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+      <program name="lrx-proc -t">
+        <file name="rus-eng.autolex.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-transfer" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+      <program name="lrx-proc">
+        <file name="rus-eng.autolex.bin"/>
+      </program>
+      <program name="apertium-transfer -b -t">
+        <file name="apertium-rus-eng.rus-eng.t1x"/>
+        <file name="rus-eng.t1x.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-interchunk" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+      <program name="lrx-proc">
+        <file name="rus-eng.autolex.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.rus-eng.t1x"/>
+        <file name="rus-eng.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk -t">
+        <file name="apertium-rus-eng.rus-eng.t2x"/>
+        <file name="rus-eng.t2x.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-eng-postchunk" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus-eng.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="rus-eng.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="rus-eng.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="rus-eng.autobil.bin"/>
+      </program>
+      <program name="lrx-proc">
+        <file name="rus-eng.autolex.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.rus-eng.t1x"/>
+        <file name="rus-eng.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk">
+        <file name="apertium-rus-eng.rus-eng.t2x"/>
+        <file name="rus-eng.t2x.bin"/>
+      </program>
+      <program name="apertium-postchunk">
+        <file name="apertium-rus-eng.rus-eng.t3x"/>
+        <file name="rus-eng.t3x.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <!-- eng → rus -->
+
+  <mode name="eng-rus" install="yes">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+      <program name="lrx-proc">
+        <file name="eng-rus.autolex.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.eng-rus.t1x"/>
+        <file name="eng-rus.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk">
+        <file name="apertium-rus-eng.eng-rus.t2x"/>
+        <file name="eng-rus.t2x.bin"/>
+      </program>
+      <program name="apertium-postchunk">
+        <file name="apertium-rus-eng.eng-rus.t3x"/>
+        <file name="eng-rus.t3x.bin"/>
+      </program>
+      <program name="lt-proc $1">
+        <file name="eng-rus.autogen.bin"/>
+      </program>
+
+      <program name="lt-proc -p">
+        <file name="eng-rus.autopgen.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-dgen" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.eng-rus.t1x"/>
+        <file name="eng-rus.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk">
+        <file name="apertium-rus-eng.eng-rus.t2x"/>
+        <file name="eng-rus.t2x.bin"/>
+      </program>
+      <program name="apertium-postchunk">
+        <file name="apertium-rus-eng.eng-rus.t3x"/>
+        <file name="eng-rus.t3x.bin"/>
+      </program>
+      <program name="lt-proc -d">
+        <file name="eng-rus.autogen.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-morph" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-disam" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+      <program name="cg-conv -a"/>
+      <program name="vislcg3 --trace --grammar">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-tagger" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-pretransfer" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-biltrans" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-lex" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+      <program name="lrx-proc">
+        <file name="eng-rus.autolex.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-transfer" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+      <program name="apertium-transfer -b -t">
+        <file name="apertium-rus-eng.eng-rus.t1x"/>
+        <file name="eng-rus.t1x.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-interchunk" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.eng-rus.t1x"/>
+        <file name="eng-rus.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk -t">
+        <file name="apertium-rus-eng.eng-rus.t2x"/>
+        <file name="eng-rus.t2x.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="eng-rus-postchunk" install="no">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="eng-rus.automorf.bin"/>
+      </program>
+
+
+      <program name="cg-proc -w">
+        <file name="eng-rus.rlx.bin"/>
+      </program>
+      <program name="apertium-tagger -g $2">
+        <file name="eng-rus.prob"/>
+      </program>
+      <program name="apertium-pretransfer"/>
+      <program name="lt-proc -b">
+        <file name="eng-rus.autobil.bin"/>
+      </program>
+      <program name="apertium-transfer -b">
+        <file name="apertium-rus-eng.eng-rus.t1x"/>
+        <file name="eng-rus.t1x.bin"/>
+      </program>
+      <program name="apertium-interchunk">
+        <file name="apertium-rus-eng.eng-rus.t2x"/>
+        <file name="eng-rus.t2x.bin"/>
+      </program>
+      <program name="apertium-postchunk">
+        <file name="apertium-rus-eng.eng-rus.t3x"/>
+        <file name="eng-rus.t3x.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+</modes>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autogen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autolex.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autopgen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autopgen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autopgen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autopgen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.autopgen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.prob	(revision 70339)
@@ -0,0 +1,50 @@
+$































**7	
+80 0!11!22 
+@B@T@A@G@_@L@P@A@R@T@A@G@_@R@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@C@M@T@A@G@_@S@E@N@T@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F
+@E@V@E@R@Y@T@H@I@N@G@V@A@N@A@D@V@T@E@P@R@E@A@D@V@D@E@H@E@T@N@O@U@N@N@O@U@N@P@L@N@O@U@N@M@N@O@U@N@F@N@O@U@N@M@F@N@O@U@N@N@T@N@O@U@N@A@C@R@A@D@J@P@R@E@D@A@D@J@A@T@T@R@A@D@J@P@A@R@T@A@D@J@A@D@J@S@I@N@T@P@R@E@D@A@D@J@S@I@N@T@A@T@T@R@A@D@J@S@I@N@T@A@D@V@V@B@L@E@X@I@M@P@V@B@L@E@X@I@N@F@V@B@L@E@X@V@E@R@B@V@E@R@B@P1@V@E@R@B@P2@V@E@R@B@P3@V@A@U@X@V@B@M@O@D@V@B@S@E@R@V@B@H@A@V@E@R@V@B@S@E@P@C@N@J@C@O@O@C@N@J@S@U@B@C@N@J@A@D@V@P@R@N@N@P@A@N@T@N@P@T@O@P@N@P@C@O@G@N@P@A@L@P@R	@P@R@N@S@U@B@J@P1	@P@R@N@S@U@B@J@P2	@P@R@N@S@U@B@J@P3@R@E@L@P@R@E@A@D@V@I@J@N@U@M@D@E@T@D@E@T@D@E@F@D@E@T@I@N@D@P@U@N@C@k@M@O@T@k@D@O@L@L@A@R@k@B@A@R@R@A@k@M@A@S@k@I@G@N@O@R@A@R@k@B@E@G@I@N@k@U@N@K@N@O@W@N;@T@A@G@_@A@D@J@T@A@G@_@A@D@J@A@T@T@R@T@A@G@_@A@D@J@P@A@R@T@T@A@G@_@A@D@J@P@R@E@D@T@A@G@_@A@D@J@S@I@N@T@T@A@G@_@A@D@J@S@I@N@T@A@T@T@R@T@A@G@_@A@D@J@S@I@N@T@P@R@E@D@T@A@G@_@A@D@V@T@A@G@_@C@M
+@T@A@G@_@C@N@J@A@D@V)
+@T@A@G@_@C@N@J@C@O@O'
+@T@A@G@_@C@N@J@S@U@B(@T@A@G@_@D@E
+@T@A@G@_@D@E@T7
+@T@A@G@_@D@E@T@D@E@F8
+@T@A@G@_@D@E@T@I@N@D9@T@A@G@_@E@V@E@R@Y@T@H@I@N@G@T@A@G@_@H@E@T@T@A@G@_@I@J5@T@A@G@_@L@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@N@O@U@N@T@A@G@_@N@O@U@N@A@C@R	@T@A@G@_@N@O@U@N@F	@T@A@G@_@N@O@U@N@M
+@T@A@G@_@N@O@U@N@M@F
+@T@A@G@_@N@O@U@N@N@T
+@T@A@G@_@N@O@U@N@P@L
+@T@A@G@_@N@P@A@L.	@T@A@G@_@N@P@A@N@T+	@T@A@G@_@N@P@C@O@G-	@T@A@G@_@N@P@T@O@P,@T@A@G@_@N@U@M6@T@A@G@_@P@R/
+@T@A@G@_@P@R@E@A@D@V4@T@A@G@_@P@R@N*
+@T@A@G@_@P@R@N@S@U@B@J@P10
+@T@A@G@_@P@R@N@S@U@B@J@P21
+@T@A@G@_@P@R@N@S@U@B@J@P32@T@A@G@_@P@U@N@C:@T@A@G@_@R@E@L3@T@A@G@_@R@P@A@R
@T@A@G@_@S@E@N@T@T@A@G@_@T@E@P@R@E@A@D@V	
+@T@A@G@_@V@A@N@A@D@V@T@A@G@_@V@A@U@X"@T@A@G@_@V@B@H@A@V@E@R%	@T@A@G@_@V@B@L@E@X@T@A@G@_@V@B@L@E@X@I@M@P@T@A@G@_@V@B@L@E@X@I@N@F	@T@A@G@_@V@B@M@O@D#	@T@A@G@_@V@B@S@E@P&	@T@A@G@_@V@B@S@E@R$@T@A@G@_@V@E@R@B
+@T@A@G@_@V@E@R@B@P1
+@T@A@G@_@V@E@R@B@P2 
+@T@A@G@_@V@E@R@B@P3!@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F@k@B@A@R@R@A=@k@B@E@G@I@N@@@k@D@O@L@L@A@R<@k@I@G@N@O@R@A@R?@k@M@A@S>@k@M@O@T;@k@U@N@K@N@O@W@N@A<






$	
+
+ !"#&+,-.56



	

+



+


















 
!
"
#
$
%
&
'
(
)
*
+
,
-
.
/
0
1
2
3
4
5
6
7
8
9
:;<?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'�8�8�8�8�8?��8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́?��}�&Q=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'@_?�
?�?�?�
?�?�?�?�?�?�	?�	?�	
+?�
+?�
+?�?�?�?�
+?�
+?�
+?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?� ?� ?� !?�!?�!"?�"?�"#?�#?�#$?�$%?�%&?�&?�&'?�'(?�()?�)*?�*+?�+?�+,?�,?�,-?�-?�-.?�.?�./?�/0?�01?�12?�23?�34?�45?�5?�56?�6?�67?�78?�89?�9:?�:;?�>@A@N@Y@_@T@A@G@A@N@Y@_@C@H@A@R@Q@U@E@U@E@a@d@v@p@r@e@a@d@v@d@e@t@d@e@f@m@f@s@g@m@f@n@p@l@n@t
@n
@m
@f@a@c@r@a@d@j@p@r@e@d@s@i@n@t@c@o@m@p@s@u@p@a@t@t@r@p@a@r@t@v@b@l@e@x@i@m@p@s@e@p@i@n@f@p@a@s@t@p@r@e@s@p@r@s@p@p@r@s@p@p@v@b@a@u@x@v@b@m@o@d@v@b@s@e@r@v@b@h@a@v@e@r@p1@p2@p3@v@a@u@x@c@n@j@c@o@o@c@n@j@s@u@b@c@n@j@a@d@v@p@r@n@n@p@a@n@t@t@o@p@c@o@g@a@l@p@r@s@u@b@j@r@e@l@i@j@n@u@m@i@n@d@a@p@o@s@g@u@i@o@c@m@l@p@a@r@r@p@a@r@l@q@u@e@s@t@s@e@n@t
>>
@t@a@g@g@e@r@�




















































































































@�<
@�@N@@	???
??@�?@�@@@�?@�?@�@@@�@C@�?@�?@�?@�?@�?@�@B@{?@x?@u?@r@G@W@E9@B#@E@�?@�?@S@@?@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<
@�

@�

:
@^
@A
@z

<
@�

9
@^
@A
@z

<
@�

8

7
2@@@@

5
@^
@A
@z

<
3
@^
@A
@z

<
5
@^
@A
@z

<.?
+?@@@B
+@E
3@H@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<'?@A?
@^
@A
@z

<'???@@
@O@^
@A
@z

<(
+@B
@^
@A
@z

<(	@B
@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<	???????
@V
=
=@_
@A
@z

<#@@
@V@S
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@p
=@_
@A
@z

<
+???

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<??

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=@_
@A
@z

<@n@D
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@�

	
+
+		
+
+
+ 
+"#%&'
+(
+)
+*
+,-/0235689;<>?@A@B@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@Z@[@^@_@`@a@b@c@e@f@h@i@k@l@m@n@o@p@q@r@t@u@w@x@z@{@}@~@�@�@�@�@�@�@�@�@�@�@� @� @� @� @� @� @� @� @� @� @�!@�!@�!@�!@�!@�!@�!@�!@�!@�!@�"@�"@�&@�&@�'@�'@�(@�(@�)@�)@�*@�*@�+@�+@�,@�,@�-@�-@�.@�.@�/@�/@�0@�0@�1@�1@�2@�2@�3@�3@�4@�4@�5@�5@�6@�6@�6@�6@�7@�7@�8@�8@�9@�9@�:@�:@�:@�:
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.rlx.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus-eng/rus-eng.t2x.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/process.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/process.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/process.sh	(revision 70339)
@@ -0,0 +1,13 @@
+#! /bin/sh
+
+echo $1 | 
+apertium-destxt | 
+lt-proc apertium-rus/rus-eng.automorf.bin | 
+gawk 'BEGIN{RS="$"; FS="/";}{nf=split($1,COMPONENTS,"^"); for(i = 1; i<nf; i++) printf COMPONENTS[i]; if($2 != "") printf("^%s$",$2);}' | 
+lt-proc -b apertium-rus-eng/rus-eng.autobil.bin | # bilingual output 
+apertium-transfer -bw apertium-rus-eng/apertium-rus-eng.rus-eng.w1x apertium-rus-eng/apertium-rus-eng.rus-eng.t1x apertium-rus-eng/rus-eng.t1x.bin | 
+apertium-interchunk apertium-rus-eng/apertium-rus-eng.rus-eng.t2x apertium-rus-eng/rus-eng.t2x.bin | 
+apertium-postchunk apertium-rus-eng/apertium-rus-eng.rus-eng.t3x apertium-rus-eng/rus-eng.t3x.bin | 
+lt-proc -g apertium-eng/rus-eng.autogen.bin | 
+apertium-retxt
+echo ''

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/process.sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.dix	(revision 70339)
@@ -0,0 +1,410 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+
+  <!-- Define the alphabet below. -->
+  <alphabet>АБВГДЕЁЖЗИЙКЛМНОМПРСТУФХЦЧШЩЪЫЬЭЮЯабвгдеёжзиклмнопрстуфхцчшщьыъэюя</alphabet>
+
+  <sdefs>
+    <!-- Define symbol definitions within <sdef> here. -->
+    <sdef n="n"               c="Noun"/>
+    <sdef n="np"              c="Proper noun"/>
+    <sdef n="vblex"           c="Verb, lexical"/>
+    <sdef n="vbmod"           c="Modal verb"/>
+    <sdef n="vaux"            c="Auxiliary verb"/>
+    <sdef n="vbser"           c="'To be' verb"/>
+    <sdef n="vbhaver"         c="'To have' verb"/>
+    <sdef n="cnjsub"          c="Subordinating conjunction"/>
+    <sdef n="cnjcoo"          c="Co-ordinating conjunction"/>
+    <sdef n="cnjadv"          c="Adverbial conjunction"/>
+    <sdef n="pr"              c="Preposition"/>
+    <sdef n="adv"             c="Adverb"/>
+    <sdef n="ij"              c="Interjection"/>
+    <sdef n="adj"             c="Adjective"/>
+    <sdef n="prn"             c="Pronoun"/>
+
+    <sdef n="attr"            c="Attributive"/>
+    <sdef n="top"             c="Toponym"/>
+    <sdef n="ant"             c="Anthroponym"/>
+    <sdef n="cog"             c="Cognomen"/>
+    <sdef n="org"             c="Organisation"/>
+    <sdef n="al"              c="Altres / misc proper nouns"/>
+
+    <sdef n="pers"            c="Personal pronoun"/>
+    <sdef n="ref"             c="Reflexive pronoun"/>
+    <sdef n="res"             c="Reciprocal pronoun"/>
+
+    <sdef n="det"             c="Determiner"/>
+    <sdef n="pos"             c="Possessive"/>
+
+    <sdef n="p1"              c="1st person"/>
+    <sdef n="p2"              c="2nd person"/>
+    <sdef n="p3"              c="3rd person"/>
+
+    <sdef n="nt"              c="Neuter"/>
+    <sdef n="ut"              c="Utrum"/>
+    <sdef n="f"               c="Feminine"/>
+    <sdef n="m"               c="Masculine"/>
+    <sdef n="un"              c="No gender"/>
+
+    <sdef n="sg"              c="Singular"/>
+    <sdef n="du"              c="Dual"/>
+    <sdef n="pl"              c="Plural"/>
+    <sdef n="sp"              c="Singular / plural"/>
+
+    <sdef n="ind"             c="Indefinite"/>
+    <sdef n="def"             c="Definite"/>
+
+    <sdef n="nom"             c="Nominative"/>
+    <sdef n="gen"             c="Genitive"/>
+    <sdef n="acc"             c="Accusative"/>
+    <sdef n="dat"             c="Dative"/>
+    <sdef n="ins"             c="Instrumentalis"/>
+    <sdef n="loc"             c="Locative"/>
+
+    <sdef n="anim"            c="Animate"/>
+    <sdef n="inan"            c="Inanimate"/>
+
+    <sdef n="dem"             c="Demonstrative"/>
+    <sdef n="itg"             c="Question word / interrogative"/>
+    <sdef n="qnt"             c="Quantifier"/>
+    <sdef n="neg"             c="Negative"/>
+    <sdef n="emph"            c="Emphatic"/>
+
+    <sdef n="inf"             c="Infinitive"/>
+    <sdef n="pres"            c="Present"/>
+    <sdef n="imp"             c="Imperative"/>
+    <sdef n="pret"            c="Preterite"/>
+    <sdef n="pp"              c="Perfect participle"/>
+    <sdef n="pprs"            c="Present participle"/>
+    <sdef n="pasv"            c="Passive"/>
+    <sdef n="actv"            c="Active voice"/>
+
+    <sdef n="sint"            c="Synthetic (of adjectives)"/>
+    <sdef n="pst"             c="Positive"/>
+    <sdef n="comp"            c="Comparative"/>
+    <sdef n="sup"             c="Superlative"/>
+
+    <sdef n="ord"             c="Ordinal"/>
+    <sdef n="acr"             c="Acronym"/>
+    <sdef n="unc"             c="Uncountable"/>
+
+    <sdef n="num"             c="Numeral"/>
+    <sdef n="sent"            c="Sentence end"/>
+    <sdef n="cm"              c="Comma"/>
+    <sdef n="apos"            c="Apostrophe"/>
+    <sdef n="guio"            c="Dash"/>
+    <sdef n="lpar"            c="Left parenthesis"/>
+    <sdef n="rpar"            c="Right parenthesis"/>
+    <sdef n="lquot"           c="Left quote"/>
+    <sdef n="rquot"           c="Right quote"/>
+
+    <sdef n="compound-only-L" c="May only be the left-side of a compound"/>
+    <sdef n="compound-R"      c="May be the right-side of a compound, or a full word"/>
+  </sdefs>
+
+  <pardefs>
+    <!-- Define paradigms within <pardef> here. -->
+    <pardef n="1_a_inan__n">
+      <e><p><l>а</l><r>а<s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ы</l><r>а<s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r>а<s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>у</l><r>а<s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ой</l><r>а<s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r>а<s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ы</l><r>а<s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l></l><r>а<s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ы</l><r>а<s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ы</l><r>а<s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r>а<s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r>а<s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:y_anim__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ы</l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:a_anim__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:y_inan__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ы</l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:i_plgen:none_inan__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>и</l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>и</l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:i_inan__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>и</l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>и</l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:i_inan_lock__n">
+      <e><p><l>ок</l><r>ок<s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ка</l><r>ок<s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ку</l><r>ок<s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ок</l><r>ок<s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ком</l><r>ок<s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ке</l><r>ок<s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ки</l><r>ок<s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ков</l><r>ок<s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>кам</l><r>ок<s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ки</l><r>ок<s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ками</l><r>ок<s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ках</l><r>ок<s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_none_plnom:a_inan__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ов</l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>а</l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_e_inan__n">
+      <e><p><l>е</l><r>е<s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>я</l><r>е<s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ю</l><r>е<s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>е</l><r>е<s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ем</l><r>е<s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r>е<s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>я</l><r>е<s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ей</l><r>е<s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ям</l><r>е<s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>я</l><r>е<s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ями</l><r>е<s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ях</l><r>е<s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="2_o_inan__n">
+      <e><p><l>о</l><r>о<s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>а</l><r>о<s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>у</l><r>о<s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>о</l><r>о<s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>ом</l><r>о<s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>е</l><r>о<s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>а</l><r>о<s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l></l><r>о<s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ам</l><r>о<s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>а</l><r>о<s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>ами</l><r>о<s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ах</l><r>о<s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="day__n">
+      <e><p><l>ень</l><r>ень<s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ня</l><r>ень<s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ню</l><r>ень<s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ень</l><r>ень<s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l>нем</l><r>ень<s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>не</l><r>ень<s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ни</l><r>ень<s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ней</l><r>ень<s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ням</l><r>ень<s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ни</l><r>ень<s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l>нями</l><r>ень<s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>нях</l><r>ень<s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="template__n">
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="acc"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="acc"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l></l><r><s n="n"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="o__adj">
+      <e><p><l>ой</l><r>ой<s n="adj"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ого</l><r>ой<s n="adj"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ому</l><r>ой<s n="adj"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ого</l><r>ой<s n="adj"/><s n="sg"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ой</l><r>ой<s n="adj"/><s n="sg"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>им</l><r>ой<s n="adj"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ом</l><r>ой<s n="adj"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ие</l><r>ой<s n="adj"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>их</l><r>ой<s n="adj"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>им</l><r>ой<s n="adj"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>их</l><r>ой<s n="adj"/><s n="pl"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ие</l><r>ой<s n="adj"/><s n="pl"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ими</l><r>ой<s n="adj"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>их</l><r>ой<s n="adj"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="y__adj">
+      <e><p><l>ый</l><r>ый<s n="adj"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ого</l><r>ый<s n="adj"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ому</l><r>ый<s n="adj"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ого</l><r>ый<s n="adj"/><s n="sg"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ый</l><r>ый<s n="adj"/><s n="sg"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ым</l><r>ый<s n="adj"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ом</l><r>ый<s n="adj"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ые</l><r>ый<s n="adj"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ых</l><r>ый<s n="adj"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ым</l><r>ый<s n="adj"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ых</l><r>ый<s n="adj"/><s n="pl"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ые</l><r>ый<s n="adj"/><s n="pl"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ыми</l><r>ый<s n="adj"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ых</l><r>ый<s n="adj"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="i__adj">
+      <e><p><l>ий</l><r>ий<s n="adj"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ьего</l><r>ий<s n="adj"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ьему</l><r>ий<s n="adj"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ьего</l><r>ий<s n="adj"/><s n="sg"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ий</l><r>ий<s n="adj"/><s n="sg"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ьим</l><r>ий<s n="adj"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ьим</l><r>ий<s n="adj"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ие</l><r>ий<s n="adj"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ьих</l><r>ий<s n="adj"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ьим</l><r>ий<s n="adj"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ьих</l><r>ий<s n="adj"/><s n="pl"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ие</l><r>ий<s n="adj"/><s n="pl"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ьими</l><r>ий<s n="adj"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ьих</l><r>ий<s n="adj"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="o__num">
+      <e><p><l>ой</l><r>ой<s n="num"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ого</l><r>ой<s n="num"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ому</l><r>ой<s n="num"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ого</l><r>ой<s n="num"/><s n="sg"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ой</l><r>ой<s n="num"/><s n="sg"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>им</l><r>ой<s n="num"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ом</l><r>ой<s n="num"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ие</l><r>ой<s n="num"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>их</l><r>ой<s n="num"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>им</l><r>ой<s n="num"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>их</l><r>ой<s n="num"/><s n="pl"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ие</l><r>ой<s n="num"/><s n="pl"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ими</l><r>ой<s n="num"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>их</l><r>ой<s n="num"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="y__num">
+      <e><p><l>ый</l><r>ый<s n="num"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ого</l><r>ый<s n="num"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ому</l><r>ый<s n="num"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ого</l><r>ый<s n="num"/><s n="sg"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ый</l><r>ый<s n="num"/><s n="sg"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ым</l><r>ый<s n="num"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ом</l><r>ый<s n="num"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ые</l><r>ый<s n="num"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ых</l><r>ый<s n="num"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ым</l><r>ый<s n="num"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ых</l><r>ый<s n="num"/><s n="pl"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ые</l><r>ый<s n="num"/><s n="pl"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ыми</l><r>ый<s n="num"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ых</l><r>ый<s n="num"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+    <pardef n="i__num">
+      <e><p><l>ий</l><r>ий<s n="num"/><s n="sg"/><s n="nom"/></r></p></e>
+      <e><p><l>ьего</l><r>ий<s n="num"/><s n="sg"/><s n="gen"/></r></p></e>
+      <e><p><l>ьему</l><r>ий<s n="num"/><s n="sg"/><s n="dat"/></r></p></e>
+      <e><p><l>ьего</l><r>ий<s n="num"/><s n="sg"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ий</l><r>ий<s n="num"/><s n="sg"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ьим</l><r>ий<s n="num"/><s n="sg"/><s n="ins"/></r></p></e>
+      <e><p><l>ьим</l><r>ий<s n="num"/><s n="sg"/><s n="loc"/></r></p></e>
+      <e><p><l>ие</l><r>ий<s n="num"/><s n="pl"/><s n="nom"/></r></p></e>
+      <e><p><l>ьих</l><r>ий<s n="num"/><s n="pl"/><s n="gen"/></r></p></e>
+      <e><p><l>ьим</l><r>ий<s n="num"/><s n="pl"/><s n="dat"/></r></p></e>
+      <e><p><l>ьих</l><r>ий<s n="num"/><s n="pl"/><s n="acc"/><s n="anim"/></r></p></e>
+      <e><p><l>ие</l><r>ий<s n="num"/><s n="pl"/><s n="acc"/><s n="inan"/></r></p></e>
+      <e><p><l>ьими</l><r>ий<s n="num"/><s n="pl"/><s n="ins"/></r></p></e>
+      <e><p><l>ьих</l><r>ий<s n="num"/><s n="pl"/><s n="loc"/></r></p></e>
+    </pardef>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <!-- Define entries within <e> here. -->
+    <e lm="остров"><i>остров</i><par n="2_none_plnom:a_inan__n"/></e>
+    <e lm="море"><i>мор</i><par n="2_e_inan__n"/></e>
+    <e lm="мертвец"><i>мертвец</i><par n="2_none_plnom:y_anim__n"/></e>
+    <e lm="сапог"><i>сапог</i><par n="2_none_plnom:i_plgen:none_inan__n"/></e>
+    <e lm="сундук"><i>сундук</i><par n="2_none_plnom:i_inan__n"/></e>
+    <e lm="пара"><i>пар</i><par n="1_a_inan__n"/></e>
+    <e lm="замок"><i>зам</i><par n="2_none_plnom:i_inan_lock__n"/></e>
+    <e lm="носок"><i>нос</i><par n="2_none_plnom:i_inan_lock__n"/></e>
+    <e lm="день"><i>д</i><par n="day__n"/></e>
+    <e lm="большой"><i>больш</i><par n="o__adj"/></e>
+    <e lm="новый"><i>нов</i><par n="y__adj"/></e>
+    <e lm="первый"><i>перв</i><par n="y__num"/></e>
+    <e lm="второй"><i>втор</i><par n="o__num"/></e>
+    <e lm="третий"><i>трет</i><par n="i__num"/></e>
+    <e lm="четвертый"><i>четверт</i><par n="y__num"/></e>
+    <e lm="пятый"><i>пят</i><par n="y__num"/></e>
+    <e lm="шестой"><i>шест</i><par n="o__num"/></e>
+    <e lm="седьмой"><i>седьм</i><par n="o__num"/></e>
+    <e lm="восьмой"><i>восьм</i><par n="o__num"/></e>
+    <e lm="девятый"><i>девят</i><par n="y__num"/></e>
+    <e lm="десятый"><i>десят</i><par n="y__num"/></e>
+  </section>
+
+  <section id="final" type="inconditional">
+    <e><re>[.\?;:!…¿¶]</re><p><l></l><r><s n="sent"/></r></p></e>
+    <e><re>,</re>          <p><l></l><r><s n="cm"/></r></p></e>
+  </section>
+
+</dictionary>
+
+<!--
+Resources:
+    http://wiki.apertium.org/wiki/Monodix_basics
+    http://wiki.apertium.org/wiki/Apertium_New_Language_Pair_HOWTO#Monolingual_dictionaries
+-->
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/eng-rus.autogen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/eng-rus.autogen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/eng-rus.autogen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/eng-rus.autogen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/eng-rus.autogen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus-eng.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus-eng.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus-eng.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus-eng.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus-eng.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/.deps/.d
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/AUTHORS
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/COPYING
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/COPYING	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/COPYING	(revision 70339)
@@ -0,0 +1,675 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/ChangeLog
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/INSTALL
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/INSTALL	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/INSTALL	(revision 70339)
@@ -0,0 +1,370 @@
+Installation Instructions
+*************************
+
+Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation,
+Inc.
+
+   Copying and distribution of this file, with or without modification,
+are permitted in any medium without royalty provided the copyright
+notice and this notice are preserved.  This file is offered as-is,
+without warranty of any kind.
+
+Basic Installation
+==================
+
+   Briefly, the shell command `./configure && make && make install'
+should configure, build, and install this package.  The following
+more-detailed instructions are generic; see the `README' file for
+instructions specific to this package.  Some packages provide this
+`INSTALL' file but do not implement all of the features documented
+below.  The lack of an optional feature in a given package is not
+necessarily a bug.  More recommendations for GNU packages can be found
+in *note Makefile Conventions: (standards)Makefile Conventions.
+
+   The `configure' shell script attempts to guess correct values for
+various system-dependent variables used during compilation.  It uses
+those values to create a `Makefile' in each directory of the package.
+It may also create one or more `.h' files containing system-dependent
+definitions.  Finally, it creates a shell script `config.status' that
+you can run in the future to recreate the current configuration, and a
+file `config.log' containing compiler output (useful mainly for
+debugging `configure').
+
+   It can also use an optional file (typically called `config.cache'
+and enabled with `--cache-file=config.cache' or simply `-C') that saves
+the results of its tests to speed up reconfiguring.  Caching is
+disabled by default to prevent problems with accidental use of stale
+cache files.
+
+   If you need to do unusual things to compile the package, please try
+to figure out how `configure' could check whether to do them, and mail
+diffs or instructions to the address given in the `README' so they can
+be considered for the next release.  If you are using the cache, and at
+some point `config.cache' contains results you don't want to keep, you
+may remove or edit it.
+
+   The file `configure.ac' (or `configure.in') is used to create
+`configure' by a program called `autoconf'.  You need `configure.ac' if
+you want to change it or regenerate `configure' using a newer version
+of `autoconf'.
+
+   The simplest way to compile this package is:
+
+  1. `cd' to the directory containing the package's source code and type
+     `./configure' to configure the package for your system.
+
+     Running `configure' might take a while.  While running, it prints
+     some messages telling which features it is checking for.
+
+  2. Type `make' to compile the package.
+
+  3. Optionally, type `make check' to run any self-tests that come with
+     the package, generally using the just-built uninstalled binaries.
+
+  4. Type `make install' to install the programs and any data files and
+     documentation.  When installing into a prefix owned by root, it is
+     recommended that the package be configured and built as a regular
+     user, and only the `make install' phase executed with root
+     privileges.
+
+  5. Optionally, type `make installcheck' to repeat any self-tests, but
+     this time using the binaries in their final installed location.
+     This target does not install anything.  Running this target as a
+     regular user, particularly if the prior `make install' required
+     root privileges, verifies that the installation completed
+     correctly.
+
+  6. You can remove the program binaries and object files from the
+     source code directory by typing `make clean'.  To also remove the
+     files that `configure' created (so you can compile the package for
+     a different kind of computer), type `make distclean'.  There is
+     also a `make maintainer-clean' target, but that is intended mainly
+     for the package's developers.  If you use it, you may have to get
+     all sorts of other programs in order to regenerate files that came
+     with the distribution.
+
+  7. Often, you can also type `make uninstall' to remove the installed
+     files again.  In practice, not all packages have tested that
+     uninstallation works correctly, even though it is required by the
+     GNU Coding Standards.
+
+  8. Some packages, particularly those that use Automake, provide `make
+     distcheck', which can by used by developers to test that all other
+     targets like `make install' and `make uninstall' work correctly.
+     This target is generally not run by end users.
+
+Compilers and Options
+=====================
+
+   Some systems require unusual options for compilation or linking that
+the `configure' script does not know about.  Run `./configure --help'
+for details on some of the pertinent environment variables.
+
+   You can give `configure' initial values for configuration parameters
+by setting variables in the command line or in the environment.  Here
+is an example:
+
+     ./configure CC=c99 CFLAGS=-g LIBS=-lposix
+
+   *Note Defining Variables::, for more details.
+
+Compiling For Multiple Architectures
+====================================
+
+   You can compile the package for more than one kind of computer at the
+same time, by placing the object files for each architecture in their
+own directory.  To do this, you can use GNU `make'.  `cd' to the
+directory where you want the object files and executables to go and run
+the `configure' script.  `configure' automatically checks for the
+source code in the directory that `configure' is in and in `..'.  This
+is known as a "VPATH" build.
+
+   With a non-GNU `make', it is safer to compile the package for one
+architecture at a time in the source code directory.  After you have
+installed the package for one architecture, use `make distclean' before
+reconfiguring for another architecture.
+
+   On MacOS X 10.5 and later systems, you can create libraries and
+executables that work on multiple system types--known as "fat" or
+"universal" binaries--by specifying multiple `-arch' options to the
+compiler but only a single `-arch' option to the preprocessor.  Like
+this:
+
+     ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \
+                 CPP="gcc -E" CXXCPP="g++ -E"
+
+   This is not guaranteed to produce working output in all cases, you
+may have to build one architecture at a time and combine the results
+using the `lipo' tool if you have problems.
+
+Installation Names
+==================
+
+   By default, `make install' installs the package's commands under
+`/usr/local/bin', include files under `/usr/local/include', etc.  You
+can specify an installation prefix other than `/usr/local' by giving
+`configure' the option `--prefix=PREFIX', where PREFIX must be an
+absolute file name.
+
+   You can specify separate installation prefixes for
+architecture-specific files and architecture-independent files.  If you
+pass the option `--exec-prefix=PREFIX' to `configure', the package uses
+PREFIX as the prefix for installing programs and libraries.
+Documentation and other data files still use the regular prefix.
+
+   In addition, if you use an unusual directory layout you can give
+options like `--bindir=DIR' to specify different values for particular
+kinds of files.  Run `configure --help' for a list of the directories
+you can set and what kinds of files go in them.  In general, the
+default for these options is expressed in terms of `${prefix}', so that
+specifying just `--prefix' will affect all of the other directory
+specifications that were not explicitly provided.
+
+   The most portable way to affect installation locations is to pass the
+correct locations to `configure'; however, many packages provide one or
+both of the following shortcuts of passing variable assignments to the
+`make install' command line to change installation locations without
+having to reconfigure or recompile.
+
+   The first method involves providing an override variable for each
+affected directory.  For example, `make install
+prefix=/alternate/directory' will choose an alternate location for all
+directory configuration variables that were expressed in terms of
+`${prefix}'.  Any directories that were specified during `configure',
+but not in terms of `${prefix}', must each be overridden at install
+time for the entire installation to be relocated.  The approach of
+makefile variable overrides for each directory variable is required by
+the GNU Coding Standards, and ideally causes no recompilation.
+However, some platforms have known limitations with the semantics of
+shared libraries that end up requiring recompilation when using this
+method, particularly noticeable in packages that use GNU Libtool.
+
+   The second method involves providing the `DESTDIR' variable.  For
+example, `make install DESTDIR=/alternate/directory' will prepend
+`/alternate/directory' before all installation names.  The approach of
+`DESTDIR' overrides is not required by the GNU Coding Standards, and
+does not work on platforms that have drive letters.  On the other hand,
+it does better at avoiding recompilation issues, and works well even
+when some directory options were not specified in terms of `${prefix}'
+at `configure' time.
+
+Optional Features
+=================
+
+   If the package supports it, you can cause programs to be installed
+with an extra prefix or suffix on their names by giving `configure' the
+option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'.
+
+   Some packages pay attention to `--enable-FEATURE' options to
+`configure', where FEATURE indicates an optional part of the package.
+They may also pay attention to `--with-PACKAGE' options, where PACKAGE
+is something like `gnu-as' or `x' (for the X Window System).  The
+`README' should mention any `--enable-' and `--with-' options that the
+package recognizes.
+
+   For packages that use the X Window System, `configure' can usually
+find the X include and library files automatically, but if it doesn't,
+you can use the `configure' options `--x-includes=DIR' and
+`--x-libraries=DIR' to specify their locations.
+
+   Some packages offer the ability to configure how verbose the
+execution of `make' will be.  For these packages, running `./configure
+--enable-silent-rules' sets the default to minimal output, which can be
+overridden with `make V=1'; while running `./configure
+--disable-silent-rules' sets the default to verbose, which can be
+overridden with `make V=0'.
+
+Particular systems
+==================
+
+   On HP-UX, the default C compiler is not ANSI C compatible.  If GNU
+CC is not installed, it is recommended to use the following options in
+order to use an ANSI C compiler:
+
+     ./configure CC="cc -Ae -D_XOPEN_SOURCE=500"
+
+and if that doesn't work, install pre-built binaries of GCC for HP-UX.
+
+   HP-UX `make' updates targets which have the same time stamps as
+their prerequisites, which makes it generally unusable when shipped
+generated files such as `configure' are involved.  Use GNU `make'
+instead.
+
+   On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot
+parse its `<wchar.h>' header file.  The option `-nodtk' can be used as
+a workaround.  If GNU CC is not installed, it is therefore recommended
+to try
+
+     ./configure CC="cc"
+
+and if that doesn't work, try
+
+     ./configure CC="cc -nodtk"
+
+   On Solaris, don't put `/usr/ucb' early in your `PATH'.  This
+directory contains several dysfunctional programs; working variants of
+these programs are available in `/usr/bin'.  So, if you need `/usr/ucb'
+in your `PATH', put it _after_ `/usr/bin'.
+
+   On Haiku, software installed for all users goes in `/boot/common',
+not `/usr/local'.  It is recommended to use the following options:
+
+     ./configure --prefix=/boot/common
+
+Specifying the System Type
+==========================
+
+   There may be some features `configure' cannot figure out
+automatically, but needs to determine by the type of machine the package
+will run on.  Usually, assuming the package is built to be run on the
+_same_ architectures, `configure' can figure that out, but if it prints
+a message saying it cannot guess the machine type, give it the
+`--build=TYPE' option.  TYPE can either be a short name for the system
+type, such as `sun4', or a canonical name which has the form:
+
+     CPU-COMPANY-SYSTEM
+
+where SYSTEM can have one of these forms:
+
+     OS
+     KERNEL-OS
+
+   See the file `config.sub' for the possible values of each field.  If
+`config.sub' isn't included in this package, then this package doesn't
+need to know the machine type.
+
+   If you are _building_ compiler tools for cross-compiling, you should
+use the option `--target=TYPE' to select the type of system they will
+produce code for.
+
+   If you want to _use_ a cross compiler, that generates code for a
+platform different from the build platform, you should specify the
+"host" platform (i.e., that on which the generated programs will
+eventually be run) with `--host=TYPE'.
+
+Sharing Defaults
+================
+
+   If you want to set default values for `configure' scripts to share,
+you can create a site shell script called `config.site' that gives
+default values for variables like `CC', `cache_file', and `prefix'.
+`configure' looks for `PREFIX/share/config.site' if it exists, then
+`PREFIX/etc/config.site' if it exists.  Or, you can set the
+`CONFIG_SITE' environment variable to the location of the site script.
+A warning: not all `configure' scripts look for a site script.
+
+Defining Variables
+==================
+
+   Variables not defined in a site shell script can be set in the
+environment passed to `configure'.  However, some packages may run
+configure again during the build, and the customized values of these
+variables may be lost.  In order to avoid this problem, you should set
+them in the `configure' command line, using `VAR=value'.  For example:
+
+     ./configure CC=/usr/local2/bin/gcc
+
+causes the specified `gcc' to be used as the C compiler (unless it is
+overridden in the site shell script).
+
+Unfortunately, this technique does not work for `CONFIG_SHELL' due to
+an Autoconf limitation.  Until the limitation is lifted, you can use
+this workaround:
+
+     CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash
+
+`configure' Invocation
+======================
+
+   `configure' recognizes the following options to control how it
+operates.
+
+`--help'
+`-h'
+     Print a summary of all of the options to `configure', and exit.
+
+`--help=short'
+`--help=recursive'
+     Print a summary of the options unique to this package's
+     `configure', and exit.  The `short' variant lists options used
+     only in the top level, while the `recursive' variant lists options
+     also present in any nested packages.
+
+`--version'
+`-V'
+     Print the version of Autoconf used to generate the `configure'
+     script, and exit.
+
+`--cache-file=FILE'
+     Enable the cache: use and save the results of the tests in FILE,
+     traditionally `config.cache'.  FILE defaults to `/dev/null' to
+     disable caching.
+
+`--config-cache'
+`-C'
+     Alias for `--cache-file=config.cache'.
+
+`--quiet'
+`--silent'
+`-q'
+     Do not print messages saying which checks are being made.  To
+     suppress all normal output, redirect it to `/dev/null' (any error
+     messages will still be shown).
+
+`--srcdir=DIR'
+     Look for the package's source code in directory DIR.  Usually
+     `configure' can determine that directory automatically.
+
+`--prefix=DIR'
+     Use DIR as the installation prefix.  *note Installation Names::
+     for more details, including other options available for fine-tuning
+     the installation locations.
+
+`--no-create'
+`-n'
+     Run the configure checks, but stop before creating any output
+     files.
+
+`configure' also accepts some other, not widely useful, options.  Run
+`configure --help' for more details.
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile	(revision 70339)
@@ -0,0 +1,752 @@
+# Makefile.in generated by automake 1.14.1 from Makefile.am.
+# Makefile.  Generated from Makefile.in by configure.
+
+# Copyright (C) 1994-2013 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+
+
+###############################################################################
+###############################################################################
+
+
+am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/apertium-{{languageCode1}}-{{languageCode2}}
+pkgincludedir = $(includedir)/apertium-{{languageCode1}}-{{languageCode2}}
+pkglibdir = $(libdir)/apertium-{{languageCode1}}-{{languageCode2}}
+pkglibexecdir = $(libexecdir)/apertium-{{languageCode1}}-{{languageCode2}}
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+subdir = .
+DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \
+	$(srcdir)/Makefile.in $(srcdir)/Makefile.am \
+	$(top_srcdir)/configure $(am__configure_deps) \
+	$(srcdir)/apertium-rus.pc.in COPYING install-sh missing
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES = apertium-rus.pc
+CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_$(V))
+am__v_P_ = $(am__v_P_$(AM_DEFAULT_VERBOSITY))
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_$(V))
+am__v_GEN_ = $(am__v_GEN_$(AM_DEFAULT_VERBOSITY))
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_$(V))
+am__v_at_ = $(am__v_at_$(AM_DEFAULT_VERBOSITY))
+am__v_at_0 = @
+am__v_at_1 = 
+SOURCES =
+DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(apertium_rusdir)" \
+	"$(DESTDIR)$(pkgconfigdir)"
+DATA = $(apertium_rus_DATA) $(noinst_DATA) $(pkgconfig_DATA)
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+DIST_TARGETS = dist-gzip
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing aclocal-1.14
+AMTAR = $${TAR-tar}
+AM_DEFAULT_VERBOSITY = 1
+APERTIUM_CFLAGS = -I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  
+APERTIUM_LIBS = -L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  
+AUTOCONF = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing autoconf
+AUTOHEADER = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing autoheader
+AUTOMAKE = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing automake-1.14
+AWK = gawk
+CGCOMP = /usr/bin/cg-comp
+CYGPATH_W = echo
+DEFS = -DPACKAGE_NAME=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\" -DPACKAGE_TARNAME=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE_VERSION=\"0.1.0\" -DPACKAGE_STRING=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\ 0.1.0\" -DPACKAGE_BUGREPORT=\"super-antispam@ya.ru\" -DPACKAGE_URL=\"http://wiki.apertium.org/wiki/Apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DVERSION=\"0.1.0\"
+ECHO_C = 
+ECHO_N = -n
+ECHO_T = 
+INSTALL = /usr/bin/install -c
+INSTALL_DATA = ${INSTALL} -m 644
+INSTALL_PROGRAM = ${INSTALL}
+INSTALL_SCRIPT = ${INSTALL}
+INSTALL_STRIP_PROGRAM = $(install_sh) -c -s
+LIBOBJS = 
+LIBS = 
+LN_S = ln -s
+LTLIBOBJS = 
+LTTOOLBOX_CFLAGS = -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  
+LTTOOLBOX_LIBS = -L/usr/local/lib -llttoolbox3 -lxml2  
+MAKEINFO = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing makeinfo
+MKDIR_P = /bin/mkdir -p
+PACKAGE = apertium-{{languageCode1}}-{{languageCode2}}
+PACKAGE_BUGREPORT = super-antispam@ya.ru
+PACKAGE_NAME = Apertium {{languageName1}}-{{languageName2}}
+PACKAGE_STRING = Apertium {{languageName1}}-{{languageName2}} 0.1.0
+PACKAGE_TARNAME = apertium-{{languageCode1}}-{{languageCode2}}
+PACKAGE_URL = http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}
+PACKAGE_VERSION = 0.1.0
+PATH_SEPARATOR = :
+PKG_CONFIG = /usr/bin/pkg-config
+PKG_CONFIG_LIBDIR = 
+PKG_CONFIG_PATH = /usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig
+SET_MAKE = 
+SHELL = /bin/bash
+STRIP = 
+VERSION = 0.1.0
+abs_builddir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus
+abs_srcdir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus
+abs_top_builddir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus
+abs_top_srcdir = /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus
+am__leading_dot = .
+am__tar = $${TAR-tar} chof - "$$tardir"
+am__untar = $${TAR-tar} xf -
+bindir = ${exec_prefix}/bin
+build_alias = 
+builddir = .
+datadir = ${datarootdir}
+datarootdir = ${prefix}/share
+docdir = ${datarootdir}/doc/${PACKAGE_TARNAME}
+dvidir = ${docdir}
+exec_prefix = ${prefix}
+host_alias = 
+htmldir = ${docdir}
+includedir = ${prefix}/include
+infodir = ${datarootdir}/info
+install_sh = ${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/install-sh
+libdir = ${exec_prefix}/lib
+libexecdir = ${exec_prefix}/libexec
+localedir = ${datarootdir}/locale
+localstatedir = ${prefix}/var
+mandir = ${datarootdir}/man
+mkdir_p = $(MKDIR_P)
+oldincludedir = /usr/include
+pdfdir = ${docdir}
+prefix = /usr/local
+program_transform_name = s,x,x,
+psdir = ${docdir}
+sbindir = ${exec_prefix}/sbin
+sharedstatedir = ${prefix}/com
+srcdir = .
+sysconfdir = ${prefix}/etc
+target_alias = 
+top_build_prefix = 
+top_builddir = .
+top_srcdir = .
+RELEASE = 0.1
+LANG1 = rus
+BASENAME = apertium-$(LANG1)
+TARGETS_COMMON = \
+	$(LANG1).automorf.bin		\
+	$(LANG1).automorf.att.gz	\
+	$(LANG1).autogen.bin		\
+	$(LANG1).autogen.att.gz		\
+	$(LANG1).autopgen.bin		\
+	$(LANG1).rlx.bin
+
+
+###############################################################################
+###############################################################################
+EXTRA_DIST = $(BASENAME).$(LANG1).dix		\
+		$(BASENAME).$(LANG1).acx	\
+		$(BASENAME).$(LANG1).rlx	\
+		$(BASENAME).post-$(LANG1).dix	\
+		$(LANG1).prob			\
+		modes.xml
+
+
+###############################################################################
+###############################################################################
+#
+#   apertium_rus_dir: This is where the compiled binaries go
+#   apertium_rus_srcdir: This is where the source files go
+apertium_rusdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_rus_srcdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_rus_DATA = $(TARGETS_COMMON) $(LANG1).prob
+pkgconfigdir = $(prefix)/share/pkgconfig
+pkgconfig_DATA = $(BASENAME).pc
+noinst_DATA = modes/$(LANG1)-morph.mode
+CLEANFILES = $(TARGETS_COMMON)
+all: all-am
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+apertium-rus.pc: $(top_builddir)/config.status $(srcdir)/apertium-rus.pc.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+install-apertium_rusDATA: $(apertium_rus_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(apertium_rus_DATA)'; test -n "$(apertium_rusdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(apertium_rusdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(apertium_rusdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(apertium_rusdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(apertium_rusdir)" || exit $$?; \
+	done
+
+uninstall-apertium_rusDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(apertium_rus_DATA)'; test -n "$(apertium_rusdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(apertium_rusdir)'; $(am__uninstall_files_from_dir)
+install-pkgconfigDATA: $(pkgconfig_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \
+	done
+
+uninstall-pkgconfigDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir)
+tags TAGS:
+
+ctags CTAGS:
+
+cscope cscopelist:
+
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__post_remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__post_remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__post_remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__post_remove_distdir)
+
+dist-tarZ: distdir
+	@echo WARNING: "Support for shar distribution archives is" \
+	               "deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__post_remove_distdir)
+
+dist-shar: distdir
+	@echo WARNING: "Support for distribution archives compressed with" \
+		       "legacy program 'compress' is deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__post_remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__post_remove_distdir)
+
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	    --srcdir=.. --prefix="$$dc_install_base" \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__post_remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-am
+all-am: Makefile $(DATA)
+installdirs:
+	for dir in "$(DESTDIR)$(apertium_rusdir)" "$(DESTDIR)$(pkgconfigdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+
+clean-generic:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am: install-apertium_rusDATA install-data-local \
+	install-pkgconfigDATA
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-apertium_rusDATA uninstall-pkgconfigDATA
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am am--refresh check check-am clean clean-generic \
+	clean-local cscopelist-am ctags-am dist dist-all dist-bzip2 \
+	dist-gzip dist-lzip dist-shar dist-tarZ dist-xz dist-zip \
+	distcheck distclean distclean-generic distcleancheck distdir \
+	distuninstallcheck dvi dvi-am html html-am info info-am \
+	install install-am install-apertium_rusDATA install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-pkgconfigDATA install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-generic pdf pdf-am ps ps-am tags-am uninstall \
+	uninstall-am uninstall-apertium_rusDATA \
+	uninstall-pkgconfigDATA
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then mv $$modes modes/; fi
+
+apertium_modesdir=$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml $(prefix)/share/apertium/$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d $(DESTDIR)$(apertium_modesdir) || mkdir $(DESTDIR)$(apertium_modesdir)
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then \
+			$(INSTALL_DATA) $$modes $(DESTDIR)$(apertium_modesdir); \
+			rm $$modes; \
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch $@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; 	if $(am__make_keepgoing); then 	  failcom='fail=yes'; 	else 	  failcom='exit 1'; 	fi; 	dot_seen=no; 	list='$(AP_SUBDIRS)'; 	for subdir in $$list; do 	  echo "Making $$subdir"; 	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) all-am) 	  || eval $$failcom; 	done; 	$(MAKE) $(AM_MAKEFLAGS) all-am || exit 1; 	test -z "$$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/$*.autobil.att > .deps/$*.autobil.hfst
+	hfst-project -p upper .deps/$*.autobil.hfst > .deps/$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/$*.autobil.upper -2 .deps/$*.any-nonplus.hfst -o .deps/$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/$*.single-plus.hfst -2 .deps/$*.autobil.nonplussed -o .deps/$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/$*.autobil.postplus -o .deps/$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/$*.autobil.nonplussed -2 .deps/$*.autobil.postplus.0,3 -o $@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+
+###############################################################################
+###############################################################################
+
+$(LANG1).autogen.bin: $(BASENAME).$(LANG1).dix .deps/.d
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).automorf.bin: $(BASENAME).$(LANG1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).autogen.att.gz: $(LANG1).autogen.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).automorf.att.gz: $(LANG1).automorf.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).autopgen.bin: $(BASENAME).post-$(LANG1).dix
+	lt-comp lr $< $@
+
+###############################################################################
+###############################################################################
+
+$(LANG1).rlx.bin: $(BASENAME).$(LANG1).rlx $(CGCOMP)
+	$(CGCOMP) $< $@
+
+# Modes are not installed since they're all just "debug modes". All
+# modes are created by this goal.
+modes/$(LANG1)-morph.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+
+install-data-local:
+	test -d $(DESTDIR)$(apertium_rus_srcdir) || mkdir -p $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).dix $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).rlx $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).post-$(LANG1).dix $(DESTDIR)$(apertium_rus_srcdir)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+###############################################################################
+
+test: all
+	echo "TODO test sentence" | apertium -d . rus-morph | tee .test-mt
+	@echo "TODO test analysis results" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile.am	(revision 70339)
@@ -0,0 +1,101 @@
+###############################################################################
+## Makefile for apertium-rus
+###############################################################################
+
+RELEASE=0.1
+VERSION=0.1.0
+LANG1=rus
+BASENAME=apertium-$(LANG1)
+
+TARGETS_COMMON =			\
+	$(LANG1).automorf.bin		\
+	$(LANG1).automorf.att.gz	\
+	$(LANG1).autogen.bin		\
+	$(LANG1).autogen.att.gz		\
+	$(LANG1).autopgen.bin		\
+	$(LANG1).rlx.bin
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+@ap_include@
+
+###############################################################################
+## Russian transducer
+###############################################################################
+
+$(LANG1).autogen.bin: $(BASENAME).$(LANG1).dix .deps/.d
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).automorf.bin: $(BASENAME).$(LANG1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).autogen.att.gz: $(LANG1).autogen.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).automorf.att.gz: $(LANG1).automorf.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).autopgen.bin: $(BASENAME).post-$(LANG1).dix
+	lt-comp lr $< $@
+
+###############################################################################
+## Disambiguation rules
+###############################################################################
+
+$(LANG1).rlx.bin: $(BASENAME).$(LANG1).rlx $(CGCOMP)
+	$(CGCOMP) $< $@
+
+###############################################################################
+## Distribution
+###############################################################################
+EXTRA_DIST=$(BASENAME).$(LANG1).dix		\
+		$(BASENAME).$(LANG1).acx	\
+		$(BASENAME).$(LANG1).rlx	\
+		$(BASENAME).post-$(LANG1).dix	\
+		$(LANG1).prob			\
+		modes.xml
+
+###############################################################################
+## Installation stuff
+###############################################################################
+#
+#   apertium_rus_dir: This is where the compiled binaries go
+#   apertium_rus_srcdir: This is where the source files go
+
+apertium_rusdir=$(prefix)/share/apertium/$(BASENAME)/
+apertium_rus_srcdir=$(prefix)/share/apertium/$(BASENAME)/
+
+apertium_rus_DATA=$(TARGETS_COMMON) $(LANG1).prob
+
+pkgconfigdir = $(prefix)/share/pkgconfig
+pkgconfig_DATA = $(BASENAME).pc
+
+# Modes are not installed since they're all just "debug modes". All
+# modes are created by this goal.
+modes/$(LANG1)-morph.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+
+noinst_DATA=modes/$(LANG1)-morph.mode
+
+install-data-local:
+	test -d $(DESTDIR)$(apertium_rus_srcdir) || mkdir -p $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).dix $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).rlx $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).post-$(LANG1).dix $(DESTDIR)$(apertium_rus_srcdir)
+
+CLEANFILES = $(TARGETS_COMMON)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+## Test
+###############################################################################
+
+test: all
+	echo "TODO test sentence" | apertium -d . rus-morph | tee .test-mt
+	@echo "TODO test analysis results" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/Makefile.in	(revision 70339)
@@ -0,0 +1,711 @@
+# Makefile.in generated by automake 1.14.1 from Makefile.am.
+# @configure_input@
+
+# Copyright (C) 1994-2013 Free Software Foundation, Inc.
+
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+@SET_MAKE@
+
+###############################################################################
+###############################################################################
+
+VPATH = @srcdir@
+am__is_gnu_make = test -n '$(MAKEFILE_LIST)' && test -n '$(MAKELEVEL)'
+am__make_running_with_option = \
+  case $${target_option-} in \
+      ?) ;; \
+      *) echo "am__make_running_with_option: internal error: invalid" \
+              "target option '$${target_option-}' specified" >&2; \
+         exit 1;; \
+  esac; \
+  has_opt=no; \
+  sane_makeflags=$$MAKEFLAGS; \
+  if $(am__is_gnu_make); then \
+    sane_makeflags=$$MFLAGS; \
+  else \
+    case $$MAKEFLAGS in \
+      *\\[\ \	]*) \
+        bs=\\; \
+        sane_makeflags=`printf '%s\n' "$$MAKEFLAGS" \
+          | sed "s/$$bs$$bs[$$bs $$bs	]*//g"`;; \
+    esac; \
+  fi; \
+  skip_next=no; \
+  strip_trailopt () \
+  { \
+    flg=`printf '%s\n' "$$flg" | sed "s/$$1.*$$//"`; \
+  }; \
+  for flg in $$sane_makeflags; do \
+    test $$skip_next = yes && { skip_next=no; continue; }; \
+    case $$flg in \
+      *=*|--*) continue;; \
+        -*I) strip_trailopt 'I'; skip_next=yes;; \
+      -*I?*) strip_trailopt 'I';; \
+        -*O) strip_trailopt 'O'; skip_next=yes;; \
+      -*O?*) strip_trailopt 'O';; \
+        -*l) strip_trailopt 'l'; skip_next=yes;; \
+      -*l?*) strip_trailopt 'l';; \
+      -[dEDm]) skip_next=yes;; \
+      -[JT]) skip_next=yes;; \
+    esac; \
+    case $$flg in \
+      *$$target_option*) has_opt=yes; break;; \
+    esac; \
+  done; \
+  test $$has_opt = yes
+am__make_dryrun = (target_option=n; $(am__make_running_with_option))
+am__make_keepgoing = (target_option=k; $(am__make_running_with_option))
+pkgdatadir = $(datadir)/@PACKAGE@
+pkgincludedir = $(includedir)/@PACKAGE@
+pkglibdir = $(libdir)/@PACKAGE@
+pkglibexecdir = $(libexecdir)/@PACKAGE@
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+subdir = .
+DIST_COMMON = INSTALL NEWS README AUTHORS ChangeLog \
+	$(srcdir)/Makefile.in $(srcdir)/Makefile.am \
+	$(top_srcdir)/configure $(am__configure_deps) \
+	$(srcdir)/apertium-rus.pc.in COPYING install-sh missing
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+am__CONFIG_DISTCLEAN_FILES = config.status config.cache config.log \
+ configure.lineno config.status.lineno
+mkinstalldirs = $(install_sh) -d
+CONFIG_CLEAN_FILES = apertium-rus.pc
+CONFIG_CLEAN_VPATH_FILES =
+AM_V_P = $(am__v_P_@AM_V@)
+am__v_P_ = $(am__v_P_@AM_DEFAULT_V@)
+am__v_P_0 = false
+am__v_P_1 = :
+AM_V_GEN = $(am__v_GEN_@AM_V@)
+am__v_GEN_ = $(am__v_GEN_@AM_DEFAULT_V@)
+am__v_GEN_0 = @echo "  GEN     " $@;
+am__v_GEN_1 = 
+AM_V_at = $(am__v_at_@AM_V@)
+am__v_at_ = $(am__v_at_@AM_DEFAULT_V@)
+am__v_at_0 = @
+am__v_at_1 = 
+SOURCES =
+DIST_SOURCES =
+am__can_run_installinfo = \
+  case $$AM_UPDATE_INFO_DIR in \
+    n|no|NO) false;; \
+    *) (install-info --version) >/dev/null 2>&1;; \
+  esac
+am__vpath_adj_setup = srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`;
+am__vpath_adj = case $$p in \
+    $(srcdir)/*) f=`echo "$$p" | sed "s|^$$srcdirstrip/||"`;; \
+    *) f=$$p;; \
+  esac;
+am__strip_dir = f=`echo $$p | sed -e 's|^.*/||'`;
+am__install_max = 40
+am__nobase_strip_setup = \
+  srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*|]/\\\\&/g'`
+am__nobase_strip = \
+  for p in $$list; do echo "$$p"; done | sed -e "s|$$srcdirstrip/||"
+am__nobase_list = $(am__nobase_strip_setup); \
+  for p in $$list; do echo "$$p $$p"; done | \
+  sed "s| $$srcdirstrip/| |;"' / .*\//!s/ .*/ ./; s,\( .*\)/[^/]*$$,\1,' | \
+  $(AWK) 'BEGIN { files["."] = "" } { files[$$2] = files[$$2] " " $$1; \
+    if (++n[$$2] == $(am__install_max)) \
+      { print $$2, files[$$2]; n[$$2] = 0; files[$$2] = "" } } \
+    END { for (dir in files) print dir, files[dir] }'
+am__base_list = \
+  sed '$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;$$!N;s/\n/ /g' | \
+  sed '$$!N;$$!N;$$!N;$$!N;s/\n/ /g'
+am__uninstall_files_from_dir = { \
+  test -z "$$files" \
+    || { test ! -d "$$dir" && test ! -f "$$dir" && test ! -r "$$dir"; } \
+    || { echo " ( cd '$$dir' && rm -f" $$files ")"; \
+         $(am__cd) "$$dir" && rm -f $$files; }; \
+  }
+am__installdirs = "$(DESTDIR)$(apertium_rusdir)" \
+	"$(DESTDIR)$(pkgconfigdir)"
+DATA = $(apertium_rus_DATA) $(noinst_DATA) $(pkgconfig_DATA)
+am__tagged_files = $(HEADERS) $(SOURCES) $(TAGS_FILES) $(LISP)
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+distdir = $(PACKAGE)-$(VERSION)
+top_distdir = $(distdir)
+am__remove_distdir = \
+  if test -d "$(distdir)"; then \
+    find "$(distdir)" -type d ! -perm -200 -exec chmod u+w {} ';' \
+      && rm -rf "$(distdir)" \
+      || { sleep 5 && rm -rf "$(distdir)"; }; \
+  else :; fi
+am__post_remove_distdir = $(am__remove_distdir)
+DIST_ARCHIVES = $(distdir).tar.gz
+GZIP_ENV = --best
+DIST_TARGETS = dist-gzip
+distuninstallcheck_listfiles = find . -type f -print
+am__distuninstallcheck_listfiles = $(distuninstallcheck_listfiles) \
+  | sed 's|^\./|$(prefix)/|' | grep -v '$(infodir)/dir$$'
+distcleancheck_listfiles = find . -type f -print
+ACLOCAL = @ACLOCAL@
+AMTAR = @AMTAR@
+AM_DEFAULT_VERBOSITY = @AM_DEFAULT_VERBOSITY@
+APERTIUM_CFLAGS = @APERTIUM_CFLAGS@
+APERTIUM_LIBS = @APERTIUM_LIBS@
+AUTOCONF = @AUTOCONF@
+AUTOHEADER = @AUTOHEADER@
+AUTOMAKE = @AUTOMAKE@
+AWK = @AWK@
+CGCOMP = @CGCOMP@
+CYGPATH_W = @CYGPATH_W@
+DEFS = @DEFS@
+ECHO_C = @ECHO_C@
+ECHO_N = @ECHO_N@
+ECHO_T = @ECHO_T@
+INSTALL = @INSTALL@
+INSTALL_DATA = @INSTALL_DATA@
+INSTALL_PROGRAM = @INSTALL_PROGRAM@
+INSTALL_SCRIPT = @INSTALL_SCRIPT@
+INSTALL_STRIP_PROGRAM = @INSTALL_STRIP_PROGRAM@
+LIBOBJS = @LIBOBJS@
+LIBS = @LIBS@
+LN_S = @LN_S@
+LTLIBOBJS = @LTLIBOBJS@
+LTTOOLBOX_CFLAGS = @LTTOOLBOX_CFLAGS@
+LTTOOLBOX_LIBS = @LTTOOLBOX_LIBS@
+MAKEINFO = @MAKEINFO@
+MKDIR_P = @MKDIR_P@
+PACKAGE = @PACKAGE@
+PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@
+PACKAGE_NAME = @PACKAGE_NAME@
+PACKAGE_STRING = @PACKAGE_STRING@
+PACKAGE_TARNAME = @PACKAGE_TARNAME@
+PACKAGE_URL = @PACKAGE_URL@
+PACKAGE_VERSION = @PACKAGE_VERSION@
+PATH_SEPARATOR = @PATH_SEPARATOR@
+PKG_CONFIG = @PKG_CONFIG@
+PKG_CONFIG_LIBDIR = @PKG_CONFIG_LIBDIR@
+PKG_CONFIG_PATH = @PKG_CONFIG_PATH@
+SET_MAKE = @SET_MAKE@
+SHELL = @SHELL@
+STRIP = @STRIP@
+VERSION = 0.1.0
+abs_builddir = @abs_builddir@
+abs_srcdir = @abs_srcdir@
+abs_top_builddir = @abs_top_builddir@
+abs_top_srcdir = @abs_top_srcdir@
+am__leading_dot = @am__leading_dot@
+am__tar = @am__tar@
+am__untar = @am__untar@
+bindir = @bindir@
+build_alias = @build_alias@
+builddir = @builddir@
+datadir = @datadir@
+datarootdir = @datarootdir@
+docdir = @docdir@
+dvidir = @dvidir@
+exec_prefix = @exec_prefix@
+host_alias = @host_alias@
+htmldir = @htmldir@
+includedir = @includedir@
+infodir = @infodir@
+install_sh = @install_sh@
+libdir = @libdir@
+libexecdir = @libexecdir@
+localedir = @localedir@
+localstatedir = @localstatedir@
+mandir = @mandir@
+mkdir_p = @mkdir_p@
+oldincludedir = @oldincludedir@
+pdfdir = @pdfdir@
+prefix = @prefix@
+program_transform_name = @program_transform_name@
+psdir = @psdir@
+sbindir = @sbindir@
+sharedstatedir = @sharedstatedir@
+srcdir = @srcdir@
+sysconfdir = @sysconfdir@
+target_alias = @target_alias@
+top_build_prefix = @top_build_prefix@
+top_builddir = @top_builddir@
+top_srcdir = @top_srcdir@
+RELEASE = 0.1
+LANG1 = rus
+BASENAME = apertium-$(LANG1)
+TARGETS_COMMON = \
+	$(LANG1).automorf.bin		\
+	$(LANG1).automorf.att.gz	\
+	$(LANG1).autogen.bin		\
+	$(LANG1).autogen.att.gz		\
+	$(LANG1).autopgen.bin		\
+	$(LANG1).rlx.bin
+
+
+###############################################################################
+###############################################################################
+EXTRA_DIST = $(BASENAME).$(LANG1).dix		\
+		$(BASENAME).$(LANG1).acx	\
+		$(BASENAME).$(LANG1).rlx	\
+		$(BASENAME).post-$(LANG1).dix	\
+		$(LANG1).prob			\
+		modes.xml
+
+
+###############################################################################
+###############################################################################
+#
+#   apertium_rus_dir: This is where the compiled binaries go
+#   apertium_rus_srcdir: This is where the source files go
+apertium_rusdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_rus_srcdir = $(prefix)/share/apertium/$(BASENAME)/
+apertium_rus_DATA = $(TARGETS_COMMON) $(LANG1).prob
+pkgconfigdir = $(prefix)/share/pkgconfig
+pkgconfig_DATA = $(BASENAME).pc
+noinst_DATA = modes/$(LANG1)-morph.mode
+CLEANFILES = $(TARGETS_COMMON)
+all: all-am
+
+.SUFFIXES:
+am--refresh: Makefile
+	@:
+$(srcdir)/Makefile.in:  $(srcdir)/Makefile.am  $(am__configure_deps)
+	@for dep in $?; do \
+	  case '$(am__configure_deps)' in \
+	    *$$dep*) \
+	      echo ' cd $(srcdir) && $(AUTOMAKE) --gnu'; \
+	      $(am__cd) $(srcdir) && $(AUTOMAKE) --gnu \
+		&& exit 0; \
+	      exit 1;; \
+	  esac; \
+	done; \
+	echo ' cd $(top_srcdir) && $(AUTOMAKE) --gnu Makefile'; \
+	$(am__cd) $(top_srcdir) && \
+	  $(AUTOMAKE) --gnu Makefile
+.PRECIOUS: Makefile
+Makefile: $(srcdir)/Makefile.in $(top_builddir)/config.status
+	@case '$?' in \
+	  *config.status*) \
+	    echo ' $(SHELL) ./config.status'; \
+	    $(SHELL) ./config.status;; \
+	  *) \
+	    echo ' cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe)'; \
+	    cd $(top_builddir) && $(SHELL) ./config.status $@ $(am__depfiles_maybe);; \
+	esac;
+
+$(top_builddir)/config.status: $(top_srcdir)/configure $(CONFIG_STATUS_DEPENDENCIES)
+	$(SHELL) ./config.status --recheck
+
+$(top_srcdir)/configure:  $(am__configure_deps)
+	$(am__cd) $(srcdir) && $(AUTOCONF)
+$(ACLOCAL_M4):  $(am__aclocal_m4_deps)
+	$(am__cd) $(srcdir) && $(ACLOCAL) $(ACLOCAL_AMFLAGS)
+$(am__aclocal_m4_deps):
+apertium-rus.pc: $(top_builddir)/config.status $(srcdir)/apertium-rus.pc.in
+	cd $(top_builddir) && $(SHELL) ./config.status $@
+install-apertium_rusDATA: $(apertium_rus_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(apertium_rus_DATA)'; test -n "$(apertium_rusdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(apertium_rusdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(apertium_rusdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(apertium_rusdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(apertium_rusdir)" || exit $$?; \
+	done
+
+uninstall-apertium_rusDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(apertium_rus_DATA)'; test -n "$(apertium_rusdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(apertium_rusdir)'; $(am__uninstall_files_from_dir)
+install-pkgconfigDATA: $(pkgconfig_DATA)
+	@$(NORMAL_INSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	if test -n "$$list"; then \
+	  echo " $(MKDIR_P) '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(MKDIR_P) "$(DESTDIR)$(pkgconfigdir)" || exit 1; \
+	fi; \
+	for p in $$list; do \
+	  if test -f "$$p"; then d=; else d="$(srcdir)/"; fi; \
+	  echo "$$d$$p"; \
+	done | $(am__base_list) | \
+	while read files; do \
+	  echo " $(INSTALL_DATA) $$files '$(DESTDIR)$(pkgconfigdir)'"; \
+	  $(INSTALL_DATA) $$files "$(DESTDIR)$(pkgconfigdir)" || exit $$?; \
+	done
+
+uninstall-pkgconfigDATA:
+	@$(NORMAL_UNINSTALL)
+	@list='$(pkgconfig_DATA)'; test -n "$(pkgconfigdir)" || list=; \
+	files=`for p in $$list; do echo $$p; done | sed -e 's|^.*/||'`; \
+	dir='$(DESTDIR)$(pkgconfigdir)'; $(am__uninstall_files_from_dir)
+tags TAGS:
+
+ctags CTAGS:
+
+cscope cscopelist:
+
+
+distdir: $(DISTFILES)
+	$(am__remove_distdir)
+	test -d "$(distdir)" || mkdir "$(distdir)"
+	@srcdirstrip=`echo "$(srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's/[].[^$$\\*]/\\\\&/g'`; \
+	list='$(DISTFILES)'; \
+	  dist_files=`for file in $$list; do echo $$file; done | \
+	  sed -e "s|^$$srcdirstrip/||;t" \
+	      -e "s|^$$topsrcdirstrip/|$(top_builddir)/|;t"`; \
+	case $$dist_files in \
+	  */*) $(MKDIR_P) `echo "$$dist_files" | \
+			   sed '/\//!d;s|^|$(distdir)/|;s,/[^/]*$$,,' | \
+			   sort -u` ;; \
+	esac; \
+	for file in $$dist_files; do \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  if test -d $$d/$$file; then \
+	    dir=`echo "/$$file" | sed -e 's,/[^/]*$$,,'`; \
+	    if test -d "$(distdir)/$$file"; then \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -fpR $(srcdir)/$$file "$(distdir)$$dir" || exit 1; \
+	      find "$(distdir)/$$file" -type d ! -perm -700 -exec chmod u+rwx {} \;; \
+	    fi; \
+	    cp -fpR $$d/$$file "$(distdir)$$dir" || exit 1; \
+	  else \
+	    test -f "$(distdir)/$$file" \
+	    || cp -p $$d/$$file "$(distdir)/$$file" \
+	    || exit 1; \
+	  fi; \
+	done
+	-test -n "$(am__skip_mode_fix)" \
+	|| find "$(distdir)" -type d ! -perm -755 \
+		-exec chmod u+rwx,go+rx {} \; -o \
+	  ! -type d ! -perm -444 -links 1 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -400 -exec chmod a+r {} \; -o \
+	  ! -type d ! -perm -444 -exec $(install_sh) -c -m a+r {} {} \; \
+	|| chmod -R a+r "$(distdir)"
+dist-gzip: distdir
+	tardir=$(distdir) && $(am__tar) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).tar.gz
+	$(am__post_remove_distdir)
+
+dist-bzip2: distdir
+	tardir=$(distdir) && $(am__tar) | BZIP2=$${BZIP2--9} bzip2 -c >$(distdir).tar.bz2
+	$(am__post_remove_distdir)
+
+dist-lzip: distdir
+	tardir=$(distdir) && $(am__tar) | lzip -c $${LZIP_OPT--9} >$(distdir).tar.lz
+	$(am__post_remove_distdir)
+
+dist-xz: distdir
+	tardir=$(distdir) && $(am__tar) | XZ_OPT=$${XZ_OPT--e} xz -c >$(distdir).tar.xz
+	$(am__post_remove_distdir)
+
+dist-tarZ: distdir
+	@echo WARNING: "Support for shar distribution archives is" \
+	               "deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	tardir=$(distdir) && $(am__tar) | compress -c >$(distdir).tar.Z
+	$(am__post_remove_distdir)
+
+dist-shar: distdir
+	@echo WARNING: "Support for distribution archives compressed with" \
+		       "legacy program 'compress' is deprecated." >&2
+	@echo WARNING: "It will be removed altogether in Automake 2.0" >&2
+	shar $(distdir) | GZIP=$(GZIP_ENV) gzip -c >$(distdir).shar.gz
+	$(am__post_remove_distdir)
+
+dist-zip: distdir
+	-rm -f $(distdir).zip
+	zip -rq $(distdir).zip $(distdir)
+	$(am__post_remove_distdir)
+
+dist dist-all:
+	$(MAKE) $(AM_MAKEFLAGS) $(DIST_TARGETS) am__post_remove_distdir='@:'
+	$(am__post_remove_distdir)
+
+# This target untars the dist file and tries a VPATH configuration.  Then
+# it guarantees that the distribution is self-contained by making another
+# tarfile.
+distcheck: dist
+	case '$(DIST_ARCHIVES)' in \
+	*.tar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).tar.gz | $(am__untar) ;;\
+	*.tar.bz2*) \
+	  bzip2 -dc $(distdir).tar.bz2 | $(am__untar) ;;\
+	*.tar.lz*) \
+	  lzip -dc $(distdir).tar.lz | $(am__untar) ;;\
+	*.tar.xz*) \
+	  xz -dc $(distdir).tar.xz | $(am__untar) ;;\
+	*.tar.Z*) \
+	  uncompress -c $(distdir).tar.Z | $(am__untar) ;;\
+	*.shar.gz*) \
+	  GZIP=$(GZIP_ENV) gzip -dc $(distdir).shar.gz | unshar ;;\
+	*.zip*) \
+	  unzip $(distdir).zip ;;\
+	esac
+	chmod -R a-w $(distdir)
+	chmod u+w $(distdir)
+	mkdir $(distdir)/_build $(distdir)/_inst
+	chmod a-w $(distdir)
+	test -d $(distdir)/_build || exit 0; \
+	dc_install_base=`$(am__cd) $(distdir)/_inst && pwd | sed -e 's,^[^:\\/]:[\\/],/,'` \
+	  && dc_destdir="$${TMPDIR-/tmp}/am-dc-$$$$/" \
+	  && am__cwd=`pwd` \
+	  && $(am__cd) $(distdir)/_build \
+	  && ../configure \
+	    $(AM_DISTCHECK_CONFIGURE_FLAGS) \
+	    $(DISTCHECK_CONFIGURE_FLAGS) \
+	    --srcdir=.. --prefix="$$dc_install_base" \
+	  && $(MAKE) $(AM_MAKEFLAGS) \
+	  && $(MAKE) $(AM_MAKEFLAGS) dvi \
+	  && $(MAKE) $(AM_MAKEFLAGS) check \
+	  && $(MAKE) $(AM_MAKEFLAGS) install \
+	  && $(MAKE) $(AM_MAKEFLAGS) installcheck \
+	  && $(MAKE) $(AM_MAKEFLAGS) uninstall \
+	  && $(MAKE) $(AM_MAKEFLAGS) distuninstallcheck_dir="$$dc_install_base" \
+	        distuninstallcheck \
+	  && chmod -R a-w "$$dc_install_base" \
+	  && ({ \
+	       (cd ../.. && umask 077 && mkdir "$$dc_destdir") \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" install \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" uninstall \
+	       && $(MAKE) $(AM_MAKEFLAGS) DESTDIR="$$dc_destdir" \
+	            distuninstallcheck_dir="$$dc_destdir" distuninstallcheck; \
+	      } || { rm -rf "$$dc_destdir"; exit 1; }) \
+	  && rm -rf "$$dc_destdir" \
+	  && $(MAKE) $(AM_MAKEFLAGS) dist \
+	  && rm -rf $(DIST_ARCHIVES) \
+	  && $(MAKE) $(AM_MAKEFLAGS) distcleancheck \
+	  && cd "$$am__cwd" \
+	  || exit 1
+	$(am__post_remove_distdir)
+	@(echo "$(distdir) archives ready for distribution: "; \
+	  list='$(DIST_ARCHIVES)'; for i in $$list; do echo $$i; done) | \
+	  sed -e 1h -e 1s/./=/g -e 1p -e 1x -e '$$p' -e '$$x'
+distuninstallcheck:
+	@test -n '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: trying to run $@ with an empty' \
+	       '$$(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	$(am__cd) '$(distuninstallcheck_dir)' || { \
+	  echo 'ERROR: cannot chdir into $(distuninstallcheck_dir)' >&2; \
+	  exit 1; \
+	}; \
+	test `$(am__distuninstallcheck_listfiles) | wc -l` -eq 0 \
+	   || { echo "ERROR: files left after uninstall:" ; \
+	        if test -n "$(DESTDIR)"; then \
+	          echo "  (check DESTDIR support)"; \
+	        fi ; \
+	        $(distuninstallcheck_listfiles) ; \
+	        exit 1; } >&2
+distcleancheck: distclean
+	@if test '$(srcdir)' = . ; then \
+	  echo "ERROR: distcleancheck can only run from a VPATH build" ; \
+	  exit 1 ; \
+	fi
+	@test `$(distcleancheck_listfiles) | wc -l` -eq 0 \
+	  || { echo "ERROR: files left in build directory after distclean:" ; \
+	       $(distcleancheck_listfiles) ; \
+	       exit 1; } >&2
+check-am: all-am
+check: check-am
+all-am: Makefile $(DATA)
+installdirs:
+	for dir in "$(DESTDIR)$(apertium_rusdir)" "$(DESTDIR)$(pkgconfigdir)"; do \
+	  test -z "$$dir" || $(MKDIR_P) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	if test -z '$(STRIP)'; then \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	      install; \
+	else \
+	  $(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	    install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	    "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'" install; \
+	fi
+mostlyclean-generic:
+
+clean-generic:
+	-test -z "$(CLEANFILES)" || rm -f $(CLEANFILES)
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+	-test . = "$(srcdir)" || test -z "$(CONFIG_CLEAN_VPATH_FILES)" || rm -f $(CONFIG_CLEAN_VPATH_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-generic clean-local mostlyclean-am
+
+distclean: distclean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -f Makefile
+distclean-am: clean-am distclean-generic
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+html-am:
+
+info: info-am
+
+info-am:
+
+install-data-am: install-apertium_rusDATA install-data-local \
+	install-pkgconfigDATA
+
+install-dvi: install-dvi-am
+
+install-dvi-am:
+
+install-exec-am:
+
+install-html: install-html-am
+
+install-html-am:
+
+install-info: install-info-am
+
+install-info-am:
+
+install-man:
+
+install-pdf: install-pdf-am
+
+install-pdf-am:
+
+install-ps: install-ps-am
+
+install-ps-am:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -f $(am__CONFIG_DISTCLEAN_FILES)
+	-rm -rf $(top_srcdir)/autom4te.cache
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-generic
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-apertium_rusDATA uninstall-pkgconfigDATA
+
+.MAKE: install-am install-strip
+
+.PHONY: all all-am am--refresh check check-am clean clean-generic \
+	clean-local cscopelist-am ctags-am dist dist-all dist-bzip2 \
+	dist-gzip dist-lzip dist-shar dist-tarZ dist-xz dist-zip \
+	distcheck distclean distclean-generic distcleancheck distdir \
+	distuninstallcheck dvi dvi-am html html-am info info-am \
+	install install-am install-apertium_rusDATA install-data \
+	install-data-am install-data-local install-dvi install-dvi-am \
+	install-exec install-exec-am install-html install-html-am \
+	install-info install-info-am install-man install-pdf \
+	install-pdf-am install-pkgconfigDATA install-ps install-ps-am \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-generic pdf pdf-am ps ps-am tags-am uninstall \
+	uninstall-am uninstall-apertium_rusDATA \
+	uninstall-pkgconfigDATA
+
+
+# This include defines goals for install-modes, .deps/.d, autobil.prefixes and .mode files:
+@ap_include@
+
+###############################################################################
+###############################################################################
+
+$(LANG1).autogen.bin: $(BASENAME).$(LANG1).dix .deps/.d
+	apertium-validate-dictionary $<
+	lt-comp rl $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).automorf.bin: $(BASENAME).$(LANG1).dix
+	apertium-validate-dictionary $<
+	lt-comp lr $< $@ $(BASENAME).$(LANG1).acx
+
+$(LANG1).autogen.att.gz: $(LANG1).autogen.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).automorf.att.gz: $(LANG1).automorf.bin
+	lt-print $< | gzip -9 -c -n > $@
+
+$(LANG1).autopgen.bin: $(BASENAME).post-$(LANG1).dix
+	lt-comp lr $< $@
+
+###############################################################################
+###############################################################################
+
+$(LANG1).rlx.bin: $(BASENAME).$(LANG1).rlx $(CGCOMP)
+	$(CGCOMP) $< $@
+
+# Modes are not installed since they're all just "debug modes". All
+# modes are created by this goal.
+modes/$(LANG1)-morph.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+
+install-data-local:
+	test -d $(DESTDIR)$(apertium_rus_srcdir) || mkdir -p $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).dix $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).$(LANG1).rlx $(DESTDIR)$(apertium_rus_srcdir)
+	$(INSTALL_DATA) $(BASENAME).post-$(LANG1).dix $(DESTDIR)$(apertium_rus_srcdir)
+clean-local:
+	-rm -rf .deps modes
+
+###############################################################################
+###############################################################################
+
+test: all
+	echo "TODO test sentence" | apertium -d . rus-morph | tee .test-mt
+	@echo "TODO test analysis results" > .test-ref
+	@diff .test-ref .test-mt
+	@rm .test-ref .test-mt
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/NEWS
===================================================================
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/README
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/README	(revision 70339)
@@ -0,0 +1,84 @@
+Russian
+
+                            apertium-rus
+===============================================================================
+
+This is an Apertium monolingual language package for Russian. What
+you can use this language package for:
+
+* Morphological analysis of Russian
+* Morphological generation of Russian
+* Part-of-speech tagging of Russian
+
+Requirements
+===============================================================================
+
+You will need the following software installed:
+
+* lttoolbox (>= 3.3.0)
+* apertium (>= 3.3.0)
+* vislcg3 (>= 0.9.9.10297)
+
+If this does not make any sense, we recommend you look at: www.apertium.org
+
+Compiling
+===============================================================================
+
+Given the requirements being installed, you should be able to just run:
+
+$ ./configure
+$ make
+
+You can use ./autogen.sh instead of ./configure if you're compiling
+from SVN.
+
+If you're doing development, you don't have to install the data, you
+can use it directly from this directory.
+
+If you are installing this language package as a prerequisite for an
+Apertium translation pair, then do (typically as root / with sudo):
+
+# make install
+
+You can give a --prefix to ./configure to install as a non-root user,
+but make sure to use the same prefix when installing the translation
+pair and any other language packages.
+
+Testing
+===============================================================================
+
+If you are in the source directory after running make, the following
+commands should work:
+
+$  echo "TODO: test sentence" | apertium -d . rus-morph
+TODO: test analysis result
+
+$ echo "TODO: test sentence" | apertium -d . rus-tagger
+TODO: test tagger result
+
+Files and data
+===============================================================================
+
+* apertium-rus.rus.dix            - Monolingual dictionary
+* rus.prob                        - Tagger model
+* apertium-rus.rus.rlx            - Constraint Grammar disambiguation rules
+* apertium-rus.post-rus.dix       - Post-generator
+* modes.xml                       - Translation modes
+
+For more information
+===============================================================================
+
+* http://wiki.apertium.org/wiki/Installation
+* http://wiki.apertium.org/wiki/apertium-rus
+* http://wiki.apertium.org/wiki/Using_an_lttoolbox_dictionary
+
+Help and support
+===============================================================================
+
+If you need help using this language pair or data, you can contact:
+
+* Mailing list: apertium-stuff@lists.sourceforge.net
+* IRC: #apertium on irc.freenode.net
+
+See also the file AUTHORS included in this distribution.
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/aclocal.m4
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/aclocal.m4	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/aclocal.m4	(revision 70339)
@@ -0,0 +1,1053 @@
+# generated automatically by aclocal 1.14.1 -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+m4_ifndef([AC_CONFIG_MACRO_DIRS], [m4_defun([_AM_CONFIG_MACRO_DIRS], [])m4_defun([AC_CONFIG_MACRO_DIRS], [_AM_CONFIG_MACRO_DIRS($@)])])
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+m4_if(m4_defn([AC_AUTOCONF_VERSION]), [2.69],,
+[m4_warning([this file was generated for autoconf 2.69.
+You have another version of autoconf.  It may work, but is not guaranteed to.
+If you have problems, you may need to regenerate the build system entirely.
+To do so, use the procedure documented by the package, typically 'autoreconf'.])])
+
+# pkg.m4 - Macros to locate and utilise pkg-config.            -*- Autoconf -*-
+# serial 1 (pkg-config-0.24)
+# 
+# Copyright © 2004 Scott James Remnant <scott@netsplit.com>.
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+# PKG_PROG_PKG_CONFIG([MIN-VERSION])
+# ----------------------------------
+AC_DEFUN([PKG_PROG_PKG_CONFIG],
+[m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility])
+AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path])
+AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path])
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	AC_PATH_TOOL([PKG_CONFIG], [pkg-config])
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=m4_default([$1], [0.9.0])
+	AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version])
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		AC_MSG_RESULT([yes])
+	else
+		AC_MSG_RESULT([no])
+		PKG_CONFIG=""
+	fi
+fi[]dnl
+])# PKG_PROG_PKG_CONFIG
+
+# PKG_CHECK_EXISTS(MODULES, [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND])
+#
+# Check to see whether a particular set of modules exists.  Similar
+# to PKG_CHECK_MODULES(), but does not set variables or print errors.
+#
+# Please remember that m4 expands AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+# only at the first occurence in configure.ac, so if the first place
+# it's called might be skipped (such as if it is within an "if", you
+# have to call PKG_CHECK_EXISTS manually
+# --------------------------------------------------------------
+AC_DEFUN([PKG_CHECK_EXISTS],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+if test -n "$PKG_CONFIG" && \
+    AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then
+  m4_default([$2], [:])
+m4_ifvaln([$3], [else
+  $3])dnl
+fi])
+
+# _PKG_CONFIG([VARIABLE], [COMMAND], [MODULES])
+# ---------------------------------------------
+m4_define([_PKG_CONFIG],
+[if test -n "$$1"; then
+    pkg_cv_[]$1="$$1"
+ elif test -n "$PKG_CONFIG"; then
+    PKG_CHECK_EXISTS([$3],
+                     [pkg_cv_[]$1=`$PKG_CONFIG --[]$2 "$3" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ],
+		     [pkg_failed=yes])
+ else
+    pkg_failed=untried
+fi[]dnl
+])# _PKG_CONFIG
+
+# _PKG_SHORT_ERRORS_SUPPORTED
+# -----------------------------
+AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi[]dnl
+])# _PKG_SHORT_ERRORS_SUPPORTED
+
+
+# PKG_CHECK_MODULES(VARIABLE-PREFIX, MODULES, [ACTION-IF-FOUND],
+# [ACTION-IF-NOT-FOUND])
+#
+#
+# Note that if there is a possibility the first call to
+# PKG_CHECK_MODULES might not happen, you should be sure to include an
+# explicit call to PKG_PROG_PKG_CONFIG in your configure.ac
+#
+#
+# --------------------------------------------------------------
+AC_DEFUN([PKG_CHECK_MODULES],
+[AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl
+AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl
+
+pkg_failed=no
+AC_MSG_CHECKING([for $1])
+
+_PKG_CONFIG([$1][_CFLAGS], [cflags], [$2])
+_PKG_CONFIG([$1][_LIBS], [libs], [$2])
+
+m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS
+and $1[]_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.])
+
+if test $pkg_failed = yes; then
+   	AC_MSG_RESULT([no])
+        _PKG_SHORT_ERRORS_SUPPORTED
+        if test $_pkg_short_errors_supported = yes; then
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1`
+        else 
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD
+
+	m4_default([$4], [AC_MSG_ERROR(
+[Package requirements ($2) were not met:
+
+$$1_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+_PKG_TEXT])[]dnl
+        ])
+elif test $pkg_failed = untried; then
+     	AC_MSG_RESULT([no])
+	m4_default([$4], [AC_MSG_FAILURE(
+[The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+_PKG_TEXT
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.])[]dnl
+        ])
+else
+	$1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS
+	$1[]_LIBS=$pkg_cv_[]$1[]_LIBS
+        AC_MSG_RESULT([yes])
+	$3
+fi[]dnl
+])# PKG_CHECK_MODULES
+
+# apertium.m4 - Macros to locate and utilise apertium libraries -*- Autoconf -*-
+# serial 1 (apertium-3.4.2)
+#
+# Copyright (C) 2013--2016 Universitat d'Alacant / Universidad de Alicante
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+
+# AP_CHECK_LING([ID], [MONOLINGUAL_PACKAGE])
+#
+# Check to see whether MONOLINGUAL_PACKAGE exists, and if so sets
+# AP_LIB[ID] and AP_SRC[ID].
+#
+# As an example, AP_CHECK_LING([1], [apertium-fie]) would check that
+# apertium-fie exists, and set AP_LIB1 and AP_SRC1 to the paths
+# containing the binaries and sources respectively of that monolingual
+# language package.
+#
+# Also sets up options --with-lang[ID] (e.g. --with-lang1) if the user
+# wants to use the source code checkout instead of installed files.
+# ------------------------------------------
+AC_DEFUN([AP_CHECK_LING],
+[
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+
+
+# AP_MKINCLUDE()
+#
+# Creates the file ap_include.am and sets the variable ap_include to
+# point to this path. Now in your Makefile.am you can include
+# ap_include.am by writing @ap_include@ on a line by itself.
+#
+# The file defines a pattern rule for making modes files, and a goal
+# for installing the ones that have install="yes" in modes.xml. To
+# generate modes, include a line like
+#
+#     noinst_DATA=modes/$(PREFIX1).mode
+#
+# in your Makefile.am with _at most one mode_ (the others will be
+# created even if you list only one, listing several will lead to
+# trouble with parallell make).
+# 
+# Install the modes by making install-data-local dependent on
+# install-modes, ie.
+#
+#     install-data-local: install-modes
+#
+# Also defined is a goal for making the .deps folder. If you want some
+# file to be built in a folder named .deps, just make that goal
+# dependent on .deps/.d, e.g.
+#
+#     .deps/intermediate.dix: original.dix .deps/.d
+# 
+# ------------------------------------------
+AC_DEFUN([AP_MKINCLUDE],
+[
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
+
+# Copyright (C) 2002-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_AUTOMAKE_VERSION(VERSION)
+# ----------------------------
+# Automake X.Y traces this macro to ensure aclocal.m4 has been
+# generated from the m4 files accompanying Automake X.Y.
+# (This private macro should not be called outside this file.)
+AC_DEFUN([AM_AUTOMAKE_VERSION],
+[am__api_version='1.14'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.14.1], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+
+# _AM_AUTOCONF_VERSION(VERSION)
+# -----------------------------
+# aclocal traces this macro to find the Autoconf version.
+# This is a private macro too.  Using m4_define simplifies
+# the logic in aclocal, which can simply ignore this definition.
+m4_define([_AM_AUTOCONF_VERSION], [])
+
+# AM_SET_CURRENT_AUTOMAKE_VERSION
+# -------------------------------
+# Call AM_AUTOMAKE_VERSION and AM_AUTOMAKE_VERSION so they can be traced.
+# This function is AC_REQUIREd by AM_INIT_AUTOMAKE.
+AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION],
+[AM_AUTOMAKE_VERSION([1.14.1])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+
+# AM_AUX_DIR_EXPAND                                         -*- Autoconf -*-
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# For projects using AC_CONFIG_AUX_DIR([foo]), Autoconf sets
+# $ac_aux_dir to '$srcdir/foo'.  In other projects, it is set to
+# '$srcdir', '$srcdir/..', or '$srcdir/../..'.
+#
+# Of course, Automake must honor this variable whenever it calls a
+# tool from the auxiliary directory.  The problem is that $srcdir (and
+# therefore $ac_aux_dir as well) can be either absolute or relative,
+# depending on how configure is run.  This is pretty annoying, since
+# it makes $ac_aux_dir quite unusable in subdirectories: in the top
+# source directory, any form will work fine, but in subdirectories a
+# relative path needs to be adjusted first.
+#
+# $ac_aux_dir/missing
+#    fails when called from a subdirectory if $ac_aux_dir is relative
+# $top_srcdir/$ac_aux_dir/missing
+#    fails if $ac_aux_dir is absolute,
+#    fails when called from a subdirectory in a VPATH build with
+#          a relative $ac_aux_dir
+#
+# The reason of the latter failure is that $top_srcdir and $ac_aux_dir
+# are both prefixed by $srcdir.  In an in-source build this is usually
+# harmless because $srcdir is '.', but things will broke when you
+# start a VPATH build or use an absolute $srcdir.
+#
+# So we could use something similar to $top_srcdir/$ac_aux_dir/missing,
+# iff we strip the leading $srcdir from $ac_aux_dir.  That would be:
+#   am_aux_dir='\$(top_srcdir)/'`expr "$ac_aux_dir" : "$srcdir//*\(.*\)"`
+# and then we would define $MISSING as
+#   MISSING="\${SHELL} $am_aux_dir/missing"
+# This will work as long as MISSING is not called from configure, because
+# unfortunately $(top_srcdir) has no meaning in configure.
+# However there are other variables, like CC, which are often used in
+# configure, and could therefore not use this "fixed" $ac_aux_dir.
+#
+# Another solution, used here, is to always expand $ac_aux_dir to an
+# absolute PATH.  The drawback is that using absolute paths prevent a
+# configured tree to be moved without reconfiguration.
+
+AC_DEFUN([AM_AUX_DIR_EXPAND],
+[dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+
+# Do all the work for Automake.                             -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This macro actually does too much.  Some checks are only needed if
+# your package does certain things.  But this isn't really a big deal.
+
+dnl Redefine AC_PROG_CC to automatically invoke _AM_PROG_CC_C_O.
+m4_define([AC_PROG_CC],
+m4_defn([AC_PROG_CC])
+[_AM_PROG_CC_C_O
+])
+
+# AM_INIT_AUTOMAKE(PACKAGE, VERSION, [NO-DEFINE])
+# AM_INIT_AUTOMAKE([OPTIONS])
+# -----------------------------------------------
+# The call with PACKAGE and VERSION arguments is the old style
+# call (pre autoconf-2.50), which is being phased out.  PACKAGE
+# and VERSION should now be passed to AC_INIT and removed from
+# the call to AM_INIT_AUTOMAKE.
+# We support both call styles for the transition.  After
+# the next Automake release, Autoconf can make the AC_INIT
+# arguments mandatory, and then we can depend on a new Autoconf
+# release and drop the old call support.
+AC_DEFUN([AM_INIT_AUTOMAKE],
+[AC_PREREQ([2.65])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[AC_DIAGNOSE([obsolete],
+             [$0: two- and three-arguments forms are deprecated.])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+AC_REQUIRE([AM_SILENT_RULES])dnl
+dnl The testsuite driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This
+dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])
+  fi
+fi])
+
+dnl Hook into '_AC_COMPILER_EXEEXT' early to learn its expansion.  Do not
+dnl add the conditional right here, as _AC_COMPILER_EXEEXT may be further
+dnl mangled by Autoconf and run in a shell conditional statement.
+m4_define([_AC_COMPILER_EXEEXT],
+m4_defn([_AC_COMPILER_EXEEXT])[m4_provide([_AM_COMPILER_EXEEXT])])
+
+# When config.status generates a header, we must update the stamp-h file.
+# This file resides in the same directory as the config header
+# that is generated.  The stamp files are numbered to have different names.
+
+# Autoconf calls _AC_AM_CONFIG_HEADER_HOOK (when defined) in the
+# loop where config.status creates the headers, so we can generate
+# our stamp files there.
+AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK],
+[# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_PROG_INSTALL_SH
+# ------------------
+# Define $install_sh.
+AC_DEFUN([AM_PROG_INSTALL_SH],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST([install_sh])])
+
+# Copyright (C) 2003-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# Check whether the underlying file-system supports filenames
+# with a leading dot.  For instance MS-DOS doesn't.
+AC_DEFUN([AM_SET_LEADING_DOT],
+[rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+
+# Fake the existence of programs that GNU maintainers use.  -*- Autoconf -*-
+
+# Copyright (C) 1997-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_MISSING_PROG(NAME, PROGRAM)
+# ------------------------------
+AC_DEFUN([AM_MISSING_PROG],
+[AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+
+# AM_MISSING_HAS_RUN
+# ------------------
+# Define MISSING if not defined so far and test if it is modern enough.
+# If it is, set am_missing_run to use it, otherwise, to nothing.
+AC_DEFUN([AM_MISSING_HAS_RUN],
+[AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  AC_MSG_WARN(['missing' script is too old or missing])
+fi
+])
+
+# Helper functions for option handling.                     -*- Autoconf -*-
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_MANGLE_OPTION(NAME)
+# -----------------------
+AC_DEFUN([_AM_MANGLE_OPTION],
+[[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+
+# _AM_SET_OPTION(NAME)
+# --------------------
+# Set option NAME.  Presently that only means defining a flag for this option.
+AC_DEFUN([_AM_SET_OPTION],
+[m4_define(_AM_MANGLE_OPTION([$1]), [1])])
+
+# _AM_SET_OPTIONS(OPTIONS)
+# ------------------------
+# OPTIONS is a space-separated list of Automake options.
+AC_DEFUN([_AM_SET_OPTIONS],
+[m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+
+# _AM_IF_OPTION(OPTION, IF-SET, [IF-NOT-SET])
+# -------------------------------------------
+# Execute IF-SET if OPTION is set, IF-NOT-SET otherwise.
+AC_DEFUN([_AM_IF_OPTION],
+[m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+
+# Check to make sure that the build environment is sane.    -*- Autoconf -*-
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_SANITY_CHECK
+# ---------------
+AC_DEFUN([AM_SANITY_CHECK],
+[AC_MSG_CHECKING([whether build environment is sane])
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
+
+# Copyright (C) 2009-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_SILENT_RULES([DEFAULT])
+# --------------------------
+# Enable less verbose build rules; with the default set to DEFAULT
+# ("yes" being less verbose, "no" or empty being verbose).
+AC_DEFUN([AM_SILENT_RULES],
+[AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+esac
+dnl
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
+dnl do not support nested variable expansions.
+dnl See automake bug#9928 and bug#10237.
+am_make=${MAKE-make}
+AC_CACHE_CHECK([whether $am_make supports nested variables],
+   [am_cv_make_support_nested_variables],
+   [if AS_ECHO([['TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi])
+if test $am_cv_make_support_nested_variables = yes; then
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
+  AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AC_SUBST([AM_V])dnl
+AM_SUBST_NOTMAKE([AM_V])dnl
+AC_SUBST([AM_DEFAULT_V])dnl
+AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl
+AC_SUBST([AM_DEFAULT_VERBOSITY])dnl
+AM_BACKSLASH='\'
+AC_SUBST([AM_BACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
+])
+
+# Copyright (C) 2001-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# AM_PROG_INSTALL_STRIP
+# ---------------------
+# One issue with vendor 'install' (even GNU) is that you can't
+# specify the program used to strip binaries.  This is especially
+# annoying in cross-compiling environments, where the build's strip
+# is unlikely to handle the host's binaries.
+# Fortunately install-sh will honor a STRIPPROG variable, so we
+# always use install-sh in "make install-strip", and initialize
+# STRIPPROG with the value of the STRIP variable (set by the user).
+AC_DEFUN([AM_PROG_INSTALL_STRIP],
+[AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+
+# Copyright (C) 2006-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_SUBST_NOTMAKE(VARIABLE)
+# ---------------------------
+# Prevent Automake from outputting VARIABLE = @VARIABLE@ in Makefile.in.
+# This macro is traced by Automake.
+AC_DEFUN([_AM_SUBST_NOTMAKE])
+
+# AM_SUBST_NOTMAKE(VARIABLE)
+# --------------------------
+# Public sister of _AM_SUBST_NOTMAKE.
+AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+
+# Check how to create a tarball.                            -*- Autoconf -*-
+
+# Copyright (C) 2004-2013 Free Software Foundation, Inc.
+#
+# This file is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# _AM_PROG_TAR(FORMAT)
+# --------------------
+# Check how to create a tarball in format FORMAT.
+# FORMAT should be one of 'v7', 'ustar', or 'pax'.
+#
+# Substitute a variable $(am__tar) that is a command
+# writing to stdout a FORMAT-tarball containing the directory
+# $tardir.
+#     tardir=directory && $(am__tar) > result.tar
+#
+# Substitute a variable $(am__untar) that extract such
+# a tarball read from stdin.
+#     $(am__untar) < result.tar
+#
+AC_DEFUN([_AM_PROG_TAR],
+[# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+
+m4_if([$1], [v7],
+  [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+
+  [m4_case([$1],
+    [ustar],
+     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.
+      # There is notably a 21 bits limit for the UID and the GID.  In fact,
+      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343
+      # and bug#13588).
+      am_max_uid=2097151 # 2^21 - 1
+      am_max_gid=$am_max_uid
+      # The $UID and $GID variables are not portable, so we need to resort
+      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls
+      # below are definitely unexpected, so allow the users to see them
+      # (that is, avoid stderr redirection).
+      am_uid=`id -u || echo unknown`
+      am_gid=`id -g || echo unknown`
+      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])
+      if test $am_uid -le $am_max_uid; then
+         AC_MSG_RESULT([yes])
+      else
+         AC_MSG_RESULT([no])
+         _am_tools=none
+      fi
+      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])
+      if test $am_gid -le $am_max_gid; then
+         AC_MSG_RESULT([yes])
+      else
+        AC_MSG_RESULT([no])
+        _am_tools=none
+      fi],
+
+  [pax],
+    [],
+
+  [m4_fatal([Unknown tar format])])
+
+  AC_MSG_CHECKING([how to create a $1 tar archive])
+
+  # Go ahead even if we have the value already cached.  We do so because we
+  # need to set the values for the 'am__tar' and 'am__untar' variables.
+  _am_tools=${am_cv_prog_tar_$1-$_am_tools}
+
+  for _am_tool in $_am_tools; do
+    case $_am_tool in
+    gnutar)
+      for _am_tar in tar gnutar gtar; do
+        AM_RUN_LOG([$_am_tar --version]) && break
+      done
+      am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+      am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+      am__untar="$_am_tar -xf -"
+      ;;
+    plaintar)
+      # Must skip GNU tar: if it does not support --format= it doesn't create
+      # ustar tarball either.
+      (tar --version) >/dev/null 2>&1 && continue
+      am__tar='tar chf - "$$tardir"'
+      am__tar_='tar chf - "$tardir"'
+      am__untar='tar xf -'
+      ;;
+    pax)
+      am__tar='pax -L -x $1 -w "$$tardir"'
+      am__tar_='pax -L -x $1 -w "$tardir"'
+      am__untar='pax -r'
+      ;;
+    cpio)
+      am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+      am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+      am__untar='cpio -i -H $1 -d'
+      ;;
+    none)
+      am__tar=false
+      am__tar_=false
+      am__untar=false
+      ;;
+    esac
+
+    # If the value was cached, stop now.  We just wanted to have am__tar
+    # and am__untar set.
+    test -n "${am_cv_prog_tar_$1}" && break
+
+    # tar/untar a dummy directory, and stop if the command works.
+    rm -rf conftest.dir
+    mkdir conftest.dir
+    echo GrepMe > conftest.dir/file
+    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+    rm -rf conftest.dir
+    if test -s conftest.tar; then
+      AM_RUN_LOG([$am__untar <conftest.tar])
+      AM_RUN_LOG([cat conftest.dir/file])
+      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+    fi
+  done
+  rm -rf conftest.dir
+
+  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+  AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+]) # _AM_PROG_TAR
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/ap_include.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/ap_include.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/ap_include.am	(revision 70339)
@@ -0,0 +1,42 @@
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then mv $$modes modes/; fi
+
+apertium_modesdir=$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml $(prefix)/share/apertium/$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d $(DESTDIR)$(apertium_modesdir) || mkdir $(DESTDIR)$(apertium_modesdir)
+	modes=`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'`; \
+		if test -n "$$modes"; then \
+			$(INSTALL_DATA) $$modes $(DESTDIR)$(apertium_modesdir); \
+			rm $$modes; \
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch $@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; 	if $(am__make_keepgoing); then 	  failcom='fail=yes'; 	else 	  failcom='exit 1'; 	fi; 	dot_seen=no; 	list='$(AP_SUBDIRS)'; 	for subdir in $$list; do 	  echo "Making $$subdir"; 	  ($(am__cd) $$subdir && $(MAKE) $(AM_MAKEFLAGS) all-am) 	  || eval $$failcom; 	done; 	$(MAKE) $(AM_MAKEFLAGS) all-am || exit 1; 	test -z "$$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/$*.autobil.att > .deps/$*.autobil.hfst
+	hfst-project -p upper .deps/$*.autobil.hfst > .deps/$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/$*.autobil.upper -2 .deps/$*.any-nonplus.hfst -o .deps/$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/$*.single-plus.hfst -2 .deps/$*.autobil.nonplussed -o .deps/$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/$*.autobil.postplus -o .deps/$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/$*.autobil.nonplussed -2 .deps/$*.autobil.postplus.0,3 -o $@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.pc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.pc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.pc	(revision 70339)
@@ -0,0 +1,8 @@
+prefix=/usr/local
+exec_prefix=${prefix}
+srcdir=${prefix}/share/apertium/apertium-rus
+
+Name: apertium-rus
+Description: Finite-state morphological transducer and constraint grammar for Russian 
+Version: 0.1.0
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.pc.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.pc.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.pc.in	(revision 70339)
@@ -0,0 +1,8 @@
+prefix=@prefix@
+exec_prefix=${prefix}
+srcdir=@datarootdir@/apertium/apertium-rus
+
+Name: apertium-rus
+Description: Finite-state morphological transducer and constraint grammar for Russian 
+Version: @VERSION@
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.post-rus.dix
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.post-rus.dix	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.post-rus.dix	(revision 70339)
@@ -0,0 +1,40 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<dictionary>
+  <alphabet/>
+
+  <sdefs>
+    <sdef n="n" c="Noun"/>
+  </sdefs>
+
+  <pardefs>
+    <pardef n="vocals">
+      <e>
+        <i>a</i>
+      </e>
+      <e>
+        <i>e</i>
+      </e>
+      <e>
+        <i>i</i>
+      </e>
+      <e>
+        <i>o</i>
+      </e>
+      <e>
+        <i>u</i>
+      </e>
+    </pardef>
+  </pardefs>
+
+  <section id="main" type="standard">
+    <!-- Define entries within <e> here. See http://wiki.apertium.org/wiki/Post-generator for more information.-->
+    <e>
+      <p>
+        <l><a/>a<b/></l>
+        <r>an<b/></r>
+      </p>
+      <par n="vocals"/>
+    </e>
+  </section>
+</dictionary>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.acx
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.acx	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.acx	(revision 70339)
@@ -0,0 +1,5 @@
+<?xml version="1.0"?>
+<analysis-chars>
+  <!-- Describe equivalent characters in monodices here. See http://wiki.apertium.org/wiki/Acx for more information. -->
+</analysis-chars>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.rlx
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.rlx	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.rlx	(revision 70339)
@@ -0,0 +1,20 @@
+# Firstly, we need to define what tags should be considered sentence delimiters. For this example, only full stop is set as delimiter.
+DELIMITERS = "<.>" ;
+
+# We can define sets for common tag clusters
+LIST Case = (n s) (n p) ; # A set that matches either a Noun Singular or a Noun Plural
+
+SECTION
+# If there is a singular noun to the right, I cannot be a verb or noun.
+REMOVE (n) OR (v) IF (1 (n s)) ;
+
+# If there is a conjunction followed by a certain cohort of the same CASE as me, choose me.
+SELECT $$Case IF (1 (cnjcoo) LINK 1C $$Case) ;
+
+# Resources:
+# http://visl.sdu.dk/cg3.html
+# http://groups.google.com/group/constraint-grammar
+# http://kevindonnelly.org.uk/2010/05/constraint-grammar-tutorial/
+# http://wiki.apertium.org/wiki/Constraint_Grammar
+# http://wiki.apertium.org/wiki/Apertium_and_Constraint_Grammar
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autogen.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autogen.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autogen.sh	(revision 70339)
@@ -0,0 +1,36 @@
+#! /bin/sh
+
+# If the user specified a --prefix, take that, otherwise /usr/local/
+# is the default.
+PREFIX=/usr/local
+prefixnext=false
+for i in "$@"; do
+    case $i in
+        --prefix=*)		# equals separated:
+	    PREFIX="${i#*=}"
+	    ;;
+        --prefix)		# space separated:
+	    prefixnext=true
+	    ;;
+        *)
+	    $prefixnext && PREFIX="$i" && prefixnext=false
+	    ;;
+    esac
+done
+
+# Set the paths needed by libtool/pkg-config/aclocal etc. By inferring
+# them based on --prefix , users don't have to edit ~/.bashrc. We only
+# append, so if a user has some other preference, that will override.
+PATH="${PATH}:/usr/local/bin"
+export PATH
+LD_LIBRARY_PATH="${LD_LIBRARY_PATH}:${PREFIX}/lib"
+export LD_LIBRARY_PATH
+PKG_CONFIG_PATH="${PKG_CONFIG_PATH}:${PREFIX}/share/pkgconfig:${PREFIX}/lib/pkgconfig"
+export PKG_CONFIG_PATH
+ACLOCAL_PATH="${ACLOCAL_PATH}:${PREFIX}/share/aclocal"
+export ACLOCAL_PATH
+
+
+# Pass on all args to configure
+autoreconf -fi && ./configure "$@"
+

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autogen.sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/output.0
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/output.0	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/output.0	(revision 70339)
@@ -0,0 +1,4043 @@
+@%:@! /bin/sh
+@%:@ Guess values for system-dependent variables and create Makefiles.
+@%:@ Generated by GNU Autoconf 2.69 for Apertium {{languageName1}}-{{languageName2}} 0.1.0.
+@%:@
+@%:@ Report bugs to <super-antispam@ya.ru>.
+@%:@ 
+@%:@ 
+@%:@ Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+@%:@ 
+@%:@ 
+@%:@ This configure script is free software; the Free Software Foundation
+@%:@ gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+  
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+  
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in @%:@(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIB@&t@OBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+
+ac_subst_vars='LTLIBOBJS
+LIB@&t@OBJS
+CGCOMP
+LTTOOLBOX_LIBS
+LTTOOLBOX_CFLAGS
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+LTTOOLBOX_CFLAGS
+LTTOOLBOX_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium {{languageName1}}-{{languageName2}} 0.1.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          @<:@@S|@ac_default_prefix@:>@
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          @<:@PREFIX@:>@
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          @<:@DATAROOTDIR/doc/apertium-{{languageCode1}}-{{languageCode2}}@:>@
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium {{languageName1}}-{{languageName2}} 0.1.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH 
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR 
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS 
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS 
+              linker flags for APERTIUM, overriding pkg-config
+  LTTOOLBOX_CFLAGS 
+              C compiler flags for LTTOOLBOX, overriding pkg-config
+  LTTOOLBOX_LIBS 
+              linker flags for LTTOOLBOX, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium {{languageName1}}-{{languageName2}} configure 0.1.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in @%:@((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in @%:@((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+@%:@ Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules; 
+fi
+
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+ VERSION='0.1.0'
+
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE "$PACKAGE"
+_ACEOF
+
+ 
+cat >>confdefs.h <<_ACEOF
+@%:@define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for LTTOOLBOX" >&5
+$as_echo_n "checking for LTTOOLBOX... " >&6; }
+
+if test -n "$LTTOOLBOX_CFLAGS"; then
+    pkg_cv_LTTOOLBOX_CFLAGS="$LTTOOLBOX_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_CFLAGS=`$PKG_CONFIG --cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$LTTOOLBOX_LIBS"; then
+    pkg_cv_LTTOOLBOX_LIBS="$LTTOOLBOX_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_LIBS=`$PKG_CONFIG --libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        else 
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$LTTOOLBOX_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (lttoolbox >= 3.3.2) were not met:
+
+$LTTOOLBOX_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	LTTOOLBOX_CFLAGS=$pkg_cv_LTTOOLBOX_CFLAGS
+	LTTOOLBOX_LIBS=$pkg_cv_LTTOOLBOX_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+
+
+  
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile apertium-rus.pc"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIB@&t@OBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIB@&t@OBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE] 
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../@%:@@%:@ /;s/...$/ @%:@@%:@/;p;x;p;x' <<_ASBOX
+@%:@@%:@ Running $as_me. @%:@@%:@
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-rus.pc") CONFIG_FILES="$CONFIG_FILES apertium-rus.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F@<:@"&"@:>@="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  
+  
+  
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/output.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/output.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/output.1	(revision 70339)
@@ -0,0 +1,4043 @@
+@%:@! /bin/sh
+@%:@ Guess values for system-dependent variables and create Makefiles.
+@%:@ Generated by GNU Autoconf 2.69 for Apertium {{languageName1}}-{{languageName2}} 0.1.0.
+@%:@
+@%:@ Report bugs to <super-antispam@ya.ru>.
+@%:@ 
+@%:@ 
+@%:@ Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+@%:@ 
+@%:@ 
+@%:@ This configure script is free software; the Free Software Foundation
+@%:@ gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+  
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+  
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in @%:@(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in @%:@ ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIB@&t@OBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+
+ac_subst_vars='LTLIBOBJS
+LIB@&t@OBJS
+CGCOMP
+LTTOOLBOX_LIBS
+LTTOOLBOX_CFLAGS
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+LTTOOLBOX_CFLAGS
+LTTOOLBOX_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium {{languageName1}}-{{languageName2}} 0.1.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          @<:@@S|@ac_default_prefix@:>@
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          @<:@PREFIX@:>@
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          @<:@DATAROOTDIR/doc/apertium-{{languageCode1}}-{{languageCode2}}@:>@
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium {{languageName1}}-{{languageName2}} 0.1.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH 
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR 
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS 
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS 
+              linker flags for APERTIUM, overriding pkg-config
+  LTTOOLBOX_CFLAGS 
+              C compiler flags for LTTOOLBOX, overriding pkg-config
+  LTTOOLBOX_LIBS 
+              linker flags for LTTOOLBOX, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium {{languageName1}}-{{languageName2}} configure 0.1.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in @%:@((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in @%:@((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+@%:@ Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules; 
+fi
+
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+ VERSION='0.1.0'
+
+
+cat >>confdefs.h <<_ACEOF
+@%:@define PACKAGE "$PACKAGE"
+_ACEOF
+
+ 
+cat >>confdefs.h <<_ACEOF
+@%:@define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else 
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for LTTOOLBOX" >&5
+$as_echo_n "checking for LTTOOLBOX... " >&6; }
+
+if test -n "$LTTOOLBOX_CFLAGS"; then
+    pkg_cv_LTTOOLBOX_CFLAGS="$LTTOOLBOX_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_CFLAGS=`$PKG_CONFIG --cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$LTTOOLBOX_LIBS"; then
+    pkg_cv_LTTOOLBOX_LIBS="$LTTOOLBOX_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_LIBS=`$PKG_CONFIG --libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes 
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+        
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        else 
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$LTTOOLBOX_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (lttoolbox >= 3.3.2) were not met:
+
+$LTTOOLBOX_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5        
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }        
+else
+	LTTOOLBOX_CFLAGS=$pkg_cv_LTTOOLBOX_CFLAGS
+	LTTOOLBOX_LIBS=$pkg_cv_LTTOOLBOX_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	
+fi
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+
+
+  
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile apertium-rus.pc"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIB@&t@OBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIB@&t@OBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in @%:@(
+  *posix*) :
+    set -o posix ;; @%:@(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in @%:@(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in @%:@((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+@%:@ as_fn_error STATUS ERROR [LINENO LOG_FD]
+@%:@ ----------------------------------------
+@%:@ Output "`basename @S|@0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+@%:@ provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+@%:@ script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} @%:@ as_fn_error
+
+
+@%:@ as_fn_set_status STATUS
+@%:@ -----------------------
+@%:@ Set @S|@? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} @%:@ as_fn_set_status
+
+@%:@ as_fn_exit STATUS
+@%:@ -----------------
+@%:@ Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} @%:@ as_fn_exit
+
+@%:@ as_fn_unset VAR
+@%:@ ---------------
+@%:@ Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+@%:@ as_fn_append VAR VALUE
+@%:@ ----------------------
+@%:@ Append the text in VALUE to the end of the definition contained in VAR. Take
+@%:@ advantage of any shell optimizations that allow amortized linear growth over
+@%:@ repeated appends, instead of the typical quadratic growth present in naive
+@%:@ implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+@%:@ as_fn_arith ARG...
+@%:@ ------------------
+@%:@ Perform arithmetic evaluation on the ARGs, and store the result in the
+@%:@ global @S|@as_val. Take advantage of shells that can avoid forks. The arguments
+@%:@ must be portable across @S|@(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in @%:@(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+@%:@ as_fn_mkdir_p
+@%:@ -------------
+@%:@ Create "@S|@as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} @%:@ as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+@%:@ as_fn_executable_p FILE
+@%:@ -----------------------
+@%:@ Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} @%:@ as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE] 
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../@%:@@%:@ /;s/...$/ @%:@@%:@/;p;x;p;x' <<_ASBOX
+@%:@@%:@ Running $as_me. @%:@@%:@
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-rus.pc") CONFIG_FILES="$CONFIG_FILES apertium-rus.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F@<:@"&"@:>@="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+  
+  
+  
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/requests
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/requests	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/requests	(revision 70339)
@@ -0,0 +1,162 @@
+# This file was generated by Autom4te Thu Apr 10 10:06:43 UTC 2014.
+# It contains the lists of macros which have been traced.
+# It can be safely removed.
+
+@request = (
+             bless( [
+                      '0',
+                      1,
+                      [
+                        '/usr/share/autoconf'
+                      ],
+                      [
+                        '/usr/share/autoconf/autoconf/autoconf.m4f',
+                        '-',
+                        '/usr/share/aclocal-1.14/internal/ac-config-macro-dirs.m4',
+                        '/usr/share/aclocal/pkg.m4',
+                        '/usr/local/share/aclocal/apertium.m4',
+                        '/usr/share/aclocal-1.14/amversion.m4',
+                        '/usr/share/aclocal-1.14/auxdir.m4',
+                        '/usr/share/aclocal-1.14/cond.m4',
+                        '/usr/share/aclocal-1.14/depend.m4',
+                        '/usr/share/aclocal-1.14/depout.m4',
+                        '/usr/share/aclocal-1.14/init.m4',
+                        '/usr/share/aclocal-1.14/install-sh.m4',
+                        '/usr/share/aclocal-1.14/lead-dot.m4',
+                        '/usr/share/aclocal-1.14/make.m4',
+                        '/usr/share/aclocal-1.14/missing.m4',
+                        '/usr/share/aclocal-1.14/options.m4',
+                        '/usr/share/aclocal-1.14/prog-cc-c-o.m4',
+                        '/usr/share/aclocal-1.14/runlog.m4',
+                        '/usr/share/aclocal-1.14/sanity.m4',
+                        '/usr/share/aclocal-1.14/silent.m4',
+                        '/usr/share/aclocal-1.14/strip.m4',
+                        '/usr/share/aclocal-1.14/substnot.m4',
+                        '/usr/share/aclocal-1.14/tar.m4',
+                        'configure.ac'
+                      ],
+                      {
+                        'AU_DEFUN' => 1,
+                        'PKG_CHECK_EXISTS' => 1,
+                        'AM_PROG_CC_C_O' => 1,
+                        'AM_SUBST_NOTMAKE' => 1,
+                        '_AM_CONFIG_MACRO_DIRS' => 1,
+                        'AM_RUN_LOG' => 1,
+                        '_AM_PROG_TAR' => 1,
+                        'AM_SET_DEPDIR' => 1,
+                        'AM_PROG_INSTALL_SH' => 1,
+                        'm4_pattern_forbid' => 1,
+                        'PKG_CHECK_MODULES' => 1,
+                        'AM_AUX_DIR_EXPAND' => 1,
+                        '_AM_SET_OPTIONS' => 1,
+                        '_AM_DEPENDENCIES' => 1,
+                        'AM_SILENT_RULES' => 1,
+                        'AC_DEFUN' => 1,
+                        'AM_OUTPUT_DEPENDENCY_COMMANDS' => 1,
+                        '_AM_MANGLE_OPTION' => 1,
+                        'AP_MKINCLUDE' => 1,
+                        '_PKG_SHORT_ERRORS_SUPPORTED' => 1,
+                        'm4_pattern_allow' => 1,
+                        'AC_CONFIG_MACRO_DIR' => 1,
+                        '_AC_AM_CONFIG_HEADER_HOOK' => 1,
+                        '_m4_warn' => 1,
+                        '_AM_PROG_CC_C_O' => 1,
+                        'AM_PROG_INSTALL_STRIP' => 1,
+                        'm4_include' => 1,
+                        '_AM_SET_OPTION' => 1,
+                        '_AM_IF_OPTION' => 1,
+                        'AC_DEFUN_ONCE' => 1,
+                        'AM_CONDITIONAL' => 1,
+                        'AM_MAKE_INCLUDE' => 1,
+                        'AM_SET_CURRENT_AUTOMAKE_VERSION' => 1,
+                        'AM_SET_LEADING_DOT' => 1,
+                        'AM_MISSING_PROG' => 1,
+                        'AM_DEP_TRACK' => 1,
+                        'PKG_PROG_PKG_CONFIG' => 1,
+                        'AM_AUTOMAKE_VERSION' => 1,
+                        'AP_CHECK_LING' => 1,
+                        'AM_SANITY_CHECK' => 1,
+                        '_AM_AUTOCONF_VERSION' => 1,
+                        '_AM_SUBST_NOTMAKE' => 1,
+                        '_AM_OUTPUT_DEPENDENCY_COMMANDS' => 1,
+                        'AM_INIT_AUTOMAKE' => 1,
+                        'AM_MISSING_HAS_RUN' => 1,
+                        'AC_CONFIG_MACRO_DIR_TRACE' => 1,
+                        'include' => 1
+                      }
+                    ], 'Autom4te::Request' ),
+             bless( [
+                      '1',
+                      1,
+                      [
+                        '/usr/share/autoconf'
+                      ],
+                      [
+                        '/usr/share/autoconf/autoconf/autoconf.m4f',
+                        'aclocal.m4',
+                        'configure.ac'
+                      ],
+                      {
+                        '_AM_SUBST_NOTMAKE' => 1,
+                        'AM_PROG_MOC' => 1,
+                        'include' => 1,
+                        'AM_INIT_AUTOMAKE' => 1,
+                        'LT_SUPPORTED_TAG' => 1,
+                        '_AM_COND_ELSE' => 1,
+                        '_AM_COND_IF' => 1,
+                        'AH_OUTPUT' => 1,
+                        'AC_FC_SRCEXT' => 1,
+                        'AC_PROG_LIBTOOL' => 1,
+                        'AM_MAKEFILE_INCLUDE' => 1,
+                        'AM_AUTOMAKE_VERSION' => 1,
+                        'AC_CONFIG_HEADERS' => 1,
+                        'AC_CONFIG_LINKS' => 1,
+                        'AM_PROG_FC_C_O' => 1,
+                        'AC_CONFIG_AUX_DIR' => 1,
+                        'AM_PROG_F77_C_O' => 1,
+                        'AC_SUBST_TRACE' => 1,
+                        'AC_CANONICAL_HOST' => 1,
+                        'AM_PROG_CXX_C_O' => 1,
+                        'AM_CONDITIONAL' => 1,
+                        'AC_REQUIRE_AUX_FILE' => 1,
+                        'AC_INIT' => 1,
+                        '_m4_warn' => 1,
+                        'AM_PROG_AR' => 1,
+                        'AM_GNU_GETTEXT_INTL_SUBDIR' => 1,
+                        'm4_pattern_allow' => 1,
+                        'm4_include' => 1,
+                        'AC_CONFIG_FILES' => 1,
+                        'AC_FC_PP_SRCEXT' => 1,
+                        'AC_CONFIG_SUBDIRS' => 1,
+                        '_LT_AC_TAGCONFIG' => 1,
+                        'AC_SUBST' => 1,
+                        'LT_CONFIG_LTDL_DIR' => 1,
+                        'm4_sinclude' => 1,
+                        '_AM_COND_ENDIF' => 1,
+                        'AM_PATH_GUILE' => 1,
+                        'AC_CANONICAL_BUILD' => 1,
+                        'AC_FC_FREEFORM' => 1,
+                        'AC_FC_PP_DEFINE' => 1,
+                        'AC_LIBSOURCE' => 1,
+                        'AM_MAINTAINER_MODE' => 1,
+                        'AM_GNU_GETTEXT' => 1,
+                        'AM_PROG_MKDIR_P' => 1,
+                        'AC_CANONICAL_SYSTEM' => 1,
+                        'sinclude' => 1,
+                        'AM_SILENT_RULES' => 1,
+                        'LT_INIT' => 1,
+                        'AM_ENABLE_MULTILIB' => 1,
+                        'AM_EXTRA_RECURSIVE_TARGETS' => 1,
+                        'm4_pattern_forbid' => 1,
+                        'AC_DEFINE_TRACE_LITERAL' => 1,
+                        'AM_XGETTEXT_OPTION' => 1,
+                        'AM_PROG_CC_C_O' => 1,
+                        'AC_CONFIG_LIBOBJ_DIR' => 1,
+                        'AC_CANONICAL_TARGET' => 1,
+                        'AM_NLS' => 1,
+                        '_AM_MAKEFILE_INCLUDE' => 1,
+                        'AM_POT_TOOLS' => 1
+                      }
+                    ], 'Autom4te::Request' )
+           );
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/traces.0
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/traces.0	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/traces.0	(revision 70339)
@@ -0,0 +1,1092 @@
+m4trace:/usr/share/aclocal/pkg.m4:27: -1- AC_DEFUN([PKG_PROG_PKG_CONFIG], [m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+AC_ARG_VAR([PKG_CONFIG], [path to pkg-config utility])
+AC_ARG_VAR([PKG_CONFIG_PATH], [directories to add to pkg-config's search path])
+AC_ARG_VAR([PKG_CONFIG_LIBDIR], [path overriding pkg-config's built-in search path])
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	AC_PATH_TOOL([PKG_CONFIG], [pkg-config])
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=m4_default([$1], [0.9.0])
+	AC_MSG_CHECKING([pkg-config is at least version $_pkg_min_version])
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		AC_MSG_RESULT([yes])
+	else
+		AC_MSG_RESULT([no])
+		PKG_CONFIG=""
+	fi
+fi[]dnl
+])
+m4trace:/usr/share/aclocal/pkg.m4:60: -1- AC_DEFUN([PKG_CHECK_EXISTS], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+if test -n "$PKG_CONFIG" && \
+    AC_RUN_LOG([$PKG_CONFIG --exists --print-errors "$1"]); then
+  m4_default([$2], [:])
+m4_ifvaln([$3], [else
+  $3])dnl
+fi])
+m4trace:/usr/share/aclocal/pkg.m4:86: -1- AC_DEFUN([_PKG_SHORT_ERRORS_SUPPORTED], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi[]dnl
+])
+m4trace:/usr/share/aclocal/pkg.m4:106: -1- AC_DEFUN([PKG_CHECK_MODULES], [AC_REQUIRE([PKG_PROG_PKG_CONFIG])dnl
+AC_ARG_VAR([$1][_CFLAGS], [C compiler flags for $1, overriding pkg-config])dnl
+AC_ARG_VAR([$1][_LIBS], [linker flags for $1, overriding pkg-config])dnl
+
+pkg_failed=no
+AC_MSG_CHECKING([for $1])
+
+_PKG_CONFIG([$1][_CFLAGS], [cflags], [$2])
+_PKG_CONFIG([$1][_LIBS], [libs], [$2])
+
+m4_define([_PKG_TEXT], [Alternatively, you may set the environment variables $1[]_CFLAGS
+and $1[]_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.])
+
+if test $pkg_failed = yes; then
+   	AC_MSG_RESULT([no])
+        _PKG_SHORT_ERRORS_SUPPORTED
+        if test $_pkg_short_errors_supported = yes; then
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "$2" 2>&1`
+        else 
+	        $1[]_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "$2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$$1[]_PKG_ERRORS" >&AS_MESSAGE_LOG_FD
+
+	m4_default([$4], [AC_MSG_ERROR(
+[Package requirements ($2) were not met:
+
+$$1_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+_PKG_TEXT])[]dnl
+        ])
+elif test $pkg_failed = untried; then
+     	AC_MSG_RESULT([no])
+	m4_default([$4], [AC_MSG_FAILURE(
+[The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+_PKG_TEXT
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.])[]dnl
+        ])
+else
+	$1[]_CFLAGS=$pkg_cv_[]$1[]_CFLAGS
+	$1[]_LIBS=$pkg_cv_[]$1[]_LIBS
+        AC_MSG_RESULT([yes])
+	$3
+fi[]dnl
+])
+m4trace:/usr/local/share/aclocal/apertium.m4:33: -1- AC_DEFUN([AP_CHECK_LING], [
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+m4trace:/usr/local/share/aclocal/apertium.m4:91: -1- AC_DEFUN([AP_MKINCLUDE], [
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
+m4trace:/usr/share/aclocal-1.14/amversion.m4:14: -1- AC_DEFUN([AM_AUTOMAKE_VERSION], [am__api_version='1.14'
+dnl Some users find AM_AUTOMAKE_VERSION and mistake it for a way to
+dnl require some minimum version.  Point them to the right macro.
+m4_if([$1], [1.14.1], [],
+      [AC_FATAL([Do not call $0, use AM_INIT_AUTOMAKE([$1]).])])dnl
+])
+m4trace:/usr/share/aclocal-1.14/amversion.m4:33: -1- AC_DEFUN([AM_SET_CURRENT_AUTOMAKE_VERSION], [AM_AUTOMAKE_VERSION([1.14.1])dnl
+m4_ifndef([AC_AUTOCONF_VERSION],
+  [m4_copy([m4_PACKAGE_VERSION], [AC_AUTOCONF_VERSION])])dnl
+_AM_AUTOCONF_VERSION(m4_defn([AC_AUTOCONF_VERSION]))])
+m4trace:/usr/share/aclocal-1.14/auxdir.m4:47: -1- AC_DEFUN([AM_AUX_DIR_EXPAND], [dnl Rely on autoconf to set up CDPATH properly.
+AC_PREREQ([2.50])dnl
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+])
+m4trace:/usr/share/aclocal-1.14/cond.m4:12: -1- AC_DEFUN([AM_CONDITIONAL], [AC_PREREQ([2.52])dnl
+ m4_if([$1], [TRUE],  [AC_FATAL([$0: invalid condition: $1])],
+       [$1], [FALSE], [AC_FATAL([$0: invalid condition: $1])])dnl
+AC_SUBST([$1_TRUE])dnl
+AC_SUBST([$1_FALSE])dnl
+_AM_SUBST_NOTMAKE([$1_TRUE])dnl
+_AM_SUBST_NOTMAKE([$1_FALSE])dnl
+m4_define([_AM_COND_VALUE_$1], [$2])dnl
+if $2; then
+  $1_TRUE=
+  $1_FALSE='#'
+else
+  $1_TRUE='#'
+  $1_FALSE=
+fi
+AC_CONFIG_COMMANDS_PRE(
+[if test -z "${$1_TRUE}" && test -z "${$1_FALSE}"; then
+  AC_MSG_ERROR([[conditional "$1" was never defined.
+Usually this means the macro was only invoked conditionally.]])
+fi])])
+m4trace:/usr/share/aclocal-1.14/depend.m4:26: -1- AC_DEFUN([_AM_DEPENDENCIES], [AC_REQUIRE([AM_SET_DEPDIR])dnl
+AC_REQUIRE([AM_OUTPUT_DEPENDENCY_COMMANDS])dnl
+AC_REQUIRE([AM_MAKE_INCLUDE])dnl
+AC_REQUIRE([AM_DEP_TRACK])dnl
+
+m4_if([$1], [CC],   [depcc="$CC"   am_compiler_list=],
+      [$1], [CXX],  [depcc="$CXX"  am_compiler_list=],
+      [$1], [OBJC], [depcc="$OBJC" am_compiler_list='gcc3 gcc'],
+      [$1], [OBJCXX], [depcc="$OBJCXX" am_compiler_list='gcc3 gcc'],
+      [$1], [UPC],  [depcc="$UPC"  am_compiler_list=],
+      [$1], [GCJ],  [depcc="$GCJ"  am_compiler_list='gcc3 gcc'],
+                    [depcc="$$1"   am_compiler_list=])
+
+AC_CACHE_CHECK([dependency style of $depcc],
+               [am_cv_$1_dependencies_compiler_type],
+[if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
+  # We make a subdir and do the tests there.  Otherwise we can end up
+  # making bogus files that we don't know about and never remove.  For
+  # instance it was reported that on HP-UX the gcc test will end up
+  # making a dummy file named 'D' -- because '-MD' means "put the output
+  # in D".
+  rm -rf conftest.dir
+  mkdir conftest.dir
+  # Copy depcomp to subdir because otherwise we won't find it if we're
+  # using a relative directory.
+  cp "$am_depcomp" conftest.dir
+  cd conftest.dir
+  # We will build objects and dependencies in a subdirectory because
+  # it helps to detect inapplicable dependency modes.  For instance
+  # both Tru64's cc and ICC support -MD to output dependencies as a
+  # side effect of compilation, but ICC will put the dependencies in
+  # the current directory while Tru64 will put them in the object
+  # directory.
+  mkdir sub
+
+  am_cv_$1_dependencies_compiler_type=none
+  if test "$am_compiler_list" = ""; then
+     am_compiler_list=`sed -n ['s/^#*\([a-zA-Z0-9]*\))$/\1/p'] < ./depcomp`
+  fi
+  am__universal=false
+  m4_case([$1], [CC],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac],
+    [CXX],
+    [case " $depcc " in #(
+     *\ -arch\ *\ -arch\ *) am__universal=true ;;
+     esac])
+
+  for depmode in $am_compiler_list; do
+    # Setup a source with many dependencies, because some compilers
+    # like to wrap large dependency lists on column 80 (with \), and
+    # we should not choose a depcomp mode which is confused by this.
+    #
+    # We need to recreate these files for each test, as the compiler may
+    # overwrite some of them when testing with obscure command lines.
+    # This happens at least with the AIX C compiler.
+    : > sub/conftest.c
+    for i in 1 2 3 4 5 6; do
+      echo '#include "conftst'$i'.h"' >> sub/conftest.c
+      # Using ": > sub/conftst$i.h" creates only sub/conftst1.h with
+      # Solaris 10 /bin/sh.
+      echo '/* dummy */' > sub/conftst$i.h
+    done
+    echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
+
+    # We check with '-c' and '-o' for the sake of the "dashmstdout"
+    # mode.  It turns out that the SunPro C++ compiler does not properly
+    # handle '-M -o', and we need to detect this.  Also, some Intel
+    # versions had trouble with output in subdirs.
+    am__obj=sub/conftest.${OBJEXT-o}
+    am__minus_obj="-o $am__obj"
+    case $depmode in
+    gcc)
+      # This depmode causes a compiler race in universal mode.
+      test "$am__universal" = false || continue
+      ;;
+    nosideeffect)
+      # After this tag, mechanisms are not by side-effect, so they'll
+      # only be used when explicitly requested.
+      if test "x$enable_dependency_tracking" = xyes; then
+	continue
+      else
+	break
+      fi
+      ;;
+    msvc7 | msvc7msys | msvisualcpp | msvcmsys)
+      # This compiler won't grok '-c -o', but also, the minuso test has
+      # not run yet.  These depmodes are late enough in the game, and
+      # so weak that their functioning should not be impacted.
+      am__obj=conftest.${OBJEXT-o}
+      am__minus_obj=
+      ;;
+    none) break ;;
+    esac
+    if depmode=$depmode \
+       source=sub/conftest.c object=$am__obj \
+       depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
+       $SHELL ./depcomp $depcc -c $am__minus_obj sub/conftest.c \
+         >/dev/null 2>conftest.err &&
+       grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
+       grep $am__obj sub/conftest.Po > /dev/null 2>&1 &&
+       ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
+      # icc doesn't choke on unknown options, it will just issue warnings
+      # or remarks (even with -Werror).  So we grep stderr for any message
+      # that says an option was ignored or not supported.
+      # When given -MP, icc 7.0 and 7.1 complain thusly:
+      #   icc: Command line warning: ignoring option '-M'; no argument required
+      # The diagnosis changed in icc 8.0:
+      #   icc: Command line remark: option '-MP' not supported
+      if (grep 'ignoring option' conftest.err ||
+          grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
+        am_cv_$1_dependencies_compiler_type=$depmode
+        break
+      fi
+    fi
+  done
+
+  cd ..
+  rm -rf conftest.dir
+else
+  am_cv_$1_dependencies_compiler_type=none
+fi
+])
+AC_SUBST([$1DEPMODE], [depmode=$am_cv_$1_dependencies_compiler_type])
+AM_CONDITIONAL([am__fastdep$1], [
+  test "x$enable_dependency_tracking" != xno \
+  && test "$am_cv_$1_dependencies_compiler_type" = gcc3])
+])
+m4trace:/usr/share/aclocal-1.14/depend.m4:163: -1- AC_DEFUN([AM_SET_DEPDIR], [AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+AC_SUBST([DEPDIR], ["${am__leading_dot}deps"])dnl
+])
+m4trace:/usr/share/aclocal-1.14/depend.m4:171: -1- AC_DEFUN([AM_DEP_TRACK], [AC_ARG_ENABLE([dependency-tracking], [dnl
+AS_HELP_STRING(
+  [--enable-dependency-tracking],
+  [do not reject slow dependency extractors])
+AS_HELP_STRING(
+  [--disable-dependency-tracking],
+  [speeds up one-time build])])
+if test "x$enable_dependency_tracking" != xno; then
+  am_depcomp="$ac_aux_dir/depcomp"
+  AMDEPBACKSLASH='\'
+  am__nodep='_no'
+fi
+AM_CONDITIONAL([AMDEP], [test "x$enable_dependency_tracking" != xno])
+AC_SUBST([AMDEPBACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AMDEPBACKSLASH])dnl
+AC_SUBST([am__nodep])dnl
+_AM_SUBST_NOTMAKE([am__nodep])dnl
+])
+m4trace:/usr/share/aclocal-1.14/depout.m4:12: -1- AC_DEFUN([_AM_OUTPUT_DEPENDENCY_COMMANDS], [{
+  # Older Autoconf quotes --file arguments for eval, but not when files
+  # are listed without --file.  Let's play safe and only enable the eval
+  # if we detect the quoting.
+  case $CONFIG_FILES in
+  *\'*) eval set x "$CONFIG_FILES" ;;
+  *)   set x $CONFIG_FILES ;;
+  esac
+  shift
+  for mf
+  do
+    # Strip MF so we end up with the name of the file.
+    mf=`echo "$mf" | sed -e 's/:.*$//'`
+    # Check whether this is an Automake generated Makefile or not.
+    # We used to match only the files named 'Makefile.in', but
+    # some people rename them; so instead we look at the file content.
+    # Grep'ing the first line is not enough: some people post-process
+    # each Makefile.in and add a new line on top of each file to say so.
+    # Grep'ing the whole file is not good either: AIX grep has a line
+    # limit of 2048, but all sed's we know have understand at least 4000.
+    if sed -n 's,^#.*generated by automake.*,X,p' "$mf" | grep X >/dev/null 2>&1; then
+      dirpart=`AS_DIRNAME("$mf")`
+    else
+      continue
+    fi
+    # Extract the definition of DEPDIR, am__include, and am__quote
+    # from the Makefile without running 'make'.
+    DEPDIR=`sed -n 's/^DEPDIR = //p' < "$mf"`
+    test -z "$DEPDIR" && continue
+    am__include=`sed -n 's/^am__include = //p' < "$mf"`
+    test -z "$am__include" && continue
+    am__quote=`sed -n 's/^am__quote = //p' < "$mf"`
+    # Find all dependency output files, they are included files with
+    # $(DEPDIR) in their names.  We invoke sed twice because it is the
+    # simplest approach to changing $(DEPDIR) to its actual value in the
+    # expansion.
+    for file in `sed -n "
+      s/^$am__include $am__quote\(.*(DEPDIR).*\)$am__quote"'$/\1/p' <"$mf" | \
+	 sed -e 's/\$(DEPDIR)/'"$DEPDIR"'/g'`; do
+      # Make sure the directory exists.
+      test -f "$dirpart/$file" && continue
+      fdir=`AS_DIRNAME(["$file"])`
+      AS_MKDIR_P([$dirpart/$fdir])
+      # echo "creating $dirpart/$file"
+      echo '# dummy' > "$dirpart/$file"
+    done
+  done
+}
+])
+m4trace:/usr/share/aclocal-1.14/depout.m4:71: -1- AC_DEFUN([AM_OUTPUT_DEPENDENCY_COMMANDS], [AC_CONFIG_COMMANDS([depfiles],
+     [test x"$AMDEP_TRUE" != x"" || _AM_OUTPUT_DEPENDENCY_COMMANDS],
+     [AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"])
+])
+m4trace:/usr/share/aclocal-1.14/init.m4:29: -1- AC_DEFUN([AM_INIT_AUTOMAKE], [AC_PREREQ([2.65])dnl
+dnl Autoconf wants to disallow AM_ names.  We explicitly allow
+dnl the ones we care about.
+m4_pattern_allow([^AM_[A-Z]+FLAGS$])dnl
+AC_REQUIRE([AM_SET_CURRENT_AUTOMAKE_VERSION])dnl
+AC_REQUIRE([AC_PROG_INSTALL])dnl
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  AC_SUBST([am__isrc], [' -I$(srcdir)'])_AM_SUBST_NOTMAKE([am__isrc])dnl
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    AC_MSG_ERROR([source directory already configured; run "make distclean" there first])
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+AC_SUBST([CYGPATH_W])
+
+# Define the identity of the package.
+dnl Distinguish between old-style and new-style calls.
+m4_ifval([$2],
+[AC_DIAGNOSE([obsolete],
+             [$0: two- and three-arguments forms are deprecated.])
+m4_ifval([$3], [_AM_SET_OPTION([no-define])])dnl
+ AC_SUBST([PACKAGE], [$1])dnl
+ AC_SUBST([VERSION], [$2])],
+[_AM_SET_OPTIONS([$1])dnl
+dnl Diagnose old-style AC_INIT with new-style AM_AUTOMAKE_INIT.
+m4_if(
+  m4_ifdef([AC_PACKAGE_NAME], [ok]):m4_ifdef([AC_PACKAGE_VERSION], [ok]),
+  [ok:ok],,
+  [m4_fatal([AC_INIT should be called with package and version arguments])])dnl
+ AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])dnl
+ AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])])dnl
+
+_AM_IF_OPTION([no-define],,
+[AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])dnl
+
+# Some tools Automake needs.
+AC_REQUIRE([AM_SANITY_CHECK])dnl
+AC_REQUIRE([AC_ARG_PROGRAM])dnl
+AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+AM_MISSING_PROG([AUTOCONF], [autoconf])
+AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+AM_MISSING_PROG([AUTOHEADER], [autoheader])
+AM_MISSING_PROG([MAKEINFO], [makeinfo])
+AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+AC_REQUIRE([AM_PROG_INSTALL_STRIP])dnl
+AC_REQUIRE([AC_PROG_MKDIR_P])dnl
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+AC_REQUIRE([AC_PROG_AWK])dnl
+AC_REQUIRE([AC_PROG_MAKE_SET])dnl
+AC_REQUIRE([AM_SET_LEADING_DOT])dnl
+_AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])],
+	      [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+_AM_IF_OPTION([no-dependencies],,
+[AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+AC_REQUIRE([AM_SILENT_RULES])dnl
+dnl The testsuite driver may need to know about EXEEXT, so add the
+dnl 'am__EXEEXT' conditional if _AM_COMPILER_EXEEXT was seen.  This
+dnl macro is hooked onto _AC_COMPILER_EXEEXT early, see below.
+AC_CONFIG_COMMANDS_PRE(dnl
+[m4_provide_if([_AM_COMPILER_EXEEXT],
+  [AM_CONDITIONAL([am__EXEEXT], [test -n "$EXEEXT"])])])dnl
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    AC_MSG_ERROR([Your 'rm' program is bad, sorry.])
+  fi
+fi])
+m4trace:/usr/share/aclocal-1.14/init.m4:182: -1- AC_DEFUN([_AC_AM_CONFIG_HEADER_HOOK], [# Compute $1's index in $config_headers.
+_am_arg=$1
+_am_stamp_count=1
+for _am_header in $config_headers :; do
+  case $_am_header in
+    $_am_arg | $_am_arg:* )
+      break ;;
+    * )
+      _am_stamp_count=`expr $_am_stamp_count + 1` ;;
+  esac
+done
+echo "timestamp for $_am_arg" >`AS_DIRNAME(["$_am_arg"])`/stamp-h[]$_am_stamp_count])
+m4trace:/usr/share/aclocal-1.14/install-sh.m4:11: -1- AC_DEFUN([AM_PROG_INSTALL_SH], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+AC_SUBST([install_sh])])
+m4trace:/usr/share/aclocal-1.14/lead-dot.m4:10: -1- AC_DEFUN([AM_SET_LEADING_DOT], [rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+AC_SUBST([am__leading_dot])])
+m4trace:/usr/share/aclocal-1.14/make.m4:12: -1- AC_DEFUN([AM_MAKE_INCLUDE], [am_make=${MAKE-make}
+cat > confinc << 'END'
+am__doit:
+	@echo this is the am__doit target
+.PHONY: am__doit
+END
+# If we don't find an include directive, just comment out the code.
+AC_MSG_CHECKING([for style of include used by $am_make])
+am__include="#"
+am__quote=
+_am_result=none
+# First try GNU make style include.
+echo "include confinc" > confmf
+# Ignore all kinds of additional output from 'make'.
+case `$am_make -s -f confmf 2> /dev/null` in #(
+*the\ am__doit\ target*)
+  am__include=include
+  am__quote=
+  _am_result=GNU
+  ;;
+esac
+# Now try BSD make style include.
+if test "$am__include" = "#"; then
+   echo '.include "confinc"' > confmf
+   case `$am_make -s -f confmf 2> /dev/null` in #(
+   *the\ am__doit\ target*)
+     am__include=.include
+     am__quote="\""
+     _am_result=BSD
+     ;;
+   esac
+fi
+AC_SUBST([am__include])
+AC_SUBST([am__quote])
+AC_MSG_RESULT([$_am_result])
+rm -f confinc confmf
+])
+m4trace:/usr/share/aclocal-1.14/missing.m4:11: -1- AC_DEFUN([AM_MISSING_PROG], [AC_REQUIRE([AM_MISSING_HAS_RUN])
+$1=${$1-"${am_missing_run}$2"}
+AC_SUBST($1)])
+m4trace:/usr/share/aclocal-1.14/missing.m4:20: -1- AC_DEFUN([AM_MISSING_HAS_RUN], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([missing])dnl
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  AC_MSG_WARN(['missing' script is too old or missing])
+fi
+])
+m4trace:/usr/share/aclocal-1.14/options.m4:11: -1- AC_DEFUN([_AM_MANGLE_OPTION], [[_AM_OPTION_]m4_bpatsubst($1, [[^a-zA-Z0-9_]], [_])])
+m4trace:/usr/share/aclocal-1.14/options.m4:17: -1- AC_DEFUN([_AM_SET_OPTION], [m4_define(_AM_MANGLE_OPTION([$1]), [1])])
+m4trace:/usr/share/aclocal-1.14/options.m4:23: -1- AC_DEFUN([_AM_SET_OPTIONS], [m4_foreach_w([_AM_Option], [$1], [_AM_SET_OPTION(_AM_Option)])])
+m4trace:/usr/share/aclocal-1.14/options.m4:29: -1- AC_DEFUN([_AM_IF_OPTION], [m4_ifset(_AM_MANGLE_OPTION([$1]), [$2], [$3])])
+m4trace:/usr/share/aclocal-1.14/prog-cc-c-o.m4:12: -1- AC_DEFUN([_AM_PROG_CC_C_O], [AC_REQUIRE([AM_AUX_DIR_EXPAND])dnl
+AC_REQUIRE_AUX_FILE([compile])dnl
+AC_LANG_PUSH([C])dnl
+AC_CACHE_CHECK(
+  [whether $CC understands -c and -o together],
+  [am_cv_prog_cc_c_o],
+  [AC_LANG_CONFTEST([AC_LANG_PROGRAM([])])
+  # Make sure it works both with $CC and with simple cc.
+  # Following AC_PROG_CC_C_O, we do the test twice because some
+  # compilers refuse to overwrite an existing .o file with -o,
+  # though they will create one.
+  am_cv_prog_cc_c_o=yes
+  for am_i in 1 2; do
+    if AM_RUN_LOG([$CC -c conftest.$ac_ext -o conftest2.$ac_objext]) \
+         && test -f conftest2.$ac_objext; then
+      : OK
+    else
+      am_cv_prog_cc_c_o=no
+      break
+    fi
+  done
+  rm -f core conftest*
+  unset am_i])
+if test "$am_cv_prog_cc_c_o" != yes; then
+   # Losing compiler, so override with the script.
+   # FIXME: It is wrong to rewrite CC.
+   # But if we don't then we get into trouble of one sort or another.
+   # A longer-term fix would be to have automake use am__CC in this case,
+   # and then we could set am__CC="\$(top_srcdir)/compile \$(CC)"
+   CC="$am_aux_dir/compile $CC"
+fi
+AC_LANG_POP([C])])
+m4trace:/usr/share/aclocal-1.14/prog-cc-c-o.m4:47: -1- AC_DEFUN_ONCE([AM_PROG_CC_C_O], [AC_REQUIRE([AC_PROG_CC])])
+m4trace:/usr/share/aclocal-1.14/runlog.m4:12: -1- AC_DEFUN([AM_RUN_LOG], [{ echo "$as_me:$LINENO: $1" >&AS_MESSAGE_LOG_FD
+   ($1) >&AS_MESSAGE_LOG_FD 2>&AS_MESSAGE_LOG_FD
+   ac_status=$?
+   echo "$as_me:$LINENO: \$? = $ac_status" >&AS_MESSAGE_LOG_FD
+   (exit $ac_status); }])
+m4trace:/usr/share/aclocal-1.14/sanity.m4:11: -1- AC_DEFUN([AM_SANITY_CHECK], [AC_MSG_CHECKING([whether build environment is sane])
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[[\\\"\#\$\&\'\`$am_lf]]*)
+    AC_MSG_ERROR([unsafe absolute working directory name]);;
+esac
+case $srcdir in
+  *[[\\\"\#\$\&\'\`$am_lf\ \	]]*)
+    AC_MSG_ERROR([unsafe srcdir value: '$srcdir']);;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$[*]" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$[*]" != "X $srcdir/configure conftest.file" \
+	&& test "$[*]" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	AC_MSG_ERROR([ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment])
+     fi
+     if test "$[2]" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$[2]" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   AC_MSG_ERROR([newly created file is older than distributed files!
+Check your system clock])
+fi
+AC_MSG_RESULT([yes])
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+AC_CONFIG_COMMANDS_PRE(
+  [AC_MSG_CHECKING([that generated files are newer than configure])
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   AC_MSG_RESULT([done])])
+rm -f conftest.file
+])
+m4trace:/usr/share/aclocal-1.14/silent.m4:12: -1- AC_DEFUN([AM_SILENT_RULES], [AC_ARG_ENABLE([silent-rules], [dnl
+AS_HELP_STRING(
+  [--enable-silent-rules],
+  [less verbose build output (undo: "make V=1")])
+AS_HELP_STRING(
+  [--disable-silent-rules],
+  [verbose build output (undo: "make V=0")])dnl
+])
+case $enable_silent_rules in @%:@ (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=m4_if([$1], [yes], [0], [1]);;
+esac
+dnl
+dnl A few 'make' implementations (e.g., NonStop OS and NextStep)
+dnl do not support nested variable expansions.
+dnl See automake bug#9928 and bug#10237.
+am_make=${MAKE-make}
+AC_CACHE_CHECK([whether $am_make supports nested variables],
+   [am_cv_make_support_nested_variables],
+   [if AS_ECHO([['TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit']]) | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi])
+if test $am_cv_make_support_nested_variables = yes; then
+  dnl Using '$V' instead of '$(V)' breaks IRIX make.
+  AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AC_SUBST([AM_V])dnl
+AM_SUBST_NOTMAKE([AM_V])dnl
+AC_SUBST([AM_DEFAULT_V])dnl
+AM_SUBST_NOTMAKE([AM_DEFAULT_V])dnl
+AC_SUBST([AM_DEFAULT_VERBOSITY])dnl
+AM_BACKSLASH='\'
+AC_SUBST([AM_BACKSLASH])dnl
+_AM_SUBST_NOTMAKE([AM_BACKSLASH])dnl
+])
+m4trace:/usr/share/aclocal-1.14/strip.m4:17: -1- AC_DEFUN([AM_PROG_INSTALL_STRIP], [AC_REQUIRE([AM_PROG_INSTALL_SH])dnl
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+dnl Don't test for $cross_compiling = yes, because it might be 'maybe'.
+if test "$cross_compiling" != no; then
+  AC_CHECK_TOOL([STRIP], [strip], :)
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+AC_SUBST([INSTALL_STRIP_PROGRAM])])
+m4trace:/usr/share/aclocal-1.14/substnot.m4:12: -1- AC_DEFUN([_AM_SUBST_NOTMAKE])
+m4trace:/usr/share/aclocal-1.14/substnot.m4:17: -1- AC_DEFUN([AM_SUBST_NOTMAKE], [_AM_SUBST_NOTMAKE($@)])
+m4trace:/usr/share/aclocal-1.14/tar.m4:23: -1- AC_DEFUN([_AM_PROG_TAR], [# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AC_SUBST([AMTAR], ['$${TAR-tar}'])
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar m4_if([$1], [ustar], [plaintar]) pax cpio none'
+
+m4_if([$1], [v7],
+  [am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'],
+
+  [m4_case([$1],
+    [ustar],
+     [# The POSIX 1988 'ustar' format is defined with fixed-size fields.
+      # There is notably a 21 bits limit for the UID and the GID.  In fact,
+      # the 'pax' utility can hang on bigger UID/GID (see automake bug#8343
+      # and bug#13588).
+      am_max_uid=2097151 # 2^21 - 1
+      am_max_gid=$am_max_uid
+      # The $UID and $GID variables are not portable, so we need to resort
+      # to the POSIX-mandated id(1) utility.  Errors in the 'id' calls
+      # below are definitely unexpected, so allow the users to see them
+      # (that is, avoid stderr redirection).
+      am_uid=`id -u || echo unknown`
+      am_gid=`id -g || echo unknown`
+      AC_MSG_CHECKING([whether UID '$am_uid' is supported by ustar format])
+      if test $am_uid -le $am_max_uid; then
+         AC_MSG_RESULT([yes])
+      else
+         AC_MSG_RESULT([no])
+         _am_tools=none
+      fi
+      AC_MSG_CHECKING([whether GID '$am_gid' is supported by ustar format])
+      if test $am_gid -le $am_max_gid; then
+         AC_MSG_RESULT([yes])
+      else
+        AC_MSG_RESULT([no])
+        _am_tools=none
+      fi],
+
+  [pax],
+    [],
+
+  [m4_fatal([Unknown tar format])])
+
+  AC_MSG_CHECKING([how to create a $1 tar archive])
+
+  # Go ahead even if we have the value already cached.  We do so because we
+  # need to set the values for the 'am__tar' and 'am__untar' variables.
+  _am_tools=${am_cv_prog_tar_$1-$_am_tools}
+
+  for _am_tool in $_am_tools; do
+    case $_am_tool in
+    gnutar)
+      for _am_tar in tar gnutar gtar; do
+        AM_RUN_LOG([$_am_tar --version]) && break
+      done
+      am__tar="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$$tardir"'
+      am__tar_="$_am_tar --format=m4_if([$1], [pax], [posix], [$1]) -chf - "'"$tardir"'
+      am__untar="$_am_tar -xf -"
+      ;;
+    plaintar)
+      # Must skip GNU tar: if it does not support --format= it doesn't create
+      # ustar tarball either.
+      (tar --version) >/dev/null 2>&1 && continue
+      am__tar='tar chf - "$$tardir"'
+      am__tar_='tar chf - "$tardir"'
+      am__untar='tar xf -'
+      ;;
+    pax)
+      am__tar='pax -L -x $1 -w "$$tardir"'
+      am__tar_='pax -L -x $1 -w "$tardir"'
+      am__untar='pax -r'
+      ;;
+    cpio)
+      am__tar='find "$$tardir" -print | cpio -o -H $1 -L'
+      am__tar_='find "$tardir" -print | cpio -o -H $1 -L'
+      am__untar='cpio -i -H $1 -d'
+      ;;
+    none)
+      am__tar=false
+      am__tar_=false
+      am__untar=false
+      ;;
+    esac
+
+    # If the value was cached, stop now.  We just wanted to have am__tar
+    # and am__untar set.
+    test -n "${am_cv_prog_tar_$1}" && break
+
+    # tar/untar a dummy directory, and stop if the command works.
+    rm -rf conftest.dir
+    mkdir conftest.dir
+    echo GrepMe > conftest.dir/file
+    AM_RUN_LOG([tardir=conftest.dir && eval $am__tar_ >conftest.tar])
+    rm -rf conftest.dir
+    if test -s conftest.tar; then
+      AM_RUN_LOG([$am__untar <conftest.tar])
+      AM_RUN_LOG([cat conftest.dir/file])
+      grep GrepMe conftest.dir/file >/dev/null 2>&1 && break
+    fi
+  done
+  rm -rf conftest.dir
+
+  AC_CACHE_VAL([am_cv_prog_tar_$1], [am_cv_prog_tar_$1=$_am_tool])
+  AC_MSG_RESULT([$am_cv_prog_tar_$1])])
+
+AC_SUBST([am__tar])
+AC_SUBST([am__untar])
+])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([_AC_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^AS_FLAGS$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?m4_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^dnl$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?AS_])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^SHELL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PATH_SEPARATOR$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^exec_prefix$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^prefix$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^program_transform_name$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^bindir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sbindir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libexecdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datarootdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datadir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sysconfdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sharedstatedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localstatedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^includedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^oldincludedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^docdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^infodir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^htmldir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^dvidir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^pdfdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^psdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libdir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localedir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^mandir$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^DEFS$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_C$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_N$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_T$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^LIBS$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^build_alias$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^host_alias$])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^target_alias$])
+m4trace:configure.ac:4: -1- AM_INIT_AUTOMAKE
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_[A-Z]+FLAGS$])
+m4trace:configure.ac:4: -1- AM_SET_CURRENT_AUTOMAKE_VERSION
+m4trace:configure.ac:4: -1- AM_AUTOMAKE_VERSION([1.14.1])
+m4trace:configure.ac:4: -1- _AM_AUTOCONF_VERSION([2.69])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_PROGRAM$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_SCRIPT$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_DATA$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__isrc$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([am__isrc])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^CYGPATH_W$])
+m4trace:configure.ac:4: -1- _AM_SET_OPTIONS([])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([no-define], [], [AC_DEFINE_UNQUOTED([PACKAGE], ["$PACKAGE"], [Name of package])
+ AC_DEFINE_UNQUOTED([VERSION], ["$VERSION"], [Version number of package])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([no-define])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AM_SANITY_CHECK
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([ACLOCAL], [aclocal-${am__api_version}])
+m4trace:configure.ac:4: -1- AM_MISSING_HAS_RUN
+m4trace:configure.ac:4: -1- AM_AUX_DIR_EXPAND
+m4trace:configure.ac:4: -1- m4_pattern_allow([^ACLOCAL$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOCONF], [autoconf])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOCONF$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOMAKE], [automake-${am__api_version}])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOMAKE$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([AUTOHEADER], [autoheader])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOHEADER$])
+m4trace:configure.ac:4: -1- AM_MISSING_PROG([MAKEINFO], [makeinfo])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MAKEINFO$])
+m4trace:configure.ac:4: -1- AM_PROG_INSTALL_SH
+m4trace:configure.ac:4: -1- m4_pattern_allow([^install_sh$])
+m4trace:configure.ac:4: -1- AM_PROG_INSTALL_STRIP
+m4trace:configure.ac:4: -1- m4_pattern_allow([^STRIP$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_STRIP_PROGRAM$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MKDIR_P$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^mkdir_p$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^SET_MAKE$])
+m4trace:configure.ac:4: -1- AM_SET_LEADING_DOT
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__leading_dot$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([tar-ustar], [_AM_PROG_TAR([ustar])], [_AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])],
+			     [_AM_PROG_TAR([v7])])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([tar-ustar])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([tar-pax], [_AM_PROG_TAR([pax])], [_AM_PROG_TAR([v7])])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([tar-pax])
+m4trace:configure.ac:4: -1- _AM_PROG_TAR([v7])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AMTAR$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__tar$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__untar$])
+m4trace:configure.ac:4: -1- _AM_IF_OPTION([no-dependencies], [], [AC_PROVIDE_IFELSE([AC_PROG_CC],
+		  [_AM_DEPENDENCIES([CC])],
+		  [m4_define([AC_PROG_CC],
+			     m4_defn([AC_PROG_CC])[_AM_DEPENDENCIES([CC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_CXX],
+		  [_AM_DEPENDENCIES([CXX])],
+		  [m4_define([AC_PROG_CXX],
+			     m4_defn([AC_PROG_CXX])[_AM_DEPENDENCIES([CXX])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJC],
+		  [_AM_DEPENDENCIES([OBJC])],
+		  [m4_define([AC_PROG_OBJC],
+			     m4_defn([AC_PROG_OBJC])[_AM_DEPENDENCIES([OBJC])])])dnl
+AC_PROVIDE_IFELSE([AC_PROG_OBJCXX],
+		  [_AM_DEPENDENCIES([OBJCXX])],
+		  [m4_define([AC_PROG_OBJCXX],
+			     m4_defn([AC_PROG_OBJCXX])[_AM_DEPENDENCIES([OBJCXX])])])dnl
+])
+m4trace:configure.ac:4: -2- _AM_MANGLE_OPTION([no-dependencies])
+m4trace:configure.ac:4: -1- AM_SILENT_RULES
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_V$])
+m4trace:configure.ac:4: -1- AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_V$])
+m4trace:configure.ac:4: -1- AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_VERBOSITY$])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_BACKSLASH$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_BACKSLASH])
+m4trace:configure.ac:6: -1- m4_pattern_allow([^LN_S$])
+m4trace:configure.ac:7: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:12: -1- PKG_CHECK_MODULES([APERTIUM], [apertium >= 3.4.0])
+m4trace:configure.ac:12: -1- PKG_PROG_PKG_CONFIG
+m4trace:configure.ac:12: -1- m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_PATH$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_LIBDIR$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:12: -1- PKG_CHECK_EXISTS([apertium >= 3.4.0], [pkg_cv_[]APERTIUM_CFLAGS=`$PKG_CONFIG --[]cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:12: -1- PKG_CHECK_EXISTS([apertium >= 3.4.0], [pkg_cv_[]APERTIUM_LIBS=`$PKG_CONFIG --[]libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:12: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:13: -1- PKG_CHECK_MODULES([LTTOOLBOX], [lttoolbox >= 3.3.2])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_CFLAGS$])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_LIBS$])
+m4trace:configure.ac:13: -1- PKG_CHECK_EXISTS([lttoolbox >= 3.3.2], [pkg_cv_[]LTTOOLBOX_CFLAGS=`$PKG_CONFIG --[]cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:13: -1- PKG_CHECK_EXISTS([lttoolbox >= 3.3.2], [pkg_cv_[]LTTOOLBOX_LIBS=`$PKG_CONFIG --[]libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes ], [pkg_failed=yes])
+m4trace:configure.ac:13: -1- _PKG_SHORT_ERRORS_SUPPORTED
+m4trace:configure.ac:15: -1- m4_pattern_allow([^CGCOMP$])
+m4trace:configure.ac:19: -1- AP_MKINCLUDE
+m4trace:configure.ac:19: -1- m4_pattern_allow([^ap_include$])
+m4trace:configure.ac:21: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
+You should run autoupdate.], [])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LIB@&t@OBJS$])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LTLIBOBJS$])
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/traces.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/traces.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/autom4te.cache/traces.1	(revision 70339)
@@ -0,0 +1,305 @@
+m4trace:configure.ac:3: -1- AC_INIT([Apertium {{languageName1}}-{{languageName2}}], [0.1.0], [super-antispam@ya.ru], [apertium-{{languageCode1}}-{{languageCode2}}], [http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([_AC_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^AS_FLAGS$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?m4_])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^dnl$])
+m4trace:configure.ac:3: -1- m4_pattern_forbid([^_?AS_])
+m4trace:configure.ac:3: -1- AC_SUBST([SHELL])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([SHELL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^SHELL$])
+m4trace:configure.ac:3: -1- AC_SUBST([PATH_SEPARATOR])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PATH_SEPARATOR])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PATH_SEPARATOR$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_NAME], [m4_ifdef([AC_PACKAGE_NAME],      ['AC_PACKAGE_NAME'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_NAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_TARNAME], [m4_ifdef([AC_PACKAGE_TARNAME],   ['AC_PACKAGE_TARNAME'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_VERSION], [m4_ifdef([AC_PACKAGE_VERSION],   ['AC_PACKAGE_VERSION'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_STRING], [m4_ifdef([AC_PACKAGE_STRING],    ['AC_PACKAGE_STRING'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_STRING])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_BUGREPORT], [m4_ifdef([AC_PACKAGE_BUGREPORT], ['AC_PACKAGE_BUGREPORT'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- AC_SUBST([PACKAGE_URL], [m4_ifdef([AC_PACKAGE_URL],       ['AC_PACKAGE_URL'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([PACKAGE_URL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- AC_SUBST([exec_prefix], [NONE])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([exec_prefix])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^exec_prefix$])
+m4trace:configure.ac:3: -1- AC_SUBST([prefix], [NONE])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([prefix])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^prefix$])
+m4trace:configure.ac:3: -1- AC_SUBST([program_transform_name], [s,x,x,])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([program_transform_name])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^program_transform_name$])
+m4trace:configure.ac:3: -1- AC_SUBST([bindir], ['${exec_prefix}/bin'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([bindir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^bindir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sbindir], ['${exec_prefix}/sbin'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sbindir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sbindir$])
+m4trace:configure.ac:3: -1- AC_SUBST([libexecdir], ['${exec_prefix}/libexec'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([libexecdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libexecdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([datarootdir], ['${prefix}/share'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([datarootdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datarootdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([datadir], ['${datarootdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([datadir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^datadir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sysconfdir], ['${prefix}/etc'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sysconfdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sysconfdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([sharedstatedir], ['${prefix}/com'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([sharedstatedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^sharedstatedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([localstatedir], ['${prefix}/var'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([localstatedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localstatedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([includedir], ['${prefix}/include'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([includedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^includedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([oldincludedir], ['/usr/include'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([oldincludedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^oldincludedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([docdir], [m4_ifset([AC_PACKAGE_TARNAME],
+				     ['${datarootdir}/doc/${PACKAGE_TARNAME}'],
+				     ['${datarootdir}/doc/${PACKAGE}'])])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([docdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^docdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([infodir], ['${datarootdir}/info'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([infodir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^infodir$])
+m4trace:configure.ac:3: -1- AC_SUBST([htmldir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([htmldir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^htmldir$])
+m4trace:configure.ac:3: -1- AC_SUBST([dvidir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([dvidir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^dvidir$])
+m4trace:configure.ac:3: -1- AC_SUBST([pdfdir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([pdfdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^pdfdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([psdir], ['${docdir}'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([psdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^psdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([libdir], ['${exec_prefix}/lib'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([libdir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^libdir$])
+m4trace:configure.ac:3: -1- AC_SUBST([localedir], ['${datarootdir}/locale'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([localedir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^localedir$])
+m4trace:configure.ac:3: -1- AC_SUBST([mandir], ['${datarootdir}/man'])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([mandir])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^mandir$])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_NAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_NAME$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_NAME], [/* Define to the full name of this package. */
+@%:@undef PACKAGE_NAME])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_TARNAME$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_TARNAME], [/* Define to the one symbol short name of this package. */
+@%:@undef PACKAGE_TARNAME])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_VERSION$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_VERSION], [/* Define to the version of this package. */
+@%:@undef PACKAGE_VERSION])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_STRING])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_STRING$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_STRING], [/* Define to the full name and version of this package. */
+@%:@undef PACKAGE_STRING])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_BUGREPORT$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_BUGREPORT], [/* Define to the address where bug reports for this package should be sent. */
+@%:@undef PACKAGE_BUGREPORT])
+m4trace:configure.ac:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_URL])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^PACKAGE_URL$])
+m4trace:configure.ac:3: -1- AH_OUTPUT([PACKAGE_URL], [/* Define to the home page for this package. */
+@%:@undef PACKAGE_URL])
+m4trace:configure.ac:3: -1- AC_SUBST([DEFS])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([DEFS])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^DEFS$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_C])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_C])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_C$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_N])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_N])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_N$])
+m4trace:configure.ac:3: -1- AC_SUBST([ECHO_T])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([ECHO_T])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^ECHO_T$])
+m4trace:configure.ac:3: -1- AC_SUBST([LIBS])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([LIBS])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^LIBS$])
+m4trace:configure.ac:3: -1- AC_SUBST([build_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([build_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^build_alias$])
+m4trace:configure.ac:3: -1- AC_SUBST([host_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([host_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^host_alias$])
+m4trace:configure.ac:3: -1- AC_SUBST([target_alias])
+m4trace:configure.ac:3: -1- AC_SUBST_TRACE([target_alias])
+m4trace:configure.ac:3: -1- m4_pattern_allow([^target_alias$])
+m4trace:configure.ac:4: -1- AM_INIT_AUTOMAKE
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_[A-Z]+FLAGS$])
+m4trace:configure.ac:4: -1- AM_AUTOMAKE_VERSION([1.14.1])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([install-sh])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_PROGRAM])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_PROGRAM])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_PROGRAM$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_SCRIPT])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_SCRIPT])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_SCRIPT$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_DATA])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_DATA])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_DATA$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__isrc], [' -I$(srcdir)'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__isrc])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__isrc$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([am__isrc])
+m4trace:configure.ac:4: -1- AC_SUBST([CYGPATH_W])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([CYGPATH_W])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^CYGPATH_W$])
+m4trace:configure.ac:4: -1- AC_SUBST([PACKAGE], ['AC_PACKAGE_TARNAME'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([PACKAGE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- AC_SUBST([VERSION], ['AC_PACKAGE_VERSION'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([VERSION])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^PACKAGE$])
+m4trace:configure.ac:4: -1- AH_OUTPUT([PACKAGE], [/* Name of package */
+@%:@undef PACKAGE])
+m4trace:configure.ac:4: -1- AC_DEFINE_TRACE_LITERAL([VERSION])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^VERSION$])
+m4trace:configure.ac:4: -1- AH_OUTPUT([VERSION], [/* Version number of package */
+@%:@undef VERSION])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([missing])
+m4trace:configure.ac:4: -1- AC_SUBST([ACLOCAL])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([ACLOCAL])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^ACLOCAL$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOCONF])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOCONF])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOCONF$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOMAKE])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOMAKE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOMAKE$])
+m4trace:configure.ac:4: -1- AC_SUBST([AUTOHEADER])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AUTOHEADER])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AUTOHEADER$])
+m4trace:configure.ac:4: -1- AC_SUBST([MAKEINFO])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([MAKEINFO])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MAKEINFO$])
+m4trace:configure.ac:4: -1- AC_SUBST([install_sh])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([install_sh])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^install_sh$])
+m4trace:configure.ac:4: -1- AC_SUBST([STRIP])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([STRIP])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^STRIP$])
+m4trace:configure.ac:4: -1- AC_SUBST([INSTALL_STRIP_PROGRAM])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([INSTALL_STRIP_PROGRAM])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^INSTALL_STRIP_PROGRAM$])
+m4trace:configure.ac:4: -1- AC_REQUIRE_AUX_FILE([install-sh])
+m4trace:configure.ac:4: -1- AC_SUBST([MKDIR_P])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([MKDIR_P])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^MKDIR_P$])
+m4trace:configure.ac:4: -1- AC_SUBST([mkdir_p], ['$(MKDIR_P)'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([mkdir_p])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^mkdir_p$])
+m4trace:configure.ac:4: -1- AC_SUBST([AWK])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AWK])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:4: -1- AC_SUBST([SET_MAKE])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([SET_MAKE])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^SET_MAKE$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__leading_dot])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__leading_dot])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__leading_dot$])
+m4trace:configure.ac:4: -1- AC_SUBST([AMTAR], ['$${TAR-tar}'])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AMTAR])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AMTAR$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__tar])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__tar])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__tar$])
+m4trace:configure.ac:4: -1- AC_SUBST([am__untar])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([am__untar])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^am__untar$])
+m4trace:configure.ac:4: -1- AM_SILENT_RULES
+m4trace:configure.ac:4: -1- AC_SUBST([AM_V])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_V$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_V])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_V$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_DEFAULT_V])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_DEFAULT_VERBOSITY])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_DEFAULT_VERBOSITY])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_DEFAULT_VERBOSITY$])
+m4trace:configure.ac:4: -1- AC_SUBST([AM_BACKSLASH])
+m4trace:configure.ac:4: -1- AC_SUBST_TRACE([AM_BACKSLASH])
+m4trace:configure.ac:4: -1- m4_pattern_allow([^AM_BACKSLASH$])
+m4trace:configure.ac:4: -1- _AM_SUBST_NOTMAKE([AM_BACKSLASH])
+m4trace:configure.ac:6: -1- AC_SUBST([LN_S], [$as_ln_s])
+m4trace:configure.ac:6: -1- AC_SUBST_TRACE([LN_S])
+m4trace:configure.ac:6: -1- m4_pattern_allow([^LN_S$])
+m4trace:configure.ac:7: -1- AC_SUBST([AWK])
+m4trace:configure.ac:7: -1- AC_SUBST_TRACE([AWK])
+m4trace:configure.ac:7: -1- m4_pattern_allow([^AWK$])
+m4trace:configure.ac:12: -1- m4_pattern_forbid([^_?PKG_[A-Z_]+$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG(_(PATH|LIBDIR|SYSROOT_DIR|ALLOW_SYSTEM_(CFLAGS|LIBS)))?$])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_(DISABLE_UNINSTALLED|TOP_BUILD_DIR|DEBUG_SPEW)$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG_PATH])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG_PATH])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_PATH$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG_LIBDIR])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG_LIBDIR])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG_LIBDIR$])
+m4trace:configure.ac:12: -1- AC_SUBST([PKG_CONFIG])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([PKG_CONFIG])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^PKG_CONFIG$])
+m4trace:configure.ac:12: -1- AC_SUBST([APERTIUM_CFLAGS])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([APERTIUM_CFLAGS])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_CFLAGS$])
+m4trace:configure.ac:12: -1- AC_SUBST([APERTIUM_LIBS])
+m4trace:configure.ac:12: -1- AC_SUBST_TRACE([APERTIUM_LIBS])
+m4trace:configure.ac:12: -1- m4_pattern_allow([^APERTIUM_LIBS$])
+m4trace:configure.ac:13: -1- AC_SUBST([LTTOOLBOX_CFLAGS])
+m4trace:configure.ac:13: -1- AC_SUBST_TRACE([LTTOOLBOX_CFLAGS])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_CFLAGS$])
+m4trace:configure.ac:13: -1- AC_SUBST([LTTOOLBOX_LIBS])
+m4trace:configure.ac:13: -1- AC_SUBST_TRACE([LTTOOLBOX_LIBS])
+m4trace:configure.ac:13: -1- m4_pattern_allow([^LTTOOLBOX_LIBS$])
+m4trace:configure.ac:15: -1- AC_SUBST([CGCOMP])
+m4trace:configure.ac:15: -1- AC_SUBST_TRACE([CGCOMP])
+m4trace:configure.ac:15: -1- m4_pattern_allow([^CGCOMP$])
+m4trace:configure.ac:19: -1- m4_pattern_allow([^ap_include$])
+m4trace:configure.ac:21: -1- AC_CONFIG_FILES([Makefile apertium-rus.pc])
+m4trace:configure.ac:21: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
+You should run autoupdate.], [])
+m4trace:configure.ac:21: -1- AC_SUBST([LIB@&t@OBJS], [$ac_libobjs])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([LIB@&t@OBJS])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LIB@&t@OBJS$])
+m4trace:configure.ac:21: -1- AC_SUBST([LTLIBOBJS], [$ac_ltlibobjs])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([LTLIBOBJS])
+m4trace:configure.ac:21: -1- m4_pattern_allow([^LTLIBOBJS$])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([top_builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([top_build_prefix])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([top_srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_top_srcdir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([abs_top_builddir])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([INSTALL])
+m4trace:configure.ac:21: -1- AC_SUBST_TRACE([MKDIR_P])
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.log
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.log	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.log	(revision 70339)
@@ -0,0 +1,241 @@
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} configure 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ ./configure 
+
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = NM-HP
+uname -m = x86_64
+uname -r = 3.13.0-30-generic
+uname -s = Linux
+uname -v = #55-Ubuntu SMP Fri Jul 4 21:40:53 UTC 2014
+
+/usr/bin/uname -p = unknown
+/bin/uname -X     = unknown
+
+/bin/arch              = unknown
+/usr/bin/arch -k       = unknown
+/usr/convex/getsysinfo = unknown
+/usr/bin/hostinfo      = unknown
+/bin/machine           = unknown
+/usr/bin/oslevel       = unknown
+/bin/universe          = unknown
+
+PATH: /usr/local/sbin
+PATH: /usr/local/bin
+PATH: /usr/sbin
+PATH: /usr/bin
+PATH: /sbin
+PATH: /bin
+PATH: /usr/games
+PATH: /usr/local/games
+PATH: /usr/local/bin
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+configure:1788: checking for a BSD-compatible install
+configure:1856: result: /usr/bin/install -c
+configure:1867: checking whether build environment is sane
+configure:1922: result: yes
+configure:2073: checking for a thread-safe mkdir -p
+configure:2112: result: /bin/mkdir -p
+configure:2119: checking for gawk
+configure:2135: found /usr/bin/gawk
+configure:2146: result: gawk
+configure:2157: checking whether make sets $(MAKE)
+configure:2179: result: yes
+configure:2208: checking whether make supports nested variables
+configure:2225: result: yes
+configure:2351: checking whether ln -s works
+configure:2355: result: yes
+configure:2366: checking for gawk
+configure:2393: result: gawk
+configure:2462: checking for pkg-config
+configure:2480: found /usr/bin/pkg-config
+configure:2492: result: /usr/bin/pkg-config
+configure:2517: checking pkg-config is at least version 0.9.0
+configure:2520: result: yes
+configure:2530: checking for APERTIUM
+configure:2537: $PKG_CONFIG --exists --print-errors "apertium >= 3.4.0"
+configure:2540: $? = 0
+configure:2554: $PKG_CONFIG --exists --print-errors "apertium >= 3.4.0"
+configure:2557: $? = 0
+configure:2615: result: yes
+configure:2621: checking for LTTOOLBOX
+configure:2628: $PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2"
+configure:2631: $? = 0
+configure:2645: $PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2"
+configure:2648: $? = 0
+configure:2706: result: yes
+configure:2713: checking for cg-comp
+configure:2731: found /usr/bin/cg-comp
+configure:2744: result: /usr/bin/cg-comp
+configure:2969: checking that generated files are newer than configure
+configure:2975: result: done
+configure:2983: creating ./config.status
+
+## ---------------------- ##
+## Running config.status. ##
+## ---------------------- ##
+
+This file was extended by Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = 
+  CONFIG_HEADERS  = 
+  CONFIG_LINKS    = 
+  CONFIG_COMMANDS = 
+  $ ./config.status 
+
+on NM-HP
+
+config.status:782: creating Makefile
+config.status:782: creating apertium-rus.pc
+
+## ---------------- ##
+## Cache variables. ##
+## ---------------- ##
+
+ac_cv_env_APERTIUM_CFLAGS_set=
+ac_cv_env_APERTIUM_CFLAGS_value=
+ac_cv_env_APERTIUM_LIBS_set=
+ac_cv_env_APERTIUM_LIBS_value=
+ac_cv_env_LTTOOLBOX_CFLAGS_set=
+ac_cv_env_LTTOOLBOX_CFLAGS_value=
+ac_cv_env_LTTOOLBOX_LIBS_set=
+ac_cv_env_LTTOOLBOX_LIBS_value=
+ac_cv_env_PKG_CONFIG_LIBDIR_set=
+ac_cv_env_PKG_CONFIG_LIBDIR_value=
+ac_cv_env_PKG_CONFIG_PATH_set=set
+ac_cv_env_PKG_CONFIG_PATH_value=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig
+ac_cv_env_PKG_CONFIG_set=
+ac_cv_env_PKG_CONFIG_value=
+ac_cv_env_build_alias_set=
+ac_cv_env_build_alias_value=
+ac_cv_env_host_alias_set=
+ac_cv_env_host_alias_value=
+ac_cv_env_target_alias_set=
+ac_cv_env_target_alias_value=
+ac_cv_path_CGCOMP=/usr/bin/cg-comp
+ac_cv_path_ac_pt_PKG_CONFIG=/usr/bin/pkg-config
+ac_cv_path_install='/usr/bin/install -c'
+ac_cv_path_mkdir=/bin/mkdir
+ac_cv_prog_AWK=gawk
+ac_cv_prog_make_make_set=yes
+am_cv_make_support_nested_variables=yes
+pkg_cv_APERTIUM_CFLAGS='-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+pkg_cv_APERTIUM_LIBS='-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  '
+pkg_cv_LTTOOLBOX_CFLAGS='-I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+pkg_cv_LTTOOLBOX_LIBS='-L/usr/local/lib -llttoolbox3 -lxml2  '
+
+## ----------------- ##
+## Output variables. ##
+## ----------------- ##
+
+ACLOCAL='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing aclocal-1.14'
+AMTAR='$${TAR-tar}'
+AM_BACKSLASH='\'
+AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+AM_DEFAULT_VERBOSITY='1'
+AM_V='$(V)'
+APERTIUM_CFLAGS='-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+APERTIUM_LIBS='-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  '
+AUTOCONF='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing autoconf'
+AUTOHEADER='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing autoheader'
+AUTOMAKE='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing automake-1.14'
+AWK='gawk'
+CGCOMP='/usr/bin/cg-comp'
+CYGPATH_W='echo'
+DEFS='-DPACKAGE_NAME=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\" -DPACKAGE_TARNAME=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE_VERSION=\"0.1.0\" -DPACKAGE_STRING=\"Apertium\ \{\{languageName1\}\}-\{\{languageName2\}\}\ 0.1.0\" -DPACKAGE_BUGREPORT=\"super-antispam@ya.ru\" -DPACKAGE_URL=\"http://wiki.apertium.org/wiki/Apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DPACKAGE=\"apertium-\{\{languageCode1\}\}-\{\{languageCode2\}\}\" -DVERSION=\"0.1.0\"'
+ECHO_C=''
+ECHO_N='-n'
+ECHO_T=''
+INSTALL_DATA='${INSTALL} -m 644'
+INSTALL_PROGRAM='${INSTALL}'
+INSTALL_SCRIPT='${INSTALL}'
+INSTALL_STRIP_PROGRAM='$(install_sh) -c -s'
+LIBOBJS=''
+LIBS=''
+LN_S='ln -s'
+LTLIBOBJS=''
+LTTOOLBOX_CFLAGS='-I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  '
+LTTOOLBOX_LIBS='-L/usr/local/lib -llttoolbox3 -lxml2  '
+MAKEINFO='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing makeinfo'
+MKDIR_P='/bin/mkdir -p'
+PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PATH_SEPARATOR=':'
+PKG_CONFIG='/usr/bin/pkg-config'
+PKG_CONFIG_LIBDIR=''
+PKG_CONFIG_PATH='/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig'
+SET_MAKE=''
+SHELL='/bin/bash'
+STRIP=''
+VERSION='0.1.0'
+am__isrc=''
+am__leading_dot='.'
+am__tar='$${TAR-tar} chof - "$$tardir"'
+am__untar='$${TAR-tar} xf -'
+bindir='${exec_prefix}/bin'
+build_alias=''
+datadir='${datarootdir}'
+datarootdir='${prefix}/share'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+dvidir='${docdir}'
+exec_prefix='${prefix}'
+host_alias=''
+htmldir='${docdir}'
+includedir='${prefix}/include'
+infodir='${datarootdir}/info'
+install_sh='${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/install-sh'
+libdir='${exec_prefix}/lib'
+libexecdir='${exec_prefix}/libexec'
+localedir='${datarootdir}/locale'
+localstatedir='${prefix}/var'
+mandir='${datarootdir}/man'
+mkdir_p='$(MKDIR_P)'
+oldincludedir='/usr/include'
+pdfdir='${docdir}'
+prefix='/usr/local'
+program_transform_name='s,x,x,'
+psdir='${docdir}'
+sbindir='${exec_prefix}/sbin'
+sharedstatedir='${prefix}/com'
+sysconfdir='${prefix}/etc'
+target_alias=''
+
+## ------------------- ##
+## File substitutions. ##
+## ------------------- ##
+
+ap_include='./ap_include.am'
+
+## ----------- ##
+## confdefs.h. ##
+## ----------- ##
+
+/* confdefs.h */
+#define PACKAGE_NAME "Apertium {{languageName1}}-{{languageName2}}"
+#define PACKAGE_TARNAME "apertium-{{languageCode1}}-{{languageCode2}}"
+#define PACKAGE_VERSION "0.1.0"
+#define PACKAGE_STRING "Apertium {{languageName1}}-{{languageName2}} 0.1.0"
+#define PACKAGE_BUGREPORT "super-antispam@ya.ru"
+#define PACKAGE_URL "http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}"
+#define PACKAGE "apertium-{{languageCode1}}-{{languageCode2}}"
+#define VERSION "0.1.0"
+
+configure: exit 0
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.status
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.status	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.status	(revision 70339)
@@ -0,0 +1,965 @@
+#! /bin/bash
+# Generated by configure.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=${CONFIG_SHELL-/bin/bash}
+export SHELL
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+# Files that config.status was made for.
+config_files=" Makefile apertium-rus.pc"
+
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+ac_cs_config="'PKG_CONFIG_PATH=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig'"
+ac_cs_version="\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by ./configure, generated by GNU Autoconf 2.69,
+  with options \"$ac_cs_config\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus'
+srcdir='.'
+INSTALL='/usr/bin/install -c'
+MKDIR_P='/bin/mkdir -p'
+AWK='gawk'
+test -n "$AWK" || AWK=awk
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+if $ac_cs_recheck; then
+  set X /bin/bash './configure'  'PKG_CONFIG_PATH=/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig' $ac_configure_extra_args --no-create --no-recursion
+  shift
+  $as_echo "running CONFIG_SHELL=/bin/bash $*" >&6
+  CONFIG_SHELL='/bin/bash'
+  export CONFIG_SHELL
+  exec "$@"
+fi
+
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-rus.pc") CONFIG_FILES="$CONFIG_FILES apertium-rus.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+cat >>"$ac_tmp/subs1.awk" <<\_ACAWK &&
+F["ap_include"]="./ap_include.am"
+_ACAWK
+cat >>"$ac_tmp/subs1.awk" <<\_ACAWK &&
+S["LTLIBOBJS"]=""
+S["LIBOBJS"]=""
+S["CGCOMP"]="/usr/bin/cg-comp"
+S["LTTOOLBOX_LIBS"]="-L/usr/local/lib -llttoolbox3 -lxml2  "
+S["LTTOOLBOX_CFLAGS"]="-I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I/usr/include/libxml2  "
+S["APERTIUM_LIBS"]="-L/usr/local/lib -lapertium3 -llttoolbox3 -lxml2 -lpcre  "
+S["APERTIUM_CFLAGS"]="-I/usr/local/include/apertium-3.4 -I/usr/local/lib/apertium-3.4/include -I/usr/local/include/lttoolbox-3.3 -I/usr/local/lib/lttoolbox-3.3/include -I"\
+"/usr/include/libxml2  "
+S["PKG_CONFIG_LIBDIR"]=""
+S["PKG_CONFIG_PATH"]="/usr/local/lib/pkgconfig::/usr/local/share/pkgconfig:/usr/local/lib/pkgconfig"
+S["PKG_CONFIG"]="/usr/bin/pkg-config"
+S["LN_S"]="ln -s"
+S["AM_BACKSLASH"]="\\"
+S["AM_DEFAULT_VERBOSITY"]="1"
+S["AM_DEFAULT_V"]="$(AM_DEFAULT_VERBOSITY)"
+S["AM_V"]="$(V)"
+S["am__untar"]="$${TAR-tar} xf -"
+S["am__tar"]="$${TAR-tar} chof - \"$$tardir\""
+S["AMTAR"]="$${TAR-tar}"
+S["am__leading_dot"]="."
+S["SET_MAKE"]=""
+S["AWK"]="gawk"
+S["mkdir_p"]="$(MKDIR_P)"
+S["MKDIR_P"]="/bin/mkdir -p"
+S["INSTALL_STRIP_PROGRAM"]="$(install_sh) -c -s"
+S["STRIP"]=""
+S["install_sh"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/install-sh"
+S["MAKEINFO"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing makeinfo"
+S["AUTOHEADER"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing autoheader"
+S["AUTOMAKE"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing automake-1.14"
+S["AUTOCONF"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing autoconf"
+S["ACLOCAL"]="${SHELL} /home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/missing aclocal-1.14"
+S["VERSION"]="0.1.0"
+S["PACKAGE"]="apertium-{{languageCode1}}-{{languageCode2}}"
+S["CYGPATH_W"]="echo"
+S["am__isrc"]=""
+S["INSTALL_DATA"]="${INSTALL} -m 644"
+S["INSTALL_SCRIPT"]="${INSTALL}"
+S["INSTALL_PROGRAM"]="${INSTALL}"
+S["target_alias"]=""
+S["host_alias"]=""
+S["build_alias"]=""
+S["LIBS"]=""
+S["ECHO_T"]=""
+S["ECHO_N"]="-n"
+S["ECHO_C"]=""
+S["DEFS"]="-DPACKAGE_NAME=\\\"Apertium\\ \\{\\{languageName1\\}\\}-\\{\\{languageName2\\}\\}\\\" -DPACKAGE_TARNAME=\\\"apertium-\\{\\{languageCode1\\}\\}-\\{\\{languageCode2\\}\\}\\\" "\
+"-DPACKAGE_VERSION=\\\"0.1.0\\\" -DPACKAGE_STRING=\\\"Apertium\\ \\{\\{languageName1\\}\\}-\\{\\{languageName2\\}\\}\\ 0.1.0\\\" -DPACKAGE_BUGREPORT=\\\"super-antispam@y"\
+"a.ru\\\" -DPACKAGE_URL=\\\"http://wiki.apertium.org/wiki/Apertium-\\{\\{languageCode1\\}\\}-\\{\\{languageCode2\\}\\}\\\" -DPACKAGE=\\\"apertium-\\{\\{languageCode1\\}"\
+"\\}-\\{\\{languageCode2\\}\\}\\\" -DVERSION=\\\"0.1.0\\\""
+S["mandir"]="${datarootdir}/man"
+S["localedir"]="${datarootdir}/locale"
+S["libdir"]="${exec_prefix}/lib"
+S["psdir"]="${docdir}"
+S["pdfdir"]="${docdir}"
+S["dvidir"]="${docdir}"
+S["htmldir"]="${docdir}"
+S["infodir"]="${datarootdir}/info"
+S["docdir"]="${datarootdir}/doc/${PACKAGE_TARNAME}"
+S["oldincludedir"]="/usr/include"
+S["includedir"]="${prefix}/include"
+S["localstatedir"]="${prefix}/var"
+S["sharedstatedir"]="${prefix}/com"
+S["sysconfdir"]="${prefix}/etc"
+S["datadir"]="${datarootdir}"
+S["datarootdir"]="${prefix}/share"
+S["libexecdir"]="${exec_prefix}/libexec"
+S["sbindir"]="${exec_prefix}/sbin"
+S["bindir"]="${exec_prefix}/bin"
+S["program_transform_name"]="s,x,x,"
+S["prefix"]="/usr/local"
+S["exec_prefix"]="${prefix}"
+S["PACKAGE_URL"]="http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}"
+S["PACKAGE_BUGREPORT"]="super-antispam@ya.ru"
+S["PACKAGE_STRING"]="Apertium {{languageName1}}-{{languageName2}} 0.1.0"
+S["PACKAGE_VERSION"]="0.1.0"
+S["PACKAGE_TARNAME"]="apertium-{{languageCode1}}-{{languageCode2}}"
+S["PACKAGE_NAME"]="Apertium {{languageName1}}-{{languageName2}}"
+S["PATH_SEPARATOR"]=":"
+S["SHELL"]="/bin/bash"
+_ACAWK
+cat >>"$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  $ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      $ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+$ac_cs_awk_pipe_fini
+_ACAWK
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+  ac_datarootdir_hack='
+  s&@datadir@&${datarootdir}&g
+  s&@docdir@&${datarootdir}/doc/${PACKAGE_TARNAME}&g
+  s&@infodir@&${datarootdir}/info&g
+  s&@localedir@&${datarootdir}/locale&g
+  s&@mandir@&${datarootdir}/man&g
+  s&\${datarootdir}&${prefix}/share&g' ;;
+esac
+ac_sed_extra="/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}
+
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+
+
+
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/config.status
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure	(revision 70339)
@@ -0,0 +1,4043 @@
+#! /bin/sh
+# Guess values for system-dependent variables and create Makefiles.
+# Generated by GNU Autoconf 2.69 for Apertium {{languageName1}}-{{languageName2}} 0.1.0.
+#
+# Report bugs to <super-antispam@ya.ru>.
+#
+#
+# Copyright (C) 1992-1996, 1998-2012 Free Software Foundation, Inc.
+#
+#
+# This configure script is free software; the Free Software Foundation
+# gives unlimited permission to copy, distribute and modify it.
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+# Use a proper internal environment variable to ensure we don't fall
+  # into an infinite loop, continuously re-executing ourselves.
+  if test x"${_as_can_reexec}" != xno && test "x$CONFIG_SHELL" != x; then
+    _as_can_reexec=no; export _as_can_reexec;
+    # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+as_fn_exit 255
+  fi
+  # We don't want this to propagate to other subprocesses.
+          { _as_can_reexec=; unset _as_can_reexec;}
+if test "x$CONFIG_SHELL" = x; then
+  as_bourne_compatible="if test -n \"\${ZSH_VERSION+set}\" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on \${1+\"\$@\"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '\${1+\"\$@\"}'='\"\$@\"'
+  setopt NO_GLOB_SUBST
+else
+  case \`(set -o) 2>/dev/null\` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+"
+  as_required="as_fn_return () { (exit \$1); }
+as_fn_success () { as_fn_return 0; }
+as_fn_failure () { as_fn_return 1; }
+as_fn_ret_success () { return 0; }
+as_fn_ret_failure () { return 1; }
+
+exitcode=0
+as_fn_success || { exitcode=1; echo as_fn_success failed.; }
+as_fn_failure && { exitcode=1; echo as_fn_failure succeeded.; }
+as_fn_ret_success || { exitcode=1; echo as_fn_ret_success failed.; }
+as_fn_ret_failure && { exitcode=1; echo as_fn_ret_failure succeeded.; }
+if ( set x; as_fn_ret_success y && test x = \"\$1\" ); then :
+
+else
+  exitcode=1; echo positional parameters were not saved.
+fi
+test x\$exitcode = x0 || exit 1
+test -x / || exit 1"
+  as_suggested="  as_lineno_1=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_1a=\$LINENO
+  as_lineno_2=";as_suggested=$as_suggested$LINENO;as_suggested=$as_suggested" as_lineno_2a=\$LINENO
+  eval 'test \"x\$as_lineno_1'\$as_run'\" != \"x\$as_lineno_2'\$as_run'\" &&
+  test \"x\`expr \$as_lineno_1'\$as_run' + 1\`\" = \"x\$as_lineno_2'\$as_run'\"' || exit 1"
+  if (eval "$as_required") 2>/dev/null; then :
+  as_have_required=yes
+else
+  as_have_required=no
+fi
+  if test x$as_have_required = xyes && (eval "$as_suggested") 2>/dev/null; then :
+
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+as_found=false
+for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+  as_found=:
+  case $as_dir in #(
+	 /*)
+	   for as_base in sh bash ksh sh5; do
+	     # Try only shells that exist, to save several forks.
+	     as_shell=$as_dir/$as_base
+	     if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
+		    { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  CONFIG_SHELL=$as_shell as_have_required=yes
+		   if { $as_echo "$as_bourne_compatible""$as_suggested" | as_run=a "$as_shell"; } 2>/dev/null; then :
+  break 2
+fi
+fi
+	   done;;
+       esac
+  as_found=false
+done
+$as_found || { if { test -f "$SHELL" || test -f "$SHELL.exe"; } &&
+	      { $as_echo "$as_bourne_compatible""$as_required" | as_run=a "$SHELL"; } 2>/dev/null; then :
+  CONFIG_SHELL=$SHELL as_have_required=yes
+fi; }
+IFS=$as_save_IFS
+
+
+      if test "x$CONFIG_SHELL" != x; then :
+  export CONFIG_SHELL
+             # We cannot yet assume a decent shell, so we have to provide a
+# neutralization value for shells without unset; and this also
+# works around shells that cannot unset nonexistent variables.
+# Preserve -v and -x to the replacement shell.
+BASH_ENV=/dev/null
+ENV=/dev/null
+(unset BASH_ENV) >/dev/null 2>&1 && unset BASH_ENV ENV
+case $- in # ((((
+  *v*x* | *x*v* ) as_opts=-vx ;;
+  *v* ) as_opts=-v ;;
+  *x* ) as_opts=-x ;;
+  * ) as_opts= ;;
+esac
+exec $CONFIG_SHELL $as_opts "$as_myself" ${1+"$@"}
+# Admittedly, this is quite paranoid, since all the known shells bail
+# out after a failed `exec'.
+$as_echo "$0: could not re-execute with $CONFIG_SHELL" >&2
+exit 255
+fi
+
+    if test x$as_have_required = xno; then :
+  $as_echo "$0: This script requires a shell more modern than all"
+  $as_echo "$0: the shells that I found on your system."
+  if test x${ZSH_VERSION+set} = xset ; then
+    $as_echo "$0: In particular, zsh $ZSH_VERSION has bugs and should"
+    $as_echo "$0: be upgraded to zsh 4.3.4 or later."
+  else
+    $as_echo "$0: Please tell bug-autoconf@gnu.org and
+$0: super-antispam@ya.ru about your system, including any
+$0: error possibly output before this message. Then install
+$0: a modern shell, or manually run the script under such a
+$0: shell if you do have one."
+  fi
+  exit 1
+fi
+fi
+fi
+SHELL=${CONFIG_SHELL-/bin/sh}
+export SHELL
+# Unset more variables known to interfere with behavior of common tools.
+CLICOLOR_FORCE= GREP_OPTIONS=
+unset CLICOLOR_FORCE GREP_OPTIONS
+
+## --------------------- ##
+## M4sh Shell Functions. ##
+## --------------------- ##
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+
+  as_lineno_1=$LINENO as_lineno_1a=$LINENO
+  as_lineno_2=$LINENO as_lineno_2a=$LINENO
+  eval 'test "x$as_lineno_1'$as_run'" != "x$as_lineno_2'$as_run'" &&
+  test "x`expr $as_lineno_1'$as_run' + 1`" = "x$as_lineno_2'$as_run'"' || {
+  # Blame Lee E. McMahon (1931-1989) for sed's syntax.  :-)
+  sed -n '
+    p
+    /[$]LINENO/=
+  ' <$as_myself |
+    sed '
+      s/[$]LINENO.*/&-/
+      t lineno
+      b
+      :lineno
+      N
+      :loop
+      s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
+      t loop
+      s/-\n.*//
+    ' >$as_me.lineno &&
+  chmod +x "$as_me.lineno" ||
+    { $as_echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2; as_fn_exit 1; }
+
+  # If we had to re-execute with $CONFIG_SHELL, we're ensured to have
+  # already done that, so ensure we don't try to do so again and fall
+  # in an infinite loop.  This has already happened in practice.
+  _as_can_reexec=no; export _as_can_reexec
+  # Don't try to exec as it changes $[0], causing all sort of problems
+  # (the dirname of $[0] is not the place where we might find the
+  # original and so on.  Autoconf is especially sensitive to this).
+  . "./$as_me.lineno"
+  # Exit status is that of the last command.
+  exit
+}
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+test -n "$DJDIR" || exec 7<&0 </dev/null
+exec 6>&1
+
+# Name of the host.
+# hostname on some systems (SVR3.2, old GNU/Linux) returns a bogus exit status,
+# so uname gets run too.
+ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
+
+#
+# Initializations.
+#
+ac_default_prefix=/usr/local
+ac_clean_files=
+ac_config_libobj_dir=.
+LIBOBJS=
+cross_compiling=no
+subdirs=
+MFLAGS=
+MAKEFLAGS=
+
+# Identity of this package.
+PACKAGE_NAME='Apertium {{languageName1}}-{{languageName2}}'
+PACKAGE_TARNAME='apertium-{{languageCode1}}-{{languageCode2}}'
+PACKAGE_VERSION='0.1.0'
+PACKAGE_STRING='Apertium {{languageName1}}-{{languageName2}} 0.1.0'
+PACKAGE_BUGREPORT='super-antispam@ya.ru'
+PACKAGE_URL='http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}'
+
+ac_subst_vars='LTLIBOBJS
+LIBOBJS
+CGCOMP
+LTTOOLBOX_LIBS
+LTTOOLBOX_CFLAGS
+APERTIUM_LIBS
+APERTIUM_CFLAGS
+PKG_CONFIG_LIBDIR
+PKG_CONFIG_PATH
+PKG_CONFIG
+LN_S
+AM_BACKSLASH
+AM_DEFAULT_VERBOSITY
+AM_DEFAULT_V
+AM_V
+am__untar
+am__tar
+AMTAR
+am__leading_dot
+SET_MAKE
+AWK
+mkdir_p
+MKDIR_P
+INSTALL_STRIP_PROGRAM
+STRIP
+install_sh
+MAKEINFO
+AUTOHEADER
+AUTOMAKE
+AUTOCONF
+ACLOCAL
+VERSION
+PACKAGE
+CYGPATH_W
+am__isrc
+INSTALL_DATA
+INSTALL_SCRIPT
+INSTALL_PROGRAM
+target_alias
+host_alias
+build_alias
+LIBS
+ECHO_T
+ECHO_N
+ECHO_C
+DEFS
+mandir
+localedir
+libdir
+psdir
+pdfdir
+dvidir
+htmldir
+infodir
+docdir
+oldincludedir
+includedir
+localstatedir
+sharedstatedir
+sysconfdir
+datadir
+datarootdir
+libexecdir
+sbindir
+bindir
+program_transform_name
+prefix
+exec_prefix
+PACKAGE_URL
+PACKAGE_BUGREPORT
+PACKAGE_STRING
+PACKAGE_VERSION
+PACKAGE_TARNAME
+PACKAGE_NAME
+PATH_SEPARATOR
+SHELL'
+ac_subst_files='ap_include'
+ac_user_opts='
+enable_option_checking
+enable_silent_rules
+'
+      ac_precious_vars='build_alias
+host_alias
+target_alias
+PKG_CONFIG
+PKG_CONFIG_PATH
+PKG_CONFIG_LIBDIR
+APERTIUM_CFLAGS
+APERTIUM_LIBS
+LTTOOLBOX_CFLAGS
+LTTOOLBOX_LIBS'
+
+
+# Initialize some variables set by options.
+ac_init_help=
+ac_init_version=false
+ac_unrecognized_opts=
+ac_unrecognized_sep=
+# The variables have the same names as the options, with
+# dashes changed to underlines.
+cache_file=/dev/null
+exec_prefix=NONE
+no_create=
+no_recursion=
+prefix=NONE
+program_prefix=NONE
+program_suffix=NONE
+program_transform_name=s,x,x,
+silent=
+site=
+srcdir=
+verbose=
+x_includes=NONE
+x_libraries=NONE
+
+# Installation directory options.
+# These are left unexpanded so users can "make install exec_prefix=/foo"
+# and all the variables that are supposed to be based on exec_prefix
+# by default will actually change.
+# Use braces instead of parens because sh, perl, etc. also accept them.
+# (The list follows the same order as the GNU Coding Standards.)
+bindir='${exec_prefix}/bin'
+sbindir='${exec_prefix}/sbin'
+libexecdir='${exec_prefix}/libexec'
+datarootdir='${prefix}/share'
+datadir='${datarootdir}'
+sysconfdir='${prefix}/etc'
+sharedstatedir='${prefix}/com'
+localstatedir='${prefix}/var'
+includedir='${prefix}/include'
+oldincludedir='/usr/include'
+docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
+infodir='${datarootdir}/info'
+htmldir='${docdir}'
+dvidir='${docdir}'
+pdfdir='${docdir}'
+psdir='${docdir}'
+libdir='${exec_prefix}/lib'
+localedir='${datarootdir}/locale'
+mandir='${datarootdir}/man'
+
+ac_prev=
+ac_dashdash=
+for ac_option
+do
+  # If the previous option needs an argument, assign it.
+  if test -n "$ac_prev"; then
+    eval $ac_prev=\$ac_option
+    ac_prev=
+    continue
+  fi
+
+  case $ac_option in
+  *=?*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
+  *=)   ac_optarg= ;;
+  *)    ac_optarg=yes ;;
+  esac
+
+  # Accept the important Cygnus configure options, so we can diagnose typos.
+
+  case $ac_dashdash$ac_option in
+  --)
+    ac_dashdash=yes ;;
+
+  -bindir | --bindir | --bindi | --bind | --bin | --bi)
+    ac_prev=bindir ;;
+  -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
+    bindir=$ac_optarg ;;
+
+  -build | --build | --buil | --bui | --bu)
+    ac_prev=build_alias ;;
+  -build=* | --build=* | --buil=* | --bui=* | --bu=*)
+    build_alias=$ac_optarg ;;
+
+  -cache-file | --cache-file | --cache-fil | --cache-fi \
+  | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
+    ac_prev=cache_file ;;
+  -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
+  | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
+    cache_file=$ac_optarg ;;
+
+  --config-cache | -C)
+    cache_file=config.cache ;;
+
+  -datadir | --datadir | --datadi | --datad)
+    ac_prev=datadir ;;
+  -datadir=* | --datadir=* | --datadi=* | --datad=*)
+    datadir=$ac_optarg ;;
+
+  -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
+  | --dataroo | --dataro | --datar)
+    ac_prev=datarootdir ;;
+  -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
+  | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
+    datarootdir=$ac_optarg ;;
+
+  -disable-* | --disable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--disable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=no ;;
+
+  -docdir | --docdir | --docdi | --doc | --do)
+    ac_prev=docdir ;;
+  -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
+    docdir=$ac_optarg ;;
+
+  -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
+    ac_prev=dvidir ;;
+  -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
+    dvidir=$ac_optarg ;;
+
+  -enable-* | --enable-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid feature name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"enable_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--enable-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval enable_$ac_useropt=\$ac_optarg ;;
+
+  -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
+  | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
+  | --exec | --exe | --ex)
+    ac_prev=exec_prefix ;;
+  -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
+  | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
+  | --exec=* | --exe=* | --ex=*)
+    exec_prefix=$ac_optarg ;;
+
+  -gas | --gas | --ga | --g)
+    # Obsolete; use --with-gas.
+    with_gas=yes ;;
+
+  -help | --help | --hel | --he | -h)
+    ac_init_help=long ;;
+  -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
+    ac_init_help=recursive ;;
+  -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
+    ac_init_help=short ;;
+
+  -host | --host | --hos | --ho)
+    ac_prev=host_alias ;;
+  -host=* | --host=* | --hos=* | --ho=*)
+    host_alias=$ac_optarg ;;
+
+  -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
+    ac_prev=htmldir ;;
+  -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
+  | --ht=*)
+    htmldir=$ac_optarg ;;
+
+  -includedir | --includedir | --includedi | --included | --include \
+  | --includ | --inclu | --incl | --inc)
+    ac_prev=includedir ;;
+  -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
+  | --includ=* | --inclu=* | --incl=* | --inc=*)
+    includedir=$ac_optarg ;;
+
+  -infodir | --infodir | --infodi | --infod | --info | --inf)
+    ac_prev=infodir ;;
+  -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
+    infodir=$ac_optarg ;;
+
+  -libdir | --libdir | --libdi | --libd)
+    ac_prev=libdir ;;
+  -libdir=* | --libdir=* | --libdi=* | --libd=*)
+    libdir=$ac_optarg ;;
+
+  -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
+  | --libexe | --libex | --libe)
+    ac_prev=libexecdir ;;
+  -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
+  | --libexe=* | --libex=* | --libe=*)
+    libexecdir=$ac_optarg ;;
+
+  -localedir | --localedir | --localedi | --localed | --locale)
+    ac_prev=localedir ;;
+  -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
+    localedir=$ac_optarg ;;
+
+  -localstatedir | --localstatedir | --localstatedi | --localstated \
+  | --localstate | --localstat | --localsta | --localst | --locals)
+    ac_prev=localstatedir ;;
+  -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
+  | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
+    localstatedir=$ac_optarg ;;
+
+  -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
+    ac_prev=mandir ;;
+  -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
+    mandir=$ac_optarg ;;
+
+  -nfp | --nfp | --nf)
+    # Obsolete; use --without-fp.
+    with_fp=no ;;
+
+  -no-create | --no-create | --no-creat | --no-crea | --no-cre \
+  | --no-cr | --no-c | -n)
+    no_create=yes ;;
+
+  -no-recursion | --no-recursion | --no-recursio | --no-recursi \
+  | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
+    no_recursion=yes ;;
+
+  -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
+  | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
+  | --oldin | --oldi | --old | --ol | --o)
+    ac_prev=oldincludedir ;;
+  -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
+  | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
+  | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
+    oldincludedir=$ac_optarg ;;
+
+  -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
+    ac_prev=prefix ;;
+  -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
+    prefix=$ac_optarg ;;
+
+  -program-prefix | --program-prefix | --program-prefi | --program-pref \
+  | --program-pre | --program-pr | --program-p)
+    ac_prev=program_prefix ;;
+  -program-prefix=* | --program-prefix=* | --program-prefi=* \
+  | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
+    program_prefix=$ac_optarg ;;
+
+  -program-suffix | --program-suffix | --program-suffi | --program-suff \
+  | --program-suf | --program-su | --program-s)
+    ac_prev=program_suffix ;;
+  -program-suffix=* | --program-suffix=* | --program-suffi=* \
+  | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
+    program_suffix=$ac_optarg ;;
+
+  -program-transform-name | --program-transform-name \
+  | --program-transform-nam | --program-transform-na \
+  | --program-transform-n | --program-transform- \
+  | --program-transform | --program-transfor \
+  | --program-transfo | --program-transf \
+  | --program-trans | --program-tran \
+  | --progr-tra | --program-tr | --program-t)
+    ac_prev=program_transform_name ;;
+  -program-transform-name=* | --program-transform-name=* \
+  | --program-transform-nam=* | --program-transform-na=* \
+  | --program-transform-n=* | --program-transform-=* \
+  | --program-transform=* | --program-transfor=* \
+  | --program-transfo=* | --program-transf=* \
+  | --program-trans=* | --program-tran=* \
+  | --progr-tra=* | --program-tr=* | --program-t=*)
+    program_transform_name=$ac_optarg ;;
+
+  -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
+    ac_prev=pdfdir ;;
+  -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
+    pdfdir=$ac_optarg ;;
+
+  -psdir | --psdir | --psdi | --psd | --ps)
+    ac_prev=psdir ;;
+  -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
+    psdir=$ac_optarg ;;
+
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil)
+    silent=yes ;;
+
+  -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
+    ac_prev=sbindir ;;
+  -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
+  | --sbi=* | --sb=*)
+    sbindir=$ac_optarg ;;
+
+  -sharedstatedir | --sharedstatedir | --sharedstatedi \
+  | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
+  | --sharedst | --shareds | --shared | --share | --shar \
+  | --sha | --sh)
+    ac_prev=sharedstatedir ;;
+  -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
+  | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
+  | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
+  | --sha=* | --sh=*)
+    sharedstatedir=$ac_optarg ;;
+
+  -site | --site | --sit)
+    ac_prev=site ;;
+  -site=* | --site=* | --sit=*)
+    site=$ac_optarg ;;
+
+  -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
+    ac_prev=srcdir ;;
+  -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
+    srcdir=$ac_optarg ;;
+
+  -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
+  | --syscon | --sysco | --sysc | --sys | --sy)
+    ac_prev=sysconfdir ;;
+  -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
+  | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
+    sysconfdir=$ac_optarg ;;
+
+  -target | --target | --targe | --targ | --tar | --ta | --t)
+    ac_prev=target_alias ;;
+  -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
+    target_alias=$ac_optarg ;;
+
+  -v | -verbose | --verbose | --verbos | --verbo | --verb)
+    verbose=yes ;;
+
+  -version | --version | --versio | --versi | --vers | -V)
+    ac_init_version=: ;;
+
+  -with-* | --with-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--with-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=\$ac_optarg ;;
+
+  -without-* | --without-*)
+    ac_useropt=`expr "x$ac_option" : 'x-*without-\(.*\)'`
+    # Reject names that are not valid shell variable names.
+    expr "x$ac_useropt" : ".*[^-+._$as_cr_alnum]" >/dev/null &&
+      as_fn_error $? "invalid package name: $ac_useropt"
+    ac_useropt_orig=$ac_useropt
+    ac_useropt=`$as_echo "$ac_useropt" | sed 's/[-+.]/_/g'`
+    case $ac_user_opts in
+      *"
+"with_$ac_useropt"
+"*) ;;
+      *) ac_unrecognized_opts="$ac_unrecognized_opts$ac_unrecognized_sep--without-$ac_useropt_orig"
+	 ac_unrecognized_sep=', ';;
+    esac
+    eval with_$ac_useropt=no ;;
+
+  --x)
+    # Obsolete; use --with-x.
+    with_x=yes ;;
+
+  -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
+  | --x-incl | --x-inc | --x-in | --x-i)
+    ac_prev=x_includes ;;
+  -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
+  | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
+    x_includes=$ac_optarg ;;
+
+  -x-libraries | --x-libraries | --x-librarie | --x-librari \
+  | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
+    ac_prev=x_libraries ;;
+  -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
+  | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
+    x_libraries=$ac_optarg ;;
+
+  -*) as_fn_error $? "unrecognized option: \`$ac_option'
+Try \`$0 --help' for more information"
+    ;;
+
+  *=*)
+    ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
+    # Reject names that are not valid shell variable names.
+    case $ac_envvar in #(
+      '' | [0-9]* | *[!_$as_cr_alnum]* )
+      as_fn_error $? "invalid variable name: \`$ac_envvar'" ;;
+    esac
+    eval $ac_envvar=\$ac_optarg
+    export $ac_envvar ;;
+
+  *)
+    # FIXME: should be removed in autoconf 3.0.
+    $as_echo "$as_me: WARNING: you should use --build, --host, --target" >&2
+    expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
+      $as_echo "$as_me: WARNING: invalid host type: $ac_option" >&2
+    : "${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}"
+    ;;
+
+  esac
+done
+
+if test -n "$ac_prev"; then
+  ac_option=--`echo $ac_prev | sed 's/_/-/g'`
+  as_fn_error $? "missing argument to $ac_option"
+fi
+
+if test -n "$ac_unrecognized_opts"; then
+  case $enable_option_checking in
+    no) ;;
+    fatal) as_fn_error $? "unrecognized options: $ac_unrecognized_opts" ;;
+    *)     $as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2 ;;
+  esac
+fi
+
+# Check all directory arguments for consistency.
+for ac_var in	exec_prefix prefix bindir sbindir libexecdir datarootdir \
+		datadir sysconfdir sharedstatedir localstatedir includedir \
+		oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
+		libdir localedir mandir
+do
+  eval ac_val=\$$ac_var
+  # Remove trailing slashes.
+  case $ac_val in
+    */ )
+      ac_val=`expr "X$ac_val" : 'X\(.*[^/]\)' \| "X$ac_val" : 'X\(.*\)'`
+      eval $ac_var=\$ac_val;;
+  esac
+  # Be sure to have absolute directory names.
+  case $ac_val in
+    [\\/$]* | ?:[\\/]* )  continue;;
+    NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
+  esac
+  as_fn_error $? "expected an absolute directory name for --$ac_var: $ac_val"
+done
+
+# There might be people who depend on the old broken behavior: `$host'
+# used to hold the argument of --host etc.
+# FIXME: To remove some day.
+build=$build_alias
+host=$host_alias
+target=$target_alias
+
+# FIXME: To remove some day.
+if test "x$host_alias" != x; then
+  if test "x$build_alias" = x; then
+    cross_compiling=maybe
+  elif test "x$build_alias" != "x$host_alias"; then
+    cross_compiling=yes
+  fi
+fi
+
+ac_tool_prefix=
+test -n "$host_alias" && ac_tool_prefix=$host_alias-
+
+test "$silent" = yes && exec 6>/dev/null
+
+
+ac_pwd=`pwd` && test -n "$ac_pwd" &&
+ac_ls_di=`ls -di .` &&
+ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
+  as_fn_error $? "working directory cannot be determined"
+test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
+  as_fn_error $? "pwd does not report name of working directory"
+
+
+# Find the source files, if location was not specified.
+if test -z "$srcdir"; then
+  ac_srcdir_defaulted=yes
+  # Try the directory containing this script, then the parent directory.
+  ac_confdir=`$as_dirname -- "$as_myself" ||
+$as_expr X"$as_myself" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_myself" : 'X\(//\)[^/]' \| \
+	 X"$as_myself" : 'X\(//\)$' \| \
+	 X"$as_myself" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_myself" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  srcdir=$ac_confdir
+  if test ! -r "$srcdir/$ac_unique_file"; then
+    srcdir=..
+  fi
+else
+  ac_srcdir_defaulted=no
+fi
+if test ! -r "$srcdir/$ac_unique_file"; then
+  test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
+  as_fn_error $? "cannot find sources ($ac_unique_file) in $srcdir"
+fi
+ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
+ac_abs_confdir=`(
+	cd "$srcdir" && test -r "./$ac_unique_file" || as_fn_error $? "$ac_msg"
+	pwd)`
+# When building in place, set srcdir=.
+if test "$ac_abs_confdir" = "$ac_pwd"; then
+  srcdir=.
+fi
+# Remove unnecessary trailing slashes from srcdir.
+# Double slashes in file names in object file debugging info
+# mess up M-x gdb in Emacs.
+case $srcdir in
+*/) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
+esac
+for ac_var in $ac_precious_vars; do
+  eval ac_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_env_${ac_var}_value=\$${ac_var}
+  eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
+  eval ac_cv_env_${ac_var}_value=\$${ac_var}
+done
+
+#
+# Report the --help message.
+#
+if test "$ac_init_help" = "long"; then
+  # Omit some internal or obsolete options to make the list less imposing.
+  # This message is too long to be a string in the A/UX 3.1 sh.
+  cat <<_ACEOF
+\`configure' configures Apertium {{languageName1}}-{{languageName2}} 0.1.0 to adapt to many kinds of systems.
+
+Usage: $0 [OPTION]... [VAR=VALUE]...
+
+To assign environment variables (e.g., CC, CFLAGS...), specify them as
+VAR=VALUE.  See below for descriptions of some of the useful variables.
+
+Defaults for the options are specified in brackets.
+
+Configuration:
+  -h, --help              display this help and exit
+      --help=short        display options specific to this package
+      --help=recursive    display the short help of all the included packages
+  -V, --version           display version information and exit
+  -q, --quiet, --silent   do not print \`checking ...' messages
+      --cache-file=FILE   cache test results in FILE [disabled]
+  -C, --config-cache      alias for \`--cache-file=config.cache'
+  -n, --no-create         do not create output files
+      --srcdir=DIR        find the sources in DIR [configure dir or \`..']
+
+Installation directories:
+  --prefix=PREFIX         install architecture-independent files in PREFIX
+                          [$ac_default_prefix]
+  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
+                          [PREFIX]
+
+By default, \`make install' will install all the files in
+\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc.  You can specify
+an installation prefix other than \`$ac_default_prefix' using \`--prefix',
+for instance \`--prefix=\$HOME'.
+
+For better control, use the options below.
+
+Fine tuning of the installation directories:
+  --bindir=DIR            user executables [EPREFIX/bin]
+  --sbindir=DIR           system admin executables [EPREFIX/sbin]
+  --libexecdir=DIR        program executables [EPREFIX/libexec]
+  --sysconfdir=DIR        read-only single-machine data [PREFIX/etc]
+  --sharedstatedir=DIR    modifiable architecture-independent data [PREFIX/com]
+  --localstatedir=DIR     modifiable single-machine data [PREFIX/var]
+  --libdir=DIR            object code libraries [EPREFIX/lib]
+  --includedir=DIR        C header files [PREFIX/include]
+  --oldincludedir=DIR     C header files for non-gcc [/usr/include]
+  --datarootdir=DIR       read-only arch.-independent data root [PREFIX/share]
+  --datadir=DIR           read-only architecture-independent data [DATAROOTDIR]
+  --infodir=DIR           info documentation [DATAROOTDIR/info]
+  --localedir=DIR         locale-dependent data [DATAROOTDIR/locale]
+  --mandir=DIR            man documentation [DATAROOTDIR/man]
+  --docdir=DIR            documentation root
+                          [DATAROOTDIR/doc/apertium-{{languageCode1}}-{{languageCode2}}]
+  --htmldir=DIR           html documentation [DOCDIR]
+  --dvidir=DIR            dvi documentation [DOCDIR]
+  --pdfdir=DIR            pdf documentation [DOCDIR]
+  --psdir=DIR             ps documentation [DOCDIR]
+_ACEOF
+
+  cat <<\_ACEOF
+
+Program names:
+  --program-prefix=PREFIX            prepend PREFIX to installed program names
+  --program-suffix=SUFFIX            append SUFFIX to installed program names
+  --program-transform-name=PROGRAM   run sed PROGRAM on installed program names
+_ACEOF
+fi
+
+if test -n "$ac_init_help"; then
+  case $ac_init_help in
+     short | recursive ) echo "Configuration of Apertium {{languageName1}}-{{languageName2}} 0.1.0:";;
+   esac
+  cat <<\_ACEOF
+
+Optional Features:
+  --disable-option-checking  ignore unrecognized --enable/--with options
+  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
+  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
+  --enable-silent-rules   less verbose build output (undo: "make V=1")
+  --disable-silent-rules  verbose build output (undo: "make V=0")
+
+Some influential environment variables:
+  PKG_CONFIG  path to pkg-config utility
+  PKG_CONFIG_PATH
+              directories to add to pkg-config's search path
+  PKG_CONFIG_LIBDIR
+              path overriding pkg-config's built-in search path
+  APERTIUM_CFLAGS
+              C compiler flags for APERTIUM, overriding pkg-config
+  APERTIUM_LIBS
+              linker flags for APERTIUM, overriding pkg-config
+  LTTOOLBOX_CFLAGS
+              C compiler flags for LTTOOLBOX, overriding pkg-config
+  LTTOOLBOX_LIBS
+              linker flags for LTTOOLBOX, overriding pkg-config
+
+Use these variables to override the choices made by `configure' or to help
+it to find libraries and programs with nonstandard names/locations.
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>.
+_ACEOF
+ac_status=$?
+fi
+
+if test "$ac_init_help" = "recursive"; then
+  # If there are subdirs, report their specific --help.
+  for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
+    test -d "$ac_dir" ||
+      { cd "$srcdir" && ac_pwd=`pwd` && srcdir=. && test -d "$ac_dir"; } ||
+      continue
+    ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+    cd "$ac_dir" || { ac_status=$?; continue; }
+    # Check for guested configure.
+    if test -f "$ac_srcdir/configure.gnu"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure.gnu" --help=recursive
+    elif test -f "$ac_srcdir/configure"; then
+      echo &&
+      $SHELL "$ac_srcdir/configure" --help=recursive
+    else
+      $as_echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
+    fi || ac_status=$?
+    cd "$ac_pwd" || { ac_status=$?; break; }
+  done
+fi
+
+test -n "$ac_init_help" && exit $ac_status
+if $ac_init_version; then
+  cat <<\_ACEOF
+Apertium {{languageName1}}-{{languageName2}} configure 0.1.0
+generated by GNU Autoconf 2.69
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This configure script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it.
+_ACEOF
+  exit
+fi
+
+## ------------------------ ##
+## Autoconf initialization. ##
+## ------------------------ ##
+cat >config.log <<_ACEOF
+This file contains any messages produced by compilers while
+running configure, to aid debugging if configure makes a mistake.
+
+It was created by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  $ $0 $@
+
+_ACEOF
+exec 5>>config.log
+{
+cat <<_ASUNAME
+## --------- ##
+## Platform. ##
+## --------- ##
+
+hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null     || echo unknown`
+
+/bin/arch              = `(/bin/arch) 2>/dev/null              || echo unknown`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null       || echo unknown`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
+/usr/bin/hostinfo      = `(/usr/bin/hostinfo) 2>/dev/null      || echo unknown`
+/bin/machine           = `(/bin/machine) 2>/dev/null           || echo unknown`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null       || echo unknown`
+/bin/universe          = `(/bin/universe) 2>/dev/null          || echo unknown`
+
+_ASUNAME
+
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    $as_echo "PATH: $as_dir"
+  done
+IFS=$as_save_IFS
+
+} >&5
+
+cat >&5 <<_ACEOF
+
+
+## ----------- ##
+## Core tests. ##
+## ----------- ##
+
+_ACEOF
+
+
+# Keep a trace of the command line.
+# Strip out --no-create and --no-recursion so they do not pile up.
+# Strip out --silent because we don't want to record it for future runs.
+# Also quote any args containing shell meta-characters.
+# Make two passes to allow for proper duplicate-argument suppression.
+ac_configure_args=
+ac_configure_args0=
+ac_configure_args1=
+ac_must_keep_next=false
+for ac_pass in 1 2
+do
+  for ac_arg
+  do
+    case $ac_arg in
+    -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
+    -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+    | -silent | --silent | --silen | --sile | --sil)
+      continue ;;
+    *\'*)
+      ac_arg=`$as_echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    esac
+    case $ac_pass in
+    1) as_fn_append ac_configure_args0 " '$ac_arg'" ;;
+    2)
+      as_fn_append ac_configure_args1 " '$ac_arg'"
+      if test $ac_must_keep_next = true; then
+	ac_must_keep_next=false # Got value, back to normal.
+      else
+	case $ac_arg in
+	  *=* | --config-cache | -C | -disable-* | --disable-* \
+	  | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
+	  | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
+	  | -with-* | --with-* | -without-* | --without-* | --x)
+	    case "$ac_configure_args0 " in
+	      "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
+	    esac
+	    ;;
+	  -* ) ac_must_keep_next=true ;;
+	esac
+      fi
+      as_fn_append ac_configure_args " '$ac_arg'"
+      ;;
+    esac
+  done
+done
+{ ac_configure_args0=; unset ac_configure_args0;}
+{ ac_configure_args1=; unset ac_configure_args1;}
+
+# When interrupted or exit'd, cleanup temporary files, and complete
+# config.log.  We remove comments because anyway the quotes in there
+# would cause problems or look ugly.
+# WARNING: Use '\'' to represent an apostrophe within the trap.
+# WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
+trap 'exit_status=$?
+  # Save into config.log some information that might help in debugging.
+  {
+    echo
+
+    $as_echo "## ---------------- ##
+## Cache variables. ##
+## ---------------- ##"
+    echo
+    # The following way of writing the cache mishandles newlines in values,
+(
+  for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+  (set) 2>&1 |
+    case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      sed -n \
+	"s/'\''/'\''\\\\'\'''\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
+      ;; #(
+    *)
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+)
+    echo
+
+    $as_echo "## ----------------- ##
+## Output variables. ##
+## ----------------- ##"
+    echo
+    for ac_var in $ac_subst_vars
+    do
+      eval ac_val=\$$ac_var
+      case $ac_val in
+      *\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+      esac
+      $as_echo "$ac_var='\''$ac_val'\''"
+    done | sort
+    echo
+
+    if test -n "$ac_subst_files"; then
+      $as_echo "## ------------------- ##
+## File substitutions. ##
+## ------------------- ##"
+      echo
+      for ac_var in $ac_subst_files
+      do
+	eval ac_val=\$$ac_var
+	case $ac_val in
+	*\'\''*) ac_val=`$as_echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
+	esac
+	$as_echo "$ac_var='\''$ac_val'\''"
+      done | sort
+      echo
+    fi
+
+    if test -s confdefs.h; then
+      $as_echo "## ----------- ##
+## confdefs.h. ##
+## ----------- ##"
+      echo
+      cat confdefs.h
+      echo
+    fi
+    test "$ac_signal" != 0 &&
+      $as_echo "$as_me: caught signal $ac_signal"
+    $as_echo "$as_me: exit $exit_status"
+  } >&5
+  rm -f core *.core core.conftest.* &&
+    rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
+    exit $exit_status
+' 0
+for ac_signal in 1 2 13 15; do
+  trap 'ac_signal='$ac_signal'; as_fn_exit 1' $ac_signal
+done
+ac_signal=0
+
+# confdefs.h avoids OS command line length limits that DEFS can exceed.
+rm -f -r conftest* confdefs.h
+
+$as_echo "/* confdefs.h */" > confdefs.h
+
+# Predefined preprocessor variables.
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_NAME "$PACKAGE_NAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_TARNAME "$PACKAGE_TARNAME"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_VERSION "$PACKAGE_VERSION"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_STRING "$PACKAGE_STRING"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
+_ACEOF
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE_URL "$PACKAGE_URL"
+_ACEOF
+
+
+# Let the site file select an alternate cache file if it wants to.
+# Prefer an explicitly selected file to automatically selected ones.
+ac_site_file1=NONE
+ac_site_file2=NONE
+if test -n "$CONFIG_SITE"; then
+  # We do not want a PATH search for config.site.
+  case $CONFIG_SITE in #((
+    -*)  ac_site_file1=./$CONFIG_SITE;;
+    */*) ac_site_file1=$CONFIG_SITE;;
+    *)   ac_site_file1=./$CONFIG_SITE;;
+  esac
+elif test "x$prefix" != xNONE; then
+  ac_site_file1=$prefix/share/config.site
+  ac_site_file2=$prefix/etc/config.site
+else
+  ac_site_file1=$ac_default_prefix/share/config.site
+  ac_site_file2=$ac_default_prefix/etc/config.site
+fi
+for ac_site_file in "$ac_site_file1" "$ac_site_file2"
+do
+  test "x$ac_site_file" = xNONE && continue
+  if test /dev/null != "$ac_site_file" && test -r "$ac_site_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading site script $ac_site_file" >&5
+$as_echo "$as_me: loading site script $ac_site_file" >&6;}
+    sed 's/^/| /' "$ac_site_file" >&5
+    . "$ac_site_file" \
+      || { { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "failed to load site script $ac_site_file
+See \`config.log' for more details" "$LINENO" 5; }
+  fi
+done
+
+if test -r "$cache_file"; then
+  # Some versions of bash will fail to source /dev/null (special files
+  # actually), so we avoid doing that.  DJGPP emulates it as a regular file.
+  if test /dev/null != "$cache_file" && test -f "$cache_file"; then
+    { $as_echo "$as_me:${as_lineno-$LINENO}: loading cache $cache_file" >&5
+$as_echo "$as_me: loading cache $cache_file" >&6;}
+    case $cache_file in
+      [\\/]* | ?:[\\/]* ) . "$cache_file";;
+      *)                      . "./$cache_file";;
+    esac
+  fi
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: creating cache $cache_file" >&5
+$as_echo "$as_me: creating cache $cache_file" >&6;}
+  >$cache_file
+fi
+
+# Check that the precious variables saved in the cache have kept the same
+# value.
+ac_cache_corrupted=false
+for ac_var in $ac_precious_vars; do
+  eval ac_old_set=\$ac_cv_env_${ac_var}_set
+  eval ac_new_set=\$ac_env_${ac_var}_set
+  eval ac_old_val=\$ac_cv_env_${ac_var}_value
+  eval ac_new_val=\$ac_env_${ac_var}_value
+  case $ac_old_set,$ac_new_set in
+    set,)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,set)
+      { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' was not set in the previous run" >&5
+$as_echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
+      ac_cache_corrupted=: ;;
+    ,);;
+    *)
+      if test "x$ac_old_val" != "x$ac_new_val"; then
+	# differences in whitespace do not lead to failure.
+	ac_old_val_w=`echo x $ac_old_val`
+	ac_new_val_w=`echo x $ac_new_val`
+	if test "$ac_old_val_w" != "$ac_new_val_w"; then
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: error: \`$ac_var' has changed since the previous run:" >&5
+$as_echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
+	  ac_cache_corrupted=:
+	else
+	  { $as_echo "$as_me:${as_lineno-$LINENO}: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&5
+$as_echo "$as_me: warning: ignoring whitespace changes in \`$ac_var' since the previous run:" >&2;}
+	  eval $ac_var=\$ac_old_val
+	fi
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   former value:  \`$ac_old_val'" >&5
+$as_echo "$as_me:   former value:  \`$ac_old_val'" >&2;}
+	{ $as_echo "$as_me:${as_lineno-$LINENO}:   current value: \`$ac_new_val'" >&5
+$as_echo "$as_me:   current value: \`$ac_new_val'" >&2;}
+      fi;;
+  esac
+  # Pass precious variables to config.status.
+  if test "$ac_new_set" = set; then
+    case $ac_new_val in
+    *\'*) ac_arg=$ac_var=`$as_echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
+    *) ac_arg=$ac_var=$ac_new_val ;;
+    esac
+    case " $ac_configure_args " in
+      *" '$ac_arg' "*) ;; # Avoid dups.  Use of quotes ensures accuracy.
+      *) as_fn_append ac_configure_args " '$ac_arg'" ;;
+    esac
+  fi
+done
+if $ac_cache_corrupted; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+  { $as_echo "$as_me:${as_lineno-$LINENO}: error: changes in the environment can compromise the build" >&5
+$as_echo "$as_me: error: changes in the environment can compromise the build" >&2;}
+  as_fn_error $? "run \`make distclean' and/or \`rm $cache_file' and start over" "$LINENO" 5
+fi
+## -------------------- ##
+## Main body of script. ##
+## -------------------- ##
+
+ac_ext=c
+ac_cpp='$CPP $CPPFLAGS'
+ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
+ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
+ac_compiler_gnu=$ac_cv_c_compiler_gnu
+
+
+am__api_version='1.14'
+
+ac_aux_dir=
+for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
+  if test -f "$ac_dir/install-sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install-sh -c"
+    break
+  elif test -f "$ac_dir/install.sh"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/install.sh -c"
+    break
+  elif test -f "$ac_dir/shtool"; then
+    ac_aux_dir=$ac_dir
+    ac_install_sh="$ac_aux_dir/shtool install -c"
+    break
+  fi
+done
+if test -z "$ac_aux_dir"; then
+  as_fn_error $? "cannot find install-sh, install.sh, or shtool in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" "$LINENO" 5
+fi
+
+# These three variables are undocumented and unsupported,
+# and are intended to be withdrawn in a future Autoconf release.
+# They can cause serious problems if a builder's source tree is in a directory
+# whose full name contains unusual characters.
+ac_config_guess="$SHELL $ac_aux_dir/config.guess"  # Please don't use this var.
+ac_config_sub="$SHELL $ac_aux_dir/config.sub"  # Please don't use this var.
+ac_configure="$SHELL $ac_aux_dir/configure"  # Please don't use this var.
+
+
+# Find a good install program.  We prefer a C program (faster),
+# so one script is as good as another.  But avoid the broken or
+# incompatible versions:
+# SysV /etc/install, /usr/sbin/install
+# SunOS /usr/etc/install
+# IRIX /sbin/install
+# AIX /bin/install
+# AmigaOS /C/install, which installs bootblocks on floppy discs
+# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
+# AFS /usr/afsws/bin/install, which mishandles nonexistent args
+# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
+# OS/2's system install, which has a completely different semantic
+# ./install, which can be erroneously created by make from ./install.sh.
+# Reject install programs that cannot install multiple files.
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a BSD-compatible install" >&5
+$as_echo_n "checking for a BSD-compatible install... " >&6; }
+if test -z "$INSTALL"; then
+if ${ac_cv_path_install+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    # Account for people who put trailing slashes in PATH elements.
+case $as_dir/ in #((
+  ./ | .// | /[cC]/* | \
+  /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
+  ?:[\\/]os2[\\/]install[\\/]* | ?:[\\/]OS2[\\/]INSTALL[\\/]* | \
+  /usr/ucb/* ) ;;
+  *)
+    # OSF1 and SCO ODT 3.0 have their own names for install.
+    # Don't use installbsd from OSF since it installs stuff as root
+    # by default.
+    for ac_prog in ginstall scoinst install; do
+      for ac_exec_ext in '' $ac_executable_extensions; do
+	if as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then
+	  if test $ac_prog = install &&
+	    grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # AIX install.  It has an incompatible calling convention.
+	    :
+	  elif test $ac_prog = install &&
+	    grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
+	    # program-specific install script used by HP pwplus--don't use.
+	    :
+	  else
+	    rm -rf conftest.one conftest.two conftest.dir
+	    echo one > conftest.one
+	    echo two > conftest.two
+	    mkdir conftest.dir
+	    if "$as_dir/$ac_prog$ac_exec_ext" -c conftest.one conftest.two "`pwd`/conftest.dir" &&
+	      test -s conftest.one && test -s conftest.two &&
+	      test -s conftest.dir/conftest.one &&
+	      test -s conftest.dir/conftest.two
+	    then
+	      ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
+	      break 3
+	    fi
+	  fi
+	fi
+      done
+    done
+    ;;
+esac
+
+  done
+IFS=$as_save_IFS
+
+rm -rf conftest.one conftest.two conftest.dir
+
+fi
+  if test "${ac_cv_path_install+set}" = set; then
+    INSTALL=$ac_cv_path_install
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for INSTALL within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    INSTALL=$ac_install_sh
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $INSTALL" >&5
+$as_echo "$INSTALL" >&6; }
+
+# Use test -z because SunOS4 sh mishandles braces in ${var-val}.
+# It thinks the first close brace ends the variable substitution.
+test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
+
+test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
+
+test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether build environment is sane" >&5
+$as_echo_n "checking whether build environment is sane... " >&6; }
+# Reject unsafe characters in $srcdir or the absolute working directory
+# name.  Accept space and tab only in the latter.
+am_lf='
+'
+case `pwd` in
+  *[\\\"\#\$\&\'\`$am_lf]*)
+    as_fn_error $? "unsafe absolute working directory name" "$LINENO" 5;;
+esac
+case $srcdir in
+  *[\\\"\#\$\&\'\`$am_lf\ \	]*)
+    as_fn_error $? "unsafe srcdir value: '$srcdir'" "$LINENO" 5;;
+esac
+
+# Do 'set' in a subshell so we don't clobber the current shell's
+# arguments.  Must try -L first in case configure is actually a
+# symlink; some systems play weird games with the mod time of symlinks
+# (eg FreeBSD returns the mod time of the symlink's containing
+# directory).
+if (
+   am_has_slept=no
+   for am_try in 1 2; do
+     echo "timestamp, slept: $am_has_slept" > conftest.file
+     set X `ls -Lt "$srcdir/configure" conftest.file 2> /dev/null`
+     if test "$*" = "X"; then
+	# -L didn't work.
+	set X `ls -t "$srcdir/configure" conftest.file`
+     fi
+     if test "$*" != "X $srcdir/configure conftest.file" \
+	&& test "$*" != "X conftest.file $srcdir/configure"; then
+
+	# If neither matched, then we have a broken ls.  This can happen
+	# if, for instance, CONFIG_SHELL is bash and it inherits a
+	# broken ls alias from the environment.  This has actually
+	# happened.  Such a system could not be considered "sane".
+	as_fn_error $? "ls -t appears to fail.  Make sure there is not a broken
+  alias in your environment" "$LINENO" 5
+     fi
+     if test "$2" = conftest.file || test $am_try -eq 2; then
+       break
+     fi
+     # Just in case.
+     sleep 1
+     am_has_slept=yes
+   done
+   test "$2" = conftest.file
+   )
+then
+   # Ok.
+   :
+else
+   as_fn_error $? "newly created file is older than distributed files!
+Check your system clock" "$LINENO" 5
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+# If we didn't sleep, we still need to ensure time stamps of config.status and
+# generated files are strictly newer.
+am_sleep_pid=
+if grep 'slept: no' conftest.file >/dev/null 2>&1; then
+  ( sleep 1 ) &
+  am_sleep_pid=$!
+fi
+
+rm -f conftest.file
+
+test "$program_prefix" != NONE &&
+  program_transform_name="s&^&$program_prefix&;$program_transform_name"
+# Use a double $ so make ignores it.
+test "$program_suffix" != NONE &&
+  program_transform_name="s&\$&$program_suffix&;$program_transform_name"
+# Double any \ or $.
+# By default was `s,x,x', remove it if useless.
+ac_script='s/[\\$]/&&/g;s/;s,x,x,$//'
+program_transform_name=`$as_echo "$program_transform_name" | sed "$ac_script"`
+
+# expand $ac_aux_dir to an absolute path
+am_aux_dir=`cd $ac_aux_dir && pwd`
+
+if test x"${MISSING+set}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    MISSING="\${SHELL} \"$am_aux_dir/missing\"" ;;
+  *)
+    MISSING="\${SHELL} $am_aux_dir/missing" ;;
+  esac
+fi
+# Use eval to expand $SHELL
+if eval "$MISSING --is-lightweight"; then
+  am_missing_run="$MISSING "
+else
+  am_missing_run=
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: 'missing' script is too old or missing" >&5
+$as_echo "$as_me: WARNING: 'missing' script is too old or missing" >&2;}
+fi
+
+if test x"${install_sh}" != xset; then
+  case $am_aux_dir in
+  *\ * | *\	*)
+    install_sh="\${SHELL} '$am_aux_dir/install-sh'" ;;
+  *)
+    install_sh="\${SHELL} $am_aux_dir/install-sh"
+  esac
+fi
+
+# Installed binaries are usually stripped using 'strip' when the user
+# run "make install-strip".  However 'strip' might not be the right
+# tool to use in cross-compilation environments, therefore Automake
+# will honor the 'STRIP' environment variable to overrule this program.
+if test "$cross_compiling" != no; then
+  if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
+set dummy ${ac_tool_prefix}strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$STRIP"; then
+  ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_STRIP="${ac_tool_prefix}strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+STRIP=$ac_cv_prog_STRIP
+if test -n "$STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $STRIP" >&5
+$as_echo "$STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_prog_STRIP"; then
+  ac_ct_STRIP=$STRIP
+  # Extract the first word of "strip", so it can be a program name with args.
+set dummy strip; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_ac_ct_STRIP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$ac_ct_STRIP"; then
+  ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_ac_ct_STRIP="strip"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
+if test -n "$ac_ct_STRIP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_ct_STRIP" >&5
+$as_echo "$ac_ct_STRIP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_ct_STRIP" = x; then
+    STRIP=":"
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    STRIP=$ac_ct_STRIP
+  fi
+else
+  STRIP="$ac_cv_prog_STRIP"
+fi
+
+fi
+INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for a thread-safe mkdir -p" >&5
+$as_echo_n "checking for a thread-safe mkdir -p... " >&6; }
+if test -z "$MKDIR_P"; then
+  if ${ac_cv_path_mkdir+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_prog in mkdir gmkdir; do
+	 for ac_exec_ext in '' $ac_executable_extensions; do
+	   as_fn_executable_p "$as_dir/$ac_prog$ac_exec_ext" || continue
+	   case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
+	     'mkdir (GNU coreutils) '* | \
+	     'mkdir (coreutils) '* | \
+	     'mkdir (fileutils) '4.1*)
+	       ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
+	       break 3;;
+	   esac
+	 done
+       done
+  done
+IFS=$as_save_IFS
+
+fi
+
+  test -d ./--version && rmdir ./--version
+  if test "${ac_cv_path_mkdir+set}" = set; then
+    MKDIR_P="$ac_cv_path_mkdir -p"
+  else
+    # As a last resort, use the slow shell script.  Don't cache a
+    # value for MKDIR_P within a source directory, because that will
+    # break other packages using the cache if that directory is
+    # removed, or if the value is a relative name.
+    MKDIR_P="$ac_install_sh -d"
+  fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $MKDIR_P" >&5
+$as_echo "$MKDIR_P" >&6; }
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ${MAKE-make} sets \$(MAKE)" >&5
+$as_echo_n "checking whether ${MAKE-make} sets \$(MAKE)... " >&6; }
+set x ${MAKE-make}
+ac_make=`$as_echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
+if eval \${ac_cv_prog_make_${ac_make}_set+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  cat >conftest.make <<\_ACEOF
+SHELL = /bin/sh
+all:
+	@echo '@@@%%%=$(MAKE)=@@@%%%'
+_ACEOF
+# GNU make sometimes prints "make[1]: Entering ...", which would confuse us.
+case `${MAKE-make} -f conftest.make 2>/dev/null` in
+  *@@@%%%=?*=@@@%%%*)
+    eval ac_cv_prog_make_${ac_make}_set=yes;;
+  *)
+    eval ac_cv_prog_make_${ac_make}_set=no;;
+esac
+rm -f conftest.make
+fi
+if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+  SET_MAKE=
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+  SET_MAKE="MAKE=${MAKE-make}"
+fi
+
+rm -rf .tst 2>/dev/null
+mkdir .tst 2>/dev/null
+if test -d .tst; then
+  am__leading_dot=.
+else
+  am__leading_dot=_
+fi
+rmdir .tst 2>/dev/null
+
+# Check whether --enable-silent-rules was given.
+if test "${enable_silent_rules+set}" = set; then :
+  enableval=$enable_silent_rules;
+fi
+
+case $enable_silent_rules in # (((
+  yes) AM_DEFAULT_VERBOSITY=0;;
+   no) AM_DEFAULT_VERBOSITY=1;;
+    *) AM_DEFAULT_VERBOSITY=1;;
+esac
+am_make=${MAKE-make}
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether $am_make supports nested variables" >&5
+$as_echo_n "checking whether $am_make supports nested variables... " >&6; }
+if ${am_cv_make_support_nested_variables+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if $as_echo 'TRUE=$(BAR$(V))
+BAR0=false
+BAR1=true
+V=1
+am__doit:
+	@$(TRUE)
+.PHONY: am__doit' | $am_make -f - >/dev/null 2>&1; then
+  am_cv_make_support_nested_variables=yes
+else
+  am_cv_make_support_nested_variables=no
+fi
+fi
+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $am_cv_make_support_nested_variables" >&5
+$as_echo "$am_cv_make_support_nested_variables" >&6; }
+if test $am_cv_make_support_nested_variables = yes; then
+    AM_V='$(V)'
+  AM_DEFAULT_V='$(AM_DEFAULT_VERBOSITY)'
+else
+  AM_V=$AM_DEFAULT_VERBOSITY
+  AM_DEFAULT_V=$AM_DEFAULT_VERBOSITY
+fi
+AM_BACKSLASH='\'
+
+if test "`cd $srcdir && pwd`" != "`pwd`"; then
+  # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
+  # is not polluted with repeated "-I."
+  am__isrc=' -I$(srcdir)'
+  # test to see if srcdir already configured
+  if test -f $srcdir/config.status; then
+    as_fn_error $? "source directory already configured; run \"make distclean\" there first" "$LINENO" 5
+  fi
+fi
+
+# test whether we have cygpath
+if test -z "$CYGPATH_W"; then
+  if (cygpath --version) >/dev/null 2>/dev/null; then
+    CYGPATH_W='cygpath -w'
+  else
+    CYGPATH_W=echo
+  fi
+fi
+
+
+# Define the identity of the package.
+ PACKAGE='apertium-{{languageCode1}}-{{languageCode2}}'
+ VERSION='0.1.0'
+
+
+cat >>confdefs.h <<_ACEOF
+#define PACKAGE "$PACKAGE"
+_ACEOF
+
+
+cat >>confdefs.h <<_ACEOF
+#define VERSION "$VERSION"
+_ACEOF
+
+# Some tools Automake needs.
+
+ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
+
+
+AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
+
+
+AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
+
+
+AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
+
+
+MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
+
+# For better backward compatibility.  To be removed once Automake 1.9.x
+# dies out for good.  For more background, see:
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00001.html>
+# <http://lists.gnu.org/archive/html/automake/2012-07/msg00014.html>
+mkdir_p='$(MKDIR_P)'
+
+# We need awk for the "check" target.  The system "awk" is bad on
+# some platforms.
+# Always define AMTAR for backward compatibility.  Yes, it's still used
+# in the wild :-(  We should find a proper way to deprecate it ...
+AMTAR='$${TAR-tar}'
+
+
+# We'll loop over all known methods to create a tar archive until one works.
+_am_tools='gnutar  pax cpio none'
+
+am__tar='$${TAR-tar} chof - "$$tardir"' am__untar='$${TAR-tar} xf -'
+
+
+
+
+
+
+# POSIX will say in a future version that running "rm -f" with no argument
+# is OK; and we want to be able to make that assumption in our Makefile
+# recipes.  So use an aggressive probe to check that the usage we want is
+# actually supported "in the wild" to an acceptable degree.
+# See automake bug#10828.
+# To make any issue more visible, cause the running configure to be aborted
+# by default if the 'rm' program in use doesn't match our expectations; the
+# user can still override this though.
+if rm -f && rm -fr && rm -rf; then : OK; else
+  cat >&2 <<'END'
+Oops!
+
+Your 'rm' program seems unable to run without file operands specified
+on the command line, even when the '-f' option is present.  This is contrary
+to the behaviour of most rm programs out there, and not conforming with
+the upcoming POSIX standard: <http://austingroupbugs.net/view.php?id=542>
+
+Please tell bug-automake@gnu.org about your system, including the value
+of your $PATH and any error possibly output before this message.  This
+can help us improve future automake versions.
+
+END
+  if test x"$ACCEPT_INFERIOR_RM_PROGRAM" = x"yes"; then
+    echo 'Configuration will proceed anyway, since you have set the' >&2
+    echo 'ACCEPT_INFERIOR_RM_PROGRAM variable to "yes"' >&2
+    echo >&2
+  else
+    cat >&2 <<'END'
+Aborting the configuration process, to ensure you take notice of the issue.
+
+You can download and install GNU coreutils to get an 'rm' implementation
+that behaves properly: <http://www.gnu.org/software/coreutils/>.
+
+If you want to complete the configuration process using your problematic
+'rm' anyway, export the environment variable ACCEPT_INFERIOR_RM_PROGRAM
+to "yes", and re-run configure.
+
+END
+    as_fn_error $? "Your 'rm' program is bad, sorry." "$LINENO" 5
+  fi
+fi
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking whether ln -s works" >&5
+$as_echo_n "checking whether ln -s works... " >&6; }
+LN_S=$as_ln_s
+if test "$LN_S" = "ln -s"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no, using $LN_S" >&5
+$as_echo "no, using $LN_S" >&6; }
+fi
+
+for ac_prog in gawk mawk nawk awk
+do
+  # Extract the first word of "$ac_prog", so it can be a program name with args.
+set dummy $ac_prog; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_prog_AWK+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  if test -n "$AWK"; then
+  ac_cv_prog_AWK="$AWK" # Let the user override the test.
+else
+as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_prog_AWK="$ac_prog"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+fi
+fi
+AWK=$ac_cv_prog_AWK
+if test -n "$AWK"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $AWK" >&5
+$as_echo "$AWK" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+  test -n "$AWK" && break
+done
+
+
+
+
+
+
+
+
+
+
+
+
+if test "x$ac_cv_env_PKG_CONFIG_set" != "xset"; then
+	if test -n "$ac_tool_prefix"; then
+  # Extract the first word of "${ac_tool_prefix}pkg-config", so it can be a program name with args.
+set dummy ${ac_tool_prefix}pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_PKG_CONFIG="$PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+PKG_CONFIG=$ac_cv_path_PKG_CONFIG
+if test -n "$PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $PKG_CONFIG" >&5
+$as_echo "$PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+fi
+if test -z "$ac_cv_path_PKG_CONFIG"; then
+  ac_pt_PKG_CONFIG=$PKG_CONFIG
+  # Extract the first word of "pkg-config", so it can be a program name with args.
+set dummy pkg-config; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_ac_pt_PKG_CONFIG+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $ac_pt_PKG_CONFIG in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_ac_pt_PKG_CONFIG="$ac_pt_PKG_CONFIG" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_ac_pt_PKG_CONFIG="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  ;;
+esac
+fi
+ac_pt_PKG_CONFIG=$ac_cv_path_ac_pt_PKG_CONFIG
+if test -n "$ac_pt_PKG_CONFIG"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $ac_pt_PKG_CONFIG" >&5
+$as_echo "$ac_pt_PKG_CONFIG" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+  if test "x$ac_pt_PKG_CONFIG" = x; then
+    PKG_CONFIG=""
+  else
+    case $cross_compiling:$ac_tool_warned in
+yes:)
+{ $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: using cross tools not prefixed with host triplet" >&5
+$as_echo "$as_me: WARNING: using cross tools not prefixed with host triplet" >&2;}
+ac_tool_warned=yes ;;
+esac
+    PKG_CONFIG=$ac_pt_PKG_CONFIG
+  fi
+else
+  PKG_CONFIG="$ac_cv_path_PKG_CONFIG"
+fi
+
+fi
+if test -n "$PKG_CONFIG"; then
+	_pkg_min_version=0.9.0
+	{ $as_echo "$as_me:${as_lineno-$LINENO}: checking pkg-config is at least version $_pkg_min_version" >&5
+$as_echo_n "checking pkg-config is at least version $_pkg_min_version... " >&6; }
+	if $PKG_CONFIG --atleast-pkgconfig-version $_pkg_min_version; then
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+	else
+		{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+		PKG_CONFIG=""
+	fi
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for APERTIUM" >&5
+$as_echo_n "checking for APERTIUM... " >&6; }
+
+if test -n "$APERTIUM_CFLAGS"; then
+    pkg_cv_APERTIUM_CFLAGS="$APERTIUM_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_CFLAGS=`$PKG_CONFIG --cflags "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$APERTIUM_LIBS"; then
+    pkg_cv_APERTIUM_LIBS="$APERTIUM_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"apertium >= 3.4.0\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "apertium >= 3.4.0") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_APERTIUM_LIBS=`$PKG_CONFIG --libs "apertium >= 3.4.0" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        else
+	        APERTIUM_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "apertium >= 3.4.0" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$APERTIUM_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (apertium >= 3.4.0) were not met:
+
+$APERTIUM_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables APERTIUM_CFLAGS
+and APERTIUM_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	APERTIUM_CFLAGS=$pkg_cv_APERTIUM_CFLAGS
+	APERTIUM_LIBS=$pkg_cv_APERTIUM_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+
+pkg_failed=no
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for LTTOOLBOX" >&5
+$as_echo_n "checking for LTTOOLBOX... " >&6; }
+
+if test -n "$LTTOOLBOX_CFLAGS"; then
+    pkg_cv_LTTOOLBOX_CFLAGS="$LTTOOLBOX_CFLAGS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_CFLAGS=`$PKG_CONFIG --cflags "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+if test -n "$LTTOOLBOX_LIBS"; then
+    pkg_cv_LTTOOLBOX_LIBS="$LTTOOLBOX_LIBS"
+ elif test -n "$PKG_CONFIG"; then
+    if test -n "$PKG_CONFIG" && \
+    { { $as_echo "$as_me:${as_lineno-$LINENO}: \$PKG_CONFIG --exists --print-errors \"lttoolbox >= 3.3.2\""; } >&5
+  ($PKG_CONFIG --exists --print-errors "lttoolbox >= 3.3.2") 2>&5
+  ac_status=$?
+  $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5
+  test $ac_status = 0; }; then
+  pkg_cv_LTTOOLBOX_LIBS=`$PKG_CONFIG --libs "lttoolbox >= 3.3.2" 2>/dev/null`
+		      test "x$?" != "x0" && pkg_failed=yes
+else
+  pkg_failed=yes
+fi
+ else
+    pkg_failed=untried
+fi
+
+
+
+if test $pkg_failed = yes; then
+   	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+
+if $PKG_CONFIG --atleast-pkgconfig-version 0.20; then
+        _pkg_short_errors_supported=yes
+else
+        _pkg_short_errors_supported=no
+fi
+        if test $_pkg_short_errors_supported = yes; then
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --short-errors --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        else
+	        LTTOOLBOX_PKG_ERRORS=`$PKG_CONFIG --print-errors --cflags --libs "lttoolbox >= 3.3.2" 2>&1`
+        fi
+	# Put the nasty error message in config.log where it belongs
+	echo "$LTTOOLBOX_PKG_ERRORS" >&5
+
+	as_fn_error $? "Package requirements (lttoolbox >= 3.3.2) were not met:
+
+$LTTOOLBOX_PKG_ERRORS
+
+Consider adjusting the PKG_CONFIG_PATH environment variable if you
+installed software in a non-standard prefix.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details." "$LINENO" 5
+elif test $pkg_failed = untried; then
+     	{ $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+	{ { $as_echo "$as_me:${as_lineno-$LINENO}: error: in \`$ac_pwd':" >&5
+$as_echo "$as_me: error: in \`$ac_pwd':" >&2;}
+as_fn_error $? "The pkg-config script could not be found or is too old.  Make sure it
+is in your PATH or set the PKG_CONFIG environment variable to the full
+path to pkg-config.
+
+Alternatively, you may set the environment variables LTTOOLBOX_CFLAGS
+and LTTOOLBOX_LIBS to avoid the need to call pkg-config.
+See the pkg-config man page for more details.
+
+To get pkg-config, see <http://pkg-config.freedesktop.org/>.
+See \`config.log' for more details" "$LINENO" 5; }
+else
+	LTTOOLBOX_CFLAGS=$pkg_cv_LTTOOLBOX_CFLAGS
+	LTTOOLBOX_LIBS=$pkg_cv_LTTOOLBOX_LIBS
+        { $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5
+$as_echo "yes" >&6; }
+
+fi
+
+# Extract the first word of "cg-comp", so it can be a program name with args.
+set dummy cg-comp; ac_word=$2
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for $ac_word" >&5
+$as_echo_n "checking for $ac_word... " >&6; }
+if ${ac_cv_path_CGCOMP+:} false; then :
+  $as_echo_n "(cached) " >&6
+else
+  case $CGCOMP in
+  [\\/]* | ?:[\\/]*)
+  ac_cv_path_CGCOMP="$CGCOMP" # Let the user override the test with a path.
+  ;;
+  *)
+  as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH$PATH_SEPARATOR$with_cg_comp/bin
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    for ac_exec_ext in '' $ac_executable_extensions; do
+  if as_fn_executable_p "$as_dir/$ac_word$ac_exec_ext"; then
+    ac_cv_path_CGCOMP="$as_dir/$ac_word$ac_exec_ext"
+    $as_echo "$as_me:${as_lineno-$LINENO}: found $as_dir/$ac_word$ac_exec_ext" >&5
+    break 2
+  fi
+done
+  done
+IFS=$as_save_IFS
+
+  test -z "$ac_cv_path_CGCOMP" && ac_cv_path_CGCOMP="false"
+  ;;
+esac
+fi
+CGCOMP=$ac_cv_path_CGCOMP
+if test -n "$CGCOMP"; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: $CGCOMP" >&5
+$as_echo "$CGCOMP" >&6; }
+else
+  { $as_echo "$as_me:${as_lineno-$LINENO}: result: no" >&5
+$as_echo "no" >&6; }
+fi
+
+
+if test x$CGCOMP = xfalse; then :
+  as_fn_error $? "You don't have cg-comp installed" "$LINENO" 5
+fi
+
+
+
+
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode[@install="yes"]/@name' modes.xml | sed 's/ *name="\([^"]*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\$*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\$*.autobil.att > .deps/\$*.autobil.hfst
+	hfst-project -p upper .deps/\$*.autobil.hfst > .deps/\$*.autobil.upper                                   # bidix
+	echo ' [ ? - %+ ]* ' | hfst-regexp2fst > .deps/\$*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\$*.autobil.upper -2 .deps/\$*.any-nonplus.hfst -o .deps/\$*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\$*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\$*.single-plus.hfst -2 .deps/\$*.autobil.nonplussed -o .deps/\$*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\$*.autobil.postplus -o .deps/\$*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\$*.autobil.nonplussed -2 .deps/\$*.autobil.postplus.0,3 -o \$@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+
+
+ac_config_files="$ac_config_files Makefile apertium-rus.pc"
+
+cat >confcache <<\_ACEOF
+# This file is a shell script that caches the results of configure
+# tests run on this system so they can be shared between configure
+# scripts and configure runs, see configure's option --config-cache.
+# It is not useful on other systems.  If it contains results you don't
+# want to keep, you may remove or edit it.
+#
+# config.status only pays attention to the cache file if you give it
+# the --recheck option to rerun configure.
+#
+# `ac_cv_env_foo' variables (set or unset) will be overridden when
+# loading this file, other *unset* `ac_cv_foo' will be assigned the
+# following values.
+
+_ACEOF
+
+# The following way of writing the cache mishandles newlines in values,
+# but we know of no workaround that is simple, portable, and efficient.
+# So, we kill variables containing newlines.
+# Ultrix sh set writes to stderr and can't be redirected directly,
+# and sets the high bit in the cache file unless we assign to the vars.
+(
+  for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
+    eval ac_val=\$$ac_var
+    case $ac_val in #(
+    *${as_nl}*)
+      case $ac_var in #(
+      *_cv_*) { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: cache variable $ac_var contains a newline" >&5
+$as_echo "$as_me: WARNING: cache variable $ac_var contains a newline" >&2;} ;;
+      esac
+      case $ac_var in #(
+      _ | IFS | as_nl) ;; #(
+      BASH_ARGV | BASH_SOURCE) eval $ac_var= ;; #(
+      *) { eval $ac_var=; unset $ac_var;} ;;
+      esac ;;
+    esac
+  done
+
+  (set) 2>&1 |
+    case $as_nl`(ac_space=' '; set) 2>&1` in #(
+    *${as_nl}ac_space=\ *)
+      # `set' does not quote correctly, so add quotes: double-quote
+      # substitution turns \\\\ into \\, and sed turns \\ into \.
+      sed -n \
+	"s/'/'\\\\''/g;
+	  s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
+      ;; #(
+    *)
+      # `set' quotes correctly as required by POSIX, so do not add quotes.
+      sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
+      ;;
+    esac |
+    sort
+) |
+  sed '
+     /^ac_cv_env_/b end
+     t clear
+     :clear
+     s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
+     t end
+     s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
+     :end' >>confcache
+if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
+  if test -w "$cache_file"; then
+    if test "x$cache_file" != "x/dev/null"; then
+      { $as_echo "$as_me:${as_lineno-$LINENO}: updating cache $cache_file" >&5
+$as_echo "$as_me: updating cache $cache_file" >&6;}
+      if test ! -f "$cache_file" || test -h "$cache_file"; then
+	cat confcache >"$cache_file"
+      else
+        case $cache_file in #(
+        */* | ?:*)
+	  mv -f confcache "$cache_file"$$ &&
+	  mv -f "$cache_file"$$ "$cache_file" ;; #(
+        *)
+	  mv -f confcache "$cache_file" ;;
+	esac
+      fi
+    fi
+  else
+    { $as_echo "$as_me:${as_lineno-$LINENO}: not updating unwritable cache $cache_file" >&5
+$as_echo "$as_me: not updating unwritable cache $cache_file" >&6;}
+  fi
+fi
+rm -f confcache
+
+test "x$prefix" = xNONE && prefix=$ac_default_prefix
+# Let make expand exec_prefix.
+test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
+
+# Transform confdefs.h into DEFS.
+# Protect against shell expansion while executing Makefile rules.
+# Protect against Makefile macro expansion.
+#
+# If the first sed substitution is executed (which looks for macros that
+# take arguments), then branch to the quote section.  Otherwise,
+# look for a macro that doesn't take arguments.
+ac_script='
+:mline
+/\\$/{
+ N
+ s,\\\n,,
+ b mline
+}
+t clear
+:clear
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 (][^	 (]*([^)]*)\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+s/^[	 ]*#[	 ]*define[	 ][	 ]*\([^	 ][^	 ]*\)[	 ]*\(.*\)/-D\1=\2/g
+t quote
+b any
+:quote
+s/[	 `~#$^&*(){}\\|;'\''"<>?]/\\&/g
+s/\[/\\&/g
+s/\]/\\&/g
+s/\$/$$/g
+H
+:any
+${
+	g
+	s/^\n//
+	s/\n/ /g
+	p
+}
+'
+DEFS=`sed -n "$ac_script" confdefs.h`
+
+
+ac_libobjs=
+ac_ltlibobjs=
+U=
+for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
+  # 1. Remove the extension, and $U if already installed.
+  ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
+  ac_i=`$as_echo "$ac_i" | sed "$ac_script"`
+  # 2. Prepend LIBOBJDIR.  When used with automake>=1.10 LIBOBJDIR
+  #    will be set to the directory where LIBOBJS objects are built.
+  as_fn_append ac_libobjs " \${LIBOBJDIR}$ac_i\$U.$ac_objext"
+  as_fn_append ac_ltlibobjs " \${LIBOBJDIR}$ac_i"'$U.lo'
+done
+LIBOBJS=$ac_libobjs
+
+LTLIBOBJS=$ac_ltlibobjs
+
+
+{ $as_echo "$as_me:${as_lineno-$LINENO}: checking that generated files are newer than configure" >&5
+$as_echo_n "checking that generated files are newer than configure... " >&6; }
+   if test -n "$am_sleep_pid"; then
+     # Hide warnings about reused PIDs.
+     wait $am_sleep_pid 2>/dev/null
+   fi
+   { $as_echo "$as_me:${as_lineno-$LINENO}: result: done" >&5
+$as_echo "done" >&6; }
+
+
+: "${CONFIG_STATUS=./config.status}"
+ac_write_fail=0
+ac_clean_files_save=$ac_clean_files
+ac_clean_files="$ac_clean_files $CONFIG_STATUS"
+{ $as_echo "$as_me:${as_lineno-$LINENO}: creating $CONFIG_STATUS" >&5
+$as_echo "$as_me: creating $CONFIG_STATUS" >&6;}
+as_write_fail=0
+cat >$CONFIG_STATUS <<_ASEOF || as_write_fail=1
+#! $SHELL
+# Generated by $as_me.
+# Run this file to recreate the current configuration.
+# Compiler output produced by configure, useful for debugging
+# configure, is in config.log if it exists.
+
+debug=false
+ac_cs_recheck=false
+ac_cs_silent=false
+
+SHELL=\${CONFIG_SHELL-$SHELL}
+export SHELL
+_ASEOF
+cat >>$CONFIG_STATUS <<\_ASEOF || as_write_fail=1
+## -------------------- ##
+## M4sh Initialization. ##
+## -------------------- ##
+
+# Be more Bourne compatible
+DUALCASE=1; export DUALCASE # for MKS sh
+if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then :
+  emulate sh
+  NULLCMD=:
+  # Pre-4.2 versions of Zsh do word splitting on ${1+"$@"}, which
+  # is contrary to our usage.  Disable this feature.
+  alias -g '${1+"$@"}'='"$@"'
+  setopt NO_GLOB_SUBST
+else
+  case `(set -o) 2>/dev/null` in #(
+  *posix*) :
+    set -o posix ;; #(
+  *) :
+     ;;
+esac
+fi
+
+
+as_nl='
+'
+export as_nl
+# Printing a long string crashes Solaris 7 /usr/bin/printf.
+as_echo='\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\'
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo
+as_echo=$as_echo$as_echo$as_echo$as_echo$as_echo$as_echo
+# Prefer a ksh shell builtin over an external printf program on Solaris,
+# but without wasting forks for bash or zsh.
+if test -z "$BASH_VERSION$ZSH_VERSION" \
+    && (test "X`print -r -- $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='print -r --'
+  as_echo_n='print -rn --'
+elif (test "X`printf %s $as_echo`" = "X$as_echo") 2>/dev/null; then
+  as_echo='printf %s\n'
+  as_echo_n='printf %s'
+else
+  if test "X`(/usr/ucb/echo -n -n $as_echo) 2>/dev/null`" = "X-n $as_echo"; then
+    as_echo_body='eval /usr/ucb/echo -n "$1$as_nl"'
+    as_echo_n='/usr/ucb/echo -n'
+  else
+    as_echo_body='eval expr "X$1" : "X\\(.*\\)"'
+    as_echo_n_body='eval
+      arg=$1;
+      case $arg in #(
+      *"$as_nl"*)
+	expr "X$arg" : "X\\(.*\\)$as_nl";
+	arg=`expr "X$arg" : ".*$as_nl\\(.*\\)"`;;
+      esac;
+      expr "X$arg" : "X\\(.*\\)" | tr -d "$as_nl"
+    '
+    export as_echo_n_body
+    as_echo_n='sh -c $as_echo_n_body as_echo'
+  fi
+  export as_echo_body
+  as_echo='sh -c $as_echo_body as_echo'
+fi
+
+# The user is always right.
+if test "${PATH_SEPARATOR+set}" != set; then
+  PATH_SEPARATOR=:
+  (PATH='/bin;/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 && {
+    (PATH='/bin:/bin'; FPATH=$PATH; sh -c :) >/dev/null 2>&1 ||
+      PATH_SEPARATOR=';'
+  }
+fi
+
+
+# IFS
+# We need space, tab and new line, in precisely that order.  Quoting is
+# there to prevent editors from complaining about space-tab.
+# (If _AS_PATH_WALK were called with IFS unset, it would disable word
+# splitting by setting IFS to empty value.)
+IFS=" ""	$as_nl"
+
+# Find who we are.  Look in the path if we contain no directory separator.
+as_myself=
+case $0 in #((
+  *[\\/]* ) as_myself=$0 ;;
+  *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
+for as_dir in $PATH
+do
+  IFS=$as_save_IFS
+  test -z "$as_dir" && as_dir=.
+    test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
+  done
+IFS=$as_save_IFS
+
+     ;;
+esac
+# We did not find ourselves, most probably we were run as `sh COMMAND'
+# in which case we are not to be found in the path.
+if test "x$as_myself" = x; then
+  as_myself=$0
+fi
+if test ! -f "$as_myself"; then
+  $as_echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
+  exit 1
+fi
+
+# Unset variables that we do not need and which cause bugs (e.g. in
+# pre-3.0 UWIN ksh).  But do not cause bugs in bash 2.01; the "|| exit 1"
+# suppresses any "Segmentation fault" message there.  '((' could
+# trigger a bug in pdksh 5.2.14.
+for as_var in BASH_ENV ENV MAIL MAILPATH
+do eval test x\${$as_var+set} = xset \
+  && ( (unset $as_var) || exit 1) >/dev/null 2>&1 && unset $as_var || :
+done
+PS1='$ '
+PS2='> '
+PS4='+ '
+
+# NLS nuisances.
+LC_ALL=C
+export LC_ALL
+LANGUAGE=C
+export LANGUAGE
+
+# CDPATH.
+(unset CDPATH) >/dev/null 2>&1 && unset CDPATH
+
+
+# as_fn_error STATUS ERROR [LINENO LOG_FD]
+# ----------------------------------------
+# Output "`basename $0`: error: ERROR" to stderr. If LINENO and LOG_FD are
+# provided, also output the error to LOG_FD, referencing LINENO. Then exit the
+# script with STATUS, using 1 if that was 0.
+as_fn_error ()
+{
+  as_status=$1; test $as_status -eq 0 && as_status=1
+  if test "$4"; then
+    as_lineno=${as_lineno-"$3"} as_lineno_stack=as_lineno_stack=$as_lineno_stack
+    $as_echo "$as_me:${as_lineno-$LINENO}: error: $2" >&$4
+  fi
+  $as_echo "$as_me: error: $2" >&2
+  as_fn_exit $as_status
+} # as_fn_error
+
+
+# as_fn_set_status STATUS
+# -----------------------
+# Set $? to STATUS, without forking.
+as_fn_set_status ()
+{
+  return $1
+} # as_fn_set_status
+
+# as_fn_exit STATUS
+# -----------------
+# Exit the shell with STATUS, even in a "trap 0" or "set -e" context.
+as_fn_exit ()
+{
+  set +e
+  as_fn_set_status $1
+  exit $1
+} # as_fn_exit
+
+# as_fn_unset VAR
+# ---------------
+# Portably unset VAR.
+as_fn_unset ()
+{
+  { eval $1=; unset $1;}
+}
+as_unset=as_fn_unset
+# as_fn_append VAR VALUE
+# ----------------------
+# Append the text in VALUE to the end of the definition contained in VAR. Take
+# advantage of any shell optimizations that allow amortized linear growth over
+# repeated appends, instead of the typical quadratic growth present in naive
+# implementations.
+if (eval "as_var=1; as_var+=2; test x\$as_var = x12") 2>/dev/null; then :
+  eval 'as_fn_append ()
+  {
+    eval $1+=\$2
+  }'
+else
+  as_fn_append ()
+  {
+    eval $1=\$$1\$2
+  }
+fi # as_fn_append
+
+# as_fn_arith ARG...
+# ------------------
+# Perform arithmetic evaluation on the ARGs, and store the result in the
+# global $as_val. Take advantage of shells that can avoid forks. The arguments
+# must be portable across $(()) and expr.
+if (eval "test \$(( 1 + 1 )) = 2") 2>/dev/null; then :
+  eval 'as_fn_arith ()
+  {
+    as_val=$(( $* ))
+  }'
+else
+  as_fn_arith ()
+  {
+    as_val=`expr "$@" || test $? -eq 1`
+  }
+fi # as_fn_arith
+
+
+if expr a : '\(a\)' >/dev/null 2>&1 &&
+   test "X`expr 00001 : '.*\(...\)'`" = X001; then
+  as_expr=expr
+else
+  as_expr=false
+fi
+
+if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
+  as_basename=basename
+else
+  as_basename=false
+fi
+
+if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
+  as_dirname=dirname
+else
+  as_dirname=false
+fi
+
+as_me=`$as_basename -- "$0" ||
+$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
+	 X"$0" : 'X\(//\)$' \| \
+	 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X/"$0" |
+    sed '/^.*\/\([^/][^/]*\)\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\/\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+
+# Avoid depending upon Character Ranges.
+as_cr_letters='abcdefghijklmnopqrstuvwxyz'
+as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+as_cr_Letters=$as_cr_letters$as_cr_LETTERS
+as_cr_digits='0123456789'
+as_cr_alnum=$as_cr_Letters$as_cr_digits
+
+ECHO_C= ECHO_N= ECHO_T=
+case `echo -n x` in #(((((
+-n*)
+  case `echo 'xy\c'` in
+  *c*) ECHO_T='	';;	# ECHO_T is single tab character.
+  xy)  ECHO_C='\c';;
+  *)   echo `echo ksh88 bug on AIX 6.1` > /dev/null
+       ECHO_T='	';;
+  esac;;
+*)
+  ECHO_N='-n';;
+esac
+
+rm -f conf$$ conf$$.exe conf$$.file
+if test -d conf$$.dir; then
+  rm -f conf$$.dir/conf$$.file
+else
+  rm -f conf$$.dir
+  mkdir conf$$.dir 2>/dev/null
+fi
+if (echo >conf$$.file) 2>/dev/null; then
+  if ln -s conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s='ln -s'
+    # ... but there are two gotchas:
+    # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
+    # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
+    # In both cases, we have to default to `cp -pR'.
+    ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
+      as_ln_s='cp -pR'
+  elif ln conf$$.file conf$$ 2>/dev/null; then
+    as_ln_s=ln
+  else
+    as_ln_s='cp -pR'
+  fi
+else
+  as_ln_s='cp -pR'
+fi
+rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
+rmdir conf$$.dir 2>/dev/null
+
+
+# as_fn_mkdir_p
+# -------------
+# Create "$as_dir" as a directory, including parents if necessary.
+as_fn_mkdir_p ()
+{
+
+  case $as_dir in #(
+  -*) as_dir=./$as_dir;;
+  esac
+  test -d "$as_dir" || eval $as_mkdir_p || {
+    as_dirs=
+    while :; do
+      case $as_dir in #(
+      *\'*) as_qdir=`$as_echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #'(
+      *) as_qdir=$as_dir;;
+      esac
+      as_dirs="'$as_qdir' $as_dirs"
+      as_dir=`$as_dirname -- "$as_dir" ||
+$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$as_dir" : 'X\(//\)[^/]' \| \
+	 X"$as_dir" : 'X\(//\)$' \| \
+	 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$as_dir" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+      test -d "$as_dir" && break
+    done
+    test -z "$as_dirs" || eval "mkdir $as_dirs"
+  } || test -d "$as_dir" || as_fn_error $? "cannot create directory $as_dir"
+
+
+} # as_fn_mkdir_p
+if mkdir -p . 2>/dev/null; then
+  as_mkdir_p='mkdir -p "$as_dir"'
+else
+  test -d ./-p && rmdir ./-p
+  as_mkdir_p=false
+fi
+
+
+# as_fn_executable_p FILE
+# -----------------------
+# Test if FILE is an executable regular file.
+as_fn_executable_p ()
+{
+  test -f "$1" && test -x "$1"
+} # as_fn_executable_p
+as_test_x='test -x'
+as_executable_p=as_fn_executable_p
+
+# Sed expression to map a string onto a valid CPP name.
+as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
+
+# Sed expression to map a string onto a valid variable name.
+as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
+
+
+exec 6>&1
+## ----------------------------------- ##
+## Main body of $CONFIG_STATUS script. ##
+## ----------------------------------- ##
+_ASEOF
+test $as_write_fail = 0 && chmod +x $CONFIG_STATUS || ac_write_fail=1
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# Save the log message, to keep $0 and so on meaningful, and to
+# report actual input values of CONFIG_FILES etc. instead of their
+# values after options handling.
+ac_log="
+This file was extended by Apertium {{languageName1}}-{{languageName2}} $as_me 0.1.0, which was
+generated by GNU Autoconf 2.69.  Invocation command line was
+
+  CONFIG_FILES    = $CONFIG_FILES
+  CONFIG_HEADERS  = $CONFIG_HEADERS
+  CONFIG_LINKS    = $CONFIG_LINKS
+  CONFIG_COMMANDS = $CONFIG_COMMANDS
+  $ $0 $@
+
+on `(hostname || uname -n) 2>/dev/null | sed 1q`
+"
+
+_ACEOF
+
+case $ac_config_files in *"
+"*) set x $ac_config_files; shift; ac_config_files=$*;;
+esac
+
+
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+# Files that config.status was made for.
+config_files="$ac_config_files"
+
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+ac_cs_usage="\
+\`$as_me' instantiates files and other configuration actions
+from templates according to the current configuration.  Unless the files
+and actions are specified as TAGs, all are instantiated by default.
+
+Usage: $0 [OPTION]... [TAG]...
+
+  -h, --help       print this help, then exit
+  -V, --version    print version number and configuration settings, then exit
+      --config     print configuration, then exit
+  -q, --quiet, --silent
+                   do not print progress messages
+  -d, --debug      don't remove temporary files
+      --recheck    update $as_me by reconfiguring in the same conditions
+      --file=FILE[:TEMPLATE]
+                   instantiate the configuration file FILE
+
+Configuration files:
+$config_files
+
+Report bugs to <super-antispam@ya.ru>.
+Apertium {{languageName1}}-{{languageName2}} home page: <http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}>."
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_cs_config="`$as_echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`"
+ac_cs_version="\\
+Apertium {{languageName1}}-{{languageName2}} config.status 0.1.0
+configured by $0, generated by GNU Autoconf 2.69,
+  with options \\"\$ac_cs_config\\"
+
+Copyright (C) 2012 Free Software Foundation, Inc.
+This config.status script is free software; the Free Software Foundation
+gives unlimited permission to copy, distribute and modify it."
+
+ac_pwd='$ac_pwd'
+srcdir='$srcdir'
+INSTALL='$INSTALL'
+MKDIR_P='$MKDIR_P'
+AWK='$AWK'
+test -n "\$AWK" || AWK=awk
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# The default lists apply if the user does not specify any file.
+ac_need_defaults=:
+while test $# != 0
+do
+  case $1 in
+  --*=?*)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
+    ac_shift=:
+    ;;
+  --*=)
+    ac_option=`expr "X$1" : 'X\([^=]*\)='`
+    ac_optarg=
+    ac_shift=:
+    ;;
+  *)
+    ac_option=$1
+    ac_optarg=$2
+    ac_shift=shift
+    ;;
+  esac
+
+  case $ac_option in
+  # Handling of the options.
+  -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
+    ac_cs_recheck=: ;;
+  --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
+    $as_echo "$ac_cs_version"; exit ;;
+  --config | --confi | --conf | --con | --co | --c )
+    $as_echo "$ac_cs_config"; exit ;;
+  --debug | --debu | --deb | --de | --d | -d )
+    debug=: ;;
+  --file | --fil | --fi | --f )
+    $ac_shift
+    case $ac_optarg in
+    *\'*) ac_optarg=`$as_echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` ;;
+    '') as_fn_error $? "missing file argument" ;;
+    esac
+    as_fn_append CONFIG_FILES " '$ac_optarg'"
+    ac_need_defaults=false;;
+  --he | --h |  --help | --hel | -h )
+    $as_echo "$ac_cs_usage"; exit ;;
+  -q | -quiet | --quiet | --quie | --qui | --qu | --q \
+  | -silent | --silent | --silen | --sile | --sil | --si | --s)
+    ac_cs_silent=: ;;
+
+  # This is an error.
+  -*) as_fn_error $? "unrecognized option: \`$1'
+Try \`$0 --help' for more information." ;;
+
+  *) as_fn_append ac_config_targets " $1"
+     ac_need_defaults=false ;;
+
+  esac
+  shift
+done
+
+ac_configure_extra_args=
+
+if $ac_cs_silent; then
+  exec 6>/dev/null
+  ac_configure_extra_args="$ac_configure_extra_args --silent"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+if \$ac_cs_recheck; then
+  set X $SHELL '$0' $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
+  shift
+  \$as_echo "running CONFIG_SHELL=$SHELL \$*" >&6
+  CONFIG_SHELL='$SHELL'
+  export CONFIG_SHELL
+  exec "\$@"
+fi
+
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+exec 5>>config.log
+{
+  echo
+  sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
+## Running $as_me. ##
+_ASBOX
+  $as_echo "$ac_log"
+} >&5
+
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+
+# Handling of arguments.
+for ac_config_target in $ac_config_targets
+do
+  case $ac_config_target in
+    "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
+    "apertium-rus.pc") CONFIG_FILES="$CONFIG_FILES apertium-rus.pc" ;;
+
+  *) as_fn_error $? "invalid argument: \`$ac_config_target'" "$LINENO" 5;;
+  esac
+done
+
+
+# If the user did not use the arguments to specify the items to instantiate,
+# then the envvar interface is used.  Set only those that are not.
+# We use the long form for the default assignment because of an extremely
+# bizarre bug on SunOS 4.1.3.
+if $ac_need_defaults; then
+  test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
+fi
+
+# Have a temporary directory for convenience.  Make it in the build tree
+# simply because there is no reason against having it here, and in addition,
+# creating and moving files from /tmp can sometimes cause problems.
+# Hook for its removal unless debugging.
+# Note that there is a small window in which the directory will not be cleaned:
+# after its creation but before its name has been assigned to `$tmp'.
+$debug ||
+{
+  tmp= ac_tmp=
+  trap 'exit_status=$?
+  : "${ac_tmp:=$tmp}"
+  { test ! -d "$ac_tmp" || rm -fr "$ac_tmp"; } && exit $exit_status
+' 0
+  trap 'as_fn_exit 1' 1 2 13 15
+}
+# Create a (secure) tmp directory for tmp files.
+
+{
+  tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
+  test -d "$tmp"
+}  ||
+{
+  tmp=./conf$$-$RANDOM
+  (umask 077 && mkdir "$tmp")
+} || as_fn_error $? "cannot create a temporary directory in ." "$LINENO" 5
+ac_tmp=$tmp
+
+# Set up the scripts for CONFIG_FILES section.
+# No need to generate them if there are no CONFIG_FILES.
+# This happens for instance with `./config.status config.h'.
+if test -n "$CONFIG_FILES"; then
+
+if $AWK 'BEGIN { getline <"/dev/null" }' </dev/null 2>/dev/null; then
+  ac_cs_awk_getline=:
+  ac_cs_awk_pipe_init=
+  ac_cs_awk_read_file='
+      while ((getline aline < (F[key])) > 0)
+	print(aline)
+      close(F[key])'
+  ac_cs_awk_pipe_fini=
+else
+  ac_cs_awk_getline=false
+  ac_cs_awk_pipe_init="print \"cat <<'|#_!!_#|' &&\""
+  ac_cs_awk_read_file='
+      print "|#_!!_#|"
+      print "cat " F[key] " &&"
+      '$ac_cs_awk_pipe_init
+  # The final `:' finishes the AND list.
+  ac_cs_awk_pipe_fini='END { print "|#_!!_#|"; print ":" }'
+fi
+ac_cr=`echo X | tr X '\015'`
+# On cygwin, bash can eat \r inside `` if the user requested igncr.
+# But we know of no other shell where ac_cr would be empty at this
+# point, so we can use a bashism as a fallback.
+if test "x$ac_cr" = x; then
+  eval ac_cr=\$\'\\r\'
+fi
+ac_cs_awk_cr=`$AWK 'BEGIN { print "a\rb" }' </dev/null 2>/dev/null`
+if test "$ac_cs_awk_cr" = "a${ac_cr}b"; then
+  ac_cs_awk_cr='\\r'
+else
+  ac_cs_awk_cr=$ac_cr
+fi
+
+echo 'BEGIN {' >"$ac_tmp/subs1.awk" &&
+_ACEOF
+
+# Create commands to substitute file output variables.
+{
+  echo "cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1" &&
+  echo 'cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&' &&
+  echo "$ac_subst_files" | sed 's/.*/F["&"]="$&"/' &&
+  echo "_ACAWK" &&
+  echo "_ACEOF"
+} >conf$$files.sh &&
+. ./conf$$files.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+rm -f conf$$files.sh
+
+{
+  echo "cat >conf$$subs.awk <<_ACEOF" &&
+  echo "$ac_subst_vars" | sed 's/.*/&!$&$ac_delim/' &&
+  echo "_ACEOF"
+} >conf$$subs.sh ||
+  as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+ac_delim_num=`echo "$ac_subst_vars" | grep -c '^'`
+ac_delim='%!_!# '
+for ac_last_try in false false false false false :; do
+  . ./conf$$subs.sh ||
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+
+  ac_delim_n=`sed -n "s/.*$ac_delim\$/X/p" conf$$subs.awk | grep -c X`
+  if test $ac_delim_n = $ac_delim_num; then
+    break
+  elif $ac_last_try; then
+    as_fn_error $? "could not make $CONFIG_STATUS" "$LINENO" 5
+  else
+    ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
+  fi
+done
+rm -f conf$$subs.sh
+
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+cat >>"\$ac_tmp/subs1.awk" <<\\_ACAWK &&
+_ACEOF
+sed -n '
+h
+s/^/S["/; s/!.*/"]=/
+p
+g
+s/^[^!]*!//
+:repl
+t repl
+s/'"$ac_delim"'$//
+t delim
+:nl
+h
+s/\(.\{148\}\)..*/\1/
+t more1
+s/["\\]/\\&/g; s/^/"/; s/$/\\n"\\/
+p
+n
+b repl
+:more1
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t nl
+:delim
+h
+s/\(.\{148\}\)..*/\1/
+t more2
+s/["\\]/\\&/g; s/^/"/; s/$/"/
+p
+b
+:more2
+s/["\\]/\\&/g; s/^/"/; s/$/"\\/
+p
+g
+s/.\{148\}//
+t delim
+' <conf$$subs.awk | sed '
+/^[^""]/{
+  N
+  s/\n//
+}
+' >>$CONFIG_STATUS || ac_write_fail=1
+rm -f conf$$subs.awk
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+_ACAWK
+cat >>"\$ac_tmp/subs1.awk" <<_ACAWK &&
+  for (key in S) S_is_set[key] = 1
+  FS = ""
+  \$ac_cs_awk_pipe_init
+}
+{
+  line = $ 0
+  nfields = split(line, field, "@")
+  substed = 0
+  len = length(field[1])
+  for (i = 2; i < nfields; i++) {
+    key = field[i]
+    keylen = length(key)
+    if (S_is_set[key]) {
+      value = S[key]
+      line = substr(line, 1, len) "" value "" substr(line, len + keylen + 3)
+      len += length(value) + length(field[++i])
+      substed = 1
+    } else
+      len += 1 + keylen
+  }
+  if (nfields == 3 && !substed) {
+    key = field[2]
+    if (F[key] != "" && line ~ /^[	 ]*@.*@[	 ]*$/) {
+      \$ac_cs_awk_read_file
+      next
+    }
+  }
+  print line
+}
+\$ac_cs_awk_pipe_fini
+_ACAWK
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+if sed "s/$ac_cr//" < /dev/null > /dev/null 2>&1; then
+  sed "s/$ac_cr\$//; s/$ac_cr/$ac_cs_awk_cr/g"
+else
+  cat
+fi < "$ac_tmp/subs1.awk" > "$ac_tmp/subs.awk" \
+  || as_fn_error $? "could not setup config files machinery" "$LINENO" 5
+_ACEOF
+
+# VPATH may cause trouble with some makes, so we remove sole $(srcdir),
+# ${srcdir} and @srcdir@ entries from VPATH if srcdir is ".", strip leading and
+# trailing colons and then remove the whole line if VPATH becomes empty
+# (actually we leave an empty line to preserve line numbers).
+if test "x$srcdir" = x.; then
+  ac_vpsub='/^[	 ]*VPATH[	 ]*=[	 ]*/{
+h
+s///
+s/^/:/
+s/[	 ]*$/:/
+s/:\$(srcdir):/:/g
+s/:\${srcdir}:/:/g
+s/:@srcdir@:/:/g
+s/^:*//
+s/:*$//
+x
+s/\(=[	 ]*\).*/\1/
+G
+s/\n//
+s/^[^=]*=[	 ]*$//
+}'
+fi
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+fi # test -n "$CONFIG_FILES"
+
+
+eval set X "  :F $CONFIG_FILES      "
+shift
+for ac_tag
+do
+  case $ac_tag in
+  :[FHLC]) ac_mode=$ac_tag; continue;;
+  esac
+  case $ac_mode$ac_tag in
+  :[FHL]*:*);;
+  :L* | :C*:*) as_fn_error $? "invalid tag \`$ac_tag'" "$LINENO" 5;;
+  :[FH]-) ac_tag=-:-;;
+  :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
+  esac
+  ac_save_IFS=$IFS
+  IFS=:
+  set x $ac_tag
+  IFS=$ac_save_IFS
+  shift
+  ac_file=$1
+  shift
+
+  case $ac_mode in
+  :L) ac_source=$1;;
+  :[FH])
+    ac_file_inputs=
+    for ac_f
+    do
+      case $ac_f in
+      -) ac_f="$ac_tmp/stdin";;
+      *) # Look for the file first in the build tree, then in the source tree
+	 # (if the path is not absolute).  The absolute path cannot be DOS-style,
+	 # because $ac_f cannot contain `:'.
+	 test -f "$ac_f" ||
+	   case $ac_f in
+	   [\\/$]*) false;;
+	   *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
+	   esac ||
+	   as_fn_error 1 "cannot find input file: \`$ac_f'" "$LINENO" 5;;
+      esac
+      case $ac_f in *\'*) ac_f=`$as_echo "$ac_f" | sed "s/'/'\\\\\\\\''/g"`;; esac
+      as_fn_append ac_file_inputs " '$ac_f'"
+    done
+
+    # Let's still pretend it is `configure' which instantiates (i.e., don't
+    # use $as_me), people would be surprised to read:
+    #    /* config.h.  Generated by config.status.  */
+    configure_input='Generated from '`
+	  $as_echo "$*" | sed 's|^[^:]*/||;s|:[^:]*/|, |g'
+	`' by configure.'
+    if test x"$ac_file" != x-; then
+      configure_input="$ac_file.  $configure_input"
+      { $as_echo "$as_me:${as_lineno-$LINENO}: creating $ac_file" >&5
+$as_echo "$as_me: creating $ac_file" >&6;}
+    fi
+    # Neutralize special characters interpreted by sed in replacement strings.
+    case $configure_input in #(
+    *\&* | *\|* | *\\* )
+       ac_sed_conf_input=`$as_echo "$configure_input" |
+       sed 's/[\\\\&|]/\\\\&/g'`;; #(
+    *) ac_sed_conf_input=$configure_input;;
+    esac
+
+    case $ac_tag in
+    *:-:* | *:-) cat >"$ac_tmp/stdin" \
+      || as_fn_error $? "could not create $ac_file" "$LINENO" 5 ;;
+    esac
+    ;;
+  esac
+
+  ac_dir=`$as_dirname -- "$ac_file" ||
+$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	 X"$ac_file" : 'X\(//\)[^/]' \| \
+	 X"$ac_file" : 'X\(//\)$' \| \
+	 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
+$as_echo X"$ac_file" |
+    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)[^/].*/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\/\)$/{
+	    s//\1/
+	    q
+	  }
+	  /^X\(\/\).*/{
+	    s//\1/
+	    q
+	  }
+	  s/.*/./; q'`
+  as_dir="$ac_dir"; as_fn_mkdir_p
+  ac_builddir=.
+
+case "$ac_dir" in
+.) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
+*)
+  ac_dir_suffix=/`$as_echo "$ac_dir" | sed 's|^\.[\\/]||'`
+  # A ".." for each directory in $ac_dir_suffix.
+  ac_top_builddir_sub=`$as_echo "$ac_dir_suffix" | sed 's|/[^\\/]*|/..|g;s|/||'`
+  case $ac_top_builddir_sub in
+  "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
+  *)  ac_top_build_prefix=$ac_top_builddir_sub/ ;;
+  esac ;;
+esac
+ac_abs_top_builddir=$ac_pwd
+ac_abs_builddir=$ac_pwd$ac_dir_suffix
+# for backward compatibility:
+ac_top_builddir=$ac_top_build_prefix
+
+case $srcdir in
+  .)  # We are building in place.
+    ac_srcdir=.
+    ac_top_srcdir=$ac_top_builddir_sub
+    ac_abs_top_srcdir=$ac_pwd ;;
+  [\\/]* | ?:[\\/]* )  # Absolute name.
+    ac_srcdir=$srcdir$ac_dir_suffix;
+    ac_top_srcdir=$srcdir
+    ac_abs_top_srcdir=$srcdir ;;
+  *) # Relative name.
+    ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
+    ac_top_srcdir=$ac_top_build_prefix$srcdir
+    ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
+esac
+ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
+
+
+  case $ac_mode in
+  :F)
+  #
+  # CONFIG_FILE
+  #
+
+  case $INSTALL in
+  [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
+  *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
+  esac
+  ac_MKDIR_P=$MKDIR_P
+  case $MKDIR_P in
+  [\\/$]* | ?:[\\/]* ) ;;
+  */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
+  esac
+_ACEOF
+
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+# If the template does not know about datarootdir, expand it.
+# FIXME: This hack should be removed a few years after 2.60.
+ac_datarootdir_hack=; ac_datarootdir_seen=
+ac_sed_dataroot='
+/datarootdir/ {
+  p
+  q
+}
+/@datadir@/p
+/@docdir@/p
+/@infodir@/p
+/@localedir@/p
+/@mandir@/p'
+case `eval "sed -n \"\$ac_sed_dataroot\" $ac_file_inputs"` in
+*datarootdir*) ac_datarootdir_seen=yes;;
+*@datadir@*|*@docdir@*|*@infodir@*|*@localedir@*|*@mandir@*)
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&5
+$as_echo "$as_me: WARNING: $ac_file_inputs seems to ignore the --datarootdir setting" >&2;}
+_ACEOF
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+  ac_datarootdir_hack='
+  s&@datadir@&$datadir&g
+  s&@docdir@&$docdir&g
+  s&@infodir@&$infodir&g
+  s&@localedir@&$localedir&g
+  s&@mandir@&$mandir&g
+  s&\\\${datarootdir}&$datarootdir&g' ;;
+esac
+_ACEOF
+
+# Neutralize VPATH when `$srcdir' = `.'.
+# Shell code in configure.ac might set extrasub.
+# FIXME: do we really want to maintain this feature?
+cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
+ac_sed_extra="$ac_vpsub
+$extrasub
+_ACEOF
+cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
+:t
+/@[a-zA-Z_][a-zA-Z_0-9]*@/!b
+s|@configure_input@|$ac_sed_conf_input|;t t
+s&@top_builddir@&$ac_top_builddir_sub&;t t
+s&@top_build_prefix@&$ac_top_build_prefix&;t t
+s&@srcdir@&$ac_srcdir&;t t
+s&@abs_srcdir@&$ac_abs_srcdir&;t t
+s&@top_srcdir@&$ac_top_srcdir&;t t
+s&@abs_top_srcdir@&$ac_abs_top_srcdir&;t t
+s&@builddir@&$ac_builddir&;t t
+s&@abs_builddir@&$ac_abs_builddir&;t t
+s&@abs_top_builddir@&$ac_abs_top_builddir&;t t
+s&@INSTALL@&$ac_INSTALL&;t t
+s&@MKDIR_P@&$ac_MKDIR_P&;t t
+$ac_datarootdir_hack
+"
+eval sed \"\$ac_sed_extra\" "$ac_file_inputs" |
+if $ac_cs_awk_getline; then
+  $AWK -f "$ac_tmp/subs.awk"
+else
+  $AWK -f "$ac_tmp/subs.awk" | $SHELL
+fi \
+  >$ac_tmp/out || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+
+test -z "$ac_datarootdir_hack$ac_datarootdir_seen" &&
+  { ac_out=`sed -n '/\${datarootdir}/p' "$ac_tmp/out"`; test -n "$ac_out"; } &&
+  { ac_out=`sed -n '/^[	 ]*datarootdir[	 ]*:*=/p' \
+      "$ac_tmp/out"`; test -z "$ac_out"; } &&
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&5
+$as_echo "$as_me: WARNING: $ac_file contains a reference to the variable \`datarootdir'
+which seems to be undefined.  Please make sure it is defined" >&2;}
+
+  rm -f "$ac_tmp/stdin"
+  case $ac_file in
+  -) cat "$ac_tmp/out" && rm -f "$ac_tmp/out";;
+  *) rm -f "$ac_file" && mv "$ac_tmp/out" "$ac_file";;
+  esac \
+  || as_fn_error $? "could not create $ac_file" "$LINENO" 5
+ ;;
+
+
+
+  esac
+
+done # for ac_tag
+
+
+as_fn_exit 0
+_ACEOF
+ac_clean_files=$ac_clean_files_save
+
+test $ac_write_fail = 0 ||
+  as_fn_error $? "write failure creating $CONFIG_STATUS" "$LINENO" 5
+
+
+# configure is writing to config.log, and then calls config.status.
+# config.status does its own redirection, appending to config.log.
+# Unfortunately, on DOS this fails, as config.log is still kept open
+# by configure, so config.status won't be able to write to it; its
+# output is simply discarded.  So we exec the FD to /dev/null,
+# effectively closing config.log, so it can be properly (re)opened and
+# appended to by config.status.  When coming back to configure, we
+# need to make the FD available again.
+if test "$no_create" != yes; then
+  ac_cs_success=:
+  ac_config_status_args=
+  test "$silent" = yes &&
+    ac_config_status_args="$ac_config_status_args --quiet"
+  exec 5>/dev/null
+  $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false
+  exec 5>>config.log
+  # Use ||, not &&, to avoid exiting from the if with $? = 1, which
+  # would make configure fail if this is the last instruction.
+  $ac_cs_success || as_fn_exit 1
+fi
+if test -n "$ac_unrecognized_opts" && test "$enable_option_checking" != no; then
+  { $as_echo "$as_me:${as_lineno-$LINENO}: WARNING: unrecognized options: $ac_unrecognized_opts" >&5
+$as_echo "$as_me: WARNING: unrecognized options: $ac_unrecognized_opts" >&2;}
+fi
+
+

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure.ac
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure.ac	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/configure.ac	(revision 70339)
@@ -0,0 +1,22 @@
+AC_PREREQ(2.52)
+
+AC_INIT([Apertium {{languageName1}}-{{languageName2}}], [0.1.0], [super-antispam@ya.ru], [apertium-{{languageCode1}}-{{languageCode2}}], [http://wiki.apertium.org/wiki/Apertium-{{languageCode1}}-{{languageCode2}}])
+AM_INIT_AUTOMAKE
+
+AC_PROG_LN_S
+AC_PROG_AWK
+
+m4_define([required_apertium_version], [3.4.0])
+m4_define([required_lttoolbox_version], [3.3.2])
+
+PKG_CHECK_MODULES(APERTIUM, apertium >= required_apertium_version)
+PKG_CHECK_MODULES(LTTOOLBOX, lttoolbox >= required_lttoolbox_version)
+
+AC_PATH_PROG([CGCOMP], [cg-comp], [false], [$PATH$PATH_SEPARATOR$with_cg_comp/bin])
+AS_IF([test x$CGCOMP = xfalse], [AC_MSG_ERROR([You don't have cg-comp installed])])
+
+
+AP_MKINCLUDE
+
+AC_OUTPUT([Makefile apertium-rus.pc])
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/install-sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/install-sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/install-sh	(revision 70339)
@@ -0,0 +1,527 @@
+#!/bin/sh
+# install - install a program, script, or datafile
+
+scriptversion=2011-11-20.07; # UTC
+
+# This originates from X11R5 (mit/util/scripts/install.sh), which was
+# later released in X11R6 (xc/config/util/install.sh) with the
+# following copyright and license.
+#
+# Copyright (C) 1994 X Consortium
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to
+# deal in the Software without restriction, including without limitation the
+# rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+# sell copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in
+# all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+# X CONSORTIUM BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+# AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNEC-
+# TION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+# Except as contained in this notice, the name of the X Consortium shall not
+# be used in advertising or otherwise to promote the sale, use or other deal-
+# ings in this Software without prior written authorization from the X Consor-
+# tium.
+#
+#
+# FSF changes to this file are in the public domain.
+#
+# Calling this script install-sh is preferred over install.sh, to prevent
+# 'make' implicit rules from creating a file called install from it
+# when there is no Makefile.
+#
+# This script is compatible with the BSD install script, but was written
+# from scratch.
+
+nl='
+'
+IFS=" ""	$nl"
+
+# set DOITPROG to echo to test this script
+
+# Don't use :- since 4.3BSD and earlier shells don't like it.
+doit=${DOITPROG-}
+if test -z "$doit"; then
+  doit_exec=exec
+else
+  doit_exec=$doit
+fi
+
+# Put in absolute file names if you don't have them in your path;
+# or use environment vars.
+
+chgrpprog=${CHGRPPROG-chgrp}
+chmodprog=${CHMODPROG-chmod}
+chownprog=${CHOWNPROG-chown}
+cmpprog=${CMPPROG-cmp}
+cpprog=${CPPROG-cp}
+mkdirprog=${MKDIRPROG-mkdir}
+mvprog=${MVPROG-mv}
+rmprog=${RMPROG-rm}
+stripprog=${STRIPPROG-strip}
+
+posix_glob='?'
+initialize_posix_glob='
+  test "$posix_glob" != "?" || {
+    if (set -f) 2>/dev/null; then
+      posix_glob=
+    else
+      posix_glob=:
+    fi
+  }
+'
+
+posix_mkdir=
+
+# Desired mode of installed file.
+mode=0755
+
+chgrpcmd=
+chmodcmd=$chmodprog
+chowncmd=
+mvcmd=$mvprog
+rmcmd="$rmprog -f"
+stripcmd=
+
+src=
+dst=
+dir_arg=
+dst_arg=
+
+copy_on_change=false
+no_target_directory=
+
+usage="\
+Usage: $0 [OPTION]... [-T] SRCFILE DSTFILE
+   or: $0 [OPTION]... SRCFILES... DIRECTORY
+   or: $0 [OPTION]... -t DIRECTORY SRCFILES...
+   or: $0 [OPTION]... -d DIRECTORIES...
+
+In the 1st form, copy SRCFILE to DSTFILE.
+In the 2nd and 3rd, copy all SRCFILES to DIRECTORY.
+In the 4th, create DIRECTORIES.
+
+Options:
+     --help     display this help and exit.
+     --version  display version info and exit.
+
+  -c            (ignored)
+  -C            install only if different (preserve the last data modification time)
+  -d            create directories instead of installing files.
+  -g GROUP      $chgrpprog installed files to GROUP.
+  -m MODE       $chmodprog installed files to MODE.
+  -o USER       $chownprog installed files to USER.
+  -s            $stripprog installed files.
+  -t DIRECTORY  install into DIRECTORY.
+  -T            report an error if DSTFILE is a directory.
+
+Environment variables override the default commands:
+  CHGRPPROG CHMODPROG CHOWNPROG CMPPROG CPPROG MKDIRPROG MVPROG
+  RMPROG STRIPPROG
+"
+
+while test $# -ne 0; do
+  case $1 in
+    -c) ;;
+
+    -C) copy_on_change=true;;
+
+    -d) dir_arg=true;;
+
+    -g) chgrpcmd="$chgrpprog $2"
+	shift;;
+
+    --help) echo "$usage"; exit $?;;
+
+    -m) mode=$2
+	case $mode in
+	  *' '* | *'	'* | *'
+'*	  | *'*'* | *'?'* | *'['*)
+	    echo "$0: invalid mode: $mode" >&2
+	    exit 1;;
+	esac
+	shift;;
+
+    -o) chowncmd="$chownprog $2"
+	shift;;
+
+    -s) stripcmd=$stripprog;;
+
+    -t) dst_arg=$2
+	# Protect names problematic for 'test' and other utilities.
+	case $dst_arg in
+	  -* | [=\(\)!]) dst_arg=./$dst_arg;;
+	esac
+	shift;;
+
+    -T) no_target_directory=true;;
+
+    --version) echo "$0 $scriptversion"; exit $?;;
+
+    --)	shift
+	break;;
+
+    -*)	echo "$0: invalid option: $1" >&2
+	exit 1;;
+
+    *)  break;;
+  esac
+  shift
+done
+
+if test $# -ne 0 && test -z "$dir_arg$dst_arg"; then
+  # When -d is used, all remaining arguments are directories to create.
+  # When -t is used, the destination is already specified.
+  # Otherwise, the last argument is the destination.  Remove it from $@.
+  for arg
+  do
+    if test -n "$dst_arg"; then
+      # $@ is not empty: it contains at least $arg.
+      set fnord "$@" "$dst_arg"
+      shift # fnord
+    fi
+    shift # arg
+    dst_arg=$arg
+    # Protect names problematic for 'test' and other utilities.
+    case $dst_arg in
+      -* | [=\(\)!]) dst_arg=./$dst_arg;;
+    esac
+  done
+fi
+
+if test $# -eq 0; then
+  if test -z "$dir_arg"; then
+    echo "$0: no input file specified." >&2
+    exit 1
+  fi
+  # It's OK to call 'install-sh -d' without argument.
+  # This can happen when creating conditional directories.
+  exit 0
+fi
+
+if test -z "$dir_arg"; then
+  do_exit='(exit $ret); exit $ret'
+  trap "ret=129; $do_exit" 1
+  trap "ret=130; $do_exit" 2
+  trap "ret=141; $do_exit" 13
+  trap "ret=143; $do_exit" 15
+
+  # Set umask so as not to create temps with too-generous modes.
+  # However, 'strip' requires both read and write access to temps.
+  case $mode in
+    # Optimize common cases.
+    *644) cp_umask=133;;
+    *755) cp_umask=22;;
+
+    *[0-7])
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw='% 200'
+      fi
+      cp_umask=`expr '(' 777 - $mode % 1000 ')' $u_plus_rw`;;
+    *)
+      if test -z "$stripcmd"; then
+	u_plus_rw=
+      else
+	u_plus_rw=,u+rw
+      fi
+      cp_umask=$mode$u_plus_rw;;
+  esac
+fi
+
+for src
+do
+  # Protect names problematic for 'test' and other utilities.
+  case $src in
+    -* | [=\(\)!]) src=./$src;;
+  esac
+
+  if test -n "$dir_arg"; then
+    dst=$src
+    dstdir=$dst
+    test -d "$dstdir"
+    dstdir_status=$?
+  else
+
+    # Waiting for this to be detected by the "$cpprog $src $dsttmp" command
+    # might cause directories to be created, which would be especially bad
+    # if $src (and thus $dsttmp) contains '*'.
+    if test ! -f "$src" && test ! -d "$src"; then
+      echo "$0: $src does not exist." >&2
+      exit 1
+    fi
+
+    if test -z "$dst_arg"; then
+      echo "$0: no destination specified." >&2
+      exit 1
+    fi
+    dst=$dst_arg
+
+    # If destination is a directory, append the input filename; won't work
+    # if double slashes aren't ignored.
+    if test -d "$dst"; then
+      if test -n "$no_target_directory"; then
+	echo "$0: $dst_arg: Is a directory" >&2
+	exit 1
+      fi
+      dstdir=$dst
+      dst=$dstdir/`basename "$src"`
+      dstdir_status=0
+    else
+      # Prefer dirname, but fall back on a substitute if dirname fails.
+      dstdir=`
+	(dirname "$dst") 2>/dev/null ||
+	expr X"$dst" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
+	     X"$dst" : 'X\(//\)[^/]' \| \
+	     X"$dst" : 'X\(//\)$' \| \
+	     X"$dst" : 'X\(/\)' \| . 2>/dev/null ||
+	echo X"$dst" |
+	    sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)[^/].*/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\/\)$/{
+		   s//\1/
+		   q
+		 }
+		 /^X\(\/\).*/{
+		   s//\1/
+		   q
+		 }
+		 s/.*/./; q'
+      `
+
+      test -d "$dstdir"
+      dstdir_status=$?
+    fi
+  fi
+
+  obsolete_mkdir_used=false
+
+  if test $dstdir_status != 0; then
+    case $posix_mkdir in
+      '')
+	# Create intermediate dirs using mode 755 as modified by the umask.
+	# This is like FreeBSD 'install' as of 1997-10-28.
+	umask=`umask`
+	case $stripcmd.$umask in
+	  # Optimize common cases.
+	  *[2367][2367]) mkdir_umask=$umask;;
+	  .*0[02][02] | .[02][02] | .[02]) mkdir_umask=22;;
+
+	  *[0-7])
+	    mkdir_umask=`expr $umask + 22 \
+	      - $umask % 100 % 40 + $umask % 20 \
+	      - $umask % 10 % 4 + $umask % 2
+	    `;;
+	  *) mkdir_umask=$umask,go-w;;
+	esac
+
+	# With -d, create the new directory with the user-specified mode.
+	# Otherwise, rely on $mkdir_umask.
+	if test -n "$dir_arg"; then
+	  mkdir_mode=-m$mode
+	else
+	  mkdir_mode=
+	fi
+
+	posix_mkdir=false
+	case $umask in
+	  *[123567][0-7][0-7])
+	    # POSIX mkdir -p sets u+wx bits regardless of umask, which
+	    # is incompatible with FreeBSD 'install' when (umask & 300) != 0.
+	    ;;
+	  *)
+	    tmpdir=${TMPDIR-/tmp}/ins$RANDOM-$$
+	    trap 'ret=$?; rmdir "$tmpdir/d" "$tmpdir" 2>/dev/null; exit $ret' 0
+
+	    if (umask $mkdir_umask &&
+		exec $mkdirprog $mkdir_mode -p -- "$tmpdir/d") >/dev/null 2>&1
+	    then
+	      if test -z "$dir_arg" || {
+		   # Check for POSIX incompatibilities with -m.
+		   # HP-UX 11.23 and IRIX 6.5 mkdir -m -p sets group- or
+		   # other-writable bit of parent directory when it shouldn't.
+		   # FreeBSD 6.1 mkdir -m -p sets mode of existing directory.
+		   ls_ld_tmpdir=`ls -ld "$tmpdir"`
+		   case $ls_ld_tmpdir in
+		     d????-?r-*) different_mode=700;;
+		     d????-?--*) different_mode=755;;
+		     *) false;;
+		   esac &&
+		   $mkdirprog -m$different_mode -p -- "$tmpdir" && {
+		     ls_ld_tmpdir_1=`ls -ld "$tmpdir"`
+		     test "$ls_ld_tmpdir" = "$ls_ld_tmpdir_1"
+		   }
+		 }
+	      then posix_mkdir=:
+	      fi
+	      rmdir "$tmpdir/d" "$tmpdir"
+	    else
+	      # Remove any dirs left behind by ancient mkdir implementations.
+	      rmdir ./$mkdir_mode ./-p ./-- 2>/dev/null
+	    fi
+	    trap '' 0;;
+	esac;;
+    esac
+
+    if
+      $posix_mkdir && (
+	umask $mkdir_umask &&
+	$doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir"
+      )
+    then :
+    else
+
+      # The umask is ridiculous, or mkdir does not conform to POSIX,
+      # or it failed possibly due to a race condition.  Create the
+      # directory the slow way, step by step, checking for races as we go.
+
+      case $dstdir in
+	/*) prefix='/';;
+	[-=\(\)!]*) prefix='./';;
+	*)  prefix='';;
+      esac
+
+      eval "$initialize_posix_glob"
+
+      oIFS=$IFS
+      IFS=/
+      $posix_glob set -f
+      set fnord $dstdir
+      shift
+      $posix_glob set +f
+      IFS=$oIFS
+
+      prefixes=
+
+      for d
+      do
+	test X"$d" = X && continue
+
+	prefix=$prefix$d
+	if test -d "$prefix"; then
+	  prefixes=
+	else
+	  if $posix_mkdir; then
+	    (umask=$mkdir_umask &&
+	     $doit_exec $mkdirprog $mkdir_mode -p -- "$dstdir") && break
+	    # Don't fail if two instances are running concurrently.
+	    test -d "$prefix" || exit 1
+	  else
+	    case $prefix in
+	      *\'*) qprefix=`echo "$prefix" | sed "s/'/'\\\\\\\\''/g"`;;
+	      *) qprefix=$prefix;;
+	    esac
+	    prefixes="$prefixes '$qprefix'"
+	  fi
+	fi
+	prefix=$prefix/
+      done
+
+      if test -n "$prefixes"; then
+	# Don't fail if two instances are running concurrently.
+	(umask $mkdir_umask &&
+	 eval "\$doit_exec \$mkdirprog $prefixes") ||
+	  test -d "$dstdir" || exit 1
+	obsolete_mkdir_used=true
+      fi
+    fi
+  fi
+
+  if test -n "$dir_arg"; then
+    { test -z "$chowncmd" || $doit $chowncmd "$dst"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dst"; } &&
+    { test "$obsolete_mkdir_used$chowncmd$chgrpcmd" = false ||
+      test -z "$chmodcmd" || $doit $chmodcmd $mode "$dst"; } || exit 1
+  else
+
+    # Make a couple of temp file names in the proper directory.
+    dsttmp=$dstdir/_inst.$$_
+    rmtmp=$dstdir/_rm.$$_
+
+    # Trap to clean up those temp files at exit.
+    trap 'ret=$?; rm -f "$dsttmp" "$rmtmp" && exit $ret' 0
+
+    # Copy the file name to the temp name.
+    (umask $cp_umask && $doit_exec $cpprog "$src" "$dsttmp") &&
+
+    # and set any options; do chmod last to preserve setuid bits.
+    #
+    # If any of these fail, we abort the whole thing.  If we want to
+    # ignore errors from any of these, just make sure not to ignore
+    # errors from the above "$doit $cpprog $src $dsttmp" command.
+    #
+    { test -z "$chowncmd" || $doit $chowncmd "$dsttmp"; } &&
+    { test -z "$chgrpcmd" || $doit $chgrpcmd "$dsttmp"; } &&
+    { test -z "$stripcmd" || $doit $stripcmd "$dsttmp"; } &&
+    { test -z "$chmodcmd" || $doit $chmodcmd $mode "$dsttmp"; } &&
+
+    # If -C, don't bother to copy if it wouldn't change the file.
+    if $copy_on_change &&
+       old=`LC_ALL=C ls -dlL "$dst"	2>/dev/null` &&
+       new=`LC_ALL=C ls -dlL "$dsttmp"	2>/dev/null` &&
+
+       eval "$initialize_posix_glob" &&
+       $posix_glob set -f &&
+       set X $old && old=:$2:$4:$5:$6 &&
+       set X $new && new=:$2:$4:$5:$6 &&
+       $posix_glob set +f &&
+
+       test "$old" = "$new" &&
+       $cmpprog "$dst" "$dsttmp" >/dev/null 2>&1
+    then
+      rm -f "$dsttmp"
+    else
+      # Rename the file to the real destination.
+      $doit $mvcmd -f "$dsttmp" "$dst" 2>/dev/null ||
+
+      # The rename failed, perhaps because mv can't rename something else
+      # to itself, or perhaps because mv is so ancient that it does not
+      # support -f.
+      {
+	# Now remove or move aside any old file at destination location.
+	# We try this two ways since rm can't unlink itself on some
+	# systems and the destination file might be busy for other
+	# reasons.  In this case, the final cleanup might fail but the new
+	# file should still install successfully.
+	{
+	  test ! -f "$dst" ||
+	  $doit $rmcmd -f "$dst" 2>/dev/null ||
+	  { $doit $mvcmd -f "$dst" "$rmtmp" 2>/dev/null &&
+	    { $doit $rmcmd -f "$rmtmp" 2>/dev/null; :; }
+	  } ||
+	  { echo "$0: cannot unlink or rename $dst" >&2
+	    (exit 1); exit 1
+	  }
+	} &&
+
+	# Now rename the file to the real destination.
+	$doit $mvcmd "$dsttmp" "$dst"
+      }
+    fi || exit 1
+
+    trap '' 0
+  fi
+done
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/install-sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/missing
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/missing	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/missing	(revision 70339)
@@ -0,0 +1,215 @@
+#! /bin/sh
+# Common wrapper for a few potentially missing GNU programs.
+
+scriptversion=2013-10-28.13; # UTC
+
+# Copyright (C) 1996-2013 Free Software Foundation, Inc.
+# Originally written by Fran,cois Pinard <pinard@iro.umontreal.ca>, 1996.
+
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2, or (at your option)
+# any later version.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+
+# You should have received a copy of the GNU General Public License
+# along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that program.
+
+if test $# -eq 0; then
+  echo 1>&2 "Try '$0 --help' for more information"
+  exit 1
+fi
+
+case $1 in
+
+  --is-lightweight)
+    # Used by our autoconf macros to check whether the available missing
+    # script is modern enough.
+    exit 0
+    ;;
+
+  --run)
+    # Back-compat with the calling convention used by older automake.
+    shift
+    ;;
+
+  -h|--h|--he|--hel|--help)
+    echo "\
+$0 [OPTION]... PROGRAM [ARGUMENT]...
+
+Run 'PROGRAM [ARGUMENT]...', returning a proper advice when this fails due
+to PROGRAM being missing or too old.
+
+Options:
+  -h, --help      display this help and exit
+  -v, --version   output version information and exit
+
+Supported PROGRAM values:
+  aclocal   autoconf  autoheader   autom4te  automake  makeinfo
+  bison     yacc      flex         lex       help2man
+
+Version suffixes to PROGRAM as well as the prefixes 'gnu-', 'gnu', and
+'g' are ignored when checking the name.
+
+Send bug reports to <bug-automake@gnu.org>."
+    exit $?
+    ;;
+
+  -v|--v|--ve|--ver|--vers|--versi|--versio|--version)
+    echo "missing $scriptversion (GNU Automake)"
+    exit $?
+    ;;
+
+  -*)
+    echo 1>&2 "$0: unknown '$1' option"
+    echo 1>&2 "Try '$0 --help' for more information"
+    exit 1
+    ;;
+
+esac
+
+# Run the given program, remember its exit status.
+"$@"; st=$?
+
+# If it succeeded, we are done.
+test $st -eq 0 && exit 0
+
+# Also exit now if we it failed (or wasn't found), and '--version' was
+# passed; such an option is passed most likely to detect whether the
+# program is present and works.
+case $2 in --version|--help) exit $st;; esac
+
+# Exit code 63 means version mismatch.  This often happens when the user
+# tries to use an ancient version of a tool on a file that requires a
+# minimum version.
+if test $st -eq 63; then
+  msg="probably too old"
+elif test $st -eq 127; then
+  # Program was missing.
+  msg="missing on your system"
+else
+  # Program was found and executed, but failed.  Give up.
+  exit $st
+fi
+
+perl_URL=http://www.perl.org/
+flex_URL=http://flex.sourceforge.net/
+gnu_software_URL=http://www.gnu.org/software
+
+program_details ()
+{
+  case $1 in
+    aclocal|automake)
+      echo "The '$1' program is part of the GNU Automake package:"
+      echo "<$gnu_software_URL/automake>"
+      echo "It also requires GNU Autoconf, GNU m4 and Perl in order to run:"
+      echo "<$gnu_software_URL/autoconf>"
+      echo "<$gnu_software_URL/m4/>"
+      echo "<$perl_URL>"
+      ;;
+    autoconf|autom4te|autoheader)
+      echo "The '$1' program is part of the GNU Autoconf package:"
+      echo "<$gnu_software_URL/autoconf/>"
+      echo "It also requires GNU m4 and Perl in order to run:"
+      echo "<$gnu_software_URL/m4/>"
+      echo "<$perl_URL>"
+      ;;
+  esac
+}
+
+give_advice ()
+{
+  # Normalize program name to check for.
+  normalized_program=`echo "$1" | sed '
+    s/^gnu-//; t
+    s/^gnu//; t
+    s/^g//; t'`
+
+  printf '%s\n' "'$1' is $msg."
+
+  configure_deps="'configure.ac' or m4 files included by 'configure.ac'"
+  case $normalized_program in
+    autoconf*)
+      echo "You should only need it if you modified 'configure.ac',"
+      echo "or m4 files included by it."
+      program_details 'autoconf'
+      ;;
+    autoheader*)
+      echo "You should only need it if you modified 'acconfig.h' or"
+      echo "$configure_deps."
+      program_details 'autoheader'
+      ;;
+    automake*)
+      echo "You should only need it if you modified 'Makefile.am' or"
+      echo "$configure_deps."
+      program_details 'automake'
+      ;;
+    aclocal*)
+      echo "You should only need it if you modified 'acinclude.m4' or"
+      echo "$configure_deps."
+      program_details 'aclocal'
+      ;;
+   autom4te*)
+      echo "You might have modified some maintainer files that require"
+      echo "the 'autom4te' program to be rebuilt."
+      program_details 'autom4te'
+      ;;
+    bison*|yacc*)
+      echo "You should only need it if you modified a '.y' file."
+      echo "You may want to install the GNU Bison package:"
+      echo "<$gnu_software_URL/bison/>"
+      ;;
+    lex*|flex*)
+      echo "You should only need it if you modified a '.l' file."
+      echo "You may want to install the Fast Lexical Analyzer package:"
+      echo "<$flex_URL>"
+      ;;
+    help2man*)
+      echo "You should only need it if you modified a dependency" \
+           "of a man page."
+      echo "You may want to install the GNU Help2man package:"
+      echo "<$gnu_software_URL/help2man/>"
+    ;;
+    makeinfo*)
+      echo "You should only need it if you modified a '.texi' file, or"
+      echo "any other file indirectly affecting the aspect of the manual."
+      echo "You might want to install the Texinfo package:"
+      echo "<$gnu_software_URL/texinfo/>"
+      echo "The spurious makeinfo call might also be the consequence of"
+      echo "using a buggy 'make' (AIX, DU, IRIX), in which case you might"
+      echo "want to install GNU make:"
+      echo "<$gnu_software_URL/make/>"
+      ;;
+    *)
+      echo "You might have modified some files without having the proper"
+      echo "tools for further handling them.  Check the 'README' file, it"
+      echo "often tells you about the needed prerequisites for installing"
+      echo "this package.  You may also peek at any GNU archive site, in"
+      echo "case some other package contains this missing '$1' program."
+      ;;
+  esac
+}
+
+give_advice "$1" | sed -e '1s/^/WARNING: /' \
+                       -e '2,$s/^/         /' >&2
+
+# Propagate the correct exit status (expected to be 127 for a program
+# not found, 63 for a program that failed due to version mismatch).
+exit $st
+
+# Local variables:
+# eval: (add-hook 'write-file-hooks 'time-stamp)
+# time-stamp-start: "scriptversion="
+# time-stamp-format: "%:y-%02m-%02d.%02H"
+# time-stamp-time-zone: "UTC"
+# time-stamp-end: "; # UTC"
+# End:

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/missing
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-disam.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-disam.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-disam.mode	(revision 70339)
@@ -0,0 +1,5 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/rus.automorf.bin' | cg-conv -a -l| vislcg3 --trace -g '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/apertium-rus.rus.rlx' 
+  
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-gener.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-gener.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-gener.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -g '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/rus.autogen.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-morph.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-morph.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-morph.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/rus.automorf.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-tagger.mode
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-tagger.mode	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes/rus-tagger.mode	(revision 70339)
@@ -0,0 +1,6 @@
+
+  
+    lt-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/rus.automorf.bin' | cg-proc -w '/home/nm/source/apertium/weighted-transfer/apertium-toy-ru-en/apertium-rus/rus.rlx.bin' 
+  
+
+  
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/modes.xml	(revision 70339)
@@ -0,0 +1,44 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<modes>
+
+  <mode name="rus-morph">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus.automorf.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-gener">
+    <pipeline>
+      <program name="lt-proc -g">
+        <file name="rus.autogen.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-tagger">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus.automorf.bin"/>
+      </program>
+      <program name="cg-proc -w">
+        <file name="rus.rlx.bin"/>
+      </program>
+    </pipeline>
+  </mode>
+
+  <mode name="rus-disam">
+    <pipeline>
+      <program name="lt-proc -w">
+        <file name="rus.automorf.bin"/>
+      </program>
+      <program name="cg-conv -a -l" />
+      <program name="vislcg3 --trace -g">
+        <file name="apertium-rus.rus.rlx"/>
+      </program>
+    </pipeline>
+  </mode>
+
+</modes>
+
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.att.gz
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.att.gz
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.att.gz	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.att.gz	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.att.gz
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autogen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.att.gz
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.att.gz
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.att.gz	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.att.gz	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.att.gz
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.automorf.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autopgen.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autopgen.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autopgen.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autopgen.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.autopgen.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.prob
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.prob	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.prob	(revision 70339)
@@ -0,0 +1,50 @@
+$































**7	
+80 0!11!22 
+@B@T@A@G@_@L@P@A@R@T@A@G@_@R@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@C@M@T@A@G@_@S@E@N@T@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F
+@E@V@E@R@Y@T@H@I@N@G@V@A@N@A@D@V@T@E@P@R@E@A@D@V@D@E@H@E@T@N@O@U@N@N@O@U@N@P@L@N@O@U@N@M@N@O@U@N@F@N@O@U@N@M@F@N@O@U@N@N@T@N@O@U@N@A@C@R@A@D@J@P@R@E@D@A@D@J@A@T@T@R@A@D@J@P@A@R@T@A@D@J@A@D@J@S@I@N@T@P@R@E@D@A@D@J@S@I@N@T@A@T@T@R@A@D@J@S@I@N@T@A@D@V@V@B@L@E@X@I@M@P@V@B@L@E@X@I@N@F@V@B@L@E@X@V@E@R@B@V@E@R@B@P1@V@E@R@B@P2@V@E@R@B@P3@V@A@U@X@V@B@M@O@D@V@B@S@E@R@V@B@H@A@V@E@R@V@B@S@E@P@C@N@J@C@O@O@C@N@J@S@U@B@C@N@J@A@D@V@P@R@N@N@P@A@N@T@N@P@T@O@P@N@P@C@O@G@N@P@A@L@P@R	@P@R@N@S@U@B@J@P1	@P@R@N@S@U@B@J@P2	@P@R@N@S@U@B@J@P3@R@E@L@P@R@E@A@D@V@I@J@N@U@M@D@E@T@D@E@T@D@E@F@D@E@T@I@N@D@P@U@N@C@k@M@O@T@k@D@O@L@L@A@R@k@B@A@R@R@A@k@M@A@S@k@I@G@N@O@R@A@R@k@B@E@G@I@N@k@U@N@K@N@O@W@N;@T@A@G@_@A@D@J@T@A@G@_@A@D@J@A@T@T@R@T@A@G@_@A@D@J@P@A@R@T@T@A@G@_@A@D@J@P@R@E@D@T@A@G@_@A@D@J@S@I@N@T@T@A@G@_@A@D@J@S@I@N@T@A@T@T@R@T@A@G@_@A@D@J@S@I@N@T@P@R@E@D@T@A@G@_@A@D@V@T@A@G@_@C@M
+@T@A@G@_@C@N@J@A@D@V)
+@T@A@G@_@C@N@J@C@O@O'
+@T@A@G@_@C@N@J@S@U@B(@T@A@G@_@D@E
+@T@A@G@_@D@E@T7
+@T@A@G@_@D@E@T@D@E@F8
+@T@A@G@_@D@E@T@I@N@D9@T@A@G@_@E@V@E@R@Y@T@H@I@N@G@T@A@G@_@H@E@T@T@A@G@_@I@J5@T@A@G@_@L@P@A@R
+@T@A@G@_@L@Q@U@E@S@T@T@A@G@_@N@O@U@N@T@A@G@_@N@O@U@N@A@C@R	@T@A@G@_@N@O@U@N@F	@T@A@G@_@N@O@U@N@M
+@T@A@G@_@N@O@U@N@M@F
+@T@A@G@_@N@O@U@N@N@T
+@T@A@G@_@N@O@U@N@P@L
+@T@A@G@_@N@P@A@L.	@T@A@G@_@N@P@A@N@T+	@T@A@G@_@N@P@C@O@G-	@T@A@G@_@N@P@T@O@P,@T@A@G@_@N@U@M6@T@A@G@_@P@R/
+@T@A@G@_@P@R@E@A@D@V4@T@A@G@_@P@R@N*
+@T@A@G@_@P@R@N@S@U@B@J@P10
+@T@A@G@_@P@R@N@S@U@B@J@P21
+@T@A@G@_@P@R@N@S@U@B@J@P32@T@A@G@_@P@U@N@C:@T@A@G@_@R@E@L3@T@A@G@_@R@P@A@R
@T@A@G@_@S@E@N@T@T@A@G@_@T@E@P@R@E@A@D@V	
+@T@A@G@_@V@A@N@A@D@V@T@A@G@_@V@A@U@X"@T@A@G@_@V@B@H@A@V@E@R%	@T@A@G@_@V@B@L@E@X@T@A@G@_@V@B@L@E@X@I@M@P@T@A@G@_@V@B@L@E@X@I@N@F	@T@A@G@_@V@B@M@O@D#	@T@A@G@_@V@B@S@E@P&	@T@A@G@_@V@B@S@E@R$@T@A@G@_@V@E@R@B
+@T@A@G@_@V@E@R@B@P1
+@T@A@G@_@V@E@R@B@P2 
+@T@A@G@_@V@E@R@B@P3!@T@A@G@_@k@E@O@F
+@T@A@G@_@k@U@N@D@E@F@k@B@A@R@R@A=@k@B@E@G@I@N@@@k@D@O@L@L@A@R<@k@I@G@N@O@R@A@R?@k@M@A@S>@k@M@O@T;@k@U@N@K@N@O@W@N@A<






$	
+
+ !"#&+,-.56



	

+



+


















 
!
"
#
$
%
&
'
(
)
*
+
,
-
.
/
0
1
2
3
4
5
6
7
8
9
:;<?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'�8�8�8�8�8?��8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8�8?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́?��}�&Q=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q=�s�D1́=�s�D1́?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?��}�&Q?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��=��3(��y?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?���a��?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'?�[_u'@_?�
?�?�?�
?�?�?�?�?�?�	?�	?�	
+?�
+?�
+?�?�?�?�
+?�
+?�
+?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?�?� ?� ?� !?�!?�!"?�"?�"#?�#?�#$?�$%?�%&?�&?�&'?�'(?�()?�)*?�*+?�+?�+,?�,?�,-?�-?�-.?�.?�./?�/0?�01?�12?�23?�34?�45?�5?�56?�6?�67?�78?�89?�9:?�:;?�>@A@N@Y@_@T@A@G@A@N@Y@_@C@H@A@R@Q@U@E@U@E@a@d@v@p@r@e@a@d@v@d@e@t@d@e@f@m@f@s@g@m@f@n@p@l@n@t
@n
@m
@f@a@c@r@a@d@j@p@r@e@d@s@i@n@t@c@o@m@p@s@u@p@a@t@t@r@p@a@r@t@v@b@l@e@x@i@m@p@s@e@p@i@n@f@p@a@s@t@p@r@e@s@p@r@s@p@p@r@s@p@p@v@b@a@u@x@v@b@m@o@d@v@b@s@e@r@v@b@h@a@v@e@r@p1@p2@p3@v@a@u@x@c@n@j@c@o@o@c@n@j@s@u@b@c@n@j@a@d@v@p@r@n@n@p@a@n@t@t@o@p@c@o@g@a@l@p@r@s@u@b@j@r@e@l@i@j@n@u@m@i@n@d@a@p@o@s@g@u@i@o@c@m@l@p@a@r@r@p@a@r@l@q@u@e@s@t@s@e@n@t
>>
@t@a@g@g@e@r@�




















































































































@�<
@�@N@@	???
??@�?@�@@@�?@�?@�@@@�@C@�?@�?@�?@�?@�?@�@B@{?@x?@u?@r@G@W@E9@B#@E@�?@�?@S@@?@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<
@�

@�

:
@^
@A
@z

<
@�

9
@^
@A
@z

<
@�

8

7
2@@@@

5
@^
@A
@z

<
3
@^
@A
@z

<
5
@^
@A
@z

<.?
+?@@@B
+@E
3@H@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<'?@A?
@^
@A
@z

<'???@@
@O@^
@A
@z

<(
+@B
@^
@A
@z

<(	@B
@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=
@_@A@z=@_
@A
@z

<
<	???????
@V
=
=@_
@A
@z

<#@@
@V@S
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
,??@b@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@^
@A
@z

<@p
=@_
@A
@z

<
+???

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<??

=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<=@_
@A
@z

<=@_
@A
@z

<@n@D
=@_
@A
@z

<
=
=@_
@A
@z

<
=
=@_
@A
@z

<@^
@A
@z

<@^
@A
@z

<@�

	
+
+		
+
+
+ 
+"#%&'
+(
+)
+*
+,-/0235689;<>?@A@B@D@E@F@G@H@I@J@K@L@M@N@O@P@Q@R@S@T@U@V@W@Z@[@^@_@`@a@b@c@e@f@h@i@k@l@m@n@o@p@q@r@t@u@w@x@z@{@}@~@�@�@�@�@�@�@�@�@�@�@� @� @� @� @� @� @� @� @� @� @�!@�!@�!@�!@�!@�!@�!@�!@�!@�!@�"@�"@�&@�&@�'@�'@�(@�(@�)@�)@�*@�*@�+@�+@�,@�,@�-@�-@�.@�.@�/@�/@�0@�0@�1@�1@�2@�2@�3@�3@�4@�4@�5@�5@�6@�6@�6@�6@�7@�7@�8@�8@�9@�9@�:@�:@�:@�:
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.rlx.bin
===================================================================
Cannot display: file marked as a binary type.
svn:mime-type = application/octet-stream
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.rlx.bin
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.rlx.bin	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.rlx.bin	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/apertium-rus/rus.rlx.bin
___________________________________________________________________
Added: svn:mime-type
## -0,0 +1 ##
+application/octet-stream
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/dummy_weights.py
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/dummy_weights.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/dummy_weights.py	(revision 70339)
@@ -0,0 +1,47 @@
+#! /usr/bin/python3
+
+from lxml import etree
+import hashlib
+import re
+
+whitespace_re = re.compile('\s')
+
+ifname = './apertium-rus-eng/apertium-rus-eng.rus-eng.t1x'
+ofname = 'apertium-rus-eng.rus-eng.w1x'
+
+iroot = etree.parse(ifname).getroot()
+
+# get all 'def-cat' elements
+def_cat_dict = {}
+for def_cat in iroot.find('section-def-cats').findall('def-cat'):
+    item_list = [cat_item.attrib for cat_item in def_cat.findall('cat-item')]
+    def_cat_dict[def_cat.attrib['n']] = item_list
+
+oroot = etree.Element('transfer-weights')
+for et_rule in iroot.find('section-rules').findall('rule'):
+    if 'id' not in et_rule.attrib:
+        continue
+
+    # make 'rule' element for weights file, id, md5, and comment
+    et_newrule = etree.SubElement(oroot, 'rule')
+    et_newrule.attrib.update(et_rule.attrib)
+    clean = whitespace_re.sub('', etree.tostring(et_rule, encoding='unicode'))
+    et_newrule.attrib['md5'] = hashlib.md5(clean.encode()).hexdigest()
+
+    # list all variations of generic pattern...
+    pattern_list = [[]]
+    for et_pattern_item in et_rule.find('pattern').findall('pattern-item'):
+        item_list = def_cat_dict[et_pattern_item.attrib['n']]
+        pattern_list = sum([[pattern + [item] 
+                                for pattern in pattern_list] 
+                                    for item in item_list], [])
+
+    # ...and add them
+    for pattern_items in pattern_list:
+        et_pattern = etree.SubElement(et_newrule, 'pattern')
+        et_pattern.attrib['weight'] = ''
+        for pattern_item in pattern_items:
+            et_pattern_item = etree.SubElement(et_pattern, 'pattern-item')
+            et_pattern_item.attrib.update(pattern_item)
+
+etree.ElementTree(oroot).write(ofname, pretty_print=True, encoding='utf-8', xml_declaration=True)

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/dummy_weights.py
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/compile.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/compile.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/compile.sh	(revision 70339)
@@ -0,0 +1,14 @@
+#! /bin/sh
+
+cd ./apertium-rus
+lt-comp lr apertium-rus.rus.dix rus-eng.automorf.bin
+lt-comp rl apertium-rus.rus.dix eng-rus.autogen.bin
+cd ../apertium-eng
+lt-comp lr apertium-eng.eng.dix eng-rus.automorf.bin
+lt-comp rl apertium-eng.eng.dix rus-eng.autogen.bin
+cd ../apertium-rus-eng
+lt-comp lr apertium-rus-eng.rus-eng.dix rus-eng.autobil.bin
+lt-comp rl apertium-rus-eng.rus-eng.dix eng-rus.autobil.bin
+apertium-preprocess-transfer apertium-rus-eng.rus-eng.t1x rus-eng.t1x.bin
+apertium-preprocess-transfer apertium-rus-eng.rus-eng.t2x rus-eng.t2x.bin
+apertium-preprocess-transfer apertium-rus-eng.rus-eng.t3x rus-eng.t3x.bin

Property changes on: branches/weighted-transfer/tags/midterm/apertium-toy-ru-en/compile.sh
___________________________________________________________________
Added: svn:executable
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.cc	(revision 70339)
@@ -0,0 +1,2947 @@
+/*
+ * Copyright (C) 2005--2015 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer.h>
+#include <apertium/trx_reader.h>
+#include <apertium/utf_converter.h>
+#include <apertium/string_utils.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <pcre.h>
+
+#include <cctype>
+#include <iostream>
+#include <stack>
+#include <cerrno>
+#include <cstdlib>
+
+using namespace Apertium;
+using namespace std;
+
+void
+Transfer::destroy()
+{
+  if(me)
+  {
+    delete me;
+    me = NULL;
+  }
+  if(doc)
+  {
+    xmlFreeDoc(doc);
+    doc = NULL;
+  }
+}
+
+Transfer::Transfer() :
+word(0),
+blank(0),
+lword(0),
+lblank(0),
+output(0),
+any_char(0),
+any_tag(0),
+nwords(0)
+{
+  me = NULL;
+  doc = NULL;
+  root_element = NULL;
+  lastrule = NULL;
+  defaultAttrs = lu;
+  useBilingual = true;
+  preBilingual = false;
+  isExtended = false;
+  null_flush = false;
+  internal_null_flush = false;
+  trace = false;
+  trace_att = false;
+  emptyblank = "";
+}
+
+Transfer::~Transfer()
+{
+  destroy();
+}
+
+void
+Transfer::readData(FILE *in)
+{
+  // Read transfer rules data from .t*x.bin file
+  //cerr << "readData" << endl; // di
+
+  alphabet.read(in);
+  //cerr << "Alphabet size: " << alphabet.size() << endl; // di
+
+  any_char = alphabet(TRXReader::ANY_CHAR);
+  any_tag = alphabet(TRXReader::ANY_TAG);
+
+  Transducer t;
+  t.read(in, alphabet.size());
+
+  map<int, int> finals;
+
+  // finals
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    int key = Compression::multibyte_read(in);
+    finals[key] = Compression::multibyte_read(in);
+  }
+
+  me = new MatchExe(t, finals);
+
+  // attr_items
+  bool recompile_attrs = Compression::string_read(in) != string(pcre_version());
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    attr_items[cad_k].read(in);
+    wstring fallback = Compression::wstring_read(in);
+    if(recompile_attrs) {
+      attr_items[cad_k].compile(UtfConverter::toUtf8(fallback));
+    }
+  }
+
+  // variables
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    variables[cad_k] = UtfConverter::toUtf8(Compression::wstring_read(in));
+  }
+
+  // macros
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    macros[cad_k] = Compression::multibyte_read(in);
+  }
+
+  // lists
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+
+    for(int j = 0, limit2 = Compression::multibyte_read(in); j != limit2; j++)
+    {
+      wstring const cad_v = Compression::wstring_read(in);
+      lists[cad_k].insert(UtfConverter::toUtf8(cad_v));
+      listslow[cad_k].insert(UtfConverter::toUtf8(StringUtils::tolower(cad_v)));
+    }
+  }
+}
+
+void
+Transfer::readBil(string const &fstfile)
+{ 
+  cerr << "readBil" << endl; // di
+  FILE *in = fopen(fstfile.c_str(), "rb");
+  if(!in)
+  {
+    cerr << "Error: Could not open file '" << fstfile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  fstp.load(in);
+  fstp.initBiltrans();
+  fclose(in);
+}
+
+void
+Transfer::setExtendedDictionary(string const &fstfile)
+{ 
+  cerr << "setExtendedDictionary" << endl; // di
+  FILE *in = fopen(fstfile.c_str(), "rb");
+  if(!in)
+  {
+    cerr << "Error: Could not open extended dictionary file '" << fstfile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  extended.load(in);
+  extended.initBiltrans();
+  fclose(in);
+  isExtended = true;
+}
+
+void
+Transfer::read(string const &transferfile, string const &datafile,
+               string const &weightsfile, string const &fstfile)
+{ 
+  // read and parse .t*x transfer file
+  readTransfer(transferfile);
+
+  // open precompiled .t*x.bin file and read data from it
+  cerr << "Reading data from " << datafile.c_str() << endl << endl;
+  FILE *in = fopen(datafile.c_str(), "rb");
+  if(!in)
+  {
+    cerr << "Error: Could not open file '" << datafile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  readData(in);
+  fclose(in);
+
+  // read data from transfer weights file if specified
+  if(weightsfile != "")
+  {
+    //cerr << "Reading weights from " << weightsfile << endl; // di
+    readTransferWeights(weightsfile);
+  }
+
+  // read data from bilingual letter transducer file if specified
+  if(fstfile != "")
+  {
+    cerr << "Reading fst data from " << fstfile << endl; // di
+    readBil(fstfile);
+  }
+}
+
+void
+Transfer::readTransfer(string const &in)
+{ 
+  // Read transfer rules from .t*x file.
+  // In fact, here we collect only default attribute value,
+  // macros, and actions specified in rules.
+  cerr << "Reading transfer rules from " << in.c_str() << endl; // di
+  doc = xmlReadFile(in.c_str(), NULL, 0);
+  if(doc == NULL)
+  {
+    cerr << "Error: Could not parse file '" << in << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  root_element = xmlDocGetRootElement(doc);
+  //cerr << root_element->properties << endl; // di
+
+  // search through attributes of root element 
+  for(xmlAttr *i = root_element->properties; i != NULL; i = i->next)
+  { 
+    // only check for 'default' attribute
+    if(!xmlStrcmp(i->name, (const xmlChar *) "default"))
+    {
+      // assuming either default="chunk" or something else
+      if(!xmlStrcmp(i->children->content, (const xmlChar *) "chunk"))
+      {
+        // if default="chunk", set it to chunk
+        defaultAttrs = chunk; // default value for 'chunk'
+      }
+      else
+      { 
+        // if not default="chunk", set it to default
+        defaultAttrs = lu; // default value for 'default'
+      }
+    }
+  }
+
+  // search through root's children nodes for macroses & rules
+  for(xmlNode *i = root_element->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "section-def-macros"))
+      {
+        collectMacros(i);
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "section-rules"))
+      {
+        collectRules(i);
+      }
+    }
+  }
+
+  if (useWeights) // di
+  { // di
+    // double-check rule ids in rule_id_map and rule_ids // di
+    cerr << endl << "Those are the ids you wanted: " << endl; //di
+    for (int k = 1; k < rule_ids.size(); k++) // di
+    { // di
+      cerr << "rule_ids[" << k << "]: " << rule_ids[k] << endl; // di
+      cerr << "rule_id_map[" << rule_ids[k] << "]: " << rule_id_map[rule_ids[k]] << endl << endl; // di
+    } // di
+  } // di
+}
+
+void
+Transfer::collectRules(xmlNode *localroot)
+{ 
+  // go through subelements of 'section-rules'
+  int rule_index = 0;
+  string rule_id = "";
+  rule_ids.push_back(""); // fictive zero position element to not bother with i-1 thing
+  rule_id_map[""] = 0; // a uniformed answer to all empty string ids since we're not interested
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE && !xmlStrcmp(i->name, (const xmlChar *) "rule"))
+    {
+      // 'rule' element
+      rule_index++;
+      cerr << "Collecting rule # " << rule_index << endl; //di
+
+      if (useWeights) // only need ids if weights are used
+      {
+        // get rule id and add it to rule_ids
+        rule_id = getRuleId(i);
+        if (rule_id != "")
+        {
+          rule_id_map[rule_id] = rule_index;
+        }
+        rule_ids.push_back(rule_id);
+        rule_id = "";
+        cerr << endl; // di
+      }
+
+      // go through subelements of current 'rule' element looking for some action
+      for(xmlNode *j = i->children; ; j = j->next)
+      {
+        // check if subelement is 'action' element
+        if(j->type == XML_ELEMENT_NODE && !xmlStrcmp(j->name, (const xmlChar *) "action"))
+        {
+          // if so, add it at the end of the rule map
+          //cerr << "Collected '" << i->name << "' part '" << j->name << "'" << endl; // di
+          rule_map.push_back(j);
+          break;
+        }
+      }
+    }
+  }
+}
+
+void
+Transfer::collectMacros(xmlNode *localroot)
+{ 
+  // go through subelements of 'section-macros'
+  // and add all subelements, normally 'def-macros' nodes
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      macro_map.push_back(i);
+    }
+  }
+}
+
+void
+Transfer::readTransferWeights(string const &in)
+{
+  // Read transfer weights from .w*x file.
+  int rule_group_index = 0;
+  double weight = 0.;
+  string lemma = "", tags = "*";
+  string rule_id = "";
+  string regex = "";
+  vector<string> current_rule_group; // to track all rules in one group
+  rule_group_map[""] = -1; // a uniformed answer to all empty rule_group ids
+  vector<pair<pcre*, double > > current_pattern_group;
+  weighted_patterns[""] = current_pattern_group;
+
+  pcre *reCompiled;
+  pcre_extra *pcreExtra;
+  const char *pcreErrorStr;
+  int pcreErrorOffset;
+
+  cerr << "Reading transfer weights from " << in.c_str() << endl << endl; // di
+  // di
+  doc = xmlReadFile(in.c_str(), NULL, 0);
+  if(doc == NULL)
+  {
+    cerr << "Error: Could not parse file '" << in << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  root_element = xmlDocGetRootElement(doc);
+  //cerr << root_element->name << endl; // di
+
+  // search through root's children nodes for 'rule-group' elements
+  for(xmlNode *i = root_element->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE && !xmlStrcmp(i->name, (const xmlChar *) "rule-group"))
+    {
+      cerr << "Collecting rule-group # " << rule_group_index << endl; // di
+      // get ids of all rules in rule group
+      for(xmlNode *j = i->children; j != NULL; j = j->next)
+      {
+        if(j->type == XML_ELEMENT_NODE && !xmlStrcmp(j->name, (const xmlChar *) "rule"))
+        {
+          // get id
+          rule_id = getRuleId(j);
+          current_rule_group.push_back(rule_id);
+          rule_group_map[rule_id] = rule_group_index;
+          cerr << endl; // di
+
+          // get patterns
+          for(xmlNode *k = j->children; k != NULL; k = k->next)
+          {
+            if(k->type == XML_ELEMENT_NODE && !xmlStrcmp(k->name, (const xmlChar *) "pattern"))
+            {
+               weight = atof(getNodeAttr(k, "weight").c_str());
+               cerr << weight << endl;
+               for(xmlNode *patit = k->children; patit != NULL; patit = patit->next)
+               {
+                 if(patit->type == XML_ELEMENT_NODE && !xmlStrcmp(patit->name, (const xmlChar *) "pattern-item"))
+                 {
+                   lemma = getNodeAttr(patit, "lemma");
+                   if (lemma == "")
+                   {
+                     regex = regex + "[^<>]*?";
+                   }
+                   else
+                   {
+                     regex = regex + lemma;
+                   }
+
+                   tags = getNodeAttr(patit, "tags");
+                   unsigned int tags_len = tags.size();
+                   if (tags_len > 0 && tags != "*")
+                   {
+                     regex = regex + "<";
+                   } 
+                   char curr_char;
+                   for(unsigned int i = 0; i < tags_len; i++)
+                   {
+                     curr_char = tags[i];
+                     switch (curr_char)
+                     {
+                       case '.':
+                         regex = regex + "><";
+                         break;
+
+                       case '*':
+                         regex = regex + ".*?";
+                         break;
+                     
+                       default:
+                         regex = regex + curr_char;
+                     }
+                   }
+                   if (tags_len > 0 && tags != "*")
+                   {
+                     regex = regex + ">";
+                   } 
+                   cerr << lemma << " " << tags << endl;
+                   regex = regex + "\\S*? ";
+                   cerr << regex << endl;
+                 }
+               }
+               reCompiled = pcre_compile(regex.c_str(), 0, &pcreErrorStr, &pcreErrorOffset, NULL);
+               //pcreExtra = pcre_study(reCompiled, 0, &pcreErrorStr);
+               current_pattern_group.push_back(make_pair(reCompiled, weight));
+               regex = "";
+            }
+          }
+          weighted_patterns[rule_id] = current_pattern_group;
+          current_pattern_group.clear();
+        }
+      }
+      // push newly acquired current_rule_group into rule_groups
+      rule_groups.push_back(current_rule_group);
+      current_rule_group.clear();
+      cerr << endl; // di
+      rule_group_index++;
+    }
+  }
+
+  // print out what was collected // di
+  cerr << "These are the rule groups you collected:" << endl; // di
+  unsigned int k1, k2; // di
+  for (k1 = 0; k1 < rule_groups.size(); k1++) // di
+  { // di
+    cerr << "rule_groups[" << k1 << "]:" << endl; // di
+    for (k2 = 0; k2 < rule_groups[k1].size(); k2++) // di
+    { // di
+      cerr << "  " << rule_groups[k1][k2] << endl; // di
+      cerr << "    rule_group_map[" << rule_groups[k1][k2] << "]: "; // di
+      cerr << rule_group_map[rule_groups[k1][k2]] << endl; // di
+    } // di
+    cerr << endl; // di
+  } // di
+
+  cerr << "And these are the patterns:" << endl; // di
+  for (k1 = 1; k1 < rule_ids.size(); k1++) // di
+  { // di
+    if (rule_ids[k1] != "") // di
+    { // di
+      cerr << "Patterns for rule " << rule_ids[k1] << endl; // di
+      for (k2 = 0; k2 < weighted_patterns[rule_ids[k1]].size(); k2++) // di
+      { // di
+        cerr << "  " << weighted_patterns[rule_ids[k1]][k2].first << " "; // di
+        cerr << weighted_patterns[rule_ids[k1]][k2].second << endl; // di
+      } // di
+    } // di
+  } // di
+
+}
+
+string
+Transfer::getRuleId(xmlNode *localroot)
+{
+  string rule_id = "";
+      // normally looking at a 'rule' node now
+      for(xmlAttr *j = localroot->properties; j != NULL; j = j->next)
+      {
+        if(!xmlStrcmp(j->name, (const xmlChar *) "comment")) // di
+        { // di
+          cerr << "Rule comment: " << xmlNodeListGetString(localroot->doc, j->children, 1) << endl;   // di
+        } // di
+        else //di
+        { //di
+          if(!xmlStrcmp(j->name, (const xmlChar *) "id"))
+          {
+            // add rule id to rule_id_map
+            rule_id = (const char*)xmlNodeListGetString(localroot->doc, j->children, 1);
+            cerr << "Rule id: " << rule_id << endl;   // di           
+          }
+        } // di
+      } // di
+  return rule_id;
+}
+
+string
+Transfer::getNodeAttr(xmlNode *localroot, const char* attr_name)
+{
+  string attr_val = "";
+  for(xmlAttr *j = localroot->properties; j != NULL; j = j->next)
+  {
+    if(!xmlStrcmp(j->name, (const xmlChar *) attr_name))
+    { 
+      attr_val = (const char*) xmlNodeListGetString(localroot->doc, j->children, 1);
+    }
+  }
+  return attr_val;
+}
+
+bool
+Transfer::checkIndex(xmlNode *element, int index, int limit)
+{ 
+  if(index >= limit)
+  {
+    wcerr << L"Error in " << UtfConverter::fromUtf8((char *) doc->URL) <<L": line " << element->line << endl;
+    return false;
+  }
+  return true;
+}
+
+void
+Transfer::evalStringClip(xmlNode *element, string &lemma, int &pos)
+{
+  // This is a corrupted baby clone of evalString 
+  // that only gets lemma and its position from source part
+  
+  map<xmlNode *, TransferInstr>::iterator it;
+  it = evalStringCache.find(element);
+  TransferInstr &ti = it->second;
+
+  lemma = "";
+  pos = -1;
+
+  if (ti.getType() == ti_clip_tl)
+  {
+    if (checkIndex(element, ti.getPos(), lword))
+    { 
+      if (ti.getContent() == "lem") 
+      { 
+        pos = ti.getPos();
+        lemma = word[pos]->source(attr_items["lem"], ti.getCondition());
+      }
+    }
+  }
+}
+
+string
+Transfer::evalString(xmlNode *element)
+{
+  // This function evaluates an xml element
+  // and executes appropriate instruction.
+
+  // I believe it is used for lowest-level action elements, 
+  // such as 'clip' or 'lit-tag'.
+
+  // If TransferInstr object corresponding to the element is already
+  // in evalStringCache, execute that instruction,
+  // if not, first add the instruction to evalStringCache,
+  // then call evalString again and execute that instruction.
+  
+  // First, let's see what we've got. // di
+  //if (element->type == XML_ELEMENT_NODE)  // di
+  //{  // di
+    //cerr << "Evaluating " << element->name << " "; // di
+    //for(xmlAttr *prop = element->properties; prop != NULL; prop = prop->next) // di
+    //{  // di
+      //cerr << prop->name << "='" << xmlNodeListGetString(element->doc, prop->children, 1) << "' "; // di
+    //} // di
+    //cerr << endl; // di
+  //} // di
+
+  map<xmlNode *, TransferInstr>::iterator it;
+  it = evalStringCache.find(element); 
+
+  // Check if the TransferInstr object corresponding to the element
+  // is already in evalStringCache...
+  if(it != evalStringCache.end())
+  { 
+    // ...if it is, execute the corresponding instruction...
+    TransferInstr &ti = it->second;
+
+    // ...depending on its type 
+    switch(ti.getType())
+    {
+      case ti_clip_sl: // <clip ... side="sl" ...>
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return word[ti.getPos()]->source(attr_items[ti.getContent()], ti.getCondition());
+        }
+        break;
+
+      case ti_clip_tl: // <clip ... side="tl" ...>
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return word[ti.getPos()]->target(attr_items[ti.getContent()], ti.getCondition());
+        }
+        break;
+
+      case ti_linkto_sl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          if(word[ti.getPos()]->source(attr_items[ti.getContent()], ti.getCondition()) != "")
+          {
+            return "<" + string((char *) ti.getPointer()) + ">";
+          }
+          else
+          {
+            return "";
+          }
+        }
+        break;
+
+      case ti_linkto_tl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          if(word[ti.getPos()]->target(attr_items[ti.getContent()], ti.getCondition()) != "")
+          {
+            return "<" + string((char *) ti.getPointer()) + ">";
+          }
+          else
+          {
+            return "";
+          }
+        }
+        break;
+
+      case ti_var:
+        return variables[ti.getContent()];
+
+      case ti_lit_tag: // <lit-tag .../>
+      case ti_lit: // <lit .../>
+        return ti.getContent(); // just output what's specified in 'v'
+
+      case ti_b: // <b/>
+        if(checkIndex(element, ti.getPos(), lblank))
+        {
+          if(ti.getPos() >= 0)
+          {
+            return !blank?"":*(blank[ti.getPos()]);
+          }
+          return " ";
+        }
+        break;
+
+      case ti_get_case_from:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return copycase(word[ti.getPos()]->source(attr_items[ti.getContent()]),
+                  evalString((xmlNode *) ti.getPointer()));
+        }
+        break;
+
+      case ti_case_of_sl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return caseOf(word[ti.getPos()]->source(attr_items[ti.getContent()]));
+        }
+        break;
+
+      case ti_case_of_tl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return caseOf(word[ti.getPos()]->target(attr_items[ti.getContent()]));
+        }
+        break;
+
+      default:
+        return "";
+    }
+    return "";
+  } // end of if(it != evalStringCache.end()) clause
+
+  // The following code is executed if TransferInstr object 
+  // corresponding to the element is not in evalStringCache yet.
+  // It parses lowest-level element, creates TransferInstr object
+  // out of it, and pushes it into evalStringCache.
+  if(!xmlStrcmp(element->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL, *side = NULL, *as = NULL;
+    bool queue = true;
+
+    for(xmlAttr *i = element->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "side"))
+      {
+        side = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+        part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+        pos = atoi((const char *)i->children->content) - 1;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "queue"))
+      {
+        if(!xmlStrcmp(i->children->content, (const xmlChar *) "no"))
+        {
+          queue = false;
+        }
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "link-to"))
+      {
+        as = i->children->content;
+      }
+    }
+
+    if(as != NULL)
+    {
+      if(!xmlStrcmp(side, (const xmlChar *) "sl"))
+      {
+        evalStringCache[element] = TransferInstr(ti_linkto_sl, (const char *) part, pos, (void *) as, queue);
+      }
+      else
+      {
+        evalStringCache[element] = TransferInstr(ti_linkto_tl, (const char *) part, pos, (void *) as, queue);
+      }
+    }
+    else if(!xmlStrcmp(side, (const xmlChar *) "sl"))
+    {
+      evalStringCache[element] = TransferInstr(ti_clip_sl, (const char *) part, pos, NULL, queue);
+    }
+    else
+    {
+      evalStringCache[element] = TransferInstr(ti_clip_tl, (const char *) part, pos, NULL, queue);
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lit-tag"))
+  { 
+    evalStringCache[element] = TransferInstr(ti_lit_tag,
+                                             tags((const char *) element->properties->children->content), 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lit"))
+  {
+    evalStringCache[element] = TransferInstr(ti_lit, string((char *) element->properties->children->content), 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "b"))
+  {
+    if(element->properties == NULL)
+    {
+      evalStringCache[element] = TransferInstr(ti_b, " ", -1);
+    }
+    else
+    {
+      int pos = atoi((const char *) element->properties->children->content) - 1;
+      evalStringCache[element] = TransferInstr(ti_b, "", pos);
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "get-case-from"))
+  {
+    int pos = atoi((const char *) element->properties->children->content) - 1;
+    xmlNode *param = NULL;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+        param = i;
+        break;
+      }
+    }
+
+    evalStringCache[element] = TransferInstr(ti_get_case_from, "lem", pos, param);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "var"))
+  {
+    evalStringCache[element] = TransferInstr(ti_var, (const char *) element->properties->children->content, 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "case-of"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL, *side = NULL;
+
+    for(xmlAttr *i = element->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "side"))
+      {
+        side = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+        part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+        pos = atoi((const char *) i->children->content) - 1;
+      }
+    }
+
+    if(!xmlStrcmp(side, (const xmlChar *) "sl"))
+    {
+      evalStringCache[element] = TransferInstr(ti_case_of_sl, (const char *) part, pos);
+    }
+    else
+    {
+      evalStringCache[element] = TransferInstr(ti_case_of_tl, (const char *) part, pos);
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "concat"))
+  {
+    string value;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+        value.append(evalString(i));
+      }
+    }
+    return value;
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lu"))
+  {
+    string myword;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+       if(i->type == XML_ELEMENT_NODE)
+       {
+         myword.append(evalString(i));
+       }
+    }
+
+    if(myword != "")
+    {
+      return "^"+myword+"$";
+    }
+    else
+    {
+      return "";
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "mlu"))
+  {
+    string value;
+
+    bool first_time = true;
+
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+        string myword;
+
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            myword.append(evalString(j));
+          }
+        }
+
+        if(!first_time)
+        {
+          if(myword != "" && myword[0] != '#')  //'+#' problem
+          {
+            value.append("+");
+          }
+        }
+        else
+        {
+          if(myword != "")
+          {
+            first_time = false;
+          }
+        }
+
+        value.append(myword);
+      }
+    }
+
+    if(value != "")
+    {
+      return "^"+value+"$";
+    }
+    else
+    {
+      return "";
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "chunk"))
+  {
+    return processChunk(element);
+  }
+  else
+  {
+    cerr << "Error: unexpected rvalue expression '" << element->name << "'" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  return evalString(element);
+} // end of evalString
+
+void
+Transfer::processOut(xmlNode *localroot)
+{ 
+  // apply 'out' subelement of a rule, one subelement at a time,
+  // depending on subelement type
+  //cerr << "Applying 'out' element" << endl; // di
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(defaultAttrs == lu)
+      {
+        if(!xmlStrcmp(i->name, (const xmlChar *) "lu"))
+        {
+          string myword;
+          for(xmlNode *j = i->children; j != NULL; j = j->next)
+          {
+            if(j->type == XML_ELEMENT_NODE)
+            {
+              myword.append(evalString(j));
+              //cerr << myword << endl; // di
+            }
+          }
+          if(myword != "")
+          {
+            fputwc_unlocked(L'^', output);
+            fputws_unlocked(UtfConverter::fromUtf8(myword).c_str(), output);
+            fputwc_unlocked(L'$', output);
+            //cerr << UtfConverter::fromUtf8(myword).c_str() << endl; // di
+          }
+        }
+        else if(!xmlStrcmp(i->name, (const xmlChar *) "mlu"))
+        {
+          fputwc_unlocked('^', output);
+          bool first_time = true;
+          for(xmlNode *j = i->children; j != NULL; j = j->next)
+          {
+            if(j->type == XML_ELEMENT_NODE)
+            {
+              string myword;
+              for(xmlNode *k = j->children; k != NULL; k = k->next)
+              {
+                if(k->type == XML_ELEMENT_NODE)
+                {
+                  myword.append(evalString(k));
+                  cerr << myword << endl;
+                }
+              }
+
+              if(!first_time)
+              {
+                if(myword != "" && myword[0] != '#')  //'+#' problem
+                {
+                  fputwc_unlocked(L'+', output);
+                }
+              }
+              else
+              {
+                if(myword != "")
+                {
+                  first_time = false;
+                }
+              }
+              fputws_unlocked(UtfConverter::fromUtf8(myword).c_str(), output);
+            }
+          }
+          fputwc_unlocked(L'$', output);
+        }
+        else // 'b'
+        {
+          fputws_unlocked(UtfConverter::fromUtf8(evalString(i)).c_str(), output);
+        }
+      }
+      else
+      {
+        if(!xmlStrcmp(i->name, (const xmlChar *) "chunk"))
+        {
+          string processed = processChunk(i);
+          fputws_unlocked(UtfConverter::fromUtf8(processed).c_str(), output);
+          cerr << "Hey, I just made a chunk: " << processed << endl; // di
+        }
+        else // 'b'
+        {
+          fputws_unlocked(UtfConverter::fromUtf8(evalString(i)).c_str(), output);
+        }
+      }
+    }
+  }
+} // end of processOut
+
+string
+Transfer::processChunk(xmlNode *localroot)
+{ 
+  // apply 'chunk' subelement of 'out' element of a rule,
+  // one subelement at a time, depending on subelement type
+
+  //cerr << "Applying 'chunk' element" << endl; // di
+  string name, namefrom;
+  string caseofchunk = "aa";
+  string result;
+
+  // this will be the cache of source language lemmas found in chunk
+  unsigned int limit = tmpword.size();
+  string* wordcache;
+  wordcache = new string [limit];
+
+  for(xmlAttr *i = localroot->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "name"))
+    {
+      name = (const char *) i->children->content;
+    }
+    else if(!xmlStrcmp(i->name, (const xmlChar *) "namefrom"))
+    {
+      namefrom = (const char *) i->children->content;
+    }
+    else if(!xmlStrcmp(i->name, (const xmlChar *) "case"))
+    {
+      caseofchunk = (const char *) i->children->content;
+    }
+  }
+
+  // starting to build the chunk
+  result.append("^");
+  //cerr << result << endl; // di
+
+  // adding chunk name
+  if(caseofchunk != "")
+  {
+    if(name != "")
+    {
+      result.append(copycase(variables[caseofchunk], name));
+      //cerr << result << endl; // di
+    }
+    else if(namefrom != "")
+    {
+      result.append(copycase(variables[caseofchunk], variables[namefrom]));
+      //cerr << result << endl; // di
+    }
+    else
+    {
+      cerr << "Error: you must specify either 'name' or 'namefrom' for the 'chunk' element" << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+  else
+  {
+    if(name != "")
+    {
+      result.append(name);
+      //cerr << result << endl; // di
+    }
+    else if(namefrom != "")
+    {
+      result.append(variables[namefrom]);
+      //cerr << result << endl; // di
+    }
+    else
+    {
+      cerr << "Error: you must specify either 'name' or 'namefrom' for the 'chunk' element" << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+
+  // processing and adding chunk subelements one element at a time
+  int count = 0; // di
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    { 
+      cerr << "chunk element # " << count << ": " << i->name << endl; // di
+      count++; // di
+      if(!xmlStrcmp(i->name, (const xmlChar *) "tags"))
+      {
+        // add chunk tags
+        result.append(processTags(i));
+        result.append("{");
+        //cerr << result << endl; // di
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "lu"))
+      {
+        // process and add one 'lu' element
+        string myword;
+        string untouched;
+        int untouched_pos;
+
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            //cerr << "Executing " << j->name << endl; // di
+            myword.append(evalString(j));
+
+            evalStringClip(j, untouched, untouched_pos); // black magic
+            if(untouched_pos != -1)
+            {
+              //cerr << "Got untouched: " << untouched_pos << ", " << untouched << endl; // di
+              wordcache[untouched_pos].append(untouched);
+            }
+          }
+        }
+        if(myword != "")
+        {
+          //cerr << myword << endl;
+          result.append("^");
+          result.append(myword);
+          result.append("$");
+          //cerr << result << endl;
+        }
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "mlu"))
+      {
+        bool first_time = true;
+        string myword;
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          string mylocalword;
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            for(xmlNode *k = j->children; k != NULL; k = k->next)
+            {
+              if(k->type == XML_ELEMENT_NODE)
+              {
+                mylocalword.append(evalString(k));
+              }
+            }
+
+            if(!first_time)
+            {
+              if(mylocalword != "" && mylocalword[0] != '#')  // '+#' problem
+              {
+                myword += '+';
+              }
+            }
+            else
+            {
+              first_time = false;
+            }
+          }
+          myword.append(mylocalword);
+        }
+        if(myword != "")
+        {
+          //cerr << myword << endl; // di
+          result.append("^");
+          result.append(myword);
+          result.append("$");
+          //cerr << result << endl; // di
+        }
+      }
+      else // 'b'
+      {
+        result.append(evalString(i));
+        //cerr << result << endl; // di
+      }
+    }
+  }
+
+  // finishing the chunk
+  result.append("}$");
+
+  // now it's time to check if there was a magic word in the chunk
+  bool stopword = false;
+  for (int k = 0; k < limit && !stopword; k++)
+  {
+    if (wordcache[k] == "море")
+    {
+      stopword = true;
+    }
+  }
+  if (stopword)
+  {
+    result = "^untouchable<SN>{";
+    for (int k = 0; k < limit-1; k++)
+    {
+      result.append("^");
+      result.append(wordcache[k]);
+      result.append("$ ");
+    }
+    result.append("^");
+    result.append(wordcache[limit-1]);
+    result.append("$}$");
+  }
+  return result;
+} // end of processChunk
+
+string
+Transfer::processTags(xmlNode *localroot)
+{ 
+  //cerr << "processTags" << endl; // di
+  string result;
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (xmlChar const *) "tag"))
+      {
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            result.append(evalString(j));
+          }
+        }
+      }
+    }
+  }
+  return result;
+}
+
+int
+Transfer::processInstruction(xmlNode *localroot)
+{ 
+  // process instruction specified in rule action based on its name
+  //cerr << "Processing instruction '" << localroot->name << "'" << endl; // di
+
+  int words_to_consume = -1;
+  if(!xmlStrcmp(localroot->name, (const xmlChar *) "choose"))
+  {
+    words_to_consume = processChoose(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "let"))
+  {
+    processLet(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "append"))
+  {
+    processAppend(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "out"))
+  {
+    processOut(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "call-macro"))
+  {
+    processCallMacro(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "modify-case"))
+  {
+    processModifyCase(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "reject-current-rule"))
+  {
+    words_to_consume = processRejectCurrentRule(localroot);
+  }
+  return words_to_consume;
+}
+
+int
+Transfer::processRejectCurrentRule(xmlNode *localroot)
+{ 
+  cerr << "processRejectCurrentRule" << endl; // di
+  bool shifting = true;
+  string value;
+  for(xmlAttr *i = localroot->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "shifting"))
+    {
+      value = (char *) i->children->content;
+      break;
+    }
+  }
+
+  if(value == "no")
+  {
+    shifting = false;
+  }
+
+  return shifting ? 1 : 0;
+}
+
+void
+Transfer::processLet(xmlNode *localroot)
+{ 
+  cerr << "processLet" << endl; // di
+  xmlNode *leftSide = NULL, *rightSide = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(leftSide == NULL)
+      {
+        leftSide = i;
+      }
+      else
+      {
+        rightSide = i;
+        break;
+      }
+    }
+  }
+
+  map<xmlNode *, TransferInstr>::iterator it = evalStringCache.find(leftSide);
+  if(it != evalStringCache.end())
+  {
+    TransferInstr &ti = it->second;
+    switch(ti.getType())
+    {
+      case ti_var:
+        variables[ti.getContent()] = evalString(rightSide);
+        return;
+
+      case ti_clip_sl:
+        word[ti.getPos()]->setSource(attr_items[ti.getContent()], evalString(rightSide), ti.getCondition());
+        return;
+
+      case ti_clip_tl:
+        word[ti.getPos()]->setTarget(attr_items[ti.getContent()], evalString(rightSide), ti.getCondition());
+        return;
+
+      default:
+        return;
+    }
+  }
+  if(leftSide->name != NULL && !xmlStrcmp(leftSide->name, (const xmlChar *) "var"))
+  {
+    string const val = (const char *) leftSide->properties->children->content;
+    variables[val] = evalString(rightSide);
+    evalStringCache[leftSide] = TransferInstr(ti_var, val, 0);
+  }
+  else if(!xmlStrcmp(leftSide->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL, *side = NULL, *as = NULL;
+    bool queue = true;
+
+    for(xmlAttr *i = leftSide->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "side"))
+      {
+        side = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+        part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+        pos = atoi((const char *) i->children->content) - 1;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "queue"))
+      {
+        if(!xmlStrcmp(i->children->content, (const xmlChar *) "no"))
+        {
+          queue = false;
+        }
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "link-to"))
+      {
+        as = i->children->content;
+      }
+    }
+
+    if(!xmlStrcmp(side, (const xmlChar *) "tl"))
+    {
+      word[pos]->setTarget(attr_items[(const char *) part], evalString(rightSide), queue);
+      evalStringCache[leftSide] = TransferInstr(ti_clip_tl, (const char *) part, pos, NULL, queue);
+    }
+    else
+    {
+      word[pos]->setSource(attr_items[(const char *) part], evalString(rightSide), queue);
+      evalStringCache[leftSide] = TransferInstr(ti_clip_sl, (const char *) part, pos, NULL, queue);
+    }
+  }
+}
+
+void
+Transfer::processAppend(xmlNode *localroot)
+{ 
+  cerr << "processAppend" << endl; // di
+  string name;
+  for(xmlAttr *i = localroot->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "n"))
+    {
+      name = (char *) i->children->content;
+      break;
+    }
+  }
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      variables[name].append(evalString(i));
+    }
+  }
+}
+
+void
+Transfer::processModifyCase(xmlNode *localroot)
+{ 
+  cerr << "processModifyCase" << endl; // di
+  xmlNode *leftSide = NULL, *rightSide = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(leftSide == NULL)
+      {
+        leftSide = i;
+      }
+      else
+      {
+        rightSide = i;
+        break;
+      }
+    }
+  }
+
+  if(leftSide->name != NULL && !xmlStrcmp(leftSide->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL, *side = NULL, *as = NULL;
+    bool queue = true;
+
+    for(xmlAttr *i = leftSide->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "side"))
+      {
+        side = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+        part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+        pos = atoi((const char *) i->children->content) - 1;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "queue"))
+      {
+        if(!xmlStrcmp(i->children->content, (xmlChar const *) "no"))
+        {
+          queue = false;
+        }
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "link-to"))
+      {
+        as = i->children->content;
+        (void)as; // ToDo, remove "as" and the whole else?
+      }
+    }
+    if(!xmlStrcmp(side, (const xmlChar *) "sl"))
+    {
+      string const result = copycase(evalString(rightSide),
+                                     word[pos]->source(attr_items[(const char *) part], queue));
+      word[pos]->setSource(attr_items[(const char *) part], result);
+    }
+    else
+    {
+      string const result = copycase(evalString(rightSide),
+                                     word[pos]->target(attr_items[(const char *) part], queue));
+      word[pos]->setTarget(attr_items[(const char *) part], result);
+    }
+  }
+  else if(!xmlStrcmp(leftSide->name, (const xmlChar *) "var"))
+  {
+    string const val = (const char *) leftSide->properties->children->content;
+    variables[val] = copycase(evalString(rightSide), variables[val]);
+  }
+}
+
+void
+Transfer::processCallMacro(xmlNode *localroot)
+{ 
+  cerr << "processCallMacro" << endl; // di
+  string const n = (const char *) localroot->properties->children->content;
+  int npar = 0;
+
+  xmlNode *macro = macro_map[macros[n]];
+
+  for(xmlAttr *i = macro->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "npar"))
+    {
+      npar = atoi((const char *) i->children->content);
+      break;
+    }
+  }
+  
+  // ToDo: Is it at all valid if npar <= 0 ?
+
+  TransferWord **myword = NULL;
+  if(npar > 0)
+  {
+    myword = new TransferWord *[npar];
+  }
+  string **myblank = NULL;
+  if(npar > 0)
+  {
+    myblank = new string *[npar];
+    myblank[npar-1] = &emptyblank;
+  }
+
+  int idx = 0;
+  int lastpos = 0;
+  for(xmlNode *i = localroot->children; npar && i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      int pos = atoi((const char *) i->properties->children->content)-1;
+      myword[idx] = word[pos];
+      if(idx-1 >= 0)
+      {
+        myblank[idx-1] = blank[lastpos];
+      }
+      idx++;
+      lastpos = pos;
+    }
+  }
+
+  swap(myword, word);
+  swap(myblank, blank);
+  swap(npar, lword);
+
+  for(xmlNode *i = macro->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      processInstruction(i);
+    }
+  }
+
+  swap(myword, word);
+  swap(myblank, blank);
+  swap(npar, lword);
+  
+  delete[] myword;
+  delete[] myblank;
+}
+
+int
+Transfer::processChoose(xmlNode *localroot)
+{ 
+  cerr << "processChoose" << endl; // di
+  int words_to_consume = -1;
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "when"))
+      {
+        bool picked_option = false;
+
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            if(!xmlStrcmp(j->name, (const xmlChar *) "test"))
+            {
+              if(!processTest(j))
+              {
+                break;
+              }
+              else
+              {
+                picked_option = true;
+              }
+            }
+            else
+            {
+              words_to_consume = processInstruction(j);
+              if(words_to_consume != -1)
+              {
+                return words_to_consume;
+              }
+            }
+          }
+        }
+        if(picked_option)
+        {
+          return words_to_consume;
+        }
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "otherwise"))
+      {
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            words_to_consume = processInstruction(j);
+            if(words_to_consume != -1)
+            {
+              return words_to_consume;
+            }
+          }
+        }
+      }
+    }
+  }
+  return words_to_consume;
+}
+
+bool
+Transfer::processLogical(xmlNode *localroot)
+{ 
+  cerr << "processLogical" << endl; // di
+  if(!xmlStrcmp(localroot->name, (const xmlChar *) "equal"))
+  {
+    return processEqual(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "begins-with"))
+  {
+    return processBeginsWith(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "begins-with-list"))
+  {
+    return processBeginsWithList(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "ends-with"))
+  {
+    return processEndsWith(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "ends-with-list"))
+  {
+    return processEndsWithList(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "contains-substring"))
+  {
+    return processContainsSubstring(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "or"))
+  {
+    return processOr(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "and"))
+  {
+    return processAnd(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "not"))
+  {
+    return processNot(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "in"))
+  {
+    return processIn(localroot);
+  }
+
+  return false;
+}
+
+bool
+Transfer::processIn(xmlNode *localroot)
+{ 
+  cerr << "processIn" << endl; // di
+  xmlNode *value = NULL;
+  xmlChar *idlist = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(value == NULL)
+      {
+        value = i;
+      }
+      else
+      {
+        idlist = i->properties->children->content;
+        break;
+      }
+    }
+  }
+
+  string sval = evalString(value);
+
+  if(localroot->properties != NULL)
+  {
+    if(!xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+    {
+      set<string, Ltstr> &myset = listslow[(const char *) idlist];
+      if(myset.find(tolower(sval)) != myset.end())
+      {
+        return true;
+      }
+      else
+      {
+        return false;
+      }
+    }
+  }
+
+  set<string, Ltstr> &myset = lists[(const char *) idlist];
+  if(myset.find(sval) != myset.end())
+  {
+    return true;
+  }
+  else
+  {
+    return false;
+  }
+}
+
+bool
+Transfer::processTest(xmlNode *localroot)
+{ 
+  cerr << "processTest" << endl; // di
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      return processLogical(i);
+    }
+  }
+  return false;
+}
+
+bool
+Transfer::processAnd(xmlNode *localroot)
+{ 
+  cerr << "processAnd" << endl; // di
+  bool val = true;
+  for(xmlNode *i = localroot->children; val && i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      val = val && processLogical(i);
+    }
+  }
+
+  return val;
+}
+
+bool
+Transfer::processOr(xmlNode *localroot)
+{ 
+  cerr << "processOr" << endl; // di
+  bool val = false;
+  for(xmlNode *i = localroot->children; !val && i != NULL ; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      val = val || processLogical(i);
+    }
+  }
+
+  return val;
+}
+
+bool
+Transfer::processNot(xmlNode *localroot)
+{ 
+  cerr << "processNot" << endl; // di
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      return !processLogical(i);
+    }
+  }
+  return false;
+}
+
+bool
+Transfer::processEqual(xmlNode *localroot)
+{ 
+  cerr << "processEqual" << endl; // di
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+        second = i;
+        break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return evalString(first) == evalString(second);
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+                  (const xmlChar *) "yes"))
+    {
+      return tolower(evalString(first)) == tolower(evalString(second));
+    }
+    else
+    {
+      return evalString(first) == evalString(second);
+    }
+  }
+}
+
+bool
+Transfer::beginsWith(string const &s1, string const &s2) const
+{ 
+  cerr << "beginsWith" << endl; // di
+  int const limit = s2.size(), constraint = s1.size();
+
+  if(constraint < limit)
+  {
+    return false;
+  }
+  for(int i = 0; i != limit; i++)
+  {
+    if(s1[i] != s2[i])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+bool
+Transfer::endsWith(string const &s1, string const &s2) const
+{ 
+  cerr << "endsWith" << endl; // di
+  int const limit = s2.size(), constraint = s1.size();
+
+  if(constraint < limit)
+  {
+    return false;
+  }
+  for(int i = limit-1, j = constraint - 1; i >= 0; i--, j--)
+  {
+    if(s1[j] != s2[i])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+
+bool
+Transfer::processBeginsWith(xmlNode *localroot)
+{ 
+  cerr << "processBeginsWith" << endl; // di
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+        second = i;
+        break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return beginsWith(evalString(first), evalString(second));
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+                  (const xmlChar *) "yes"))
+    {
+      return beginsWith(tolower(evalString(first)), tolower(evalString(second)));
+    }
+    else
+    {
+      return beginsWith(evalString(first), evalString(second));
+    }
+  }
+}
+
+bool
+Transfer::processEndsWith(xmlNode *localroot)
+{ 
+  cerr << "processEndsWith" << endl; // di
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+        second = i;
+        break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return endsWith(evalString(first), evalString(second));
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+                  (const xmlChar *) "yes"))
+    {
+      return endsWith(tolower(evalString(first)), tolower(evalString(second)));
+    }
+    else
+    {
+      return endsWith(evalString(first), evalString(second));
+    }
+  }
+}
+
+bool
+Transfer::processBeginsWithList(xmlNode *localroot)
+{ 
+  cerr << "processBeginsWithList" << endl; // di
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+        second = i;
+        break;
+      }
+    }
+  }
+
+  xmlChar *idlist = second->properties->children->content;
+  string needle = evalString(first);
+  set<string, Ltstr>::iterator it, limit;
+
+  if(localroot->properties == NULL ||
+     xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+  {
+    it = lists[(const char *) idlist].begin();
+    limit = lists[(const char *) idlist].end();
+  }
+  else
+  {
+    needle = tolower(needle);
+    it = listslow[(const char *) idlist].begin();
+    limit = listslow[(const char *) idlist].end();
+  }
+
+  for(; it != limit; it++)
+  {
+    if(beginsWith(needle, *it))
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+
+bool
+Transfer::processEndsWithList(xmlNode *localroot)
+{ 
+  cerr << "processEndsWithList" << endl; // di
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+        second = i;
+        break;
+      }
+    }
+  }
+
+  xmlChar *idlist = second->properties->children->content;
+  string needle = evalString(first);
+  set<string, Ltstr>::iterator it, limit;
+
+  if(localroot->properties == NULL ||
+     xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+  {
+    it = lists[(const char *) idlist].begin();
+    limit = lists[(const char *) idlist].end();
+  }
+  else
+  {
+    needle = tolower(needle);
+    it = listslow[(const char *) idlist].begin();
+    limit = listslow[(const char *) idlist].end();
+  }
+
+  for(; it != limit; it++)
+  {
+    if(endsWith(needle, *it))
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool
+Transfer::processContainsSubstring(xmlNode *localroot)
+{ 
+  cerr << "processContainsSubstring" << endl; // di
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+        second = i;
+        break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return evalString(first).find(evalString(second)) != string::npos;
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+                  (const xmlChar *) "yes"))
+    {
+      return tolower(evalString(first)).find(tolower(evalString(second))) != string::npos;
+    }
+    else
+    {
+      return evalString(first).find(evalString(second)) != string::npos;
+    }
+  }
+}
+
+string
+Transfer::copycase(string const &source_word, string const &target_word)
+{ 
+  //cerr << "copycase" << endl; // di
+  wstring result;
+  wstring const s_word = UtfConverter::fromUtf8(source_word);
+  wstring const t_word = UtfConverter::fromUtf8(target_word);
+
+  bool firstupper = iswupper(s_word[0]);
+  bool uppercase = firstupper && iswupper(s_word[s_word.size()-1]);
+  bool sizeone = s_word.size() == 1;
+
+  if(!uppercase || (sizeone && uppercase))
+  {
+    result = t_word;
+    result[0] = towlower(result[0]);
+    //result = StringUtils::tolower(t_word);
+  }
+  else
+  {
+    result = StringUtils::toupper(t_word);
+  }
+
+  if(firstupper)
+  {
+    result[0] = towupper(result[0]);
+  }
+
+  return UtfConverter::toUtf8(result);
+}
+
+string
+Transfer::caseOf(string const &str)
+{ 
+  cerr << "caseOf" << endl; // di
+  wstring const s = UtfConverter::fromUtf8(str);
+
+  if(s.size() > 1)
+  {
+    if(!iswupper(s[0]))
+    {
+      return "aa";
+    }
+    else if(!iswupper(s[s.size()-1]))
+    {
+      return "Aa";
+    }
+    else
+    {
+      return "AA";
+    }
+  }
+  else if(s.size() == 1)
+  {
+    if(!iswupper(s[0]))
+    {
+      return "aa";
+    }
+    else
+    {
+      return "Aa";
+    }
+  }
+  else
+  {
+    return "aa";
+  }
+}
+
+string
+Transfer::tolower(string const &str) const
+{ 
+  cerr << "tolower" << endl; // di
+  return UtfConverter::toUtf8(StringUtils::tolower(UtfConverter::fromUtf8(str)));
+}
+
+string
+Transfer::tags(string const &str) const
+{ 
+  //cerr << "tags" << endl; // di
+  string result = "<";
+
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+    if(str[i] == '.')
+    {
+      result.append("><");
+    }
+    else
+    {
+      result += str[i];
+    }
+  }
+
+  result += '>';
+
+  return result;
+}
+
+int
+Transfer::processRule(xmlNode *localroot)
+{
+  cerr << "processRule" << endl; // di
+  int instruction_return, words_to_consume = -1;
+  // localroot is supposed to be an 'action' tag
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      instruction_return = processInstruction(i);
+      // When an instruction which modifies the number of words to be consumed
+      // from the input is found, execution of the rule is stopped
+      if(instruction_return != -1)
+      {
+        words_to_consume = instruction_return;
+        break;
+      }
+    }
+  }
+  return words_to_consume;
+}
+
+TransferToken &
+Transfer::readToken(FILE *in)
+{ 
+  //cerr << "readToken" << endl; // di
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wstring content;
+  while(true)
+  {
+    int val = fgetwc_unlocked(in);
+    //wcerr << UtfConverter::toUtf8(wchar_t(val)) << endl; // di
+
+    if(feof(in) || (val == 0 && internal_null_flush))
+    {
+      return input_buffer.add(TransferToken(content, tt_eof));
+    }
+    if(val == '\\')
+    {
+      content += L'\\';
+      content += (wchar_t) fgetwc_unlocked(in);
+      //wcerr << content << endl; // di
+    }
+    else if(val == L'[')
+    {
+      content += L'[';
+      //wcerr << content << endl; // di
+      while(true)
+      {
+        int val2 = fgetwc_unlocked(in);
+        if(val2 == L'\\')
+        {
+          content += L'\\';
+          content += wchar_t(fgetwc_unlocked(in));
+          //wcerr << content << endl; // di
+        }
+        else if(val2 == L']')
+        {
+          content += L']';
+          //wcerr << content << endl; // di
+          break;
+        }
+        else
+        {
+          content += wchar_t(val2);
+          //cerr << UtfConverter::toUtf8(content) << endl; // di
+        }
+      }
+    }
+    else if(val == L'$')
+    {
+      cerr << UtfConverter::toUtf8(content) << endl;
+      return input_buffer.add(TransferToken(content, tt_word));
+    }
+    else if(val == L'^')
+    {
+      cerr << UtfConverter::toUtf8(content) << endl;
+      return input_buffer.add(TransferToken(content, tt_blank));
+    }
+    else if(val == L'\0' && null_flush)
+    {
+      fflush(output);
+    }
+    else
+    {
+      content += wchar_t(val);
+    }
+  }
+} // end of readToken
+
+bool
+Transfer::getNullFlush(void)
+{ 
+  //cerr << "getNullFlush" << endl; // di
+  return null_flush;
+}
+
+void
+Transfer::setNullFlush(bool null_flush)
+{ 
+  cerr << "setNullFlush" << endl; // di
+  this->null_flush = null_flush;
+}
+
+void
+Transfer::setTrace(bool trace)
+{ 
+  cerr << "setTrace" << endl; // di
+  this->trace = trace;
+}
+
+void
+Transfer::setTraceATT(bool trace)
+{ 
+  cerr << "setTraceATT" << endl; // di
+  this->trace_att = trace;
+}
+
+void
+Transfer::transfer_wrapper_null_flush(FILE *in, FILE *out)
+{ 
+  cerr << "transfer_wrapper_null_flush" << endl; // di
+  null_flush = false;
+  internal_null_flush = true;
+
+  while(!feof(in))
+  {
+    transfer(in, out);
+    fputwc_unlocked(L'\0', out);
+    int code = fflush(out);
+    if(code != 0)
+    {
+      wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+
+  internal_null_flush = false;
+  null_flush = true;
+}
+
+void
+Transfer::transfer(FILE *in, FILE *out)
+{ 
+  cerr << "Transfer starts here" << endl << endl; // di
+
+  if(getNullFlush())
+  {
+    transfer_wrapper_null_flush(in, out);
+  }
+
+  int last = 0;
+  int prev_last = 0;
+  lastrule_num = -1;
+  set<int> banned_rules;
+
+  output = out;
+  ms.init(me->getInitial());
+
+  int counter = 0; // di
+  while(true)
+  { 
+    cerr << "Transfer iteration # " << counter << endl; // di
+    cerr << "last: " << last << endl; // di
+    cerr << "prev_last: " << prev_last << endl; // di
+    cerr << "lastrule_num: " << lastrule_num << endl; // di
+    cerr << "ms.size(): " << ms.size() << endl; // di
+
+    // Let's look at input_buffer contents // di
+    /*int initbuffpos = input_buffer.getPos(); // di
+    //cerr << "input_buffer position: " << initbuffpos << endl << endl; // di
+    input_buffer.setPos(0); // di
+    int currbuffpos, prevbuffpos = input_buffer.getPos(); // di
+    TransferToken currbufftok, prevbufftok = input_buffer.next(); // di
+    bool run = true; // di
+    while (run) { // di
+      currbuffpos = input_buffer.getPos(); // di
+      currbufftok = input_buffer.next(); // di
+      //cerr << "input_buffer.buf[" << prevbuffpos << "]: " << UtfConverter::toUtf8(prevbufftok.getContent()) << endl; // di
+      if (currbuffpos == prevbuffpos) { // di
+        run = false; // di
+      } else { // di
+        prevbuffpos = currbuffpos; // di
+        prevbufftok = currbufftok; // di
+      } // di
+    } // di
+    cerr << endl; // di
+    // Return input_buffer to its initial position // di
+    input_buffer.setPos(initbuffpos); // di
+    // List banned_rules //di
+    //cerr << "banned_rules:" << endl;
+    //for(set<int>::iterator iter=banned_rules.begin(); iter != banned_rules.end(); iter++) { // di
+    //    cerr << *iter << ", "; // di
+    //} // di
+    //cerr << endl; // di*/
+
+    if(trace_att)
+    {
+      cerr << "Loop start " << endl;
+      cerr << "ms.size: " << ms.size() << endl;
+
+      cerr << "tmpword.size(): " << tmpword.size() << endl;
+
+      for (unsigned int ind = 0; ind < tmpword.size(); ind++)
+      {
+        if(ind != 0)
+        {
+          wcerr << L" ";
+        }
+        wcerr << *tmpword[ind];
+      }
+      wcerr << endl;
+
+      cerr << "tmpblank.size(): " << tmpblank.size() << endl;
+      for (unsigned int ind = 0; ind < tmpblank.size(); ind++)
+      {
+        wcerr << L"'";
+        wcerr << *tmpblank[ind];
+        wcerr << L"' ";
+      }
+      wcerr << endl;
+
+      cerr << "last: " << last << endl;
+      cerr << "prev_last: " << prev_last << endl << endl;
+    } // if(trace_att) ends here 
+
+    if (ms.size() == 0)
+    { 
+      //cerr << "(ms.size() == 0)" << endl; // di
+      if(lastrule != NULL)
+      {
+        // this is the branch where a rule specified by lastrule_num is applied
+
+        //cerr << "lastrule != NULL" << endl; // di
+        int num_words_to_consume = applyRule();
+
+        if(trace_att)
+        {
+          cerr << "num_words_to_consume: " << num_words_to_consume << endl;
+        }
+
+        //Consume all the words from the input which matched the rule.
+        //This piece of code is executed unless the rule contains a "reject-current-rule" instruction
+        if(num_words_to_consume < 0)
+        {
+          cerr << "num_words_to_consume < 0" << endl; // di
+          banned_rules.clear();
+          input_buffer.setPos(last);
+        }
+        else if(num_words_to_consume > 0)
+        {
+          cerr << "num_words_to_consume > 0" << endl; // di
+          banned_rules.clear();
+          if(prev_last >= input_buffer.getSize())
+          {
+            input_buffer.setPos(0);
+          }
+          else
+          {
+            input_buffer.setPos(prev_last+1);
+          }
+          int num_consumed_words = 0;
+          while(num_consumed_words < num_words_to_consume)
+          {
+            TransferToken& local_tt = input_buffer.next();
+            if (local_tt.getType() == tt_word)
+            {
+              num_consumed_words++;
+            }
+          }
+        }
+        else
+        {
+          cerr << "num_words_to_consume == 0" << endl; // di
+          //Add rule to banned rules
+          banned_rules.insert(lastrule_num);
+          input_buffer.setPos(prev_last);
+          input_buffer.next();
+          last = input_buffer.getPos();
+        } // thy words consumed
+        lastrule_num = -1;
+      }
+      else // lastrule == NULL
+      {
+        if(tmpword.size() != 0)
+        {
+          if(trace_att)
+          {
+            cerr << "printing tmpword[0]" <<endl;
+          }
+
+          pair<wstring, int> tr;
+          if(useBilingual && preBilingual == false)
+          {
+            if(isExtended && (*tmpword[0])[0] == L'*')
+            {
+              tr = extended.biltransWithQueue((*tmpword[0]).substr(1), false);
+              if(tr.first[0] == L'@')
+              {
+                tr.first[0] = L'*';
+              }
+              else
+              {
+                tr.first = L"%" + tr.first;
+              }
+            }
+            else
+            {
+              tr = fstp.biltransWithQueue(*tmpword[0], false);
+            }
+          }
+          else if(preBilingual)
+          {
+            wstring sl;
+            wstring tl;
+            int seenSlash = 0;
+            for(wstring::const_iterator it = tmpword[0]->begin(); it != tmpword[0]->end(); it++)
+            {
+              if(*it == L'\\')
+              {
+                if(seenSlash == 0)
+                {
+                  sl.push_back(*it);
+                  it++;
+                  sl.push_back(*it);
+                }
+                else
+                {
+                  tl.push_back(*it);
+                  it++;
+                  tl.push_back(*it);
+                }
+                continue;
+              }
+              else if(*it == L'/')
+              {
+                seenSlash++;
+                continue;
+              }
+              if(seenSlash == 0)
+              {
+                sl.push_back(*it);
+              }
+              else if(seenSlash == 1)
+              {
+                tl.push_back(*it);
+              }
+              else if(seenSlash > 1)
+              {
+                break;
+              }
+            }
+            //tmpword[0]->assign(sl);
+            tr = pair<wstring, int>(tl, false);
+            //wcerr << L"pb: " << *tmpword[0] << L" :: " << sl << L" >> " << tl << endl ;
+          }
+          else
+          {
+            tr = pair<wstring, int>(*tmpword[0], 0);
+          }
+
+          if(tr.first.size() != 0)
+          { 
+            if(defaultAttrs == lu)
+            {
+              fputwc_unlocked(L'^', output);
+              fputws_unlocked(tr.first.c_str(), output);
+              fputwc_unlocked(L'$', output);
+            }
+            else
+            {
+              if(tr.first[0] == '*')
+              {
+                fputws_unlocked(L"^unknown<unknown>{^", output);
+              }
+              else
+              {
+                fputws_unlocked(L"^default<default>{^", output);
+              }
+              fputws_unlocked(tr.first.c_str(), output);
+              fputws_unlocked(L"$}$", output);
+            }
+          }
+          banned_rules.clear();
+          tmpword.clear();
+          input_buffer.setPos(last);
+          input_buffer.next();
+          prev_last = last;
+          last = input_buffer.getPos();
+          ms.init(me->getInitial());
+        }
+        else if(tmpblank.size() != 0)
+        {
+          cerr << "tmpblank.size() != 0" << endl;
+          if(trace_att)
+          {
+            cerr << "printing tmpblank[0]" <<endl;
+          }
+          fputws_unlocked(tmpblank[0]->c_str(), output);
+          tmpblank.clear();
+          prev_last = last;
+          last = input_buffer.getPos();
+          ms.init(me->getInitial());
+        }
+      } // lastrule == NULL ends here
+    } // if(ms.size() == 0) ends here
+
+    int val = ms.classifyFinals(me->getFinals(), banned_rules);
+    if(val != -1)
+    {
+      lastrule = rule_map[val-1];
+      lastrule_num = val;
+      last = input_buffer.getPos();
+
+      if(trace)
+      {
+        wcerr << endl << L"apertium-transfer: Rule " << val << L" ";
+        for (unsigned int ind = 0; ind < tmpword.size(); ind++)
+        {
+          if (ind != 0)
+          {
+            wcerr << L" ";
+          }
+          wcerr << *tmpword[ind];
+        }
+        wcerr << endl;
+      }
+    }
+
+    TransferToken &current = readToken(in);
+    switch(current.getType())
+    { 
+      case tt_word:
+        applyWord(current.getContent());
+        tmpword.push_back(&current.getContent());
+        break;
+
+      case tt_blank:
+        ms.step(L' ');
+        tmpblank.push_back(&current.getContent());
+        break;
+
+      case tt_eof:
+        if(tmpword.size() != 0)
+        {
+          tmpblank.push_back(&current.getContent());
+          ms.clear();
+        }
+        else
+        {
+          fputws_unlocked(current.getContent().c_str(), output);
+          cerr << endl << "transfer ends" << endl << endl;
+          return;
+        }
+        break;
+
+      default:
+        cerr << "Error: Unknown input token." << endl;
+        return;
+    }
+    counter++;
+    cerr << endl;
+  }
+} // end of transfer
+
+int
+Transfer::applyRule()
+{ 
+  //cerr << "applyRule" << endl; // di
+  //cerr << "limit " << tmpword.size() << endl; // di
+  //wcerr << UtfConverter::toUtf8(*tmpword[0]) << endl; // di
+
+  int words_to_consume;
+  unsigned int limit = tmpword.size();
+
+  wstring wtmpchunk;
+  string tmpchunk;
+
+  if (useWeights)
+  {
+    wtmpchunk = L"";
+  }
+
+  for(unsigned int i = 0; i != limit; i++)
+  { 
+    cerr << "applyRule iteration # " << i << endl; // di
+    if(i == 0)
+    { 
+      cerr << "i == 0" << endl; // di
+      word = new TransferWord *[limit];
+      lword = limit;
+      if(limit != 1)
+      { 
+        cerr << "limit != 1" << endl; // di
+        blank = new string *[limit - 1];
+        lblank = limit - 1;
+      }
+      else
+      { 
+        cerr << "not limit != 1" << endl; // di
+        blank = NULL;
+        lblank = 0;
+      }
+    }
+    else
+    { 
+      cerr << "not i == 0" << endl; // di
+      blank[i-1] = new string(UtfConverter::toUtf8(*tmpblank[i-1]));
+    }
+
+    pair<wstring, int> tr;
+    if(useBilingual && preBilingual == false)
+    { 
+      cerr << "useBilingual && preBilingual == false" << endl; // di
+      tr = fstp.biltransWithQueue(*tmpword[i], false);
+      cerr << i << " ";
+      wcerr << tr.first << " "; // di
+      cerr << tr.second << endl; // di
+    }
+    else if(preBilingual)
+    { 
+      // this part is dedicated to splitting token by slash, e.g.
+      // if tmpword[i] was word_in_lang1<its><tags>/word_in_lang2<its><tags> 
+      // then
+      // sl = word_in_lang1<its><tags>
+      // tl = word_in_lang2<its><tags>
+
+      cerr << "preBilingual" << endl; // di
+      wstring sl;
+      wstring tl;
+      int seenSlash = 0;
+      for(wstring::const_iterator it = tmpword[i]->begin(); it != tmpword[i]->end(); it++)
+      {
+        if(*it == L'\\')
+        {
+          if(seenSlash == 0)
+          {
+            sl.push_back(*it);
+            it++;
+            sl.push_back(*it);
+          }
+          else
+          {
+            tl.push_back(*it);
+            it++;
+            tl.push_back(*it);
+          }
+          continue;
+        }
+
+        if(*it == L'/')
+        {
+          seenSlash++;
+          continue;
+        }
+
+        if(seenSlash == 0)
+        {
+          sl.push_back(*it);
+        }
+        else if(seenSlash == 1)
+        {
+          tl.push_back(*it);
+        }
+        else if(seenSlash > 1)
+        {
+          break;
+        }
+      }
+      cerr << UtfConverter::toUtf8(sl) << endl; // di
+      wcerr << tl << endl; // di
+      //tmpword[i]->assign(sl);
+      tr = pair<wstring, int>(tl, false);
+      if (useWeights)
+      {
+        wtmpchunk = wtmpchunk + sl + L" ";
+      }
+    }
+    else
+    { 
+      // here we don't need to split anything
+      cerr << "else" << endl; // di
+      tr = pair<wstring, int>(*tmpword[i], false);
+    }
+
+    //wcerr << L"tr.first: " << tr.first << endl; // di
+    word[i] = new TransferWord(UtfConverter::toUtf8(*tmpword[i]),
+                               UtfConverter::toUtf8(tr.first), tr.second);
+    //cerr << i << " "; // di
+    //wcerr << L"word[" << i << L"]: " << UtfConverter::fromUtf8(tr.first) << endl; // di
+  }
+
+  // check if we use weights
+  if (useWeights)
+  {
+    tmpchunk = UtfConverter::toUtf8(wtmpchunk);
+    cerr << "Got an lchunk: " << tmpchunk << endl << endl; // di
+
+    int pcreExecRet;
+    int subStrVec[30];
+    double chosen_weight = 0., current_weight = 0.;
+    string chosen_rule_id = rule_ids[lastrule_num];
+    string current_rule_id;
+    unsigned int rule_group_num; 
+
+    // check if rule id is not empty
+    if (chosen_rule_id != "")
+    {
+      // check if there are other rules in its group
+      rule_group_num = rule_group_map[chosen_rule_id];
+      if (rule_groups[rule_group_num].size() > 1)
+      {
+        cerr << "Rule # " << lastrule_num << " is ambiguous" << endl; // di
+        cerr << "Rule id: " << chosen_rule_id << endl; // di
+        cerr << "Rules in the group: " << endl; // di
+        for (unsigned int ind = 0; ind < rule_groups[rule_group_num].size(); ind++) // di
+        {  // di
+          cerr << "  " << rule_groups[rule_group_num][ind] << endl; // di
+        } // di
+        cerr << endl; // di
+     
+        // let's check the weights for each rule in the group
+        chosen_weight = 0.;
+        for (unsigned int ind = 0; ind < rule_groups[rule_group_num].size(); ind++)
+        {
+          current_weight = 0.;
+          current_rule_id = rule_groups[rule_group_num][ind];
+
+          cerr << "Checking " << current_rule_id << endl; // di
+          // go through patterns
+          for (unsigned int k = 0; k < weighted_patterns[current_rule_id].size(); k++)
+          { 
+            pcreExecRet = pcre_exec(weighted_patterns[current_rule_id][k].first, NULL, 
+                                    tmpchunk.c_str(), tmpchunk.length(), 
+                                    0, 0, subStrVec, 30);
+            if(pcreExecRet >= 0) // bingo!
+            {
+              cerr << "Pattern matched " << weighted_patterns[current_rule_id][k].first; // di
+              current_weight = weighted_patterns[current_rule_id][k].second;
+              cerr << " with weight " << current_weight << endl; // di
+              if (current_weight > chosen_weight) // heavier rule
+              {
+                chosen_weight = current_weight;
+                chosen_rule_id = current_rule_id;
+              }
+            }
+          }
+        }
+        cerr << endl; // di
+        // substitute lastrule with the chosen one
+        lastrule_num = rule_id_map[chosen_rule_id];
+        lastrule = rule_map[lastrule_num-1];
+        cerr << "Chose rule # " << lastrule_num << " id: " << chosen_rule_id;
+        cerr << " with weight " << chosen_weight << endl; // di
+      }
+    }
+  }
+
+  words_to_consume = processRule(lastrule);
+
+  // some cleanup ?
+  lastrule = NULL;
+
+  if(word)
+  {
+    for(unsigned int i = 0; i != limit; i++)
+    {
+      delete word[i];
+    }
+    delete[] word;
+  }
+  if(blank)
+  {
+    for(unsigned int i = 0; i != limit - 1; i++)
+    {
+      delete blank[i];
+    }
+    delete[] blank;
+  }
+  word = NULL;
+  blank = NULL;
+  tmpword.clear();
+  tmpblank.clear();
+  ms.init(me->getInitial());
+  cerr << "wtc: " << words_to_consume << endl; // di
+  return words_to_consume;
+} // end of applyRule
+
+/* HERE */
+void
+Transfer::applyWord(wstring const &word_str)
+{
+  // Here, the token contained in word_str is fed 
+  // to the fst by stepping with ms
+
+  //cerr << "applyWord: applying to " << UtfConverter::toUtf8(word_str) << endl; // di
+  ms.step(L'^');
+  for(unsigned int i = 0, limit = word_str.size(); i < limit; i++)
+  {
+    switch(word_str[i])
+    {
+      case L'\\':
+        i++;
+        ms.step(towlower(word_str[i]), any_char);
+        break;
+
+      case L'/': // got to the end of left side part (source token)
+        i = limit;
+        break;
+
+      case L'<': // got to the start of a tag
+        for(unsigned int j = i+1; j != limit; j++)
+        {
+          if(word_str[j] == L'>') // got to the end of the tag
+          {
+            // try to get the symbol corresponding to the tag
+            int symbol = alphabet(word_str.substr(i, j-i+1));
+            if(symbol) // there is such symbol in alphabet
+            {
+              ms.step(symbol, any_tag);
+            }
+            else // there is no such symbol in alphabet
+            {
+              ms.step(any_tag);
+            }
+            i = j;
+            break;
+          }
+        }
+        break;
+
+      default: // default is applying lemma's symbols one by one
+        ms.step(towlower(word_str[i]), any_char);
+        break;
+    }
+  }
+  ms.step(L'$'); // push the end of token
+  //cerr << UtfConverter::toUtf8(word_str) << endl; // di
+} // end of applyWord
+
+void
+Transfer::setPreBilingual(bool value)
+{ 
+  preBilingual = value;
+}
+
+bool
+Transfer::getPreBilingual(void) const
+{ 
+  return preBilingual;
+}
+
+void
+Transfer::setUseBilingual(bool value)
+{ 
+  useBilingual = value;
+}
+
+bool
+Transfer::getUseBilingual(void) const
+{ 
+  return useBilingual;
+}
+
+void
+Transfer::setCaseSensitiveness(bool value)
+{ 
+  fstp.setCaseSensitiveMode(value);
+}
+
+void
+Transfer::setUseWeights(bool value)
+{
+  useWeights = value;
+}
+
+bool
+Transfer::getUseWeights(void) const
+{
+  return useWeights;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_transfer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_transfer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_transfer.cc	(revision 70339)
@@ -0,0 +1,245 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <apertium/string_utils.h>
+#include "getopt_long.h"
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace Apertium;
+using namespace std;
+
+void message(char *progname)
+{
+  wcerr << "USAGE: " << basename(progname) << " trules preproc biltrans [input [output]]" << endl;
+  wcerr << "       " << basename(progname) << " -b trules preproc [input [output]]" << endl;
+  wcerr << "       " << basename(progname) << " -n trules preproc [input [output]]" << endl;
+  wcerr << "       " << basename(progname) << " -x extended trules preproc biltrans [input [output]]" << endl;
+  wcerr << "       " << basename(progname) << " -c trules preproc biltrans [input [output]]" << endl;
+  wcerr << "       " << basename(progname) << " -t trules preproc biltrans [input [output]]" << endl;
+  wcerr << "  trules       transfer rules file" << endl;
+  wcerr << "  preproc      result of preprocess trules file" << endl;
+  wcerr << "  biltrans     bilingual letter transducer file" << endl;
+  wcerr << "  input        input file, standard input by default" << endl;
+  wcerr << "  output       output file, standard output by default" << endl;
+  wcerr << "  -w tweights  transfer rule weights file" << endl;
+  wcerr << "  -b           input from lexical transfer" << endl;
+  wcerr << "  -n           don't use bilingual dictionary" << endl;
+  wcerr << "  -x bindix    extended mode with user dictionary" << endl;
+  wcerr << "  -c           case-sensitiveness while accessing bilingual dictionary" << endl;
+  wcerr << "  -t           trace (show rule numbers and patterns matched)" << endl;
+  wcerr << "  -T           trace, for apertium-transfer-tools (also sets -t)" << endl;
+  wcerr << "  -z           null-flushing output on '\0'" << endl;
+  wcerr << "  -h           shows this message" << endl;
+  
+
+  exit(EXIT_FAILURE);
+}
+
+void testfile(string const &filename)
+{
+  struct stat mybuf;
+  if(stat(filename.c_str(), &mybuf) == -1)
+  {
+    wcerr << "Error: can't stat file '";
+    wcerr << filename << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+FILE * open_input(string const &filename)
+{
+  FILE *input = fopen(filename.c_str(), "r");
+  if(!input)
+  {
+    wcerr << "Error: can't open input file '";
+    wcerr << filename.c_str() << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  return input;
+}  
+
+FILE * open_output(string const &filename)
+{
+  FILE *output = fopen(filename.c_str(), "w");
+  if(!output)
+  {
+    wcerr << "Error: can't open output file '";
+    wcerr << filename.c_str() << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  return output;
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+ 
+  Transfer t;
+
+  int option_index=0;
+  string weights = "";
+
+  while (true) {
+    static struct option long_options[] =
+    {
+      {"from-bilingual",      no_argument, 0, 'b'},
+      {"no-bilingual",      no_argument, 0, 'n'},
+      {"extended",      required_argument, 0, 'x'},
+      {"transfer-weihts",      required_argument, 0, 'w'},
+      {"case-sensitive", no_argument, 0, 'c'},
+      {"null-flush", no_argument, 0, 'z'},
+      {"trace", no_argument, 0, 't'},
+      {"trace_att", no_argument, 0, 'T'},
+      {"help", no_argument, 0, 'h'},
+      {0, 0, 0, 0}
+    };
+
+    int c=getopt_long(argc, argv, "nbx:w:cztTh", long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c)
+    {
+      case 'b':
+        t.setPreBilingual(true);
+        t.setUseBilingual(false);
+        break;
+
+      case 'n':
+        t.setUseBilingual(false);
+        break;
+        
+      case 'x':
+        t.setExtendedDictionary(optarg);
+        break;
+
+      case 'w': // transfer rule weights file is specified
+        weights = optarg;
+        testfile(weights);
+        t.setUseWeights(true);
+        break;
+        
+      case 'c':
+        t.setCaseSensitiveness(true);
+        break;
+      
+      case 't':
+        t.setTrace(true);
+        break;
+      
+      case 'T':
+        t.setTrace(true);
+        t.setTraceATT(true);
+        break;
+      
+      case 'z':
+        t.setNullFlush(true);
+        break;
+
+      case 'h':
+      default:
+        message(argv[0]);
+        break;
+    }    
+  }
+
+  FILE *input = stdin, *output = stdout;
+
+  switch(argc - optind + 1)
+  {
+    case 6:
+      output = open_output(argv[argc-1]);
+      input = open_input(argv[argc-2]);
+      testfile(argv[argc-3]);
+      testfile(argv[argc-4]);
+      testfile(argv[argc-5]);
+      t.read(argv[argc-5], argv[argc-4], weights, argv[argc-3]);
+      break;
+      
+    case 5:
+      if(t.getUseBilingual() == false || t.getPreBilingual() == true)
+      {
+        output = open_output(argv[argc-1]);
+        input = open_input(argv[argc-2]);
+        testfile(argv[argc-3]);
+        testfile(argv[argc-4]);
+        t.read(argv[argc-4], argv[argc-3], weights);
+      }
+      else
+      {
+        input = open_input(argv[argc-1]);
+        testfile(argv[argc-2]);
+        testfile(argv[argc-3]);
+        testfile(argv[argc-4]);
+        t.read(argv[argc-4], argv[argc-3], weights, argv[argc-2]);
+      }
+      break;
+      
+    case 4:
+      if(t.getUseBilingual() == false || t.getPreBilingual() == true)
+      {
+        input = open_input(argv[argc-1]);
+        testfile(argv[argc-2]);
+        testfile(argv[argc-3]);
+        t.read(argv[argc-3], argv[argc-2], weights);
+      }
+      else
+      {
+        testfile(argv[argc-1]);
+        testfile(argv[argc-2]);
+        testfile(argv[argc-3]);
+        t.read(argv[argc-3], argv[argc-2], weights, argv[argc-1]);
+      }
+      break;
+    case 3:
+      if(t.getUseBilingual() == false || t.getPreBilingual() == true)
+      {
+        testfile(argv[argc-1]);
+        testfile(argv[argc-2]);
+        t.read(argv[argc-2], argv[argc-1], weights);
+      }
+      else
+      {
+        message(argv[0]);
+      }
+      break;
+    
+    default:
+      message(argv[0]);
+      break;
+  }  
+  
+#ifdef _MSC_VER
+  _setmode(_fileno(input), _O_U8TEXT);
+  _setmode(_fileno(output), _O_U8TEXT);
+#endif 
+
+  t.transfer(input, output);
+  return EXIT_SUCCESS; 
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.h	(revision 70339)
@@ -0,0 +1,165 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSFER_
+#define _TRANSFER_
+
+#include <apertium/transfer_instr.h>
+#include <apertium/transfer_token.h>
+#include <apertium/transfer_word.h>
+#include <apertium/apertium_re.h>
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/buffer.h>
+#include <lttoolbox/fst_processor.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/match_state.h>
+
+#include <cstdio>
+#include <libxml/parser.h>
+#include <libxml/tree.h>
+#include <map>
+#include <set>
+#include <vector>
+#include <pcre.h>
+
+using namespace std;
+
+class Transfer
+{
+private:
+
+  Alphabet alphabet;
+  MatchExe *me;
+  MatchState ms;
+  map<string, ApertiumRE, Ltstr> attr_items;
+  map<string, string, Ltstr> variables;
+  map<string, int, Ltstr> macros;
+  map<string, set<string, Ltstr>, Ltstr> lists;
+  map<string, set<string, Ltstr>, Ltstr> listslow;
+  vector<xmlNode *> macro_map;
+  vector<xmlNode *> rule_map;
+  vector<string> rule_ids; // rule number -> rule id, first meaningful rule at position 1
+  map<string, int> rule_id_map; // rule id -> rule number
+  vector<vector<string> > rule_groups; // rule group number -> rule ids
+  map<string, int> rule_group_map; // id -> rule group number
+  map<string, vector<pair<pcre*, double> > > weighted_patterns; // all weighted patterns, grouped by rule id
+  xmlDoc *doc;
+  xmlNode *root_element;
+  TransferWord **word;
+  string **blank;
+  int lword, lblank;
+  Buffer<TransferToken> input_buffer;
+  vector<wstring *> tmpword;
+  vector<wstring *> tmpblank;
+
+  FSTProcessor fstp;
+  FSTProcessor extended;
+  bool isExtended;
+  FILE *output;
+  int any_char;
+  int any_tag;
+
+  xmlNode *lastrule;
+  int lastrule_num;
+  unsigned int nwords;
+
+  map<xmlNode *, TransferInstr> evalStringCache;
+
+  enum OutputType{lu,chunk};
+
+  OutputType defaultAttrs;
+  bool preBilingual;
+  bool useBilingual;
+  bool useWeights;
+  bool null_flush;
+  bool internal_null_flush;
+  bool trace;
+  bool trace_att;
+  string emptyblank;
+  
+  void destroy();
+  void readData(FILE *input);
+  void readBil(string const &filename);
+  void readTransfer(string const &input);
+  void readTransferWeights(string const &in); // read transfer weights file
+  void collectMacros(xmlNode *localroot);
+  void collectRules(xmlNode *localroot);
+  string getRuleId(xmlNode *localroot); // get value of 'id' property of 'rule' element
+  string getNodeAttr(xmlNode *localroot, const char* attr_name);
+  string caseOf(string const &str);
+  string copycase(string const &source_word, string const &target_word);
+
+  void processLet(xmlNode *localroot);
+  void processAppend(xmlNode *localroot);
+  int processRejectCurrentRule(xmlNode *localroot);
+  void processOut(xmlNode *localroot);
+  void processCallMacro(xmlNode *localroot);
+  void processModifyCase(xmlNode *localroot);
+  bool processLogical(xmlNode *localroot);
+  bool processTest(xmlNode *localroot);
+  bool processAnd(xmlNode *localroot);
+  bool processOr(xmlNode *localroot);
+  bool processEqual(xmlNode *localroot);
+  bool processBeginsWith(xmlNode *localroot);
+  bool processBeginsWithList(xmlNode *localroot);
+  bool processEndsWith(xmlNode *localroot);
+  bool processEndsWithList(xmlNode *local);
+  bool processContainsSubstring(xmlNode *localroot);
+  bool processNot(xmlNode *localroot);
+  bool processIn(xmlNode *localroot);
+  int processRule(xmlNode *localroot);
+  string evalString(xmlNode *localroot);
+  void evalStringClip(xmlNode *element, string &lemma, int &pos); // the dark horse
+  int processInstruction(xmlNode *localroot);
+  int processChoose(xmlNode *localroot);
+  string processChunk(xmlNode *localroot);
+  string processTags(xmlNode *localroot);
+
+  bool beginsWith(string const &str1, string const &str2) const;
+  bool endsWith(string const &str1, string const &str2) const;
+  string tolower(string const &str) const;
+  string tags(string const &str) const;
+  wstring readWord(FILE *in);
+  wstring readBlank(FILE *in);
+  wstring readUntil(FILE *in, int const symbol) const;
+  void applyWord(wstring const &word_str);
+  int applyRule();
+  TransferToken & readToken(FILE *in);
+  bool checkIndex(xmlNode *element, int index, int limit);
+  void transfer_wrapper_null_flush(FILE *in, FILE *out);
+public:
+  Transfer();
+  ~Transfer();
+  
+  void read(string const &transferfile, string const &datafile, 
+            string const &weightsfile = "", string const &fstfile = "");
+  void transfer(FILE *in, FILE *out);
+  void setUseBilingual(bool value);
+  bool getUseBilingual(void) const;
+  void setPreBilingual(bool value);
+  bool getPreBilingual(void) const;
+  void setExtendedDictionary(string const &fstfile);
+  void setCaseSensitiveness(bool value);
+  bool getNullFlush(void);
+  void setNullFlush(bool null_flush);
+  void setTrace(bool trace);
+  void setTraceATT(bool trace);
+  void setUseWeights(bool weighted);
+  bool getUseWeights(void) const;
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer-weights.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer-weights.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer-weights.dtd	(revision 70339)
@@ -0,0 +1,51 @@
+<?xml version="1.0" encoding="UTF-8"?>
+
+<!ELEMENT transfer-weights (rule-group+)>
+<!-- 
+     'transfer-weights' is a root element.
+-->
+
+<!ELEMENT rule-group (rule+)>
+<!--
+     An element used to keep all mutually ambiguous rules together.
+-->
+
+<!ELEMENT rule (pattern+)>
+<!ATTLIST rule id ID #REQUIRED
+               md5 CDATA #REQUIRED
+               comment CDATA #IMPLIED>
+<!-- 
+      Each rule has a list of patterns that define its weights.
+      * attribute 'id' is a unique rule identifier used to refer to the rule
+        as defined in transfer file.  It is not restricted to integers, and it is
+        encouraged to make id meaningful.
+      * attribute 'md5' is md5 sum of the corresponding rule entry text 
+        from transfer file with whitespace removed.  It is used to check 
+        if text of the rule hasn't changed since the weights were calculated.
+      * attribute 'comment' allows to put in comments about the purpose of
+        the rule.
+-->
+
+<!ELEMENT pattern (pattern-item+)>
+<!ATTLIST pattern weight CDATA #REQUIRED>
+<!-- 
+      The pattern is specified in terms of pattern items, each one
+      representing a lexical form in the matched pattern. 
+-->
+
+<!ELEMENT pattern-item EMPTY>
+<!ATTLIST pattern-item lemma CDATA #IMPLIED 
+                       tags CDATA #REQUIRED> 
+<!-- 
+     Each 'pattern-item' (pattern item) represents a set of lexical forms
+     and has a mandatory attribute 'tags' whose value is a sequence of
+     dot-separated tag names; this sequence is a subsequence of the
+     tag sequence defining each possible lexical form. For example,
+     tags="n.f" would match all lexical forms containing this tag
+     sequence, such as "^casa<n><f><pl>$".
+
+     In addition, an optional attribute, "lemma", may be used to
+     define lexical forms having a particular substring in their lemma.
+
+     This element is similar to 'cat-item' used in transfer files.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.dtd	(revision 70339)
@@ -0,0 +1,494 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!-- 
+   Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+    Draft of DTD for the structural transfer rule files 
+     
+    Sergio Ortiz, Gema Ram�rez-S�nchez, Mireia Ginest�, Mikel L. Forcada, 
+    2005.07.29. 
+-->    
+
+<!ENTITY % condition "(and|or|not|equal|begins-with|begins-with-list|ends-with|ends-with-list|contains-substring|in)">
+<!ENTITY % container "(var|clip)">
+<!ENTITY % sentence "(let|out|choose|modify-case|call-macro|append|reject-current-rule)">
+<!ENTITY % value "(b|clip|lit|lit-tag|var|get-case-from|case-of|concat|lu|mlu|chunk)">
+<!ENTITY % stringvalue "(clip|lit|var|get-case-from|case-of)">
+
+<!ELEMENT transfer (section-def-cats, section-def-attrs?, section-def-vars?, section-def-lists?, section-def-macros?, section-rules)>
+<!ATTLIST transfer default (lu|chunk) #IMPLIED>
+<!-- 
+     'transfer' is the root element containing the whole structural
+     transfer rule file.  Attribute 'default' specifies if
+     unmatched words have to be written as lexical units ("lu", this is
+     the default value) or as chunks ("chunk").
+-->
+
+<!ELEMENT section-def-cats (def-cat+)>
+<!-- 
+     The 'def-cats' section defines the categories used to build the
+patterns used in rules
+ -->
+
+<!ELEMENT def-cat (cat-item+)>
+<!ATTLIST def-cat  n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!-- 
+     Each 'def-cat' defines one category in terms of a list of
+     category items and has a unique name 'n', which is mandatory
+-->
+
+<!ELEMENT cat-item EMPTY>
+<!ATTLIST cat-item lemma CDATA #IMPLIED 
+                   tags CDATA #REQUIRED 
+                   c CDATA #IMPLIED> 
+<!-- 
+          Each 'cat-item' (category item) represents a set of lexical forms
+     and has a mandatory attribute 'tags' whose value is a sequence of
+     dot-separated tag names; this sequence is a subsequence of the
+     tag sequence defining each possible lexical form. For example,
+     tags="n.f" would match all lexical forms containing this tag
+     sequence, such as "^casa<n><f><pl>$".
+
+     In addition, an optional attribute, "lemma", may be used to
+     define lexical forms having a particular substring in their lemma
+-->
+ 
+<!ELEMENT section-def-attrs (def-attr+)>
+
+<!-- 
+     The 'def-attrs' section defines the attributes that will be
+     identified in matched lexical forms 
+-->
+
+<!ELEMENT def-attr (attr-item+)>
+<!ATTLIST def-attr n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!-- 
+     Each def-attr defines one attribute in terms of a list of
+     attribute items and has a mandatory unique name n 
+-->
+
+<!ELEMENT attr-item EMPTY>
+<!ATTLIST attr-item tags CDATA #IMPLIED
+                    c CDATA #IMPLIED>
+<!-- 
+     Each 'attr-item' specifies a subsequence of the tags in
+     that lexical form (attribute 'tags')
+-->
+
+<!ELEMENT section-def-vars (def-var+)>
+<!-- 
+     The 'def-vars' section defines the global variables
+     that will be used to transfer information between rules
+-->
+
+<!ELEMENT def-var EMPTY>
+<!ATTLIST def-var n ID #REQUIRED
+                  v CDATA #IMPLIED
+                  c CDATA #IMPLIED>
+<!-- 
+     The definition of a global variable has a mandatory unique name 'n' that
+     will be used to refer to it. A value of initialization can also be specified
+     by means the 'v' attribute.  The default value of the initialization is the
+     empty string.
+-->
+
+<!ELEMENT section-def-lists (def-list)+>
+<!--
+     Element 'section-def-lists' encloses a set of list definitions
+-->
+
+<!ELEMENT def-list (list-item+)>
+<!ATTLIST def-list n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!--
+     The 'def-list' element defines a named list to search with the 'in' 
+     element.  Attribute 'n' sets the name of the list
+-->
+
+<!ELEMENT list-item EMPTY>
+<!ATTLIST list-item v CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+<!--
+     Attribute 'v' of 'list-item' element contains the value to be added to 
+     the list being defined     
+-->
+
+<!ELEMENT section-def-macros (def-macro)+>
+<!-- 
+
+     The 'def-macros' section defines macros containing portions of
+     code frequently used in the action part of rules
+
+-->
+
+<!ELEMENT def-macro (%sentence;)+>
+<!ATTLIST def-macro n ID #REQUIRED>
+<!ATTLIST def-macro npar CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+<!-- 
+     Macro definition:
+     
+     A macro has a mandatory name (the value of 'n'), a number of parameters
+     (the value of 'npar') and a body containing arguments and statements.  
+-->
+
+<!ELEMENT section-rules (rule+)>
+<!-- 
+     The rules section contains a sequence of one or more rules
+-->
+
+<!ELEMENT rule (pattern, action)>
+<!ATTLIST rule id ID #IMPLIED
+               comment CDATA #IMPLIED>
+<!-- 
+      Each rule has a pattern and an action
+      * attribute 'id' is a unique rule identifier used to refer to the rule
+        in weigths file. It is really necessary only for ambiguous rules, and
+        is therefore optional. It is not restricted to integers, and it is
+        encouraged to make id meaningful. 
+      * attribute 'comment' allows to put in comments about the purpose of
+        the rule being defined
+-->
+
+<!ELEMENT pattern (pattern-item+)>
+<!-- 
+The pattern is specified in terms of pattern items, each one
+representing a lexical form in the matched pattern 
+-->
+
+<!ELEMENT pattern-item EMPTY>
+<!ATTLIST pattern-item n IDREF #REQUIRED>
+<!-- 
+       Each attribute to be activated is referred to by its name in the def-cats section 
+-->
+
+<!ELEMENT action (%sentence;)*>
+<!ATTLIST action c CDATA #IMPLIED>
+<!-- 
+       Encloses the procedural part of a rule
+-->
+
+<!ELEMENT choose (when+,otherwise?)>
+<!ATTLIST choose c CDATA #IMPLIED>
+<!-- 
+     The choose statement is a selection statement (similar to a case
+     statement) composed of one or more tested cases and an optional
+     otherwise 
+-->
+
+<!ELEMENT when (test,(%sentence;)*)>
+<!ATTLIST when c CDATA #IMPLIED>
+<!-- 
+     Each tested case is a block of zero or more statements 
+-->
+
+<!ELEMENT otherwise (%sentence;)+>
+<!ATTLIST otherwise c CDATA #IMPLIED>
+<!-- 
+     The otherwise case is also a block of one or more statements 
+-->
+
+<!ELEMENT test (%condition;)>
+<!ATTLIST test c CDATA #IMPLIED>
+<!-- 
+     The test in a tested case may be a conjunction, a disjunction, or
+     a negation of simpler tests, as well as a simple equality test
+-->
+
+<!ELEMENT and ((%condition;),(%condition;)+)>
+<!--  
+     Each conjuntion test contains two or more simpler tests 
+-->
+
+<!ELEMENT or ((%condition;),(%condition;)+)>
+<!-- 
+     Each disjunction test contains two or more simpler tests 
+-->
+
+<!ELEMENT not (%condition;)>
+<!-- 
+     The negation of a simpler test is a test itself 
+-->
+
+<!ELEMENT equal (%value;,%value;)> 
+<!ATTLIST equal caseless (no|yes) #IMPLIED>
+<!-- 
+      The simplest test is an equality test. The right part and the
+      left part of the equality may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT begins-with (%value;,%value;)> 
+<!ATTLIST begins-with caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the beginning.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT ends-with (%value;,%value;)> 
+<!ATTLIST ends-with caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the end.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT begins-with-list (%value;,list)> 
+<!ATTLIST begins-with-list caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the beginning.
+      First parts of the test may be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section. The second part
+      must be always a list.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+<!ELEMENT ends-with-list (%value;,list)> 
+<!ATTLIST ends-with-list caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the end.
+      First parts of the test may be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section. The second part
+      must be always a list.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+<!ELEMENT contains-substring (%value;,%value;)> 
+<!ATTLIST contains-substring caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+
+
+<!ELEMENT in (%value;, list)>
+<!ATTLIST in caseless (no|yes) #IMPLIED>
+<!--
+    'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+    this search is performed without attending to the case
+-->
+
+<!ELEMENT list EMPTY>
+<!ATTLIST list n IDREF #REQUIRED>
+<!--
+    'list' refers, with the name in attribute 'n', a list defined before in
+    the 'section-def-list' section
+-->
+
+<!ELEMENT let (%container;, %value;)>
+<!-- 
+      An assignment statement ('let') assigns the value of a clip (see
+      below), a literal string ('lit'), a literal tag('lit-tag') or the 
+      value of a global variable ('var') to either a global variable ('var') 
+      or a clip
+-->
+
+<!ELEMENT append (%value;)+>
+<!ATTLIST append n IDREF #REQUIRED>
+<!-- 
+      This instruction appends the value of a clip (see
+      below), a literal string ('lit'), a literal tag('lit-tag') or the 
+      value of a global variable ('var') to either a global variable ('var') 
+      or a clip, identified by the "n" attribute
+-->
+
+
+<!ELEMENT out (mlu|lu|b|chunk|var)+>
+<!ATTLIST out c CDATA #IMPLIED>
+<!-- 
+      'out' is an output statement; it may output any sequence of
+      clips, literal strings, literal tags, variables, and whitespace items 
+      (see below) 
+-->
+
+<!ELEMENT modify-case (%container;, %stringvalue;)>
+<!--
+      The first argument of 'modify-case' copy the case of the second 
+      argument.
+--> 
+
+<!ELEMENT call-macro (with-param)*>
+<!ATTLIST call-macro n IDREF #REQUIRED>
+<!-- 
+      A macro may be called anywhere by name with one or more
+      arguments
+-->
+
+<!ELEMENT with-param EMPTY>
+<!ATTLIST with-param pos CDATA #REQUIRED>
+<!-- 
+      The attribute pos in each argument is used to refer to a lexical
+      form in the current rule. For example, if a 2-parameter macro
+      has been defined to perform noun-adjective agreement operations,
+      it may be used with arguments 1 and 2 in a noun-adjective rule,
+      with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+      arguments 1 and 3 in a noun-adverb-adjective rule, and with
+      arguments 2 and 1 in an adjective-noun rule 
+-->
+
+<!ELEMENT clip EMPTY>
+<!ATTLIST clip pos CDATA #REQUIRED
+               side (sl|tl) #REQUIRED
+               part CDATA #REQUIRED
+               queue CDATA #IMPLIED
+               link-to CDATA #IMPLIED
+               c CDATA #IMPLIED>
+<!-- 
+      A 'clip' is a substring of a source-language or target-language
+      lexical form, extracted according to an attribute:
+
+      * 'pos' is an index (1, 2, 3...) used to select a lexical form
+         inside the rule;
+   
+      * 'side' is used to select a source-language ('sl') or a
+        target-language ('tl') clip
+   
+      * the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+
+      * the value of 'queue' may be 'no' or 'yes'.  'yes' is assumed  by 
+        default.
+    
+      * 'link-to' causes the other attributes to be ignored in clip evaluation
+        when using 'clip' as a right hand side element (as value), and 
+        returns its value.  When using as a left hand side (as reference), 
+        the value of the 'as' attribute is ignored.
+-->
+
+<!ELEMENT lit EMPTY>
+<!ATTLIST lit v CDATA #REQUIRED>
+<!-- 
+      A literal string value: the value of the literal is the value of
+      the 'v' attribute
+-->
+
+<!ELEMENT lit-tag EMPTY>
+<!ATTLIST lit-tag v CDATA #REQUIRED>
+<!-- 
+      A literal string value: the value of the literal is the value of
+      the 'v' attribute
+-->
+
+
+<!ELEMENT var EMPTY>
+<!ATTLIST var n IDREF #REQUIRED>
+<!-- 
+     Each 'var' is a variable identifier: the attribute n is the name
+     of the variable. When it is in an 'out', a 'test', or the right
+     part of a 'let', it represents the value of the variable; when in
+     the left part of a 'let' it represents the reference of the
+     variable. 
+-->
+
+<!ELEMENT get-case-from (clip|lit|var)> 
+<!ATTLIST get-case-from pos CDATA #REQUIRED>
+<!-- Atenci�n, falta modificar todos los comentarios donde intervenga
+get-case-from -->
+
+<!ELEMENT case-of EMPTY>
+<!ATTLIST case-of pos CDATA #REQUIRED
+               side (sl|tl) #REQUIRED
+               part CDATA #REQUIRED>
+<!--
+      A 'case-of' is a value representing the case of a "clip".  This value 
+      will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+      (all uppercase).
+
+      * 'pos' is an index (1, 2, 3...) used to select a lexical form
+         inside the rule;
+   
+      * 'side' is used to select a source-language ('sl') or a
+        target-language ('tl') clip
+   
+      * the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+-->
+
+
+<!ELEMENT concat (%value;)+>
+<!-- Concatenates a sequence of values -->
+
+<!ELEMENT mlu (lu+)>
+<!-- Encloses a multiword -->
+
+<!ELEMENT lu (%value;)+>
+<!-- Encloses a word inside an 'out' element. -->
+
+<!ELEMENT reject-current-rule EMPTY>
+<!ATTLIST reject-current-rule shifting (yes|no) #IMPLIED>
+<!--
+      This instruction cancels the execution of the rule being processed.
+      If "shifting" is set to "yes" or is not specified, the matching process
+      consumes exactly one word at the input. If "shifting" is set to "no"
+      then marks the rule to not to be considered in the current matching 
+      until the input buffer advances at least one single word 
+-->
+
+<!ELEMENT chunk (tags,(mlu|lu|b|var)+)>
+<!ATTLIST chunk name CDATA #IMPLIED
+                namefrom CDATA #IMPLIED
+                case CDATA #IMPLIED
+                c CDATA #IMPLIED>
+<!-- 
+     Encloses a chunk inside an 'out' element.      
+     * 'name' the pseudolemma of the chunk.
+     * 'namefrom' get the name from a variable.
+     * 'case' the variable to get the uppercase/lowercase policy
+        to apply it to the chunk name
+-->
+
+<!ELEMENT tags (tag+)>
+<!ELEMENT tag (%value;)>
+
+<!ELEMENT b EMPTY>
+<!ATTLIST b pos CDATA #IMPLIED>
+<!-- 
+     'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+     with pos="2" refers to the [super]blanks (including format data
+     encapsulated by the de-formatter) between lexical form 2 and
+     lexical form 3. Managing [super]blanks explicitly allows for the
+     correct placement of format when the result of structural
+     transfer has more or less lexical items than the original or has
+     been reordered in some way.  If attribute "pos" is not specified, then
+     a single blank (ASCII 32) is generated.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/string_to_wostream.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/string_to_wostream.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/string_to_wostream.h	(revision 70339)
@@ -0,0 +1,13 @@
+// Include string_utils.h instead if you're linking against apertium
+
+#ifndef __STRING_TO_WOSTREAM_H_
+#define __STRING_TO_WOSTREAM_H_
+
+#include <iterator>
+
+std::wostream & operator<<(std::wostream & ostr, std::string const & str) {
+  ostr << str.c_str();
+  return ostr;
+}
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/align.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/align.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/align.cc	(revision 70339)
@@ -0,0 +1,56 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "align.h"
+#include "linebreak.h"
+#include <apertium/string_utils.h>
+
+#include <iomanip>
+#include <ios>
+#include <iostream>
+#include <ostream>
+#include <string>
+#include <utility>
+#include <vector>
+
+namespace Apertium {
+void align::align_(
+    const std::vector<std::pair<std::string, std::string> > &string_) {
+  const std::streamsize width_ = col(string_) + 2;
+
+  for (std::vector<std::pair<std::string, std::string> >::const_iterator i_ =
+           string_.begin();
+       i_ != string_.end(); ++i_) {
+    std::wcerr << "  " << std::setw(width_) << std::left << i_->first
+               << std::setw(0)
+               << linebreak::linebreak_(i_->second, width_ + 2, width_ + 4)
+               << '\n';
+  }
+}
+
+std::string::size_type
+align::col(const std::vector<std::pair<std::string, std::string> > &string_) {
+  std::string::size_type col_ = 0;
+
+  for (std::vector<std::pair<std::string, std::string> >::const_iterator i_ =
+           string_.begin();
+       i_ != string_.end(); ++i_) {
+    if (i_->first.size() > col_)
+      col_ = i_->first.size();
+  }
+
+  return col_;
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-prelatex.l
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-prelatex.l	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-prelatex.l	(revision 70339)
@@ -0,0 +1,477 @@
+
+
+%{
+
+
+
+#include <cstdlib>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+#include <apertium/latex_accentsmap.h>
+#include <apertium/string_utils.h>
+
+extern "C" {
+#if !defined(__STDC__)
+# define __STDC__ 1
+#endif
+#include <regex.h>
+}
+
+#include <string>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/ltstr.h>
+#ifndef GENFORMAT
+#include "apertium_config.h"
+#endif
+#include <apertium/unlocked_cstdio.h>
+#ifdef _WIN32
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace std;
+
+AccentsMap accentsMap(false);
+wstring closesym = L"";
+string memconv = "";
+//For german babel detection
+bool ngermanbabel = false;
+
+wstring convertir(string const &multibyte, int const length)
+{
+  memconv.append(multibyte.c_str(), length);
+  int tam = memconv.size();
+  wchar_t *retval = new wchar_t[tam+1];
+  size_t l = mbstowcs(retval, memconv.c_str(), tam);
+
+  if(l == ((size_t) -1))
+  {
+    delete[] retval;
+    if(memconv.size() >= 4)
+    {
+      wcerr << L"Warning: wrong encoding" << endl;
+    }
+    return L"";
+  }
+  else
+  {
+    memconv = "";
+    retval[l] = 0;
+    wstring ret = retval;
+    delete[] retval;
+    return ret;
+  }
+}
+
+
+
+
+%}
+
+
+%option nounput
+%option noyywrap
+%option stack
+
+%x mathenv
+%x readbrackets
+
+%%
+
+
+
+
+
+\\t\{..\}	{ //This information is lost
+	fputws(convertir(yytext+3,yyleng-4).c_str(),yyout);
+}
+\\l	{
+	fputws(L"ł", yyout);
+}
+
+\"[oOaAuUsS]	{ //When usepackage[ngerman]{babel} is present (not checked).
+	if(!ngermanbabel)
+		fputws(convertir(yytext,yyleng).c_str(),yyout);
+	else {
+		switch(yytext[1]){
+			case 'o': fputws(L"ö", yyout); break;
+			case 'O': fputws(L"Ö", yyout); break;
+			case 'a': fputws(L"ä", yyout); break;
+			case 'A': fputws(L"Ä", yyout); break;
+			case 'u': fputws(L"ü", yyout); break;
+			case 'U': fputws(L"Ü", yyout); break;
+			case 's': fputws(L"ß", yyout); break;
+			case 'S': fputws(L"ß", yyout); break;
+		}
+	}
+}
+
+
+
+\\[\^\"\'`]((\{\\[ij]\})|(\\[ij]))	{
+	switch(yytext[1]){
+	case '^':
+		if(yytext[4]=='i')
+			fputws(L"î", yyout);
+		else
+			fputws(L"ĵ",yyout);
+		break;
+	case '\"':
+		if(yytext[4]=='i')
+			fputws(L"ï",yyout);
+		else
+			fputws(L"j",yyout); //should actually be j with umlaut
+		break;
+	case '\'':
+		if(yytext[4]=='i')
+			fputws(L"í",yyout);
+		else
+			fputws(L"j",yyout); //should actually be j with accent
+		break;
+	case '`':
+		if(yytext[4]=='i')
+			fputws(L"ì",yyout);
+		else
+			fputws(L"k",yyout); //should actually be j with accent
+		break;
+	}
+}
+
+\{\\oe\}	{
+	fputws(L"œ",yyout);
+}
+
+\{\\OE\}	{
+	fputws(L"Œ",yyout);
+}
+
+\{\\ae\}	{
+	fputws(L"æ",yyout);
+}
+
+\{\\AE\}	{
+	fputws(L"Æ",yyout);
+}
+
+\{\\aa\}	{
+	fputws(L"å",yyout);
+}
+
+\{\\AA\}	{
+	fputws(L"Å",yyout);
+}
+
+\{\\o\}	{
+	fputws(L"ø",yyout);
+}
+
+\{\\O\}	{
+	fputws(L"Ø",yyout);
+}
+
+\{\\ss\}	{
+	fputws(L"ß",yyout);
+}
+
+\\#[0-9]+	{
+        fputws((wstring(L"<HASH_")+convertir(yytext+2,yyleng-2)+wstring(L"/>")).c_str(),yyout);
+}
+
+\\#		{
+        fputws(L"<HASH/>", yyout);
+}
+
+\\[`'\^\"H~ck=b.druv]((\{.\})|(.))	{
+	wstring ws = convertir(yytext,yyleng).c_str();
+
+	wstring result = accentsMap.get(
+	  L""+ws.substr(1,1)+ (
+	    (yyleng==3)? ws.substr(2,1) : ws.substr(3,1)
+	  ));
+
+        if(result == L"")
+        {
+	  fputws((wstring(L"<")+convertir(yytext+1,yyleng)+wstring(L"/>")).c_str(),yyout);
+        }
+        else
+        {
+  	  fputws(result.c_str(), yyout);
+        }
+}
+
+\\\\	{
+	fputws(L"<BR/>",yyout);
+}
+
+\%.*	{
+	if(yytext[yyleng-1]=='\r')
+		fputws((wstring(L"<COMMENT>")+convertir(yytext+1,yyleng-2)+wstring(L"</COMMENT>\r")).c_str(),yyout);
+	else
+		fputws((wstring(L"<COMMENT>")+convertir(yytext+1,yyleng-1)+wstring(L"</COMMENT>")).c_str(),yyout);
+}
+
+\\usepackage\[[^\]]*\]	{
+	wstring ws = convertir(yytext+12,yyleng-13);
+	fputws((wstring(L"<usepackage/><PARAM>")+ws+wstring(L"</PARAM>")).c_str(), yyout);
+	if(ws.find(L"ngerman") != wstring::npos)
+		ngermanbabel = true;
+}
+
+\[[^\]]*\]	{
+	fputws((wstring(L"<PARAM>")+convertir(yytext+1,yyleng-2)+wstring(L"</PARAM>")).c_str(), yyout);
+}
+
+\\begin[^a-zA-Z0-9_]	{
+	BEGIN(readbrackets);
+	closesym = L"";
+}
+
+\\end[^a-zA-Z0-9_]	{
+	BEGIN(readbrackets);
+	closesym = L"/";
+}
+
+
+
+<readbrackets>[ \n\r\t]*\{?[ \n\r\t]*	{
+	wstring ws = convertir(yytext,yyleng);
+	int i = ws.find(L'{'); //remove it
+	if(i>=0)
+		ws = ws.substr(0,i)+ws.substr(i+1);
+	fputws(ws.c_str(),yyout);
+}
+
+<readbrackets>[a-zA-Z0-9]+\*	{
+	fputws((wstring(L"<")+closesym+convertir(yytext,yyleng-1)+wstring(L"_STAR>")).c_str(),yyout);
+}
+
+<readbrackets>[a-zA-Z0-9]+	{
+	fputws((wstring(L"<")+closesym+convertir(yytext,yyleng)+wstring(L">")).c_str(),yyout);
+}
+
+<readbrackets>[ \n\r\t]*\}[ \n\r\t]*	{
+	BEGIN(0);
+	wstring ws = convertir(yytext,yyleng);
+	int i = ws.find(L'}'); //remove it
+	if(i>=0)
+		ws = ws.substr(0,i)+ws.substr(i+1);
+	fputws(ws.c_str(),yyout);
+}
+
+
+\\[A-Za-z]+\*	{
+	fputws((wstring(L"<")+convertir(yytext+1,yyleng-2)+wstring(L"_STAR/>")).c_str(),yyout);
+}
+
+\\[A-Za-z]+	{
+	fputws((wstring(L"<")+convertir(yytext+1,yyleng)+wstring(L"/>")).c_str(),yyout);
+}
+
+\\\{	{
+        fputws(L"<LEFTESCAPEDBRACE/>", yyout);
+        }
+
+\\\{	{
+        fputws(L"<RIGHTESCAPEDBRACE/>", yyout);
+        }
+
+\\\%	{
+        fputws(L"<ESCAPEDPERCENT/>", yyout);
+        }
+
+\{	{
+	fputws(L"<CONTENTS>",yyout);
+}
+
+\}	{
+	fputws((wstring(L"</CONTENTS>")).c_str(),yyout);
+}
+
+~	{
+	fputws(L"&NBSP;",yyout);
+}
+
+\$\$	{
+	BEGIN(mathenv);
+	fputws(L"<MATH_DOLLARS>",yyout);
+}
+
+<mathenv>\$\$	{
+	fputws(L"</MATH_DOLLARS>",yyout);
+	BEGIN(0);
+}
+
+\$	{
+	BEGIN(mathenv);
+	fputws(L"<MATH_DOLLAR>",yyout);
+}
+
+<mathenv>\$	{
+	fputws(L"</MATH_DOLLAR>",yyout);
+	BEGIN(0);
+}
+
+\\verb[|][^|]+[|]	{
+        fputws(L"<VERB>",yyout);
+        wstring ws = convertir(yytext, yyleng);
+        fputws(ws.substr(5, ws.size()-5).c_str(), yyout);
+        fputws(L"</VERB>", yyout);
+}
+
+\\verb[!][^!]+[!]	{
+        fputws(L"<VERB>",yyout);
+        wstring ws = convertir(yytext, yyleng);
+        fputws(ws.substr(5, ws.size()-5).c_str(), yyout);
+        fputws(L"</VERB>", yyout);
+}
+
+\\verb[?][^?]+[?]	{
+        fputws(L"<VERB>",yyout);
+        wstring ws = convertir(yytext, yyleng);
+        fputws(ws.substr(5, ws.size()-5).c_str(), yyout);
+        fputws(L"</VERB>", yyout);
+}
+
+\\verb[/][^/]+[/]	{
+        fputws(L"<VERB>",yyout);
+        wstring ws = convertir(yytext, yyleng);
+        fputws(ws.substr(5, ws.size()-5).c_str(), yyout);
+        fputws(L"</VERB>", yyout);
+}
+
+\\verb[#][^#]+[#]	{
+        fputws(L"<VERB>",yyout);
+        wstring ws = convertir(yytext, yyleng);
+        fputws(ws.substr(5, ws.size()-5).c_str(), yyout);
+        fputws(L"</VERB>", yyout);
+}
+
+\\verb[+][^+]+[+]	{
+        fputws(L"<VERB>",yyout);
+        wstring ws = convertir(yytext, yyleng);
+        fputws(ws.substr(5, ws.size()-5).c_str(), yyout);
+        fputws(L"</VERB>", yyout);
+}
+
+\\\(	{
+	fputws(L"<MATH_PAR>",yyout);
+}
+
+\\\)	{
+	fputws(L"</MATH_PAR>",yyout);
+}
+
+\\\[	{
+	fputws(L"<MATH_BRA>",yyout);
+}
+
+\\\]	{
+	fputws(L"</MATH_BRA>",yyout);
+}
+
+\?`	{
+	fputws(L"¿",yyout);
+}
+
+!`	{
+	fputws(L"¡",yyout);
+}
+
+\"	{
+	fputws(L"&quot;",yyout);
+}
+\'	{
+	fputws(L"&apos;",yyout);
+}
+\<	{
+	fputws(L"&lt;",yyout);
+}
+\>	{
+	fputws(L"&gt;",yyout);
+}
+\\\&	{
+	fputws(L"&amp;",yyout);
+}
+\&	{
+	fputws(L"<AMP/>",yyout);
+}
+
+
+
+
+
+(.|\n|\r)	{
+	fputws(convertir(yytext,yyleng).c_str(),yyout);
+}
+
+<mathenv>(.|\n)	{
+	fputws(convertir(yytext,yyleng).c_str(),yyout);
+}
+
+
+<<EOF>>	{
+	return 0;
+}
+%%
+
+
+
+void usage(string const &progname)
+{
+
+  wcerr << "USAGE: " << progname << " [input_file [output_file]" << ']' << endl;
+
+  wcerr << "LaTeX format preprocessor " << endl;
+  exit(EXIT_SUCCESS);
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  size_t base = 0;
+
+  if(argc >= 2 && !strcmp(argv[1],"-i"))
+  {
+    base++;
+  }
+
+ if((argc-base) > 4)
+  {
+    usage(argv[0]);
+  }
+
+  switch(argc-base)
+  {
+    case 3:
+      yyout = fopen(argv[2+base], "w");
+      if(!yyout)
+      {
+        usage(argv[0]);
+      }
+    case 2:
+      yyin = fopen(argv[1+base], "r");
+      if(!yyin)
+      {
+        usage(argv[0]);
+      }
+      break;
+    default:
+      break;
+  }
+
+#ifdef _WIN32
+  _setmode(_fileno(yyin), _O_U8TEXT);
+  _setmode(_fileno(yyout), _O_U8TEXT);
+#endif
+  // prevent warning message
+  yy_push_state(1);
+  yy_top_state();
+  yy_pop_state();
+
+  yylex();
+
+  fclose(yyin);
+  fclose(yyout);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_filter_ambiguity.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_filter_ambiguity.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_filter_ambiguity.cc	(revision 70339)
@@ -0,0 +1,98 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/tsx_reader.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/lt_locale.h>
+#include <apertium/hmm.h>
+#include <apertium/tagger_data_hmm.h>
+#include <apertium/tagger_word.h>
+#include <apertium/string_utils.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <cstdio>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <libgen.h>
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace Apertium;
+using namespace std;
+
+FILE * open_file(char const *filename, char const *mode)
+{
+  FILE *retval;
+
+  struct stat var;  
+  if(stat(filename, &var))
+  {
+    wcerr << "Can't stat '" << filename << "'" << endl;
+    exit(EXIT_FAILURE);
+  }
+ 
+  retval = fopen(filename, mode);
+  
+  if(!retval)
+  {
+    wcerr << "Can't open '" << filename << "'" << endl;
+    exit(EXIT_FAILURE);
+  }
+#ifdef _MSC_VER
+  _setmode(_fileno(retval), _O_U8TEXT);
+#endif   
+
+  return retval;
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  
+  if(argc < 2 || argc > 4)
+  {
+    wcerr << "USAGE: " << basename(argv[0]) << " tsx_file [input [output]" << endl; 
+    exit(EXIT_FAILURE);
+  }
+
+  FILE *input = stdin, *output = stdout;  
+  switch(argc)
+  {
+    case 4:
+      output = open_file(argv[3], "w");
+      // no break
+    case 3:      
+      input = open_file(argv[2], "r");
+      // no break
+    case 2:
+    default:
+      break;
+  }   
+  
+  TSXReader reader;
+  reader.read(argv[1]);
+
+  TaggerWord::setArrayTags(reader.getTaggerData().getArrayTags());
+
+  TaggerDataHMM tdhmm(reader.getTaggerData());  
+  HMM hmm(&tdhmm);
+  hmm.filter_ambiguity_classes(input, output);
+  
+  return EXIT_SUCCESS;  
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_interchunk.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_interchunk.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_interchunk.cc	(revision 70339)
@@ -0,0 +1,166 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/interchunk.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <apertium/string_utils.h>
+#include "getopt_long.h"
+
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace Apertium;
+using namespace std;
+
+void message(char *progname)
+{
+  wcerr << "USAGE: " << basename(progname) << " [-tz] t2x preproc [input [output]]" << endl;
+  wcerr << "  t2x        t2x rules file" << endl;
+  wcerr << "  preproc    result of preprocess trules file" << endl;
+  wcerr << "  input      input file, standard input by default" << endl;
+  wcerr << "  output     output file, standard output by default" << endl;
+  wcerr << "OPTIONS" <<endl;
+  wcerr << "  -t         trace mode" << endl;
+  wcerr << "  -z         flush buffer on '\0'" << endl;
+
+  exit(EXIT_FAILURE);
+}
+
+void testfile(string const &filename)
+{
+  struct stat mybuf;
+  if(stat(filename.c_str(), &mybuf) == -1)
+  {
+    wcerr << "Error: can't stat file '";
+    wcerr << filename << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+FILE * open_input(string const &filename)
+{
+  FILE *input = fopen(filename.c_str(), "r");
+  if(!input)
+  {
+    wcerr << "Error: can't open input file '";
+    wcerr << filename.c_str() << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  return input;
+}  
+
+FILE * open_output(string const &filename)
+{
+  FILE *output = fopen(filename.c_str(), "w");
+  if(!output)
+  {
+    wcerr << "Error: can't open output file '";
+    wcerr << filename.c_str() << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  return output;
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  
+  Interchunk i;
+
+  int option_index=0;
+
+  while (true) {
+    static struct option long_options[] =
+    {
+      {"null-flush", no_argument, 0, 'z'},
+      {"trace", no_argument, 0, 't'},
+      {"help", no_argument, 0, 'h'},
+      {0, 0, 0, 0}
+    };
+
+    int c=getopt_long(argc, argv, "zth", long_options, &option_index);
+    if (c == -1)
+      break;
+      
+    switch (c)
+    {
+      case 'z':
+        i.setNullFlush(true);
+        break;
+
+      case 't':
+        i.setTrace(true);
+        break;
+
+      case 'h':
+      default:
+        message(argv[0]);
+        break;
+    }    
+  }
+
+  FILE *input = stdin, *output = stdout;
+  string f1, f2;
+  switch(argc - optind + 1)
+  {
+    case 5:
+      output = open_output(argv[argc-1]);
+      input = open_input(argv[argc-2]);
+      testfile(argv[argc-3]);
+      testfile(argv[argc-4]);
+      f1 = argv[argc-4];
+      f2 = argv[argc-3];
+      break;
+      
+    case 4:
+      input = open_input(argv[argc-1]);
+      testfile(argv[argc-2]);
+      testfile(argv[argc-3]);
+      f1 = argv[argc-3];
+      f2 = argv[argc-2];
+      break;
+
+    case 3:
+      testfile(argv[argc-1]);
+      testfile(argv[argc-2]);
+      f1 = argv[argc-2];
+      f2 = argv[argc-1];
+      break;
+    
+    default:
+      message(argv[0]);
+      break;
+  }  
+
+#ifdef _MSC_VER
+  _setmode(_fileno(input), _O_U8TEXT);
+  _setmode(_fileno(output), _O_U8TEXT);
+#endif
+
+  i.read(f1, f2);
+  i.interchunk(input, output);
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_lextor.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_lextor.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_lextor.cc	(revision 70339)
@@ -0,0 +1,646 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * 
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <iostream>
+#include <fstream>
+#include "getopt_long.h"
+
+#include <lttoolbox/fst_processor.h>
+
+#include <apertium/lextor.h>
+#include <apertium/lextor_word.h>
+#include <apertium/lextor_data.h>
+#include <apertium/utf_converter.h>
+#include <clocale>
+#include <cstdlib>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+#define MODE_TRAINWRD 0
+#define MODE_TRAINLCH 1
+#define MODE_LEXTOR 2
+#define MODE_LEXTORTL 3
+
+using namespace std;
+
+
+void help(char *name) {
+  wcerr<<"USAGE:\n";
+  wcerr<<name<<" --trainwrd stopwords words n left right corpus model [--weightexp w]\nOR\n";
+  wcerr<<name<<" --trainlch stopwords lexchoices n left right corpus wordmodel dic bildic model [--weightexp w]\nOR\n";
+  wcerr<<name<<" --lextor model dic left right [--debug] [--weightexp w]\n\n";
+  //wcerr<<name<<" --lextortl stopwords words tlmodel dic bildic left right [--debug] [--weightexp w]\n\n"; 
+  wcerr<<"ARGUMENTS: \n"
+      <<"   --trainwrd|-t: Train word co-occurrences model.\n"
+      <<"   Required parameters:\n"
+      <<"      stopwords: file containing a list of stop words. Stop words are ignored\n"
+      <<"      words: file containing a list of words. For each word a co-occurrence model is built\n"
+      <<"      n: number of words per co-occurrence model (for each model, the n most frequent words)\n"
+      <<"      left: left-side context to take into account (number of words)\n"
+      <<"      right: right-side context to take into account (number of words)\n"
+      <<"      corpus: file containing the training corpus\n"
+      <<"      model: output file on which the co-occurrence models are saved\n\n"
+
+      <<"   --trainlch|-r: Train lexical choices co-occurrences model using a target-language co-occurrence model.\n"
+      <<"   Required parameters:\n"
+      <<"      stopwords: file containing a list of stop words. Stop words are ignored\n"
+      <<"      lexchoices: file containing a list of lexical choices. For each lexical choice a co-occurrence model is built\n"
+      <<"      n: number of words per co-occurrence model (for each model, the n most frequent words)\n"
+      <<"      left: left-side context to take into account (number of words)\n"
+      <<"      right: right-side context to take into account (number of words)\n"
+      <<"      corpus: file containing the training corpus\n"
+      <<"      wordmodel: target-language word co-occurrence model (previously trained by means of the --trainwrd option)\n"
+      <<"      dic: lexical-selection dictionary (binary format)\n"
+      <<"      bildic: bilingual dictionary (binary format)\n"
+      <<"      model: output file on which the co-occurrence models are saved\n\n"
+
+      <<"   --lextor|-l: Perform the lexical selection on the input stream.\n"
+      <<"   Required parameters:\n"
+      <<"      model: file containing the model to be used for the lexical selection\n"
+      <<"      dic: lexical-selection dictionary (binary format)\n"
+      <<"      left: left-side context to take into account (number of words)\n"
+      <<"      right: right-side context to take into account (number of words)\n\n"
+
+    //      <<"   --lextortl|-e: Perform the lexical selection on the input stream by using a tl model.\n"
+    //      <<"   Required parameters:\n"
+    //      <<"      stopwords: file containing a list of stop words in the source language. Stop words are ignored\n"
+    //      <<"      words: file containing the list of polysemous words in the source language\n"
+    //      <<"      tlmodel: file containing the target-language model to be used for the lexical selection\n"
+    //      <<"      dic: lexical-selection dictionary (binary format)\n"
+    //      <<"      bildic: bilingual dictionary (binary format)\n"
+    //      <<"      left: left-side context to take into account (number of words)\n"
+    //      <<"      right: right-side context to take into account (number of words)\n\n"
+
+      <<"   --weightexp|-w: Specify a weight value to change the influence of surrounding words while training or\n"
+      <<"     performing the lexica selection. It must be positive.\n\n"
+
+      <<"   --debug|-d: Show debug information while operating\n"
+      <<"   --help|-h: Show this help\n"
+      <<"   --version|-v: Show version information\n\n";
+  wcerr<<"Reads from standard input and writes to standard output\n";
+}
+
+int main(int argc, char* argv[]) {
+  int c;
+  int option_index=0;
+  int mode=-1;
+
+  //Parameters for the "trainwrd" or the "trainlch" mode option
+  string stopwords_file="";
+  string words_file="";
+  string corpus_file="";
+  int nwords_model=0;
+  int nwords_left=-1;
+  int nwords_right=-1;
+
+  string model_file="";
+
+  string lexchoices_file="";
+  string wordmodel_file="";
+  string bildic_file="";
+
+  //Parameters for the "lextor" option
+  string dic_file="";
+
+  double weight_exponent=0.0;
+
+  LexTor::debug=false;
+
+  //wcerr<<"LOCALE: "<<setlocale(LC_ALL,"")<<"\n";
+
+  while (true) {
+    static struct option long_options[] =
+      {
+	{"trainwrd",  required_argument, 0, 't'},
+	{"trainlch",  required_argument, 0, 'r'},
+	{"lextor",    required_argument, 0, 'l'},
+	//	{"lextortl",  required_argument, 0, 'e'},
+        {"weightexp", required_argument, 0, 'w'},
+	{"debug",        no_argument,    0, 'd'},
+	{"help",         no_argument,    0, 'h'},
+	{"version",      no_argument,    0, 'v'},
+	{0, 0, 0, 0}
+      };
+
+    c=getopt_long(argc, argv, "t:r:l:e:w:dhv",long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c) {
+    case 't':
+      mode=MODE_TRAINWRD;
+      stopwords_file=optarg;
+      words_file=argv[optind++];
+      nwords_model=atoi(argv[optind++]);
+      nwords_left=atoi(argv[optind++]);
+      nwords_right=atoi(argv[optind++]);
+      corpus_file=argv[optind++];
+      model_file=argv[optind++];
+      break;
+    case 'r':
+      //--trainlch stopwords lexchoices n left right corpus wordmodel dic bildic model
+      mode=MODE_TRAINLCH;
+      stopwords_file=optarg;
+      lexchoices_file=argv[optind++];
+      nwords_model=atoi(argv[optind++]);
+      nwords_left=atoi(argv[optind++]);
+      nwords_right=atoi(argv[optind++]);
+      corpus_file=argv[optind++];
+      wordmodel_file=argv[optind++];
+      dic_file=argv[optind++];
+      bildic_file=argv[optind++];
+      model_file=argv[optind++];
+      break;
+    case 'l':
+      mode=MODE_LEXTOR;
+      model_file=optarg;
+      dic_file=argv[optind++];
+      nwords_left=atoi(argv[optind++]);
+      nwords_right=atoi(argv[optind++]);
+      break;
+    case 'e':
+      mode=MODE_LEXTORTL;
+      stopwords_file=optarg;
+      words_file=argv[optind++];
+      model_file=argv[optind++];
+      dic_file=argv[optind++];
+      bildic_file=argv[optind++];
+      nwords_left=atoi(argv[optind++]);
+      nwords_right=atoi(argv[optind++]);
+      break;
+    case 'w':
+      weight_exponent=atof(optarg);
+      break;
+    case 'd':
+      LexTor::debug=true;
+      break;
+    case 'h': 
+      help(argv[0]);
+      exit(EXIT_SUCCESS);
+      break;
+    case 'v':
+      wcerr<<L"APERTIUM"<<L"\n"; //"APERTIUM" era PACKAGE_STRING
+      wcerr<<L"LICENSE:\n\n"
+	  <<L"   Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante\n\n"
+	  <<L"   This program is free software; you can redistribute it and/or\n"
+	  <<L"   modify it under the terms of the GNU General Public License as\n"
+	  <<L"   published by the Free Software Foundation; either version 2 of the\n"
+	  <<L"   License, or (at your option) any later version.\n"
+	  <<L"   This program is distributed in the hope that it will be useful, but\n"
+	  <<L"   WITHOUT ANY WARRANTY; without even the implied warranty of\n"
+	  <<L"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n"
+	  <<L"   General Public License for more details.\n"
+	  <<L"\n"
+	  <<L"   You should have received a copy of the GNU General Public License\n"
+	  <<L"   along with this program; if not, see <http://www.gnu.org/licenses/>.\n";
+      exit(EXIT_SUCCESS);
+      break;    
+    default:
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+      break;
+    }
+  }
+
+  if (weight_exponent<0) {
+    wcerr<<L"Error: the weight exponent provided is less than zero. It must be positive\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  //When reading from the input stream '*all* characters must be
+  //processed, including ' ','\n', .....
+  wcin.unsetf(ios::skipws);
+
+  if (mode==MODE_TRAINWRD) {
+    if(stopwords_file=="") {
+      wcerr<<L"Error: no stopwords file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (words_file=="") {
+      wcerr<<L"Error: no words file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_model==0) {
+      wcerr<<L"Error: the number of word per co-occurrence model must be greater than 0\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_left<0) {
+      wcerr<<L"Error: no left-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_right<0) {
+      wcerr<<L"Error: no right-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (corpus_file=="") {
+      wcerr<<L"Error: No training corpus file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (model_file=="") {
+      wcerr<<L"Error: No output file to save the co-occurrence models was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    wifstream fstopwords, fwords, fcorpus;
+
+    fstopwords.open(stopwords_file.c_str(), ios::in);
+    if (fstopwords.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(stopwords_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fwords.open(words_file.c_str(), ios::in);
+    if (fwords.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(words_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fcorpus.open(corpus_file.c_str(), ios::in);
+    if(fcorpus.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(corpus_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    FILE *fmodel = fopen(model_file.c_str(), "wb");
+    if(!fmodel)
+    {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(model_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+    
+    LexTorData lextor_data;
+
+    lextor_data.read_stopwords(fstopwords);
+    lextor_data.read_words(fwords);
+    lextor_data.set_nwords_per_set(nwords_model);
+
+    fstopwords.close();
+    fwords.close();
+
+    LexTor lexical_selector;
+    lexical_selector.set_lextor_data(&lextor_data);
+
+    //Whe reading from the input corpus '*all* characters must be
+    //processed, including ' ','\n', .....
+    fcorpus.unsetf(ios::skipws);
+
+    //Train
+    lexical_selector.trainwrd(fcorpus, nwords_left, nwords_right, weight_exponent);
+    fcorpus.close();
+
+    //Write parameters
+    lextor_data.write(fmodel);
+    fclose(fmodel);
+  } 
+
+  else if (mode==MODE_TRAINLCH) {
+    if(stopwords_file=="") {
+      wcerr<<L"Error: no stopwords file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (lexchoices_file=="") {
+      wcerr<<L"Error: no lexical choices file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_model==0) {
+      wcerr<<L"Error: the number of word per co-occurrence model must be greater than 0\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_left<0) {
+      wcerr<<L"Error: no left-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_right<0) {
+      wcerr<<L"Error: no rigth-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (corpus_file=="") {
+      wcerr<<L"Error: No training corpus file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if(wordmodel_file=="") {
+      wcerr<<L"Error: No target-language word co-occurrence model was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (dic_file=="") {
+      wcerr<<L"Error: No lexical-selection dictionary was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (bildic_file=="") {
+      wcerr<<"Error: No bilingual dictionary was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (model_file=="") {
+      wcerr<<L"Error: No output file to save the co-occurrence models was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    wifstream fstopwords, flexchoices, fcorpus;
+    FILE *fdic=NULL, *fbildic=NULL, *fwordmodel=NULL;
+
+    fstopwords.open(stopwords_file.c_str(), ios::in);
+    if (fstopwords.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(stopwords_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    flexchoices.open(lexchoices_file.c_str(), ios::in);
+    if (flexchoices.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(lexchoices_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fcorpus.open(corpus_file.c_str(), ios::in);
+    if(fcorpus.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(corpus_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fwordmodel = fopen(wordmodel_file.c_str(), "rb");
+    if(!fwordmodel) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(wordmodel_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fdic=fopen(dic_file.c_str(), "rb");
+    if(!fdic) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(dic_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fbildic=fopen(bildic_file.c_str(), "rb");
+    if(!fbildic) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(bildic_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    FILE *fmodel = fopen(model_file.c_str(), "wb");
+    if(!fmodel) {
+      wcerr<<L"Error: Cannot open file '"
+          <<UtfConverter::fromUtf8(model_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    LexTorData lextor_data;
+
+    lextor_data.read_stopwords(fstopwords);
+    lextor_data.read_words(flexchoices);
+    lextor_data.set_nwords_per_set(nwords_model);
+
+    fstopwords.close();
+    flexchoices.close();
+
+    LexTor lexical_selector;
+    lexical_selector.set_lextor_data(&lextor_data);
+
+    LexTorData wordmodel;
+    wordmodel.read(fwordmodel);
+    fclose(fwordmodel);
+
+    FSTProcessor fstpdic;
+    fstpdic.load(fdic);
+    fstpdic.initBiltrans();
+    fclose(fdic);
+
+    lextor_data.read_lexical_choices(fstpdic);
+
+    FSTProcessor fstpbildic;
+    fstpbildic.load(fbildic);
+    fstpbildic.initBiltrans();
+    fclose(fbildic);
+
+
+    //Whe reading from the input corpus '*all* characters must be
+    //processed, including ' ','\n', .....
+    fcorpus.unsetf(ios::skipws);
+
+    //Train
+    lexical_selector.trainlch(fcorpus, nwords_left, nwords_right, wordmodel, fstpdic, fstpbildic, weight_exponent);
+
+    fcorpus.close();
+
+    //Write parameters
+    lextor_data.write(fmodel);
+    fclose(fmodel);
+  }
+
+  else if (mode==MODE_LEXTOR) {
+    if(model_file=="") {
+      wcerr<<L"Error: no model file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (dic_file=="") {
+      wcerr<<L"Error: no dic file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_left<0) {
+      wcerr<<L"Error: no left-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_right<0) {
+      wcerr<<L"Error: no rigth-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    FILE *fdic=NULL;
+    fdic=fopen(dic_file.c_str(), "rb");
+    if (!fdic) {
+      wcerr<<L"Error: Cannot open dictionary file '"
+           <<UtfConverter::fromUtf8(dic_file)<<L"' for lexical selection\n";
+      exit(EXIT_FAILURE);
+    }
+    FSTProcessor fstp;
+    fstp.load(fdic);
+    fstp.initBiltrans();
+    fclose(fdic);
+
+    FILE *fmodel = fopen(model_file.c_str(), "rb");
+    if(!fmodel) {
+      wcerr<<L"Error: Cannot open file '"
+	   <<UtfConverter::fromUtf8(model_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    //Whe reading from the input stream '*all* characters must be
+    //processed, including ' ','\n', .....
+    wcin.unsetf(ios::skipws);
+
+    LexTorData lextor_model;
+    lextor_model.read(fmodel);
+    fclose(fmodel);
+
+    LexTor lexical_selector;
+    lexical_selector.set_lextor_data(&lextor_model);
+
+    lexical_selector.lexical_selector(wcin, fstp, nwords_left, nwords_right, weight_exponent);
+  } 
+
+  else if (mode==MODE_LEXTORTL) {
+    if(stopwords_file=="") {
+      wcerr<<L"Error: no stopwords file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if(words_file=="") {
+      wcerr<<L"Error: no words file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if(model_file=="") {
+      wcerr<<L"Error: no target-language model file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (dic_file=="") {
+      wcerr<<L"Error: No lexical-selection dictionary was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (bildic_file=="") {
+      wcerr<<L"Error: No bilingual dictionary was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_left<0) {
+      wcerr<<L"Error: no left-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_right<0) {
+      wcerr<<L"Error: no rigth-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    wifstream fstopwords, fwords;
+    FILE *fdic=NULL, *fbildic=NULL, *fmodel = NULL;
+
+    fstopwords.open(stopwords_file.c_str(), ios::in);
+    if (fstopwords.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(stopwords_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fwords.open(words_file.c_str(), ios::in);
+    if (fwords.fail()) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(words_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fmodel = fopen(model_file.c_str(), "rb");
+    if(!fmodel) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(model_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fdic=fopen(dic_file.c_str(), "rb");
+    if(!fdic) {
+      wcerr<<L"Error: Cannot open file '"
+           <<UtfConverter::fromUtf8(dic_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fbildic=fopen(bildic_file.c_str(), "rb");
+    if(!fbildic) {
+      wcerr<<L"Error: Cannot open file '"
+	   <<UtfConverter::fromUtf8(bildic_file)<<L"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    LexTorData lextor_data;
+
+    lextor_data.read_stopwords(fstopwords);
+    fstopwords.close();
+
+    lextor_data.read_words(fwords);
+    fwords.close();
+
+    LexTor lexical_selector;
+    lexical_selector.set_lextor_data(&lextor_data);
+
+    LexTorData tlmodel;
+    tlmodel.read(fmodel);
+    fclose(fmodel);
+
+    FSTProcessor fstpdic;
+    fstpdic.load(fdic);
+    fstpdic.initBiltrans();
+    fclose(fdic);
+
+    FSTProcessor fstpbildic;
+    fstpbildic.load(fbildic);
+    fstpbildic.initBiltrans();
+    fclose(fbildic);
+
+
+    lextor_data.read_lexical_choices(fstpdic);
+
+    //Whe reading from the input stream '*all* characters must be
+    //processed, including ' ','\n', .....
+    wcin.unsetf(ios::skipws);
+
+
+    lexical_selector.set_tlmodel(&tlmodel);
+    lexical_selector.set_bildic(&fstpbildic);
+
+    lexical_selector.lexical_selector(wcin, fstpdic, nwords_left, nwords_right, weight_exponent);
+  } 
+
+  else {
+    wcerr<<L"Error: No operation mode was provided\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_lextor_eval.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_lextor_eval.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_lextor_eval.cc	(revision 70339)
@@ -0,0 +1,379 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * 
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <iostream>
+#include <fstream>
+#include "getopt_long.h"
+
+#include <lttoolbox/fst_processor.h>
+
+#include <apertium/lextor.h>
+#include <apertium/lextor_word.h>
+#include <apertium/lextor_data.h>
+#include <apertium/lextor_eval.h>
+#include <clocale>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+#define MODE_LEXTOR 1
+#define MODE_LEXTORTL 2
+
+using namespace std;
+
+
+void help(char *name) {
+  wcerr<<"USAGE:\n";
+  wcerr<<name<<" --angle ang --reference reftext --parameters|-p model dic left right [--debug]\n\n";
+  wcerr<<"ARGUMENTS: \n"
+      <<"  --angle|-a: To specify the angle threshold to use............\n"
+      <<"   --reference|-r: To specify the reference corpus used for evaluation (one word per\n"
+      <<"               line with the correct translation sense for those words with more than one)\n"
+      <<"   --parameters|-p: to specify the parameters used for the lexical selection task:\n"
+      <<"   Required parameters:\n"
+      <<"      model: file containing the model to be used for the lexical selection\n"
+      <<"      dic: lexical-selection dictionary (binary format)\n"
+      <<"      left: left-side context to take into account (number of words)\n"
+      <<"      right: right-side context to take into account (number of words)\n"
+      <<"   --weightexp|-w: Specify a weight value to change the influence of surrounding words while\n"
+      <<"     performing the lexical selection. It must be positive.\n"
+      <<"   --help|-h: Show this help\n"
+      <<"   --version|-v: Show version information\n\n";
+
+  wcerr<<"NOTE: It reads from the standard input the corpus to work with. That corpus must be\n"
+      <<"      in the intermediate format used by Apertium.\n";
+}
+
+int main(int argc, char* argv[]) {
+  int c;
+  int option_index=0;
+
+  int mode=MODE_LEXTOR;
+
+  string model_file="";
+  string dic_file="";
+  int nwords_left=-1;
+  int nwords_right=-1;
+
+  //string in_file;
+  string ref_file;
+
+  double weight_exponent=0.0;
+
+  LexTor::angleth=0.0;
+
+
+  //For mode LEXTORTL
+  string stopwords_file;
+  string words_file;
+  string bildic_file;
+
+  //wcerr<<"LOCALE: "<<setlocale(LC_ALL,"")<<"\n";
+  wcerr<<"Command line: ";
+  for(int i=0; i<argc; i++)
+    wcerr<<argv[i]<<" ";
+  wcerr<<"\n";
+
+  while (true) {
+    static struct option long_options[] =
+      {
+	//{"input",       required_argument, 0, 'i'},
+	{"reference",   required_argument, 0, 'r'},
+	{"parameters",  required_argument, 0, 'p'},
+        {"weightexp",   required_argument, 0, 'w'},
+	{"angle",       required_argument, 0, 'a'},
+	{"lextortl",    required_argument, 0, 'e'},
+	{"debug",       no_argument,    0, 'd'},
+	{"help",        no_argument,    0, 'h'},
+	{"version",     no_argument,    0, 'v'},
+	{0, 0, 0, 0}
+      };
+
+    c=getopt_long(argc, argv, "r:p:w:a:e:dhv",long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c) {
+      //case 'i':
+      //in_file=optarg;
+      //break;
+    case 'r':
+      ref_file=optarg;
+      break;
+    case 'p':
+      mode=MODE_LEXTOR;
+      model_file=optarg;
+      dic_file=argv[optind++];
+      nwords_left=atoi(argv[optind++]);
+      nwords_right=atoi(argv[optind++]);
+      break;
+    case 'e':
+      mode=MODE_LEXTORTL;
+      stopwords_file=optarg;
+      words_file=argv[optind++];
+      model_file=argv[optind++];
+      dic_file=argv[optind++];
+      bildic_file=argv[optind++];
+      nwords_left=atoi(argv[optind++]);
+      nwords_right=atoi(argv[optind++]);
+      break;
+    case 'w':
+      weight_exponent=atof(optarg);
+      break;
+    case 'a':
+      LexTor::angleth=atof(optarg);
+      break;
+    case 'd':
+      LexTor::debug=true;
+      break;
+    case 'h': 
+      help(argv[0]);
+      exit(EXIT_SUCCESS);
+      break;
+    case 'v':
+      wcerr<<"APERTIUM"<<"\n"; //"APERTIUM" era PACKAGE_STRING
+      wcerr<<"LICENSE:\n\n"
+	  <<"   Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante\n\n"
+	  <<"   This program is free software; you can redistribute it and/or\n"
+	  <<"   modify it under the terms of the GNU General Public License as\n"
+	  <<"   published by the Free Software Foundation; either version 2 of the\n"
+	  <<"   License, or (at your option) any later version.\n"
+	  <<"   This program is distributed in the hope that it will be useful, but\n"
+	  <<"   WITHOUT ANY WARRANTY; without even the implied warranty of\n"
+	  <<"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n"
+	  <<"   General Public License for more details.\n"
+	  <<"\n"
+	  <<"   You should have received a copy of the GNU General Public License\n"
+	  <<"   along with this program; if not, see <http://www.gnu.org/licenses/>.\n";
+      exit(EXIT_SUCCESS);
+      break;    
+    default:
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+      break;
+    }
+  }
+
+  wcerr<<"TH ANGLE: "<<LexTor::angleth<<"\n";
+
+  if (ref_file=="") {
+    wcerr<<"Error: No reference corpus was given\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+  ifstream fref;
+
+  fref.open(ref_file.c_str(), ios::in);
+  if (fref.fail()) {
+    wcerr<<"Error: Cannot open file '"<<ref_file<<"'\n";
+    exit(EXIT_FAILURE);
+  }
+
+  if (mode==MODE_LEXTOR) {
+    if (nwords_left<0) {
+      wcerr<<"Error: no left-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_right<0) {
+      wcerr<<"Error: no right-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    //if (in_file=="") {
+    //  wcerr<<"Error: No input corpus was given\n";
+    //  help(argv[0]);
+    //  exit(EXIT_FAILURE);
+    //}
+ 
+    if (model_file=="") {
+      wcerr<<"Error: No model file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (dic_file=="") {
+      wcerr<<"Error: No dictionary file (bin format) was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    if (weight_exponent<0) {
+      wcerr<<"Error: the weight exponent provided is less than zero. It must be positive\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    ifstream fin, fmodel;
+
+    //fin.open(in_file.c_str(), ios::in);
+    //if (fin.fail()) {
+    //  wcerr<<"Error: Cannot open file '"<<in_file<<"'\n";
+    //  exit(EXIT_FAILURE);
+    //}
+
+    fmodel.open(model_file.c_str(), ios::in);
+    if(fmodel.fail()) {
+      wcerr<<"Error: Cannot open file '"<<model_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    FILE *fdic=NULL;
+    fdic=fopen(dic_file.c_str(), "rb");
+    if (!fdic) {
+      wcerr<<"Error: Cannot open file '"<<dic_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+    FSTProcessor fstp;
+    fstp.load(fdic);
+    fstp.initBiltrans();
+    fclose(fdic);
+
+
+    //When reading from the input stream '*all* characters must be
+    //processed, including ' ','\n', .....
+    cin.unsetf(ios::skipws);
+
+
+    LexTorData lextor_model;
+    lextor_model.read(fmodel);
+    fmodel.close();
+
+    LexTor lexical_selector;
+    lexical_selector.set_lextor_data(&lextor_model);
+
+    LexTorEval lteval(&fref);
+    lexical_selector.lexical_selector(cin, fstp, nwords_left, nwords_right, weight_exponent, &lteval);
+    lteval.print_evaluation();
+
+    fref.close();
+  }
+
+  else if (mode==MODE_LEXTORTL) {
+    if(stopwords_file=="") {
+      wcerr<<"Error: no stopwords file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if(words_file=="") {
+      wcerr<<"Error: no words file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if(model_file=="") {
+      wcerr<<"Error: no target-language model file was given\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (dic_file=="") {
+      wcerr<<"Error: No lexical-selection dictionary was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (bildic_file=="") {
+      wcerr<<"Error: No bilingual dictionary was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_left<0) {
+      wcerr<<"Error: no left-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+    if (nwords_right<0) {
+      wcerr<<"Error: no right-side context number of words was provided\n";
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+    }
+
+    ifstream fstopwords, fwords, fmodel;
+    FILE *fdic=NULL, *fbildic=NULL;
+
+    fstopwords.open(stopwords_file.c_str(), ios::in);
+    if (fstopwords.fail()) {
+      wcerr<<"Error: Cannot open file '"<<stopwords_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fwords.open(words_file.c_str(), ios::in);
+    if (fwords.fail()) {
+      wcerr<<"Error: Cannot open file '"<<words_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fmodel.open(model_file.c_str(), ios::in);
+    if(fmodel.fail()) {
+      wcerr<<"Error: Cannot open file '"<<model_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fdic=fopen(dic_file.c_str(), "rb");
+    if(!fdic) {
+      wcerr<<"Error: Cannot open file '"<<dic_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    fbildic=fopen(bildic_file.c_str(), "rb");
+    if(!fbildic) {
+      wcerr<<"Error: Cannot open file '"<<bildic_file<<"'\n";
+      exit(EXIT_FAILURE);
+    }
+
+    LexTorData lextor_data;
+
+    lextor_data.read_stopwords(fstopwords);
+    fstopwords.close();
+
+    lextor_data.read_words(fwords);
+    fwords.close();
+
+    LexTor lexical_selector;
+    lexical_selector.set_lextor_data(&lextor_data);
+
+    LexTorData tlmodel;
+    tlmodel.read(fmodel);
+    fmodel.close();
+
+    FSTProcessor fstpdic;
+    fstpdic.load(fdic);
+    fstpdic.initBiltrans();
+    fclose(fdic);
+
+    FSTProcessor fstpbildic;
+    fstpbildic.load(fbildic);
+    fstpbildic.initBiltrans();
+    fclose(fbildic);
+
+
+    lextor_data.read_lexical_choices(fstpdic);
+
+    //Whe reading from the input stream '*all* characters must be
+    //processed, including ' ','\n', .....
+    cin.unsetf(ios::skipws);
+
+
+    lexical_selector.set_tlmodel(&tlmodel);
+    lexical_selector.set_bildic(&fstpbildic);
+
+
+    LexTorEval lteval(&fref);
+    lexical_selector.lexical_selector(cin, fstpdic, nwords_left, nwords_right, weight_exponent, &lteval);
+    lteval.print_evaluation();
+
+    fref.close();
+  } 
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_postchunk.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_postchunk.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_postchunk.cc	(revision 70339)
@@ -0,0 +1,160 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/postchunk.h>
+#include <lttoolbox/lt_locale.h>
+
+#include <cstdlib>
+#include "getopt_long.h"
+#include <iostream>
+#include <libgen.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <apertium/string_utils.h>
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace Apertium;
+using namespace std;
+
+void message(char *progname)
+{
+  wcerr << "USAGE: " << basename(progname) << " [-z] t3x preproc [input [output]]" << endl;
+  wcerr << "  t3x        t3x rules file" << endl;
+  wcerr << "  preproc    result of preprocess trules file" << endl;
+  wcerr << "  input      input file, standard input by default" << endl;
+  wcerr << "  output     output file, standard output by default" << endl;
+  wcerr << "OPTIONS" <<endl;
+  wcerr << "  -z         flush buffer on '\0'" << endl;
+  
+  exit(EXIT_FAILURE);
+}
+
+void testfile(string const &filename)
+{
+  struct stat mybuf;
+  if(stat(filename.c_str(), &mybuf) == -1)
+  {
+    wcerr << "Error: can't stat file '";
+    wcerr << filename << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+FILE * open_input(string const &filename)
+{
+  FILE *input = fopen(filename.c_str(), "r");
+  if(!input)
+  {
+    wcerr << "Error: can't open input file '";
+    wcerr << filename.c_str() << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  return input;
+}  
+
+FILE * open_output(string const &filename)
+{
+  FILE *output = fopen(filename.c_str(), "w");
+  if(!output)
+  {
+    wcerr << "Error: can't open output file '";
+    wcerr << filename.c_str() << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  return output;
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+
+  Postchunk p;
+  
+  int option_index=0;
+
+  while (true) {
+    static struct option long_options[] =
+    {
+      {"null-flush", no_argument, 0, 'z'},
+      {"help", no_argument, 0, 'h'},
+      {0, 0, 0, 0}
+    };
+
+    int c=getopt_long(argc, argv, "zh", long_options, &option_index);
+    if (c == -1)
+      break;
+      
+    switch (c)
+    {
+      case 'z':
+        p.setNullFlush(true);
+        break;
+
+      case 'h':
+      default:
+        message(argv[0]);
+        break;
+    }    
+  }
+
+  FILE *input = stdin, *output = stdout;
+  string f1, f2;
+  switch(argc - optind + 1)
+  {
+    case 5:
+      output = open_output(argv[argc-1]);
+      input = open_input(argv[argc-2]);
+      testfile(argv[argc-3]);
+      testfile(argv[argc-4]);
+      f1 = argv[argc-4];
+      f2 = argv[argc-3];
+      break;
+      
+    case 4:
+      input = open_input(argv[argc-1]);
+      testfile(argv[argc-2]);
+      testfile(argv[argc-3]);
+      f1 = argv[argc-3];
+      f2 = argv[argc-2];
+      break;
+
+    case 3:
+      testfile(argv[argc-1]);
+      testfile(argv[argc-2]);
+      f1 = argv[argc-2];
+      f2 = argv[argc-1];
+      break;
+    
+    default:
+      message(argv[0]);
+      break;
+  }  
+
+#ifdef _MSC_VER
+  _setmode(_fileno(input), _O_U8TEXT);
+  _setmode(_fileno(output), _O_U8TEXT);
+#endif
+
+  p.read(f1, f2);
+  p.postchunk(input, output);
+
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_re.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_re.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_re.cc	(revision 70339)
@@ -0,0 +1,157 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/apertium_re.h>
+#include <lttoolbox/compression.h>
+#include <iostream>
+#include <cstdlib>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+using namespace std;
+
+ApertiumRE::ApertiumRE() :
+re(0)
+{
+  empty = true;
+}
+
+ApertiumRE::~ApertiumRE()
+{
+  if(!empty)
+  {
+    pcre_free(re);
+  }
+  empty = true;
+}
+
+void
+ApertiumRE::read(FILE *input)
+{
+  unsigned int size = Compression::multibyte_read(input);
+  re = static_cast<pcre *>(pcre_malloc(size));
+  if(size != fread(re, 1, size, input))
+  {
+    wcerr << L"Error reading regexp" << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  empty = false;
+}
+
+void
+ApertiumRE::compile(string const &str)
+{
+  const char *error;
+  int erroroffset;
+  re = pcre_compile(str.c_str(), PCRE_DOTALL|PCRE_CASELESS|PCRE_EXTENDED|PCRE_UTF8,
+	            &error, &erroroffset, NULL);
+  if(re == NULL)
+  {
+    wcerr << L"Error: pcre_compile ";
+    wcerr << error << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  empty = false;
+}
+
+void 
+ApertiumRE::write(FILE *output) const
+{
+  if(empty)
+  {
+    wcerr << L"Error, cannot write empty regexp" << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  size_t size;
+  int rc = pcre_fullinfo(re, NULL, PCRE_INFO_SIZE, &size);
+  if(rc < 0)
+  {
+    wcerr << L"Error calling pcre_fullinfo()\n" << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  Compression::multibyte_write(size, output);
+  
+  size_t rc2 = fwrite(re, 1, size, output);
+  if(rc2 != size)
+  {
+    wcerr << L"Error writing precompiled regex\n" << endl;
+    exit(EXIT_FAILURE);
+  }                
+}
+
+string
+ApertiumRE::match(string const &str) const
+{
+  if(empty)
+  {
+    return "";
+  }
+  
+  int result[3];
+  int workspace[4096];
+//  int rc = pcre_exec(re, NULL, str.c_str(), str.size(), 0, PCRE_NO_UTF8_CHECK, result, 3);
+  int rc = pcre_dfa_exec(re, NULL, str.c_str(), str.size(), 0, PCRE_NO_UTF8_CHECK, result, 3, workspace, 4096);
+
+  if(rc < 0)
+  {
+    switch(rc)
+    {
+      case PCRE_ERROR_NOMATCH:
+	return "";
+
+      default:
+	wcerr << L"Error: Unknown error matching regexp (code " << rc << L")" << endl;
+	exit(EXIT_FAILURE);
+    }
+  }
+  
+  return str.substr(result[0], result[1]-result[0]);
+}
+
+void
+ApertiumRE::replace(string &str, string const &value) const
+{
+  if(empty)
+  {
+    return;
+  }
+  
+  int result[3];
+  int workspace[4096];
+  // int rc = pcre_exec(re, NULL, str.c_str(), str.size(), 0, PCRE_NO_UTF8_CHECK, result, 3);
+  int rc = pcre_dfa_exec(re, NULL, str.c_str(), str.size(), 0, PCRE_NO_UTF8_CHECK, result, 3, workspace, 4096);
+  if(rc < 0)
+  {
+    switch(rc)
+    {
+      case PCRE_ERROR_NOMATCH:
+	return;
+      
+      default:
+	wcerr << L"Error: Unknown error matching regexp (code " << rc << L")" << endl;
+	exit(EXIT_FAILURE);
+    }
+  }
+
+  string res = str.substr(0, result[0]);
+  res.append(value);
+  res.append(str.substr(result[1]));
+  str = res;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger.cc	(revision 70339)
@@ -0,0 +1,737 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "apertium_tagger.h"
+
+#include "apertium_config.h"
+
+#include "align.h"
+#include "basic_exception_type.h"
+#include "basic_stream_tagger.h"
+#include "basic_stream_tagger_trainer.h"
+#include "basic_tagger.h"
+#include "err_exception.h"
+#include "exception.h"
+#include "file_tagger.h"
+#include "linebreak.h"
+#include "stream_5_3_1_tagger.h"
+#include "stream_5_3_1_tagger_trainer.h"
+#include "stream_5_3_2_tagger.h"
+#include "stream_5_3_2_tagger_trainer.h"
+#include "stream_5_3_3_tagger.h"
+#include "stream_5_3_3_tagger_trainer.h"
+#include <apertium/hmm.cc>
+#include <apertium/lswpost.h>
+#include <apertium/tagger_word.h>
+
+#include <lttoolbox/lt_locale.h>
+
+#include "getopt_long.h"
+#include <cerrno>
+#include <cstdio>
+#include <cstdlib>
+#include <cstring>
+#include <fstream>
+#include <iomanip>
+#include <ios>
+#include <iostream>
+#include <locale>
+#include <sstream>
+#include <string>
+#include <unistd.h>
+
+#ifdef _MSC_VER
+#include <fcntl.h>
+#include <io.h>
+#endif // _MSC_VER
+
+namespace Apertium {
+apertium_tagger::apertium_tagger(int &argc, char **&argv)
+    : argc(argc), argv(argv), The_val(),
+
+      The_indexptr(), FunctionTypeTypeOption_indexptr(),
+      FunctionTypeOption_indexptr(),
+
+      TheFunctionTypeType(), TheUnigramType(), TheFunctionType(),
+      TheFunctionTypeOptionArgument(0), TheFlags() {
+  try {
+    while (true) {
+      The_val = getopt_long(argc, argv, "dfgmpr:s:t:u:wz", longopts, &The_indexptr);
+
+      if (The_val == -1)
+        break;
+
+      set_indexptr();
+
+      switch (The_val) {
+      case 'd':
+        flagOptionCase(&basic_Tagger::Flags::getDebug,
+                       &basic_Tagger::Flags::setDebug);
+        break;
+      case 'f':
+        flagOptionCase(&basic_Tagger::Flags::getFirst,
+                       &basic_Tagger::Flags::setFirst);
+        break;
+      case 'm':
+        flagOptionCase(&basic_Tagger::Flags::getMark,
+                       &basic_Tagger::Flags::setMark);
+        break;
+      case 'p':
+        flagOptionCase(&basic_Tagger::Flags::getShowSuperficial,
+                       &basic_Tagger::Flags::setShowSuperficial);
+        break;
+      case 'z':
+        flagOptionCase(&basic_Tagger::Flags::getNullFlush,
+                       &basic_Tagger::Flags::setNullFlush);
+        break;
+      case 'u':
+        functionTypeTypeOptionCase(Unigram);
+
+        if (std::strncmp(optarg, "1", sizeof "1" - 1) == 0) {
+          TheUnigramType = Stream_5_3_1;
+          break;
+        }
+
+        if (std::strncmp(optarg, "2", sizeof "2" - 1) == 0) {
+          TheUnigramType = Stream_5_3_2;
+          break;
+        }
+
+        if (std::strncmp(optarg, "3", sizeof "3" - 1) == 0) {
+          TheUnigramType = Stream_5_3_3;
+          break;
+        }
+
+        {
+          std::stringstream what_;
+          what_ << "invalid argument '" << optarg << "' for '--unigram'\n"
+                                                     "Valid arguments are:\n"
+                                                     "  - '1'\n"
+                                                     "  - '2'\n"
+                                                     "  - '3'";
+          throw Exception::apertium_tagger::InvalidArgument(what_);
+        }
+        break;
+      case 'w':
+        functionTypeTypeOptionCase(SlidingWindow);
+        break;
+      case 'g':
+        functionTypeOptionCase(Tagger);
+        break;
+      case 'r':
+        functionTypeOptionCase(Retrain);
+        getIterationsArgument();
+        break;
+      case 's':
+        functionTypeOptionCase(Supervised);
+        getIterationsArgument();
+        break;
+      case 't':
+        functionTypeOptionCase(Train);
+        getIterationsArgument();
+        break;
+      case 'h':
+        help();
+        return;
+      default:
+        throw err_Exception();
+      }
+    }
+
+    if (!TheFunctionType) {
+      help();
+      return;
+    }
+
+    switch (*TheFunctionType) {
+    case Tagger:
+      if (!TheFunctionTypeType) {
+        HMM HiddenMarkovModelTagger_;
+        g_FILE_Tagger(HiddenMarkovModelTagger_);
+        break;
+      }
+
+      switch (*TheFunctionTypeType) {
+      case Unigram: {
+        switch (*TheUnigramType) {
+        case Stream_5_3_1: {
+          Stream_5_3_1_Tagger Stream_5_3_1_Tagger_(TheFlags);
+          g_StreamTagger(Stream_5_3_1_Tagger_);
+        } break;
+        case Stream_5_3_2: {
+          Stream_5_3_2_Tagger Stream_5_3_2_Tagger_(TheFlags);
+          g_StreamTagger(Stream_5_3_2_Tagger_);
+        } break;
+        case Stream_5_3_3: {
+          Stream_5_3_3_Tagger Stream_5_3_3_Tagger_(TheFlags);
+          g_StreamTagger(Stream_5_3_3_Tagger_);
+        } break;
+        default:
+          std::abort();
+        }
+      } break;
+      case SlidingWindow: {
+        LSWPoST SlidingWindowTagger_;
+        g_FILE_Tagger(SlidingWindowTagger_);
+      } break;
+      default:
+        std::abort();
+      }
+
+      break;
+    case Retrain:
+      if (!TheFunctionTypeType) {
+        HMM HiddenMarkovModelTagger_;
+        r_FILE_Tagger(HiddenMarkovModelTagger_);
+        break;
+      }
+
+      switch (*TheFunctionTypeType) {
+      case Unigram: {
+        std::stringstream what_;
+        what_ << "invalid option -- 'u'";
+        throw Exception::apertium_tagger::InvalidOption(what_);
+      }
+      case SlidingWindow: {
+        LSWPoST SlidingWindowTagger_;
+        r_FILE_Tagger(SlidingWindowTagger_);
+      } break;
+      default:
+        std::abort();
+      }
+
+      break;
+    case Supervised:
+      if (!TheFunctionTypeType) {
+        HMM HiddenMarkovModelTagger_;
+        s_FILE_Tagger(HiddenMarkovModelTagger_);
+        break;
+      }
+
+      switch (*TheFunctionTypeType) {
+      case Unigram: {
+        switch (*TheUnigramType) {
+        case Stream_5_3_1: {
+          Stream_5_3_1_TaggerTrainer Stream_5_3_1_TaggerTrainer_(TheFlags);
+          s_StreamTaggerTrainer(Stream_5_3_1_TaggerTrainer_);
+        } break;
+        case Stream_5_3_2: {
+          Stream_5_3_2_TaggerTrainer Stream_5_3_2_TaggerTrainer_(TheFlags);
+          s_StreamTaggerTrainer(Stream_5_3_2_TaggerTrainer_);
+        } break;
+        case Stream_5_3_3: {
+          Stream_5_3_3_TaggerTrainer Stream_5_3_3_TaggerTrainer_(TheFlags);
+          s_StreamTaggerTrainer(Stream_5_3_3_TaggerTrainer_);
+        } break;
+        default:
+          std::abort();
+        }
+      } break;
+      case SlidingWindow: {
+        std::stringstream what_;
+        what_ << "invalid option -- 'w'";
+        throw Exception::apertium_tagger::InvalidOption(what_);
+      }
+      default:
+        std::abort();
+      }
+
+      break;
+    case Train:
+      if (!TheFunctionTypeType) {
+        HMM HiddenMarkovModelTagger_;
+        t_FILE_Tagger(HiddenMarkovModelTagger_);
+        break;
+      }
+
+      switch (*TheFunctionTypeType) {
+      case Unigram: {
+        std::stringstream what_;
+        what_ << "invalid option -- 'u'";
+        throw Exception::apertium_tagger::InvalidOption(what_);
+      }
+      case SlidingWindow: {
+        LSWPoST SlidingWindowTagger_;
+        t_FILE_Tagger(SlidingWindowTagger_);
+      } break;
+      default:
+        std::abort();
+      }
+
+      break;
+    default:
+      std::abort();
+    }
+  } catch (const basic_ExceptionType &basic_ExceptionType_) {
+    std::wcerr << "apertium-tagger: " << basic_ExceptionType_.what() << std::endl;
+    throw err_Exception();
+  }
+}
+
+void apertium_tagger::help() {
+
+  std::wcerr <<
+"Usage: apertium-tagger [OPTION]... -g SERIALISED_TAGGER                        \\\n"
+"                                      [INPUT                                   \\\n"
+"                                      [OUTPUT]]\n"
+"\n"
+"  or:  apertium-tagger [OPTION]... -r ITERATIONS                               \\\n"
+"                                      CORPUS                                   \\\n"
+"                                      SERIALISED_TAGGER\n"
+"\n"
+"  or:  apertium-tagger [OPTION]... -s ITERATIONS                               \\\n"
+"                                      DICTIONARY                               \\\n"
+"                                      CORPUS                                   \\\n"
+"                                      TAGGER_SPECIFICATION                     \\\n"
+"                                      SERIALISED_TAGGER                        \\\n"
+"                                      TAGGED_CORPUS                            \\\n"
+"                                      UNTAGGED_CORPUS\n"
+"\n"
+"  or:  apertium-tagger [OPTION]... -s 0                                        \\\n"
+"                                   -u MODEL                                    \\\n"
+"                                      SERIALISED_TAGGER                        \\\n"
+"                                      TAGGED_CORPUS\n"
+"\n"
+"  or:  apertium-tagger [OPTION]... -t ITERATIONS                               \\\n"
+"                                      DICTIONARY                               \\\n"
+"                                      CORPUS                                   \\\n"
+"                                      TAGGER_SPECIFICATION                     \\\n"
+"                                      SERIALISED_TAGGER\n"
+"\n"
+"\n"
+"Mandatory arguments to long options are mandatory for short options too.\n"
+"\n";
+
+  std::vector<std::pair<std::string, std::string> > options_description_;
+  options_description_.push_back(std::make_pair("-d, --debug",            "with -g, print error messages about the input"));
+  options_description_.push_back(std::make_pair("-f, --first",            "with -g, reorder each lexical unit's analyses so that the chosen one is first"));
+  options_description_.push_back(std::make_pair("-m, --mark",             "with -g, mark disambiguated lexical units"));
+  options_description_.push_back(std::make_pair("-p, --show-superficial", "with -g, output each lexical unit's surface form"));
+  options_description_.push_back(std::make_pair("-z, --null-flush",       "with -g, flush the output after getting each null character"));
+  align::align_(options_description_);
+  std::wcerr << '\n';
+  options_description_.clear();
+  options_description_.push_back(std::make_pair("-u, --unigram=MODEL", "use unigram algorithm MODEL from <http://coltekin.net/cagri/papers/trmorph-tools.pdf>"));
+  align::align_(options_description_);
+  std::wcerr << '\n';
+  options_description_.clear();
+  options_description_.push_back(std::make_pair("-w, --sliding-window", "use the Light Sliding Window algorithm"));
+  align::align_(options_description_);
+  std::wcerr << '\n';
+  options_description_.clear();
+  options_description_.push_back(std::make_pair("-g, --tagger", "disambiguate the input"));
+  align::align_(options_description_);
+  std::wcerr << '\n';
+  options_description_.clear();
+  options_description_.push_back(std::make_pair("-r, --retrain=ITERATIONS", "with -u: exit;\notherwise: retrain the tagger with ITERATIONS unsupervised iterations"));
+  options_description_.push_back(std::make_pair("-s, --supervised=ITERATIONS", "with -u: train the tagger with a hand-tagged corpus;\nwith -w: exit;\notherwise: initialise the tagger with a hand-tagged corpus and retrain it with ITERATIONS unsupervised iterations"));
+  options_description_.push_back(std::make_pair("-t, --train=ITERATIONS", "with -u: exit;\notherwise: train the tagger with ITERATIONS unsupervised iterations"));
+  align::align_(options_description_);
+  std::wcerr << '\n';
+  options_description_.clear();
+  options_description_.push_back(std::make_pair("-h, --help", "display this help and exit"));
+  align::align_(options_description_);
+}
+
+std::string apertium_tagger::option_string(const int &indexptr_) {
+  return option_string(longopts[indexptr_]);
+}
+
+std::string apertium_tagger::option_string(const struct option &option_) {
+  std::stringstream option_string_;
+  option_string_ << "--" << option_.name;
+  return option_string_.str();
+}
+
+void apertium_tagger::locale_global_() {
+
+#if defined __clang__
+
+  std::locale::global(std::locale(""));
+
+#else
+#if defined __APPLE__
+
+  LtLocale::tryToSetLocale();
+
+#else
+
+  std::locale::global(std::locale(""));
+
+#endif // defined __APPLE__
+#endif // defined __clang__
+}
+
+const struct option apertium_tagger::longopts[] = {
+    {"help", no_argument, 0, 'h'},
+    {"debug", no_argument, 0, 'd'},
+    {"first", no_argument, 0, 'f'},
+    {"mark", no_argument, 0, 'm'},
+    {"show-superficial", no_argument, 0, 'p'},
+    {"null-flush", no_argument, 0, 'z'},
+    {"unigram", required_argument, 0, 'u'},
+    {"sliding-window", no_argument, 0, 'w'},
+    {"tagger", no_argument, 0, 'g'},
+    {"retrain", required_argument, 0, 'r'},
+    {"supervised", required_argument, 0, 's'},
+    {"train", required_argument, 0, 't'},
+    {0, 0, 0, 0}};
+
+void apertium_tagger::set_indexptr() {
+  if (The_val == longopts[The_indexptr].val)
+    return;
+
+  for (std::size_t longopts_Index = 0; longopts[longopts_Index].val != 0;
+       ++longopts_Index) {
+    if (The_val == longopts[longopts_Index].val) {
+      The_indexptr = longopts_Index;
+      return;
+    }
+  }
+}
+
+void apertium_tagger::flagOptionCase(
+    bool (basic_Tagger::Flags::*GetFlag)() const,
+    void (basic_Tagger::Flags::*SetFlag)(const bool &)) {
+  if ((TheFlags.*GetFlag)()) {
+    std::stringstream what_;
+    what_ << "unexpected '" << option_string() << "' following '"
+          << option_string() << '\'';
+    throw Exception::apertium_tagger::UnexpectedFlagOption(what_);
+  }
+
+  (TheFlags.*SetFlag)(true);
+}
+
+std::string apertium_tagger::option_string() {
+  return option_string(The_indexptr);
+}
+
+void apertium_tagger::functionTypeTypeOptionCase(
+    const FunctionTypeType &FunctionTypeType_) {
+  if (FunctionTypeTypeOption_indexptr) {
+    std::stringstream what_;
+    what_ << "unexpected '" << option_string() << "' following '"
+          << option_string(*FunctionTypeTypeOption_indexptr)
+          << '\'';
+    throw Exception::apertium_tagger::UnexpectedFunctionTypeTypeOption(what_);
+  }
+
+  TheFunctionTypeType = FunctionTypeType_;
+  FunctionTypeTypeOption_indexptr = The_indexptr;
+}
+
+void apertium_tagger::functionTypeOptionCase(
+    const FunctionType &FunctionType_) {
+  if (FunctionTypeOption_indexptr) {
+    std::stringstream what_;
+    what_ << "unexpected '" << option_string() << "' following '"
+          << option_string(*FunctionTypeOption_indexptr)
+          << '\'';
+    throw Exception::apertium_tagger::UnexpectedFunctionTypeOption(what_);
+  }
+
+  TheFunctionType = FunctionType_;
+  FunctionTypeOption_indexptr = The_indexptr;
+}
+
+void apertium_tagger::getIterationsArgument() {
+  try {
+    TheFunctionTypeOptionArgument = optarg_unsigned_long();
+  } catch (const ExceptionType &ExceptionType_) {
+    std::stringstream what_;
+    what_ << "invalid argument '" << optarg << "' for '" << option_string()
+          << '\'';
+    throw Exception::apertium_tagger::InvalidArgument(what_);
+  }
+}
+
+unsigned long apertium_tagger::optarg_unsigned_long() const {
+  char *str_end;
+  errno = 0;
+  unsigned long N_0 = std::strtoul(optarg, &str_end, 10);
+
+  if (*str_end != '\0') {
+    std::stringstream what_;
+    what_ << "can't convert char *optarg \"" << optarg << "\" to unsigned long";
+    throw Exception::apertium_tagger::str_end_not_eq_NULL(what_);
+  }
+
+  if (*optarg == '\0') {
+    std::stringstream what_;
+    what_ << "can't convert char *optarg of size 1 \"\" to unsigned long";
+    throw Exception::apertium_tagger::optarg_eq_NULL(what_);
+  }
+
+  if (errno == ERANGE) {
+    std::stringstream what_;
+    what_ << "can't convert char *optarg \"" << optarg
+          << "\" to unsigned long, not in unsigned long range";
+    throw Exception::apertium_tagger::ERANGE_(what_);
+  }
+
+  return N_0;
+}
+
+template <typename T>
+static void try_open_fstream(const char *metavar, const char *filename,
+                             T &stream) {
+  stream.open(filename);
+  if (stream.fail()) {
+    std::stringstream what_;
+    what_ << "can't open " << metavar << " file \"" << filename << "\"";
+    throw Exception::apertium_tagger::open_stream_fail(what_);
+  }
+}
+
+static FILE *try_open_file(const char *metavar, const char *filename,
+                           const char *flags) {
+  FILE *f = std::fopen(filename, flags);
+  if (f == NULL) {
+    std::stringstream what_;
+    what_ << "can't open " << metavar << " file \"" << filename << "\"";
+    throw Exception::apertium_tagger::fopen(what_);
+  }
+  return f;
+}
+
+static inline FILE *try_open_file_utf8(const char *metavar, const char *filename,
+                                       const char *flags) {
+  FILE *f = try_open_file(metavar, filename, flags);
+#ifdef _MSC_VER
+  _setmode(_fileno(f), _O_U8TEXT);
+#endif // _MSC_VER
+  return f;
+}
+
+static void try_close_file(const char *metavar, const char *filename, FILE *file) {
+  if (std::fclose(file) != 0) {
+    std::stringstream what_;
+    what_ << "can't close " << metavar << " file \"" << filename << "\"";
+    throw Exception::apertium_tagger::fclose(what_);
+  }
+}
+
+void apertium_tagger::g_StreamTagger(basic_StreamTagger &StreamTagger_) {
+  locale_global_();
+
+  if (argc - optind < 1 || !(argc - optind < 4)) {
+    std::stringstream what_;
+    what_ << "expected 1, 2, or 3 file arguments, got " << argc - optind;
+    throw Exception::apertium_tagger::UnexpectedFileArgumentCount(what_);
+  }
+
+  std::ifstream SerialisedAnalysisFrequencies;
+  try_open_fstream("SERIALISED_TAGGER", argv[optind],
+                   SerialisedAnalysisFrequencies);
+
+  try {
+    StreamTagger_.deserialise(SerialisedAnalysisFrequencies);
+  } catch (const basic_ExceptionType &basic_ExceptionType_) {
+    std::stringstream what_;
+    what_ << "can't deserialise SERIALISED_TAGGER file \"" << argv[optind]
+          << "\" Reason: " << basic_ExceptionType_.what();
+    throw Exception::apertium_tagger::deserialise(what_);
+  }
+
+  if (argc - optind < 2) {
+    Stream Input(TheFlags);
+    StreamTagger_.tag(Input, std::wcout);
+    return;
+  }
+
+  std::wifstream Input_stream;
+  try_open_fstream("INPUT", argv[optind + 1], Input_stream);
+
+  if (argc - optind < 3) {
+    Stream Input(TheFlags, Input_stream, argv[optind + 1]);
+    StreamTagger_.tag(Input, std::wcout);
+    return;
+  }
+
+  std::wofstream Output_stream;
+  try_open_fstream("OUTPUT", argv[optind + 2], Input_stream);
+
+  Stream Input(TheFlags, Input_stream, argv[optind + 1]);
+  StreamTagger_.tag(Input, Output_stream);
+}
+
+void apertium_tagger::s_StreamTaggerTrainer(
+    basic_StreamTaggerTrainer &StreamTaggerTrainer_) {
+  locale_global_();
+
+  if (TheFunctionTypeOptionArgument != 0) {
+    std::stringstream what_;
+    what_ << "invalid argument '" << TheFunctionTypeOptionArgument
+          << "' for '--supervised'";
+    throw Exception::apertium_tagger::InvalidArgument(what_);
+  }
+
+  if (argc - optind < 2 || !(argc - optind < 3)) {
+    std::stringstream what_;
+    what_ << "expected 2 file arguments, got " << argc - optind;
+    throw Exception::apertium_tagger::UnexpectedFileArgumentCount(what_);
+  }
+
+  std::wifstream TaggedCorpus_stream;
+  try_open_fstream("TAGGED_CORPUS", argv[optind + 1], TaggedCorpus_stream);
+
+  Stream TaggedCorpus(TheFlags, TaggedCorpus_stream, argv[optind]);
+  StreamTaggerTrainer_.train(TaggedCorpus);
+
+  std::ofstream Serialised_basic_Tagger;
+  try_open_fstream("SERIALISED_TAGGER", argv[optind],
+                   Serialised_basic_Tagger);
+
+  StreamTaggerTrainer_.serialise(Serialised_basic_Tagger);
+}
+
+void apertium_tagger::g_FILE_Tagger(FILE_Tagger &FILE_Tagger_) {
+  LtLocale::tryToSetLocale();
+
+  if (argc - optind < 1 || !(argc - optind < 4)) {
+    std::stringstream what_;
+    what_ << "expected 1, 2, or 3 file arguments, got " << argc - optind;
+    throw Exception::apertium_tagger::UnexpectedFileArgumentCount(what_);
+  }
+
+  FILE *Serialised_FILE_Tagger =
+      try_open_file("SERIALISED_TAGGER", argv[optind], "rb");
+  FILE_Tagger_.deserialise(Serialised_FILE_Tagger);
+  try_close_file("SERIALISED_TAGGER", argv[optind], Serialised_FILE_Tagger);
+
+  FILE_Tagger_.set_debug(TheFlags.getDebug());
+  TaggerWord::setArrayTags(FILE_Tagger_.getArrayTags());
+  TaggerWord::generate_marks = TheFlags.getMark();
+  FILE_Tagger_.set_show_sf(TheFlags.getShowSuperficial());
+  FILE_Tagger_.setNullFlush(TheFlags.getNullFlush());
+
+  if (argc - optind < 2)
+    FILE_Tagger_.tagger(stdin, stdout, TheFlags.getFirst());
+  else {
+    FILE *Input = try_open_file("INPUT", argv[optind + 1], "r");
+
+    if (argc - optind < 3)
+      FILE_Tagger_.tagger(Input, stdout, TheFlags.getFirst());
+    else {
+      FILE *Output = try_open_file_utf8("OUTPUT", argv[optind + 2], "w");
+      FILE_Tagger_.tagger(Input, Output, TheFlags.getFirst());
+      try_close_file("OUTPUT", argv[optind + 2], Output);
+    }
+
+    try_close_file("INPUT", argv[optind + 1], Input);
+  }
+}
+
+void apertium_tagger::r_FILE_Tagger(FILE_Tagger &FILE_Tagger_) {
+  LtLocale::tryToSetLocale();
+
+  if (argc - optind < 2 || !(argc - optind < 3)) {
+    std::stringstream what_;
+    what_ << "expected 2 file arguments, got " << argc - optind;
+    throw Exception::apertium_tagger::UnexpectedFileArgumentCount(what_);
+  }
+
+  FILE *Serialised_FILE_Tagger =
+      try_open_file("SERIALISED_TAGGER", argv[optind + 1], "rb");
+  FILE_Tagger_.deserialise(Serialised_FILE_Tagger);
+  try_close_file("SERIALISED_TAGGER", argv[optind + 1], Serialised_FILE_Tagger);
+
+  FILE_Tagger_.set_debug(TheFlags.getDebug());
+  TaggerWord::setArrayTags(FILE_Tagger_.getArrayTags());
+
+  FILE *Corpus = try_open_file_utf8("CORPUS", argv[optind], "r");
+  FILE_Tagger_.train(Corpus, TheFunctionTypeOptionArgument);
+  try_close_file("CORPUS", argv[optind], Corpus);
+
+  Serialised_FILE_Tagger =
+      try_open_file("SERIALISED_TAGGER", argv[optind + 1], "wb");
+  FILE_Tagger_.serialise(Serialised_FILE_Tagger);
+  try_close_file("SERIALISED_TAGGER", argv[optind + 1], Serialised_FILE_Tagger);
+}
+
+void apertium_tagger::s_FILE_Tagger(FILE_Tagger &FILE_Tagger_) {
+  LtLocale::tryToSetLocale();
+
+  if (argc - optind < 6 || !(argc - optind < 7)) {
+    std::stringstream what_;
+    what_ << "expected 6 file arguments, got " << argc - optind;
+    throw Exception::apertium_tagger::UnexpectedFileArgumentCount(what_);
+  }
+
+  FILE_Tagger_.deserialise(argv[optind + 2]);
+  FILE_Tagger_.set_debug(TheFlags.getDebug());
+  TaggerWord::setArrayTags(FILE_Tagger_.getArrayTags());
+
+  FILE *Dictionary = try_open_file("DICTIONARY", argv[optind], "r");
+  FILE_Tagger_.read_dictionary(Dictionary);
+  try_close_file("DICTIONARY", argv[optind], Dictionary);
+
+  FILE *TaggedCorpus = try_open_file("TAGGED_CORPUS", argv[optind + 4], "r");
+  FILE *UntaggedCorpus = try_open_file("UNTAGGED_CORPUS", argv[optind + 5], "r");
+  FILE_Tagger_.init_probabilities_from_tagged_text_(TaggedCorpus,
+                                                    UntaggedCorpus);
+  try_close_file("TAGGED_CORPUS", argv[optind + 4], TaggedCorpus);
+  try_close_file("UNTAGGED_CORPUS", argv[optind + 5], UntaggedCorpus);
+
+  FILE *Corpus = try_open_file_utf8("CORPUS", argv[optind + 1], "r");
+  FILE_Tagger_.train(Corpus, TheFunctionTypeOptionArgument);
+  try_close_file("CORPUS", argv[optind + 1], UntaggedCorpus);
+
+  FILE *Serialised_FILE_Tagger =
+      try_open_file("SERIALISED_TAGGER", argv[optind + 3], "wb");
+  FILE_Tagger_.serialise(Serialised_FILE_Tagger);
+  try_close_file("SERIALISED_TAGGER", argv[optind + 3], UntaggedCorpus);
+}
+
+void apertium_tagger::t_FILE_Tagger(FILE_Tagger &FILE_Tagger_) {
+  LtLocale::tryToSetLocale();
+
+  if (argc - optind < 4 || !(argc - optind < 5)) {
+    std::stringstream what_;
+    what_ << "expected 4 file arguments, got " << argc - optind;
+    throw Exception::apertium_tagger::UnexpectedFileArgumentCount(what_);
+  }
+
+  FILE_Tagger_.deserialise(argv[optind + 2]);
+  FILE_Tagger_.set_debug(TheFlags.getDebug());
+  TaggerWord::setArrayTags(FILE_Tagger_.getArrayTags());
+
+  FILE *Dictionary = try_open_file("DICTIONARY", argv[optind], "r");
+  FILE_Tagger_.read_dictionary(Dictionary);
+  try_close_file("DICTIONARY", argv[optind], Dictionary);
+
+  FILE *Corpus = try_open_file_utf8("CORPUS", argv[optind + 1], "r");
+  FILE_Tagger_.init_probabilities_kupiec_(Corpus);
+  FILE_Tagger_.train(Corpus, TheFunctionTypeOptionArgument);
+  try_close_file("CORPUS", argv[optind + 1], Corpus);
+
+  FILE *Serialised_FILE_Tagger =
+      try_open_file("SERIALISED_TAGGER", argv[optind + 3], "wb");
+  FILE_Tagger_.serialise(Serialised_FILE_Tagger);
+  try_close_file("SERIALISED_TAGGER", argv[optind + 3], Serialised_FILE_Tagger);
+}
+}
+
+int main(int argc, char **argv) {
+  try {
+    apertium_tagger(argc, argv);
+  } catch (const err_Exception &err_Exception_) {
+    std::wcerr << "Try 'apertium-tagger --help' for more information." << std::endl;
+    return 1;
+  } catch (...) {
+    throw;
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger_apply_new_rules.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger_apply_new_rules.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger_apply_new_rules.cc	(revision 70339)
@@ -0,0 +1,168 @@
+/*
+ * Copyright (C) 2004-2006 Felipe S�nchez-Mart�nez
+ * Copyright (C) 2006 Universitat d'Alacant
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <fstream>
+#include <iostream>
+#include <string>
+#include <sys/types.h>
+#include <unistd.h>
+#include "getopt_long.h"
+#include <apertium/string_utils.h>
+
+#include <apertium/hmm.h>
+#include <apertium/tagger_data_hmm.h>
+#include <apertium/tsx_reader.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+using namespace std;
+
+//Global vars
+TaggerDataHMM tagger_data_hmm;
+TTag eos; //End-of-sentence tag
+
+void check_file(FILE *f, const string& path) {
+  if (!f) {
+    wcerr<<"Error: cannot open file '"<<path.c_str()<<"'\n";
+    exit(EXIT_FAILURE);
+  }
+}
+
+void help(char *name) {
+  wcerr<<"Forbid and enforce rules are applied to the given HMM parameters\n\n";
+  wcerr<<"USAGE:\n";
+  wcerr<<name<<" --filein filein.prob --fileout fileout.prob --tsxfile file.tsx\n\n";
+
+  wcerr<<"ARGUMENTS: \n"
+      <<"   --filein|-i: To specify the file with the HMM parameter to process\n\n"
+      <<"   --fileout|-o: To specify the file to which the HMM will be written\n\n"
+      <<"   --tsxfile|-x: File containing the rules to apply\n\n"
+      <<"NOTE: Parameters are read from and written to the files provided\n";
+}
+
+int main(int argc, char* argv[]) {
+  string filein="";
+  string fileout="";
+  string filetsx="";
+
+  int c;
+  int option_index=0;
+
+  wcerr<<"Command line: ";
+  for(int i=0; i<argc; i++)
+    wcerr<<argv[i]<<" ";
+  wcerr<<"\n";
+
+  while (true) {
+    static struct option long_options[] =
+      {
+	{"filein",    required_argument, 0, 'i'},
+	{"fileout",   required_argument, 0, 'o'},
+	{"tsxfile",   required_argument, 0, 'x'},
+	{0, 0, 0, 0}
+      };
+
+    c=getopt_long(argc, argv, "i:o:x:hv",long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c) {
+    case 'i':
+      filein=optarg; 
+      break;
+    case 'o':
+      fileout=optarg; 
+      break;
+    case 'h': 
+      help(argv[0]);
+      exit(EXIT_SUCCESS);
+    case 'x':
+      filetsx=optarg;
+      break;
+    case 'v':
+      wcerr<<"LICENSE:\n\n"
+	  <<"   Copyright (C) 2006 Felipe S�nchez Mart�nez\n\n"
+	  <<"   This program is free software; you can redistribute it and/or\n"
+	  <<"   modify it under the terms of the GNU General Public License as\n"
+	  <<"   published by the Free Software Foundation; either version 2 of the\n"
+	  <<"   License, or (at your option) any later version.\n"
+	  <<"   This program is distributed in the hope that it will be useful, but\n"
+	  <<"   WITHOUT ANY WARRANTY; without even the implied warranty of\n"
+	  <<"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n"
+	  <<"   General Public License for more details.\n"
+	  <<"\n"
+	  <<"   You should have received a copy of the GNU General Public License\n"
+	  <<"   along with this program; if not, see <http://www.gnu.org/licenses/>.\n";
+      exit(EXIT_SUCCESS);
+      break;    
+    default:
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+      break;
+    }
+  }
+
+  //Now we check the command line arguments
+  if (filein=="") {
+    wcerr<<"Error: You did not provide an input file (.prob). Use --filein to do that\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  if (fileout=="") {
+    wcerr<<"Error: You did not provide an output file (.prob). Use --fileout to do that\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  if (filetsx=="") {
+    wcerr<<"Error: You did not provide a tagger definition file (.tsx). Use --filetsx to do that\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  FILE *fin, *fout;
+
+  fin=fopen(filein.c_str(), "rb");
+  check_file(fin, filein);
+
+  wcerr<<"Reading apertium-tagger data from file '"<<filein<<"' ... "<<flush;
+  tagger_data_hmm.read(fin);
+  fclose(fin);
+  wcerr<<"done.\n";
+
+  wcerr<<"Reading apertium-tagger definition from file '"<<filetsx<<"' ... "<<flush;
+  TSXReader treader;
+  treader.read(filetsx);
+  wcerr<<"done.\n";
+  
+  tagger_data_hmm.setForbidRules(treader.getTaggerData().getForbidRules());
+  tagger_data_hmm.setEnforceRules(treader.getTaggerData().getEnforceRules());
+  tagger_data_hmm.setPreferRules(treader.getTaggerData().getPreferRules());
+
+  HMM hmm(&tagger_data_hmm);
+  hmm.apply_rules();
+
+  fout=fopen(fileout.c_str(), "wb");
+  check_file(fout, fileout);
+  wcerr<<"Writing apertium-tagger data to file '"<<fileout<<"' ... "<<flush;
+  hmm.serialise(fout);
+  fclose(fout);
+  wcerr<<"done.\n";
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger_readwords.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger_readwords.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger_readwords.cc	(revision 70339)
@@ -0,0 +1,203 @@
+/*
+ * Copyright (C) 2004-2006 Felipe Sánchez-Martínez
+ * Copyright (C) 2006 Universitat d'Alacant
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+/*
+#include <iostream>
+#include <clocale>
+#include <apertium/tagger_word.h>
+#include <apertium/tagger_data.h>
+#include <apertium/tsx_reader.h>
+*/
+
+#include "getopt_long.h"
+#include <apertium/utf_converter.h>
+#include <apertium/morpho_stream.h>
+#include <apertium/tsx_reader.h>
+#include <apertium/tagger_data_hmm.h>
+#include <lttoolbox/lt_locale.h>
+#include <iostream>
+
+#include <cstdlib>
+#include <apertium/string_utils.h>
+
+
+using namespace std;
+
+//Global vars
+TaggerDataHMM tagger_data_hmm;
+bool check_ambclasses;
+
+void check_file(FILE *f, const string& path) {
+  if (!f) {
+    wcerr<<"Error: cannot open file '"<<path<<"'\n";
+    exit(EXIT_FAILURE);
+  }
+}
+
+void readwords (FILE *is, int corpus_length) {
+  MorphoStream lexmorfo(is, true, &tagger_data_hmm);
+  TaggerWord *word=NULL;
+  int nwords=0;
+
+  word = lexmorfo.get_next_word();
+  while(word) {
+    nwords++;
+
+    cout<<UtfConverter::toUtf8(word->get_superficial_form())<<" "<<UtfConverter::toUtf8(word->get_string_tags())<<"\n";
+
+    if (check_ambclasses) {
+      int k=tagger_data_hmm.getOutput()[word->get_tags()];
+
+      if ((k>=tagger_data_hmm.getM())||(k<0)) {
+	wcerr<<"Error: Ambiguity class number out of range: "<<k<<"\n";
+	wcerr<<"Word: "<<UtfConverter::toUtf8(word->get_superficial_form())<<"\n";
+	wcerr<<"Ambiguity class: "<<UtfConverter::toUtf8(word->get_string_tags())<<"\n";
+      }
+    }
+
+    delete word;
+
+    if ((corpus_length>0) && (nwords>=corpus_length))
+      break;
+
+    word=lexmorfo.get_next_word();
+  }
+  wcerr<<nwords<<" were readed\n";
+}
+
+
+void help(char *name) {
+  wcerr<<"USAGE:\n";
+  wcerr<<name<<" {--tsxfile file.tsx | --probfile file.prob} [--clength <corpus_length>] < file.crp \n\n";
+
+  wcerr<<"ARGUMENTS: \n"
+      <<"   --tsxfile|-x: Specify a tagger specification file\n"
+      <<"   --probfile|-p: Specify a tagger parameter file\n"
+      <<"   --clength|-l: Specify the length of the corpus to process\n";
+}
+
+
+int main(int argc, char* argv[]) {
+  string tsxfile="";
+  string probfile="";
+  int corpus_length=-1;
+
+  int c;
+  int option_index=0;
+
+  wcerr<<"LOCALE: "<<setlocale(LC_ALL,"")<<"\n";
+
+  wcerr<<"Command line: ";
+  for(int i=0; i<argc; i++)
+    wcerr<<argv[i]<<" ";
+  wcerr<<"\n";
+
+  while (true) {
+    static struct option long_options[] =
+      {
+	{"tsxfile",  required_argument, 0, 'x'},
+	{"probfile", required_argument, 0, 'p'},
+	{"clength",  required_argument, 0, 'l'},
+	{"help",       no_argument,     0, 'h'},
+	{"version",    no_argument,     0, 'v'},
+	{0, 0, 0, 0}
+      };
+
+    c=getopt_long(argc, argv, "x:p:l:hv",long_options, &option_index);
+    if (c==-1)
+      break;
+
+    switch (c) {
+    case 'l':
+      corpus_length=atoi(optarg);
+      if(corpus_length<=0) {
+	wcerr<<"Error: corpus length provided with --clength must be a positive integer\n";
+	help(argv[0]);
+	exit(EXIT_FAILURE);
+      }
+      break;
+    case 'x':
+      tsxfile=optarg;
+      break;
+    case 'p':
+      probfile=optarg;
+      break;
+    case 'h':
+      help(argv[0]);
+      exit(EXIT_SUCCESS);
+      break;
+    case 'v':
+      wcerr<<"apertium-tagger-readwords\n";
+      wcerr<<"LICENSE:\n\n"
+	  <<"   Copyright (C) 2006 Felipe Sánchez Martínez\n\n"
+	  <<"   This program is free software; you can redistribute it and/or\n"
+	  <<"   modify it under the terms of the GNU General Public License as\n"
+	  <<"   published by the Free Software Foundation; either version 2 of the\n"
+	  <<"   License, or (at your option) any later version.\n"
+	  <<"   This program is distributed in the hope that it will be useful, but\n"
+	  <<"   WITHOUT ANY WARRANTY; without even the implied warranty of\n"
+	  <<"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n"
+	  <<"   General Public License for more details.\n"
+	  <<"\n"
+	  <<"   You should have received a copy of the GNU General Public License\n"
+	  <<"   along with this program; if not, see <http://www.gnu.org/licenses/>.\n";
+      exit(EXIT_SUCCESS);
+      break;
+    default:
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+      break;
+    }
+  }
+
+  if((tsxfile=="") && (probfile=="")) {
+    wcerr<<"Error: You have provided neither a tagger specification file (.tsx) nor a tagger probability file (.prob). Use --tsxfile or --probfile to provide one of them\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  if((tsxfile!="") && (probfile!="")) {
+    wcerr<<"Error: You provided a tagger specification file and a tagger probability file. Only one of them can be provided, not both\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  if (tsxfile!="") {
+    wcerr<<"Reading tagger specification from file '"<<tsxfile<<"' ..."<<flush;
+    TSXReader treader;
+    treader.read(tsxfile);
+    tagger_data_hmm=treader.getTaggerData();
+    wcerr<<"done.\n";
+    check_ambclasses=false;
+  }
+
+  if (probfile!="") {
+    wcerr<<"Reading tagger parameters from file '"<<probfile<<"' ..."<<flush;
+    FILE* fin=NULL;
+    fin=fopen(probfile.c_str(), "r");
+    check_file(fin, probfile);
+    tagger_data_hmm.read(fin);
+    wcerr<<"done.\n";
+    fclose(fin);
+    check_ambclasses=true;
+  }
+
+  TaggerWord::setArrayTags(tagger_data_hmm.getArrayTags());
+
+  readwords(stdin, corpus_length);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/deformat.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/deformat.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/deformat.xsl	(revision 70339)
@@ -0,0 +1,871 @@
+<?xml version="1.0" encoding="ISO-8859-1"?> <!-- -*- nxml -*- -->
+<!--
+ Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+<xsl:stylesheet version="1.0"
+                xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+  <xsl:output method="text" encoding="UTF-8"/>
+
+<xsl:param name="mode"/>
+
+<xsl:template name="replaceString">
+  <xsl:param name="haystack"/>
+  <xsl:param name="needle"/>
+  <xsl:param name="replacement"/>
+  <xsl:choose>
+    <xsl:when test="contains($haystack, $needle)">
+      <xsl:value-of select="substring-before($haystack, $needle)"/>
+      <xsl:value-of select="$replacement"/>
+      <xsl:call-template name="replaceString">
+	<xsl:with-param name="haystack"
+			select="substring-after($haystack, $needle)"/>
+	<xsl:with-param name="needle" select="$needle"/>
+	<xsl:with-param name="replacement" select="$replacement"/>
+      </xsl:call-template>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:value-of select="$haystack"/>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+
+<xsl:template name="format-rule-apertium">
+  <xsl:choose>
+    <xsl:when test="count(./begin) = 0">
+      <xsl:value-of select="./tag/@regexp"/>
+      <xsl:value-of select="string('&#x9;{&#xA;')"/>
+      <xsl:if test="./@eos = string('yes')">
+	<xsl:value-of select="string('  isDot = true;&#xA;')"/>
+      </xsl:if>
+      <xsl:value-of select="string('  bufferAppend(buffer, yytext);&#xA;}&#xA;')"/>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:variable name="thisnode" select="."/>
+      <xsl:value-of select="./begin/@regexp"/>
+      <xsl:value-of select="string('&#x9;{&#xA;')"/>
+      <xsl:if test="./@eos = string('yes')">
+	<xsl:value-of select="string('  isDot = true;&#xA;')"/>
+      </xsl:if>
+      <xsl:value-of select="string('  bufferAppend(buffer, yytext);&#xA;  yy_push_state(C')"/>
+      <xsl:for-each select="/format/rules/format-rule/begin ">
+	<xsl:if test="./@regexp = $thisnode/begin/@regexp">
+          <xsl:value-of select="position()"/>
+	</xsl:if>
+      </xsl:for-each>
+      <xsl:value-of select="string(');&#xA;}&#xA;')"/>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+<xsl:template name="format-rule-matxin">
+  <xsl:choose>
+    <xsl:when test="./@type = 'open'">
+      <xsl:value-of select="./tag/@regexp"/>
+      <xsl:value-of select="string('&#x9;{&#xA;')"/>
+      <xsl:if test="./@eos = string('yes')">
+        <xsl:value-of select="string('  isDot = true;&#xA;')"/>
+      </xsl:if>
+      <xsl:value-of select="string('  printBuffer();&#xA;')"/>
+
+      <xsl:value-of select="string('  if (hasWrite_white) {&#xA;    fputws(L&quot; &quot;, yyout);&#xA;')"/>
+      <xsl:value-of select="string('    offset++;&#xA;    hasWrite_white = false;&#xA;  }&#xA;')"/>
+
+      <xsl:value-of select="string('  current++;&#xA;  orders.push_back(current);&#xA;')"/>
+      <xsl:value-of select="string('  last=&quot;open_tag&quot;;&#xA;  offsets.push_back(offset);&#xA;')"/>
+      <xsl:value-of select="string('  wchar_t* symbol = new wchar_t[strlen(yytext) + 1];&#xA;')"/>
+      <xsl:value-of select="string('  mbstowcs(symbol, yytext, strlen(yytext));&#xA;')"/>
+      <xsl:value-of select="string('  symbol[strlen(yytext)] = (char) 0;&#xA;')"/>
+      <xsl:value-of select="string('  tags.push_back(symbol);&#xA;  delete[] symbol;&#xA;}&#xA;')"/>
+    </xsl:when>
+    <xsl:when test="./@type = 'close'">
+      <xsl:value-of select="./tag/@regexp"/>
+      <xsl:value-of select="string('&#x9;{&#xA;')"/>
+      <xsl:if test="./@eos = string('yes')">
+        <xsl:value-of select="string('  isDot = true;&#xA;')"/>
+      </xsl:if>
+      <xsl:value-of select="string('  int ind=get_index(yytext);&#xA;')"/>
+      <xsl:value-of select="string('  printBuffer(ind, yytext);&#xA;}&#xA;')"/>
+    </xsl:when>
+    <xsl:when test="./@type = 'comment'">
+      <xsl:variable name="thisnode" select="."/>
+      <xsl:value-of select="./begin/@regexp"/>
+      <xsl:value-of select="string('&#x9;{&#xA;')"/>
+      <xsl:if test="./@eos = string('yes')">
+        <xsl:value-of select="string('  isDot = true;&#xA;')"/>
+      </xsl:if>
+      <xsl:value-of select="string('  last = &quot;buffer&quot;;&#xA;')"/>
+      <xsl:value-of select="string('  bufferAppend(buffer, yytext);&#xA;  yy_push_state(C')"/>
+      <xsl:for-each select="/format/rules/format-rule[@type='comment']">
+        <xsl:if test="./begin/@regexp = $thisnode/begin/@regexp">
+          <xsl:value-of select="position()"/>
+        </xsl:if>
+      </xsl:for-each>
+      <xsl:value-of select="string(');&#xA;}&#xA;')"/>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:value-of select="./tag/@regexp"/>
+      <xsl:value-of select="string('&#x9;{&#xA;')"/>
+      <xsl:if test="./@eos = string('yes')">
+        <xsl:value-of select="string('  isDot = true;&#xA;')"/>
+      </xsl:if>
+      <xsl:value-of select="string('  last = &quot;buffer&quot;;&#xA;')"/>
+      <xsl:value-of select="string('  bufferAppend(buffer, yytext);&#xA;}&#xA;')"/>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+<xsl:template match="format">
+
+%{
+
+#include &lt;cstdlib&gt;
+#include &lt;iostream&gt;
+#include &lt;map&gt;
+#include &lt;string&gt;
+#include &lt;vector&gt;
+
+extern "C" {
+#if !defined(__STDC__)
+# define __STDC__ 1
+#endif
+#include &lt;regex.h&gt;
+}
+
+#include &lt;string&gt;
+#include &lt;lttoolbox/lt_locale.h&gt;
+#include &lt;lttoolbox/ltstr.h&gt;
+#include &lt;apertium/string_to_wostream.h&gt;
+#ifndef GENFORMAT
+#include "apertium_config.h"
+#endif
+#include &lt;apertium/unlocked_cstdio.h&gt;
+#ifdef _WIN32
+#include &lt;io.h&gt;
+#include &lt;fcntl.h&gt;
+#endif
+
+using namespace std;
+
+wstring buffer;
+string symbuf;
+bool isDot, hasWrite_dot, hasWrite_white;
+bool eosIncond;
+bool noDot;
+FILE *formatfile;
+string last;
+int current;
+long int offset;
+
+
+vector&lt;long int&gt; offsets;
+vector&lt;wstring&gt; tags;
+vector&lt;int&gt; orders;
+
+regex_t escape_chars;
+regex_t names_regexp;
+
+void bufferAppend(wstring &amp;buf, string const &amp;str)
+{
+  symbuf.append(str);
+
+  for(size_t i = 0, limit = symbuf.size(); i &lt; limit;)
+  {
+    wchar_t symbol;
+    int gap = mbtowc(&amp;symbol, symbuf.c_str() + i, MB_CUR_MAX);
+    if(gap == -1)
+    {
+      if(i + MB_CUR_MAX &lt; limit)
+      {
+        buf += L'?';
+        gap = 1;
+      }
+      else
+      {
+        symbuf = symbuf.substr(i);
+        return;
+      }
+    }
+    else
+    {
+      buf += symbol;
+    }
+
+    i += gap;
+  }
+
+  symbuf = "";
+  return;
+}
+
+
+void init_escape()
+{
+  if(regcomp(&amp;escape_chars, "<xsl:call-template name="replaceString">
+      <xsl:with-param name="haystack"
+		      select="/format/options/escape-chars/@regexp"/>
+      <xsl:with-param name="needle" select="string('\')"/>
+      <xsl:with-param name="replacement" select="string('\\')"/>
+    </xsl:call-template>", REG_EXTENDED))
+  {
+    wcerr &lt;&lt; "ERROR: Illegal regular expression for escape characters" &lt;&lt; endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+void init_tagNames()
+{
+  if(regcomp(&amp;names_regexp, "<xsl:call-template name="replaceString">
+      <xsl:with-param name="haystack"
+		      select="/format/options/tag-name/@regexp"/>
+      <xsl:with-param name="needle" select="string('\')"/>
+      <xsl:with-param name="replacement" select="string('\\')"/>
+    </xsl:call-template>", REG_EXTENDED))
+  {
+    wcerr &lt;&lt; "ERROR: Illegal regular expression for tag-names" &lt;&lt; endl;
+    exit(EXIT_FAILURE);
+  }
+}
+
+string backslash(string const &amp;str)
+{
+  string new_str;
+
+  for(unsigned int i = 0; i &lt; str.size(); i++)
+  {
+    if(str[i] == '\\')
+    {
+      new_str += str[i];
+    }
+    new_str += str[i];
+  }
+
+  return new_str;
+}
+
+
+wstring escape(string const &amp;str)
+{
+  regmatch_t pmatch;
+
+  char const *mystring = str.c_str();
+  int base = 0;
+  wstring result;
+
+  while(!regexec(&amp;escape_chars, mystring + base, 1, &amp;pmatch, 0))
+  {
+    bufferAppend(result, str.substr(base, pmatch.rm_so));
+    result += L'\\';
+    wchar_t micaracter;
+    int pos = mbtowc(&amp;micaracter, str.c_str() + base + pmatch.rm_so, MB_CUR_MAX);
+    if(pos == -1)
+    {
+      wcerr &lt;&lt; L"Uno" &lt;&lt; endl;
+      wcerr &lt;&lt; L"Encoding error." &lt;&lt; endl;
+      exit(EXIT_FAILURE);
+    }
+
+    result += micaracter;
+    base += pmatch.rm_eo;
+  }
+
+  bufferAppend(result, str.substr(base));
+  return result;
+}
+
+wstring escape(wstring const &amp;str)
+{
+  string dest;
+
+  for(size_t i = 0, limit = str.size(); i &lt; limit; i++)
+  {
+#ifdef __GNUC__
+    char symbol[MB_CUR_MAX+1];
+#else
+    std::string _symbol(MB_CUR_MAX+1, 0);
+    char *symbol = &amp;_symbol[0];
+#endif
+    int pos = wctomb(symbol, str[i]);
+    if(pos == -1)
+    {
+      symbol[0]='?';
+      pos = 1;
+    }
+    symbol[pos] = 0;
+    dest.append(symbol);
+  }
+  return escape(dest);
+}
+
+string get_tagName(string tag){
+  regmatch_t pmatch;
+
+  char const *mystring = tag.c_str();
+  string result;
+  if(!regexec(&amp;names_regexp, mystring, 1, &amp;pmatch, 0))
+  {
+    result=tag.substr(pmatch.rm_so, pmatch.rm_eo - pmatch.rm_so);
+    return result;
+  }
+
+  return "";
+}
+
+
+<xsl:for-each select="./rules/replacement-rule">
+  <xsl:variable name="varname"
+		select="concat(concat(string('S'),position()),string('_substitution'))"/>
+  <xsl:value-of select="string('map&lt;string, wstring, Ltstr&gt; S')"/>
+  <xsl:value-of select="position()"/>
+  <xsl:value-of select="string('_substitution;&#xA;&#xA;void S')"/>
+  <xsl:value-of select="position()"/>
+  <xsl:value-of select="string('_init()&#xA;{')"/>
+
+  <xsl:for-each select="./replace">
+    <xsl:value-of select="string('&#xA;  ')"/>
+    <xsl:value-of select="$varname"/>
+    <xsl:value-of select="string('[&quot;')"/>
+    <xsl:value-of select="./@source"/>
+    <xsl:value-of select="string('&quot;] = L&quot;')"/>
+    <xsl:value-of select="./@target"/>
+    <xsl:value-of select="string('&quot;;')"/>
+  </xsl:for-each>
+
+  <xsl:value-of select="string('&#xA;}&#xA;')"/>
+</xsl:for-each>
+
+<xsl:if test="$mode=string('matxin')">
+int get_index(string end_tag){
+  string new_end_tag;
+  size_t pos;
+
+  for (int i=tags.size()-1; i >= 0; i--) {
+    // a wchar to char conversion can be up to 4 times larger
+    char *tmp = new char (sizeof(char)*((tags[i].size()+1) * 4));
+    // Keep the existing memset. Better safe than sorry.
+    memset(tmp, '\0', tags[i].size() + 1);
+
+    pos = wcstombs(tmp, tags[i].c_str(), tags[i].size());
+    if (pos == (size_t)-1)
+    {
+      wcerr &lt;&lt; L"Encoding error." &lt;&lt; endl;
+      exit(EXIT_FAILURE);
+    }
+    new_end_tag = tmp;
+    delete[] tmp;
+
+    if (get_tagName(end_tag) == get_tagName(new_end_tag))
+      return i;
+  }
+
+  return -1;
+}
+
+void print_emptyTags() {
+  wchar_t tag[250];
+
+  for (size_t i=0; i &lt; tags.size(); i++) {
+    swprintf(tag, 250, L"&lt;format-tag offset=\"%d\" order= \"%d\"&gt;&lt;![CDATA[", offsets[i], orders[i]);
+    fputws(tag, formatfile);
+    fputws(tags[i].c_str(), formatfile);
+    fputwc(L']', formatfile);
+    swprintf(tag, 250, L"]&gt;&lt;/format-tag&gt;\n");
+    fputws(tag, formatfile);
+  }
+}
+</xsl:if>
+
+<xsl:choose>
+  <xsl:when test="$mode=string('matxin')">
+void printBuffer(int ind=-1, string end_tag="")
+{
+  wchar_t tag[250];
+  wstring etiketa;
+  wstring wend_tag;
+  size_t pos;
+  int num;
+  wchar_t result[end_tag.size() + 1];
+
+  // Convert end_tag to wstring
+  pos = mbstowcs(result, end_tag.c_str(), end_tag.size());
+  if (pos == (size_t) -1)
+  {
+    wcerr &lt;&lt; L"Encoding error." &lt;&lt; endl;
+    exit(EXIT_FAILURE);
+  }
+  result[pos] = L'\0';
+  wend_tag = result;
+
+  if (ind != -1 &amp;&amp; ind == tags.size()-1 &amp;&amp;
+      offsets[ind] == offset &amp;&amp; orders[ind] == current)
+  {
+    last = "buffer";
+    buffer = tags.back() + buffer + wend_tag;
+    tags.pop_back();
+    offsets.pop_back();
+    orders.pop_back();
+  }
+  else if (ind == -1 &amp;&amp; wend_tag != L"")
+  {
+    last = "buffer";
+    buffer = buffer + wend_tag;
+  }
+  else
+  {
+    if (hasWrite_dot &amp;&amp; isDot)
+    {
+      swprintf(tag, 250, L"&lt;empty-tag offset=\"%d\"/&gt;\n", offset+1);
+      fputws(tag, formatfile);
+
+      fputws(L" .\n", yyout);
+      offset += 2;
+      hasWrite_dot = false;
+    }
+
+    isDot = false;
+
+    if ((buffer.size() == 1 &amp;&amp; buffer[0] != ' ') || buffer.size() &gt; 1)
+    {
+      if (hasWrite_white)
+      {
+        fputws(L" ", yyout);
+        offset++;
+        hasWrite_white = false;
+      }
+
+      current++;
+
+      swprintf(tag, 250, L"&lt;format-tag offset=\"%d\" order=\"%d\"&gt;&lt;![CDATA[", offset, current);
+      fputws(tag, formatfile);
+      while ((pos = buffer.find(L"]]&gt;")) != wstring::npos)
+        buffer.replace(pos, 3, L"\\]\\]\\&gt;");
+      fputws(buffer.c_str(), formatfile);
+      swprintf(tag, 250, L"]]&gt;&lt;/format-tag&gt;\n");
+      fputws(tag, formatfile);
+    }
+    else
+    {
+      fputws(buffer.c_str(), yyout);
+      offset += buffer.size();
+    }
+
+
+    if (ind != -1)
+    {
+      if (hasWrite_white)
+      {
+        fputws(L" ", yyout);
+        offset++;
+        hasWrite_white = false;
+      }
+
+      num = swprintf(tag, 250, L"&lt;open-close-tag&gt;\n");
+      swprintf(tag + num, 250 - num, L"&lt;open-tag offset=\"%d\" order=\"%d\"&gt;&lt;![CDATA[", offsets[ind], orders[ind]);
+      fputws(tag, formatfile);
+      etiketa = tags[ind];
+      while ((pos = etiketa.find(L"]]&gt;")) != wstring::npos)
+        etiketa.replace(pos, 3, L"\\]\\]\\&gt;");
+      fputws(etiketa.c_str(), formatfile);
+
+      current++;
+
+      num = swprintf(tag, 250, L"]]&gt;&lt;/open-tag&gt;\n");
+      swprintf(tag + num, 250 - num, L"&lt;close-tag offset=\"%d\" order=\"%d\"&gt;&lt;![CDATA[", offset, current);
+      fputws(tag, formatfile);
+      while ((pos = wend_tag.find(L"]]&gt;")) != wstring::npos)
+        wend_tag.replace(pos, 3, L"\\]\\]\\&gt;");
+      fputws(wend_tag.c_str(), formatfile);
+      num = swprintf(tag, 250, L"]]&gt;&lt;/close-tag&gt;\n");
+      swprintf(tag + num, 250 - num, L"&lt;/open-close-tag&gt;\n");
+      fputws(tag, formatfile);
+
+      tags.erase(tags.begin() + ind);
+      offsets.erase(offsets.begin() + ind);
+      orders.erase(orders.begin() + ind);
+    }
+
+
+    last = "buffer";
+    buffer = L"";
+  }
+
+}
+  </xsl:when>
+  <xsl:otherwise>
+
+void preDot()
+{
+  if(eosIncond)
+  {
+    if(noDot)
+    {
+      fputws_unlocked(L"[]", yyout);
+    }
+    else
+    {
+      fputws_unlocked(L".[]", yyout);
+    }
+  }
+}
+
+void printBuffer()
+{
+  if(isDot &amp;&amp; !eosIncond)
+  {
+    if(noDot)
+    {
+      fputws_unlocked(L"[]", yyout);
+    }
+    else
+    {
+      fputws_unlocked(L".[]", yyout);
+    }
+    isDot = false;
+  }
+  if(buffer.size() &gt; <xsl:value-of select="/format/options/largeblocks/@size"/>)
+  {
+    string filename = tmpnam(NULL);
+    FILE *largeblock = fopen(filename.c_str(), "w");
+    fputws_unlocked(buffer.c_str(), largeblock);
+    fclose(largeblock);
+    preDot();
+    fputwc_unlocked(L'[', yyout);
+    fputwc_unlocked(L'@', yyout);
+    wchar_t cad[filename.size()];
+    size_t pos = mbstowcs(cad, filename.c_str(), filename.size());
+    if(pos == (size_t) -1)
+    {
+      wcerr &lt;&lt; L"Tres" &lt;&lt; endl;
+
+      wcerr &lt;&lt; L"Encoding error." &lt;&lt; endl;
+      exit(EXIT_FAILURE);
+    }
+    cad[pos] = 0;
+    fputws_unlocked(cad, yyout);
+    fputwc_unlocked(L']', yyout);
+  }
+  else if(buffer.size() &gt; 1)
+  {
+    preDot();
+    fputwc_unlocked(L'[', yyout);
+    wstring const tmp = escape(buffer);
+    if(tmp[0] == L'@')
+    {
+      fputwc_unlocked(L'\\', yyout);
+    }
+    fputws_unlocked(tmp.c_str(), yyout);
+    fputwc_unlocked(L']', yyout);
+  }
+  else if(buffer.size() == 1 &amp;&amp; buffer[0] != L' ')
+  {
+    preDot();
+    fputwc_unlocked(L'[', yyout);
+    wstring const tmp = escape(buffer);
+    if(tmp[0] == L'@')
+    {
+      fputwc_unlocked(L'\\', yyout);
+    }
+    fputws_unlocked(tmp.c_str(), yyout);
+
+    fputwc_unlocked(L']', yyout);
+  }
+  else
+  {
+    fputws_unlocked(buffer.c_str(), yyout);
+  }
+
+  buffer = L"";
+}
+  </xsl:otherwise>
+</xsl:choose>
+%}
+
+<xsl:if test="count(./rules/format-rule[@type='comment']) &gt; 1">
+<xsl:value-of select="string('%x')"/>
+<xsl:for-each select="./rules/format-rule[@type='comment']">
+  <xsl:value-of select="string(' C')"/>
+  <xsl:value-of select="position()"/>
+</xsl:for-each>
+</xsl:if>
+%option nounput
+%option noyywrap<xsl:if test="./options/case-sensitive/@value=string('no')">
+%option caseless</xsl:if>
+%option stack
+
+%%
+
+<xsl:for-each select="./rules/format-rule[@type='comment']">
+  <xsl:variable name="sc"
+                select="concat(string('C'), position())"/>
+  <xsl:variable name="thisnode" select="."/>
+&lt;<xsl:value-of select="$sc"/>&gt;{
+
+<xsl:for-each select="/format/rules/format-rule">
+  <xsl:sort select="./@priority" data-type="number" order="ascending"/>
+  <xsl:choose>
+    <xsl:when test="$thisnode/@priority &gt; ./@priority">
+      <xsl:value-of select="string('&#x9;')"/>
+      <xsl:choose>
+        <xsl:when test="$mode=string('matxin')">
+          <xsl:call-template name="format-rule-matxin"/>
+        </xsl:when>
+        <xsl:otherwise>
+          <xsl:call-template name="format-rule-apertium"/>
+        </xsl:otherwise>
+      </xsl:choose>
+    </xsl:when>
+    <xsl:otherwise/>
+  </xsl:choose>
+</xsl:for-each>
+
+<xsl:value-of select="string('&#x9;')"/><xsl:value-of select="./end/@regexp"/>&#x9;{
+  last = "buffer";
+  bufferAppend(buffer, yytext);
+  yy_pop_state();
+}
+
+&#x9;\n|.&#x9;{
+  last = "buffer";
+  bufferAppend(buffer, yytext);
+}
+
+}
+</xsl:for-each>
+
+<xsl:for-each select="./rules/format-rule">
+  <xsl:choose>
+    <xsl:when test="$mode=string('matxin')">
+      <xsl:call-template name="format-rule-matxin"/>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:call-template name="format-rule-apertium"/>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:for-each>
+
+
+<xsl:for-each select="./rules/replacement-rule">
+  <xsl:variable name="varname"
+		select="concat(concat(string('S'),position()),string('_substitution'))"/>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:value-of select="./@regexp"/>
+  <xsl:value-of select="string('&#x9;{&#xA;  if(')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('.find(yytext) != ')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('.end())&#xA;  {&#xA;    printBuffer();&#xA;    fputws_unlocked(')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('[yytext].c_str(), yyout);&#xA;    offset+=')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('[yytext].size();&#xA;')"/>
+  <xsl:value-of select="string('    hasWrite_dot = hasWrite_white = true;&#xA;  }&#xA;  else&#xA;  {&#xA;')"/>
+  <xsl:value-of select="string('    last=&quot;buffer&quot;;&#xA;    bufferAppend(buffer, yytext);&#xA;  }&#xA;}&#xA;')"/>
+</xsl:for-each>
+
+<xsl:value-of select="./options/space-chars/@regexp"/>&#x9;{
+  if (last == "open_tag")
+    bufferAppend(tags.back(), yytext);
+  else
+    bufferAppend(buffer, yytext);
+
+}
+
+<xsl:value-of select="./options/escape-chars/@regexp"/>&#x9;{
+  printBuffer();
+  fputwc_unlocked(L'\\', yyout);
+  offset++;
+  wchar_t symbol;
+  int pos = mbtowc(&amp;symbol, yytext, MB_CUR_MAX);
+  if(pos == -1)
+  {
+      wcerr &lt;&lt; L"Cuatro" &lt;&lt; endl;
+
+    wcerr &lt;&lt; L"Encoding error." &lt;&lt; endl;
+    exit(EXIT_FAILURE);
+  }
+
+  fputwc_unlocked(symbol, yyout);
+  offset++;
+  hasWrite_dot = hasWrite_white = true;
+
+}
+
+.&#x9;{
+  printBuffer();
+  symbuf += yytext;
+  wchar_t symbol;
+  int pos = mbtowc(&amp;symbol, symbuf.c_str(), MB_CUR_MAX);
+  if(pos == -1)
+  {
+    if(symbuf.size() > (size_t) MB_CUR_MAX)
+    {
+      // unknown character
+      symbuf = "";
+      fputwc_unlocked(L'?', yyout);
+      offset++;
+      hasWrite_dot = hasWrite_white = true;
+    }
+  }
+  else
+  {
+    symbuf = "";
+    fputwc_unlocked(symbol, yyout);
+    offset++;
+    hasWrite_dot = hasWrite_white = true;
+  }
+}
+
+&lt;&lt;EOF&gt;&gt;&#x9;{
+  isDot = true;
+
+  preDot();
+  printBuffer();
+  return 0;
+}
+%%
+
+
+
+void usage(string const &amp;progname)
+{
+<xsl:choose>
+  <xsl:when test="$mode=string('matxin')">
+  wcerr &lt;&lt; "USAGE: " &lt;&lt; progname &lt;&lt; " format_file [input_file [output_file]" &lt;&lt; ']' &lt;&lt; endl;
+  </xsl:when>
+  <xsl:otherwise>
+  wcerr &lt;&lt; "USAGE: " &lt;&lt; progname &lt;&lt; " [ -h | -i | -n ] [input_file [output_file]" &lt;&lt; ']' &lt;&lt; endl;
+  </xsl:otherwise>
+</xsl:choose>
+  wcerr &lt;&lt; "<xsl:value-of select="./@name"/> format processor " &lt;&lt; endl;
+  exit(EXIT_SUCCESS);
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  size_t base = 0;
+  eosIncond = false;
+
+  if(argc &gt;= 2)
+  {
+    if(!strcmp(argv[1],"-i"))
+    {
+      eosIncond = true;
+      base++;
+    }
+    else if(!strcmp(argv[1],"-n"))
+    {
+      noDot = true;
+      base++;
+    }
+  }
+<xsl:choose>
+  <xsl:when test="$mode=string('matxin')">
+  if(argc &gt; 4 || argc &lt; 2)
+  {
+    usage(argv[0]);
+  }
+
+  switch(argc-base)
+  {
+    case 4:
+      yyout = fopen(argv[3+base], "w");
+      if(!yyout)
+      {
+        usage(argv[0]);
+      }
+    case 3:
+      yyin = fopen(argv[2+base], "r");
+      if(!yyin)
+      {
+        usage(argv[0]);
+      }
+    case 2:
+      formatfile = fopen(argv[1+base], "w");
+      if(!formatfile)
+      {
+        usage(argv[0]);
+      }
+      break;
+    default:
+      break;
+  }
+  </xsl:when>
+  <xsl:otherwise>
+ if((argc-base) &gt; 4)
+  {
+    usage(argv[0]);
+  }
+
+  switch(argc-base)
+  {
+    case 3:
+      yyout = fopen(argv[2+base], "w");
+      if(!yyout)
+      {
+        usage(argv[0]);
+      }
+    case 2:
+      yyin = fopen(argv[1+base], "r");
+      if(!yyin)
+      {
+        usage(argv[0]);
+      }
+      break;
+    default:
+      break;
+  }
+  </xsl:otherwise>
+</xsl:choose>
+#ifdef _WIN32
+  _setmode(_fileno(yyin), _O_U8TEXT);
+  _setmode(_fileno(yyout), _O_U8TEXT);
+#endif
+  // prevent warning message
+  yy_push_state(1);
+  yy_top_state();
+  yy_pop_state();
+
+<xsl:for-each select="./rules/replacement-rule">
+  <xsl:value-of select="string('  S')"/>
+  <xsl:value-of select="position()"/>
+  <xsl:value-of select="string('_init();&#xA;')"/>
+</xsl:for-each>
+
+<xsl:if test="$mode=string('matxin')">
+  fputws(L"&lt;?xml version=\&quot;1.0\&quot; encoding=\&quot;UTF-8\&quot; ?>\n", formatfile);
+  fputws(L"&lt;format&gt;\n", formatfile);
+</xsl:if>
+
+  last = "";
+  buffer = L"";
+  isDot = hasWrite_dot = hasWrite_white = false;
+  current=0;
+  offset = 0;
+  init_escape();
+  init_tagNames();
+  yylex();
+
+<xsl:if test="$mode=string('matxin')">
+  print_emptyTags();
+  fputws(L"&lt;/format&gt;", formatfile);
+  fclose(formatfile);
+</xsl:if>
+  fclose(yyin);
+  fclose(yyout);
+}
+</xsl:template>
+</xsl:stylesheet>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/hmm.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/hmm.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/hmm.cc	(revision 70339)
@@ -0,0 +1,872 @@
+
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+/*
+ *  First order hidden Markov model (HMM) implementation (source)
+ *
+ *  @author	Felipe Sánchez-Martínez - fsanchez@dlsi.ua.es
+ */
+
+#include <apertium/hmm.h>
+#include <apertium/tagger_utils.h>
+#include  "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+#include <lttoolbox/compression.h>
+
+#ifdef WIN32
+#define isnan(n) _isnan(n)
+#define isinf(n) (!_finite(n))
+#endif
+
+#ifdef __clang__
+#undef __GNUC__
+#endif
+
+#include <stdio.h>
+#include <unistd.h>
+#include <vector>
+#include <algorithm>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+using namespace tagger_utils;
+
+void HMM::deserialise(FILE *Serialised_FILE_Tagger) {
+  tdhmm.read(Serialised_FILE_Tagger);
+  eos = (tdhmm.getTagIndex())[L"TAG_SENT"];
+}
+
+std::vector<std::wstring> &HMM::getArrayTags() {
+  return tdhmm.getArrayTags();
+}
+
+void HMM::serialise(FILE *Stream_) { tdhmm.write(Stream_); }
+
+void HMM::deserialise(const TaggerData &Deserialised_FILE_Tagger) {
+  tdhmm = TaggerDataHMM(Deserialised_FILE_Tagger);
+  eos = (tdhmm.getTagIndex())[L"TAG_SENT"];
+}
+
+void HMM::init_probabilities_from_tagged_text_(FILE *TaggedCorpus,
+                                               FILE *UntaggedCorpus) {
+  init_probabilities_from_tagged_text(TaggedCorpus, UntaggedCorpus);
+  apply_rules();
+}
+
+void HMM::init_probabilities_kupiec_(FILE *Corpus) {
+  init_probabilities_kupiec(Corpus);
+  apply_rules();
+}
+
+void HMM::train(FILE *Corpus, unsigned long Count) {
+  for (; Count > 0; --Count) {
+    std::fseek(Corpus, 0, SEEK_SET);
+    train(Corpus);
+  }
+
+  apply_rules();
+}
+
+HMM::HMM() {}
+
+HMM::HMM(TaggerDataHMM tdhmm)
+{
+  tdhmm = tdhmm;
+  eos = (tdhmm.getTagIndex())[L"TAG_SENT"];  
+}
+
+HMM::HMM(TaggerDataHMM *tdhmm) : tdhmm(*tdhmm) {}
+
+HMM::~HMM() {}
+
+void
+HMM::init()
+{
+}
+
+void
+HMM::set_eos(TTag t) 
+{ 
+  eos = t; 
+} 
+
+void 
+HMM::read_ambiguity_classes(FILE *in) 
+{
+  while(in)
+  {
+    int ntags = Compression::multibyte_read(in);
+
+    if(feof(in))
+    {
+      break;
+    }
+    set<TTag> ambiguity_class;
+
+    for(; ntags != 0; ntags--)
+    {
+      ambiguity_class.insert(Compression::multibyte_read(in));
+    }
+    
+    if(ambiguity_class.size() != 0)
+    {
+      tdhmm.getOutput().add(ambiguity_class);
+    }     
+  }
+  
+  tdhmm.setProbabilities(tdhmm.getTagIndex().size(), tdhmm.getOutput().size());
+}
+
+void 
+HMM::write_ambiguity_classes(FILE *out) 
+{
+  for(int i=0, limit = tdhmm.getOutput().size(); i != limit; i++) 
+  {
+    set<TTag> const &ac = (tdhmm.getOutput())[i];
+    Compression::multibyte_write(ac.size(), out);
+    for(set<TTag>::const_iterator it = ac.begin(), limit2 = ac.end();
+        it != limit2; it++)
+    {
+      Compression::multibyte_write(*it, out);
+    }
+  } 
+}  
+
+void 
+HMM::read_probabilities(FILE *in)
+{
+  tdhmm.read(in);
+}
+
+void 
+HMM::write_probabilities(FILE *out)
+{
+  tdhmm.write(out);  
+}  
+
+void 
+HMM::init_probabilities_kupiec (FILE *is)
+{
+  int N = tdhmm.getN();
+  int M = tdhmm.getM();
+  int i=0, j=0, k=0, k1=0, k2=0, nw=0;
+#ifdef __GNUC__
+  double classes_ocurrences[M]; //M = Number of ambiguity classes
+  double classes_pair_ocurrences[M][M];
+  double tags_estimate[N]; //N = Number of tags (states)
+  double tags_pair_estimate[N][N];
+#else
+  vector <double> classes_ocurrences (M, 1);
+  vector <vector <double> > classes_pair_ocurrences(M, vector<double>(M, 1));
+  vector <double> tags_estimate(N, 0);
+  vector <vector <double> > tags_pair_estimate(N, vector<double>(N, 0));
+#endif
+  
+  Collection &output = tdhmm.getOutput();
+ 
+  MorphoStream lexmorfo(is, true, &tdhmm);
+  
+  TaggerWord *word=NULL;
+
+#ifdef __GNUC__
+  for(k=0; k<M; k++) {
+    classes_ocurrences[k]=1; 
+    for (k2=0; k2<M; k2++)
+      classes_pair_ocurrences[k][k2]=1;
+  }
+#endif
+
+  set<TTag> tags;
+  tags.insert(eos);  
+  k1=output[tags]; //The first tag (ambiguity class) seen is the end-of-sentence
+  
+  //We count for each ambiguity class the number of ocurrences
+  word = lexmorfo.get_next_word();
+  while((word)) {
+    if (++nw%10000==0) wcerr<<L'.'<<flush; 
+    
+    tags=word->get_tags();
+
+    if (tags.size()==0) { //This is an unknown word
+      tags = tdhmm.getOpenClass();
+    }
+    else {
+      require_ambiguity_class(tdhmm, tags, *word, nw);
+    }
+
+    k2=output[tags];
+
+    classes_ocurrences[k1]++;
+    classes_pair_ocurrences[k1][k2]++;  //k1 followed by k2
+    delete word;
+    word=lexmorfo.get_next_word();
+
+    k1=k2;
+
+  }  
+
+  //Estimation of the number of time each tags occurs in the training text
+  for(i=0; i<N; i++) {  
+#ifdef __GNUC__
+    tags_estimate[i]=0;
+#endif
+    for(k=0; k<M;  k++) { 
+  
+      if(output[k].find(i) != output[k].end())
+        tags_estimate[i] += classes_ocurrences[k]/output[k].size();	
+    }
+  }
+  
+#ifdef __GNUC__
+  //Estimation of the number of times each tag pair occurs
+  for(i=0; i<N; i++)
+    for(j=0; j<N; j++)
+      tags_pair_estimate[i][j]=0;
+#endif
+
+  set<TTag> tags1, tags2;
+  set<TTag>::iterator itag1, itag2;
+  for(k1=0; k1<M; k1++) {
+    tags1=output[k1];
+    for(k2=0; k2<M; k2++) {
+      tags2=output[k2];
+      double nocurrences=classes_pair_ocurrences[k1][k2]/((double)(tags1.size()*tags2.size()));
+      for (itag1=tags1.begin(); itag1!=tags1.end(); itag1++) {
+        for (itag2=tags2.begin(); itag2!=tags2.end(); itag2++)
+          tags_pair_estimate[*itag1][*itag2]+=nocurrences;
+      }
+    }
+  }
+
+   //a[i][j] estimation.
+  double sum;
+  for(i=0; i<N; i++) {
+    sum=0;
+    for(j=0; j<N; j++)
+      sum+=tags_pair_estimate[i][j];
+
+    for(j=0; j<N; j++) {  
+      if (sum>0)
+        (tdhmm.getA())[i][j] = tags_pair_estimate[i][j]/sum;
+      else {
+        (tdhmm.getA())[i][j] = 0;
+      }
+    }
+  }
+
+  //b[i][k] estimation
+  for(i=0; i<N; i++) {
+    for(k=0; k<M; k++)  {
+      if (output[k].find(i)!=output[k].end()) {
+        if (tags_estimate[i]>0)
+          (tdhmm.getB())[i][k] = (classes_ocurrences[k]/output[k].size())/tags_estimate[i];
+        else 
+	  (tdhmm.getB())[i][k] = 0;
+      }
+    }
+  }
+  wcerr<<L"\n";
+}
+
+void 
+HMM::init_probabilities_from_tagged_text(FILE *ftagged, FILE *funtagged) {
+  int i, j, k, nw=0;
+  int N = tdhmm.getN();
+  int M = tdhmm.getM();
+#ifdef __GNUC__
+  double tags_pair[N][N];
+  double emission[N][M];
+#else
+  vector <vector <double> > tags_pair(N, vector<double>(N, 0));
+  vector <vector <double> > emission(N, vector<double>(M, 0));
+#endif
+
+
+  MorphoStream stream_tagged(ftagged, true, &tdhmm);
+  MorphoStream stream_untagged(funtagged, true, &tdhmm);
+  
+  TaggerWord *word_tagged=NULL, *word_untagged=NULL;
+  Collection &output = tdhmm.getOutput();
+
+  
+  set<TTag> tags;
+
+#ifdef __GNUC__ 
+  // Init counters - each event appears at least once. 
+  // Espected likelihood estimate (ELE) with a fixed initial count of 1
+  for(i=0; i<N; i++) {
+    for(j=0; j<N; j++)
+      tags_pair[i][j]=0;
+  }
+  for(k=0; k<M; k++) {
+    for(i=0; i<N; i++) {
+      if (output[k].find(i)!=output[k].end())
+        emission[i][k] = 0;
+    }  
+  }
+#endif 
+
+  TTag tag1, tag2;  
+  tag1 = eos; // The first seen tag is the end-of-sentence tag
+  
+  word_tagged = stream_tagged.get_next_word();
+  word_untagged = stream_untagged.get_next_word();
+  while(word_tagged) {
+    wcerr<<*word_tagged;
+    wcerr<<L" -- "<<*word_untagged<<L"\n"; 
+
+    if (word_tagged->get_superficial_form()!=word_untagged->get_superficial_form()) {              
+      wcerr<<L"\nTagged text (.tagged) and analyzed text (.untagged) streams are not aligned.\n";
+      wcerr<<L"Take a look at tagged text (.tagged).\n";
+      wcerr<<L"Perhaps this is caused by a multiword unit that is not a multiword unit in one of the two files.\n";
+      wcerr<<*word_tagged<<L" -- "<<*word_untagged<<L"\n"; 
+      exit(1);
+    }
+
+    if (++nw%100==0) wcerr<<L'.'<<flush; 
+    
+    tag2 = tag1;
+   
+    if (word_untagged==NULL) {
+      wcerr<<L"word_untagged==NULL\n";
+      exit(1);
+    }
+
+    if (word_tagged->get_tags().size()==0) // Unknown word
+      tag1 = -1;
+    else if (word_tagged->get_tags().size()>1) // Ambiguous word
+      wcerr<<L"Error in tagged text. An ambiguous word was found: "<<word_tagged->get_superficial_form()<<L"\n";
+    else
+      tag1 = *(word_tagged->get_tags()).begin();
+
+
+    if ((tag1>=0) && (tag2>=0))
+      tags_pair[tag2][tag1]++;
+    
+
+    if (word_untagged->get_tags().size()==0) { // Unknown word
+      tags = tdhmm.getOpenClass();
+    }
+    else {
+      require_ambiguity_class(tdhmm, word_untagged->get_tags(), *word_untagged, nw);
+      tags = word_untagged->get_tags();
+    }
+
+    k=output[tags];
+    if(tag1>=0)
+      emission[tag1][k]++;
+                   
+    delete word_tagged;
+    word_tagged=stream_tagged.get_next_word();
+    delete word_untagged;
+    word_untagged=stream_untagged.get_next_word();       
+  }
+  
+  
+  //Estimate of a[i][j]
+  for(i=0; i<N; i++) {
+    double sum=0;
+    for(j=0; j<N; j++)  
+      sum += tags_pair[i][j]+1.0;
+    for(j=0; j<N; j++)  
+      (tdhmm.getA())[i][j] = (tags_pair[i][j]+1.0)/sum;
+  }
+    
+  
+  //Estimate of b[i][k]
+  for(i=0; i<N; i++) {
+    int nclasses_appear=0;
+    double times_appear=0.0;
+    for(k=0; k<M; k++)  {
+      if (output[k].find(i)!=output[k].end())  {
+	nclasses_appear++;	
+	times_appear+=emission[i][k];
+      }
+    }	      
+    for(k=0; k<M; k++)  {
+      if (output[k].find(i)!=output[k].end())
+	(tdhmm.getB())[i][k] = (emission[i][k]+(((double)1.0)/((double)nclasses_appear)))/(times_appear+((double)1.0));
+    }
+   }
+  
+  wcerr<<L"\n";  
+}
+  
+void
+HMM::apply_rules()
+{
+  vector<TForbidRule> &forbid_rules = tdhmm.getForbidRules();
+  vector<TEnforceAfterRule> &enforce_rules = tdhmm.getEnforceRules();
+  int N = tdhmm.getN();
+  int i, j, j2;
+  bool found;
+   
+  for(i=0; i<(int) forbid_rules.size(); i++) {
+    (tdhmm.getA())[forbid_rules[i].tagi][forbid_rules[i].tagj] = ZERO;
+  }
+
+  for(i=0; i<(int) enforce_rules.size(); i++) {
+    for(j=0; j<N; j++) {
+      found = false;
+      for (j2=0; j2<(int) enforce_rules[i].tagsj.size(); j2++) {
+	if (enforce_rules[i].tagsj[j2]==j) {
+	  found = true;
+	  break;
+	}	  
+      }
+      if (!found)
+        (tdhmm.getA())[enforce_rules[i].tagi][j] = ZERO;
+    }
+  }
+    
+  // Normalize probabilities
+  for(i=0; i<N; i++) {
+    double sum=0;
+    for(j=0; j<N; j++) 
+      sum += (tdhmm.getA())[i][j];
+    for(j=0; j<N; j++) {
+      if (sum>0)
+	(tdhmm.getA())[i][j] = (tdhmm.getA())[i][j]/sum;
+      else
+	(tdhmm.getA())[i][j] = 0;
+    }
+  }
+}
+
+void 
+HMM::read_dictionary(FILE *fdic) {
+  tagger_utils::read_dictionary(fdic, tdhmm);
+  int N = (tdhmm.getTagIndex()).size();
+  int M = (tdhmm.getOutput()).size();
+  wcerr << N << L" states and " << M <<L" ambiguity classes\n";
+
+  tdhmm.setProbabilities(N, M);
+}
+
+void
+HMM::filter_ambiguity_classes(FILE *in, FILE *out) {
+  set<set<TTag> > ambiguity_classes;
+  MorphoStream morpho_stream(in, true, &tdhmm);
+  
+  TaggerWord *word = morpho_stream.get_next_word();
+  
+  while(word) {
+    set<TTag> tags = word->get_tags();
+    if(tags.size() > 0) {     
+      if(ambiguity_classes.find(tags) == ambiguity_classes.end()) {
+	    ambiguity_classes.insert(tags);
+	    word->outputOriginal(out);
+	    //wcerr<<word->get_string_tags()<<L"\n";
+      }
+    }
+    delete word;
+    word = morpho_stream.get_next_word();
+  }
+}
+
+void 
+HMM::train (FILE *ftxt) {
+  int i, j, k, t, len, nw = 0;
+  TaggerWord *word=NULL;
+  TTag tag; 
+  set<TTag> tags, pretags;
+  set<TTag>::iterator itag, jtag;
+  map <int, double> gamma;
+  map <int, double>::iterator jt, kt;
+  map < int, map <int, double> > alpha, beta, xsi, phi;
+  map < int, map <int, double> >::iterator it;
+  double prob, loli;              
+  vector < set<TTag> > pending;
+  Collection &output = tdhmm.getOutput();
+  
+  int ndesconocidas=0;
+  // alpha => forward probabilities
+  // beta  => backward probabilities
+  
+  MorphoStream morpho_stream(ftxt, true, &tdhmm);
+
+  loli = 0;
+  tag = eos;
+  tags.clear();
+  tags.insert(tag);
+  pending.push_back(tags);
+
+  alpha[0].clear();      
+  alpha[0][tag] = 1;
+
+  word = morpho_stream.get_next_word();
+
+  while (word) {   
+
+    //wcerr<<L"Enter para continuar\n";
+    //getchar();
+
+    if (++nw%10000==0) wcerr<<L'.'<<flush;
+
+    //wcerr<<*word<<L"\n";
+
+    pretags = pending.back();
+
+    tags = word->get_tags();    
+    
+    if (tags.size()==0) { // This is an unknown word
+      tags = tdhmm.getOpenClass();
+      ndesconocidas++;
+    }
+    
+    require_ambiguity_class(tdhmm, tags, *word, nw);
+    
+    k = output[tags];    
+    len = pending.size();
+    alpha[len].clear();     
+      
+    //Forward probabilities
+    for (itag=tags.begin(); itag!=tags.end(); itag++) {
+      i=*itag;
+      for (jtag=pretags.begin(); jtag!=pretags.end(); jtag++) {
+         j=*jtag;
+         //wcerr<<"previous alpha["<<len<<"]["<<i<<"]="<<alpha[len][i]<<"\n";
+	 //wcerr<<"alpha["<<len-1<<"]["<<j<<"]="<<alpha[len-1][j]<<"\n";
+         //wcerr<<"a["<<j<<"]["<<i<<"]="<<a[j][i]<<"\n";
+         //wcerr<<"b["<<i<<"]["<<k<<"]="<<b[i][k]<<"\n";
+	 alpha[len][i] += alpha[len-1][j]*(tdhmm.getA())[j][i]*(tdhmm.getB())[i][k];
+      }
+      if (alpha[len][i]==0)
+        alpha[len][i]=DBL_MIN;
+      //wcerr<<"alpha["<<len<<"]["<<i<<"]="<<alpha[len][i]<<"\n--------\n";
+    }
+
+    if (tags.size()>1) {
+      pending.push_back(tags);
+    } else {  // word is unambiguous
+      tag = *tags.begin(); 
+      beta[0].clear();
+      beta[0][tag] = 1;   
+      
+      prob = alpha[len][tag];
+      
+      //wcerr<<"prob="<<prob<<"\n";
+      //wcerr<<"alpha["<<len<<"]["<<tag<<"]="<<alpha[len][tag]<<"\n";
+      loli -= log(prob);  
+      
+      for (t=0; t<len; t++) {  // loop from T-1 to 0	
+	  pretags = pending.back();
+	  pending.pop_back();
+   	  k = output[tags];
+	     beta[1-t%2].clear();
+	     for (itag=tags.begin(); itag!=tags.end(); itag++) {
+	       i=*itag;
+	       for (jtag=pretags.begin(); jtag!=pretags.end(); jtag++) {
+	         j = *jtag;	      
+	         beta[1-t%2][j] += (tdhmm.getA())[j][i]*(tdhmm.getB())[i][k]*beta[t%2][i];
+	         xsi[j][i] += alpha[len-t-1][j]*(tdhmm.getA())[j][i]*(tdhmm.getB())[i][k]*beta[t%2][i]/prob;
+	       }
+	       double previous_value = gamma[i];
+       
+	       gamma[i] +=  alpha[len-t][i]*beta[t%2][i]/prob;		       
+	       if (isnan(gamma[i])) {
+	          wcerr<<L"NAN(3) gamma["<<i<<L"] = "<<gamma[i]<<L" alpha["<<len-t<<L"]["<<i<<L"]= "<<alpha[len-t][i]
+	               <<L" beta["<<t%2<<L"]["<<i<<L"] = "<<beta[t%2][i]<<L" prob = "<<prob<<L" previous gamma = "<<previous_value<<L"\n";
+	          exit(1);	               
+	       }
+	       if (isinf(gamma[i])) {
+	          wcerr<<L"INF(3) gamma["<<i<<L"] = "<<gamma[i]<<L" alpha["<<len-t<<L"]["<<i<<L"]= "<<alpha[len-t][i]
+	               <<L" beta["<<t%2<<L"]["<<i<<L"] = "<<beta[t%2][i]<<L" prob = "<<prob<<L" previous gamma = "<<previous_value<<L"\n";
+	          exit(1);	               
+	       }
+	       if (gamma[i]==0) {
+	          //cout<<"ZERO(3) gamma["<<i<<"] = "<<gamma[i]<<" alpha["<<len-t<<"]["<<i<<"]= "<<alpha[len-t][i]
+	          //    <<" beta["<<t%2<<"]["<<i<<"] = "<<beta[t%2][i]<<" prob = "<<prob<<" previous gamma = "<<previous_value<<"\n";
+	          gamma[i]=DBL_MIN;
+	          //exit(1);	               
+	       }
+	        phi[i][k] += alpha[len-t][i]*beta[t%2][i]/prob;
+	     }
+	     tags=pretags;
+      }
+	
+      tags.clear();
+      tags.insert(tag);
+      pending.push_back(tags);
+      alpha[0].clear();
+      alpha[0][tag] = 1;
+    }
+    
+    delete word; 
+    word = morpho_stream.get_next_word();
+  }  
+
+  if ((pending.size()>1) || ((tag!=eos)&&(tag != (tdhmm.getTagIndex())[L"TAG_kEOF"]))) 
+    wcerr<<L"Warning: Thee las tag is not the end-of-sentence-tag\n";
+  
+  
+  int N = tdhmm.getN();
+  int M = tdhmm.getM();
+  
+  //Clean previous values  
+  for(i=0; i<N; i++) {
+     for(j=0; j<N; j++)
+        (tdhmm.getA())[i][j]=ZERO;
+     for(k=0; k<M; k++)
+        (tdhmm.getB())[i][k]=ZERO;
+  }
+  
+  // new parameters
+  for (it=xsi.begin(); it!=xsi.end(); it++) {
+    i = it->first;
+    for (jt=xsi[i].begin(); jt!=xsi[i].end(); jt++) {
+      j = jt->first;
+      if (xsi[i][j]>0) {        
+        if (gamma[i]==0) {
+          wcerr<<L"Warning: gamma["<<i<<L"]=0\n";
+          gamma[i]=DBL_MIN;
+        }
+        
+        (tdhmm.getA())[i][j] = xsi[i][j]/gamma[i];
+	
+        if (isnan((tdhmm.getA())[i][j])) {
+          wcerr<<L"NAN\n";
+          wcerr <<L"Error: BW - NAN(1) a["<<i<<L"]["<<j<<L"]="<<(tdhmm.getA())[i][j]<<L"\txsi["<<i<<L"]["<<j<<L"]="<<xsi[i][j]<<L"\tgamma["<<i<<L"]="<<gamma[i]<<L"\n";
+	  exit(1);
+        }
+	if (isinf((tdhmm.getA())[i][j])) {
+	  wcerr<<L"INF\n"; 
+          wcerr <<L"Error: BW - INF(1) a["<<i<<L"]["<<j<<L"]="<<(tdhmm.getA())[i][j]<<L"\txsi["<<i<<L"]["<<j<<L"]="<<xsi[i][j]<<L"\tgamma["<<i<<L"]="<<gamma[i]<<L"\n";
+          exit(1);
+        }
+	if ((tdhmm.getA())[i][j]==0) {
+          //wcerr <<"Error: BW - ZERO(1) a["<<i<<"]["<<j<<"]="<<(tdhmm.getA())[i][j]<<"\txsi["<<i<<"]["<<j<<"]="<<xsi[i][j]<<"\tgamma["<<i<<"]="<<gamma[i]<<"\n";
+	  //     exit(1);
+        }
+      }
+    }
+  }
+
+  for (it=phi.begin(); it!=phi.end(); it++) {
+    i = it->first;
+    for (kt=phi[i].begin(); kt!=phi[i].end(); kt++) {
+      k = kt->first;
+      if (phi[i][k]>0) {
+        (tdhmm.getB())[i][k] = phi[i][k]/gamma[i];	
+        
+	if (isnan((tdhmm.getB())[i][k])) {
+          wcerr<<L"Error: BW - NAN(2) b["<<i<<L"]["<<k<<L"]="<<(tdhmm.getB())[i][k]<<L"\tphi["<<i<<L"]["<<k<<L"]="<<phi[i][k]<<L"\tgamma["<<i<<L"]="<<gamma[i]<<L"\n";
+	       exit(1);
+        }
+	if (isinf((tdhmm.getB())[i][k])) {
+          wcerr<<L"Error: BW - INF(2) b["<<i<<L"]["<<k<<L"]="<<(tdhmm.getB())[i][k]<<L"\tphi["<<i<<L"]["<<k<<L"]="<<phi[i][k]<<L"\tgamma["<<i<<L"]="<<gamma[i]<<L"\n";
+	       exit(1);
+        }
+	if ((tdhmm.getB())[i][k]==0) {
+          //wcerr <<"Error: BW - ZERO(2) b["<<i<<"]["<<k<<"]="<<(tdhmm.getB())[i][k]<<"\tphi["<<i<<"]["<<k<<"]="<<phi[i][k]<<"\tgamma["<<i<<"]="<<gamma[i]<<"\n";
+	  //     exit(1);
+        }
+      }
+    }
+  }
+
+  //It can be possible that a probability is not updated
+  //We normalize the probabilitites
+  for(i=0; i<N; i++) {
+    double sum=0;
+    for(j=0; j<N; j++)
+      sum+=(tdhmm.getA())[i][j];
+    for(j=0; j<N; j++)
+      (tdhmm.getA())[i][j]=(tdhmm.getA())[i][j]/sum;
+  }
+
+  for(i=0; i<N; i++) {
+    double sum=0;
+    for(k=0; k<M; k++) {
+      if(output[k].find(i)!=output[k].end())
+        sum+=(tdhmm.getB())[i][k];
+    }
+    for(k=0; k<M; k++) {
+      if(output[k].find(i)!=output[k].end())
+        (tdhmm.getB())[i][k]=(tdhmm.getB())[i][k]/sum;
+    }
+  }
+
+  wcerr<<L"Log="<<loli<<L"\n";
+}
+
+void 
+HMM::tagger(FILE *Input, FILE *Output, const bool &First) {
+  int i, j, k, nw;
+  TaggerWord *word=NULL;
+  TTag tag;
+  
+  set <TTag> tags, pretags;
+  set <TTag>::iterator itag, jtag;
+  
+  double prob, loli, x;
+  int N = tdhmm.getN();  
+#ifdef __GNUC__
+  double alpha[2][N];
+  vector<TTag> best[2][N];
+#else
+  vector <vector <double> > alpha(2, vector<double>(N));
+  vector <vector <vector<TTag> > > best(2, vector <vector <TTag> >(N));
+#endif
+  
+  vector <TaggerWord> wpend; 
+  int nwpend;
+  
+  MorphoStream morpho_stream(Input, debug, &tdhmm);                             
+  morpho_stream.setNullFlush(null_flush);
+  
+  Collection &output = tdhmm.getOutput();
+  
+  loli = nw = 0;
+  
+  //Initialization
+  tags.insert(eos);
+  alpha[0][eos] = 1;
+   
+  word = morpho_stream.get_next_word();
+ 
+  while (word) {
+    wpend.push_back(*word);    	    
+    nwpend = wpend.size();
+    
+    pretags = tags; // Tags from the previous word
+
+    tags = word->get_tags();
+  
+    if (tags.size()==0) // This is an unknown word
+      tags = tdhmm.getOpenClass();
+                       
+    tags = require_similar_ambiguity_class(tdhmm, tags, *word, debug);
+         
+    k = output[tags];  //Ambiguity class the word belongs to
+    
+#ifdef __GNUC__
+    clear_array_double(alpha[nwpend%2], N);    
+    clear_array_vector(best[nwpend%2], N);
+#else
+    clear_array_double(&alpha[nwpend%2][0], N);    
+    clear_array_vector(&best[nwpend%2][0], N);
+#endif
+    
+    //Induction
+    for (itag=tags.begin(); itag!=tags.end(); itag++) { //For all tag from the current word
+      i=*itag;
+      for (jtag=pretags.begin(); jtag!=pretags.end(); jtag++) {	//For all tags from the previous word
+	j=*jtag;
+	x = alpha[1-nwpend%2][j]*(tdhmm.getA())[j][i]*(tdhmm.getB())[i][k];
+	if (alpha[nwpend%2][i]<=x) {
+	  if (nwpend>1) 
+	    best[nwpend%2][i] = best[1-nwpend%2][j];
+	  best[nwpend%2][i].push_back(i);
+	  alpha[nwpend%2][i] = x;
+	}
+      }
+    }
+    
+    //Backtracking
+    if (tags.size()==1) {       
+      tag = *tags.begin();      
+      
+      prob = alpha[nwpend%2][tag];
+      
+      if (prob>0) 
+	loli -= log(prob);
+      else {
+        if (debug)
+	  wcerr<<L"Problem with word '"<<word->get_superficial_form()<<L"' "<<word->get_string_tags()<<L"\n";
+      }
+      for (unsigned t=0; t<best[nwpend%2][tag].size(); t++) {
+	if (First) {
+	  wstring const &micad = wpend[t].get_all_chosen_tag_first(best[nwpend%2][tag][t], (tdhmm.getTagIndex())[L"TAG_kEOF"]);
+	  fputws_unlocked(micad.c_str(), Output); 
+	} else {
+	  // print Output
+	  wpend[t].set_show_sf(show_sf);
+	  wstring const &micad = wpend[t].get_lexical_form(best[nwpend%2][tag][t], (tdhmm.getTagIndex())[L"TAG_kEOF"]);
+	  fputws_unlocked(micad.c_str(), Output); 
+	}
+      }
+      
+      //Return to the initial state
+      wpend.clear();   
+      alpha[0][tag] = 1;
+    }
+    
+    delete word;
+    
+    if(morpho_stream.getEndOfFile())
+    {
+      if(null_flush)
+      { 
+        fputwc_unlocked(L'\0', Output);
+        tags.clear();
+        tags.insert(eos);
+        alpha[0][eos] = 1;
+      }
+      
+      fflush(Output);
+      morpho_stream.setEndOfFile(false);
+    }
+    word = morpho_stream.get_next_word();    
+  }
+  
+  if ((tags.size()>1)&&(debug)) {
+    wstring errors;
+    errors = L"The text to disambiguate has finished, but there are ambiguous words that has not been disambiguated.\n";
+    errors+= L"This message should never appears. If you are reading this ..... these are very bad news.\n";
+    wcerr<<L"Error: "<<errors;
+  }  
+}
+
+
+void
+HMM::print_A() {
+  int i,j;
+    
+  cout<<"TRANSITION MATRIX (A)\n------------------------------\n";  
+  for(i=0; i != tdhmm.getN(); i++)
+    for(j=0; j != tdhmm.getN(); j++) {
+      cout<<"A["<<i<<"]["<<j<<"] = "<<(tdhmm.getA())[i][j]<<"\n";
+    }    
+}
+
+void
+HMM::print_B() {
+  int i,k;  
+
+  cout<<"EMISSION MATRIX (B)\n-------------------------------\n";
+  for(i=0; i != tdhmm.getN(); i++)
+    for(k=0; k != tdhmm.getM(); k++) {
+      Collection &output = tdhmm.getOutput();
+      if(output[k].find(i)!=output[k].end())
+        cout<<"B["<<i<<"]["<<k<<"] = "<<(tdhmm.getB())[i][k]<<"\n";
+    }
+}
+
+void HMM::print_ambiguity_classes() {
+  set<TTag> ambiguity_class;
+  set<TTag>::iterator itag;
+  cout<<"AMBIGUITY CLASSES\n-------------------------------\n";
+  for(int i=0; i != tdhmm.getM(); i++) {
+    ambiguity_class = (tdhmm.getOutput())[i];
+    cout <<i<<": ";
+    for (itag=ambiguity_class.begin(); itag!=ambiguity_class.end(); itag++) {
+      cout << *itag <<" ";
+    }
+    cout << "\n";
+  }
+}   
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.cc	(revision 70339)
@@ -0,0 +1,1603 @@
+/*
+ * Copyright (C) 2005--2015 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/interchunk.h>
+#include <apertium/trx_reader.h>
+#include <apertium/utf_converter.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/xml_parse_util.h>
+
+#include <cctype>
+#include <cerrno>
+#include <iostream>
+#include <stack>
+#include <apertium/string_utils.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+using namespace Apertium;
+using namespace std;
+
+void
+Interchunk::destroy()
+{
+  delete me;
+  me = NULL;
+
+  if(doc)
+  {
+    xmlFreeDoc(doc);
+    doc = NULL;
+  }  
+}
+
+Interchunk::Interchunk() :
+word(0),
+blank(0),
+lword(0),
+lblank(0),
+output(0),
+any_char(0),
+any_tag(0),
+nwords(0)
+{
+  me = NULL;
+  doc = NULL;
+  root_element = NULL;
+  lastrule = NULL;
+  inword = false;
+  null_flush = false;
+  internal_null_flush = false;
+  trace = false;
+  emptyblank = "";
+}
+
+Interchunk::~Interchunk()
+{
+  destroy();
+}
+
+void 
+Interchunk::readData(FILE *in)
+{
+  alphabet.read(in);
+  any_char = alphabet(TRXReader::ANY_CHAR);
+  any_tag = alphabet(TRXReader::ANY_TAG);
+
+  Transducer t;
+  t.read(in, alphabet.size());
+  
+  map<int, int> finals;  
+  
+  // finals
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    int key = Compression::multibyte_read(in);
+    finals[key] = Compression::multibyte_read(in);
+  }  
+  
+  me = new MatchExe(t, finals);
+ 
+  // attr_items
+  bool recompile_attrs = Compression::string_read(in) != string(pcre_version());
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    attr_items[cad_k].read(in);
+    wstring fallback = Compression::wstring_read(in);
+    if(recompile_attrs) {
+      attr_items[cad_k].compile(UtfConverter::toUtf8(fallback));
+    }
+  }
+
+  // variables
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    variables[cad_k] = UtfConverter::toUtf8(Compression::wstring_read(in));
+  }
+
+  // macros
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    macros[cad_k] = Compression::multibyte_read(in);
+  }
+
+  // lists
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+
+    for(int j = 0, limit2 = Compression::multibyte_read(in); j != limit2; j++)
+    {
+      wstring const cad_v = Compression::wstring_read(in);
+      lists[cad_k].insert(UtfConverter::toUtf8(cad_v));
+      listslow[cad_k].insert(UtfConverter::toUtf8(StringUtils::tolower(cad_v)));
+    }  
+  }
+}
+
+void
+Interchunk::read(string const &transferfile, string const &datafile)
+{
+  readInterchunk(transferfile);
+  
+  // datafile
+  FILE *in = fopen(datafile.c_str(), "rb");
+  if(!in)
+  {
+    wcerr << "Error: Could not open file '" << datafile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  readData(in);
+  fclose(in);
+
+}
+
+void
+Interchunk::readInterchunk(string const &in)
+{
+  doc = xmlReadFile(in.c_str(), NULL, 0);
+  
+  if(doc == NULL)
+  {
+    wcerr << "Error: Could not parse file '" << in << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  root_element = xmlDocGetRootElement(doc);
+  
+  // search for macros & rules
+  for(xmlNode *i = root_element->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "section-def-macros"))
+      {
+        collectMacros(i);
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "section-rules"))
+      {
+        collectRules(i);
+      }
+    } 
+  }
+}
+
+void
+Interchunk::collectRules(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      for(xmlNode *j = i->children; ; j = j->next)
+      {
+        if(j->type == XML_ELEMENT_NODE && !xmlStrcmp(j->name, (const xmlChar *) "action"))
+        {
+          rule_map.push_back(j);
+          break;
+        }
+      }
+    }
+  }
+}
+
+void
+Interchunk::collectMacros(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      macro_map.push_back(i);
+    }
+  }
+}
+
+bool
+Interchunk::checkIndex(xmlNode *element, int index, int limit)
+{
+  if(index >= limit)
+  {
+    wcerr << L"Error in " << UtfConverter::fromUtf8((char *) doc->URL) <<L": line " << element->line << endl;
+    return false;
+  }
+  return true;
+}
+
+
+string 
+Interchunk::evalString(xmlNode *element)
+{
+  if (element == 0)
+  {
+    throw "Interchunk::evalString() was passed a NULL element";
+  }
+
+  map<xmlNode *, TransferInstr>::iterator it;
+  it = evalStringCache.find(element);
+  if(it != evalStringCache.end())
+  {
+    TransferInstr &ti = it->second;
+    switch(ti.getType())
+    {
+      case ti_clip_tl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          if(ti.getContent() == "content") // jacob's new 'part'
+          { 
+            string wf = word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]);
+            return wf.substr(1, wf.length()-2); // trim away the { and }  
+          }
+          else
+          {
+            return word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]);
+          }
+        }
+        break;
+        
+      case ti_var:
+        return variables[ti.getContent()];
+        
+      case ti_lit_tag:
+      case ti_lit:
+        return ti.getContent();
+        
+      case ti_b:
+        if(checkIndex(element, ti.getPos(), lblank))
+        {
+          if(ti.getPos() >= 0)
+          {
+            return !blank?"":*(blank[ti.getPos()]);
+          }
+          return " ";
+        }
+        break;
+            
+      case ti_get_case_from:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return copycase(word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]),
+                          evalString((xmlNode *) ti.getPointer()));
+        }
+        break;
+      
+      case ti_case_of_tl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return caseOf(word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]));
+        }
+        break;
+      
+      default:
+        return "";
+    }
+    return "";
+  }
+
+  if(!xmlStrcmp(element->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = element->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *)i->children->content) - 1;
+      }
+    }
+
+    evalStringCache[element] = TransferInstr(ti_clip_tl, (const char *) part, pos, NULL);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lit-tag"))
+  {
+    evalStringCache[element] = TransferInstr(ti_lit_tag, 
+                                             tags((const char *) element->properties->children->content), 0);                                            
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lit"))
+  {
+    evalStringCache[element] = TransferInstr(ti_lit, ((const char *) element->properties->children->content), 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "b"))
+  {
+    if(element->properties == NULL)
+    {
+      evalStringCache[element] = TransferInstr(ti_b, " ", -1);
+    }
+    else
+    {
+      int pos = atoi((const char *) element->properties->children->content) - 1;
+      evalStringCache[element] = TransferInstr(ti_b, "", pos);
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "get-case-from"))
+  {
+    int pos = atoi((const char *) element->properties->children->content) - 1;
+    xmlNode *param = NULL;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+	param = i;
+	break;
+      }
+    }
+
+    evalStringCache[element] = TransferInstr(ti_get_case_from, "lem", pos, param);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "var"))
+  {
+    evalStringCache[element] = TransferInstr(ti_var, (const char *) element->properties->children->content, 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "case-of"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = element->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *) i->children->content) - 1;
+      }
+    }
+      
+    evalStringCache[element] = TransferInstr(ti_case_of_tl, (const char *) part, pos);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "concat"))
+  { 
+    string value;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+        value.append(evalString(i));
+      }
+    }
+    return value;
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "chunk"))
+  {
+    return processChunk(element);
+  }  
+  else
+  {
+    wcerr << "Error: unexpected rvalue expression '" << element->name << "'" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  return evalString(element);
+}
+
+void
+Interchunk::processOut(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "chunk"))
+      {
+        fputws_unlocked(UtfConverter::fromUtf8(processChunk(i)).c_str(), output);
+      }
+      else // 'b'
+      {
+        fputws_unlocked(UtfConverter::fromUtf8(evalString(i)).c_str(), output);
+      }
+    }
+  }
+}
+
+string
+Interchunk::processChunk(xmlNode *localroot)
+{
+  string result;
+  result.append("^");
+  
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      result.append(evalString(i));
+    }      
+  }
+  
+  result.append("$");
+  return result;
+}
+
+void
+Interchunk::processInstruction(xmlNode *localroot)
+{
+  if(!xmlStrcmp(localroot->name, (const xmlChar *) "choose"))
+  {
+    processChoose(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "let"))
+  {
+    processLet(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "append"))
+  {
+    processAppend(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "out"))
+  {
+    processOut(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "call-macro"))
+  {
+    processCallMacro(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "modify-case"))
+  {
+    processModifyCase(localroot);
+  }
+}
+
+void
+Interchunk::processLet(xmlNode *localroot)
+{
+  xmlNode *leftSide = NULL, *rightSide = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(leftSide == NULL)
+      {
+	leftSide = i;
+      }
+      else
+      {
+	rightSide = i;
+	break;
+      }
+    }
+  }
+
+  map<xmlNode *, TransferInstr>::iterator it = evalStringCache.find(leftSide);
+  if(it != evalStringCache.end())
+  {
+    TransferInstr &ti = it->second;
+    switch(ti.getType())
+    {
+      case ti_var:
+        variables[ti.getContent()] = evalString(rightSide);
+        return;
+        
+      case ti_clip_tl:
+        word[ti.getPos()]->setChunkPart(attr_items[ti.getContent()], evalString(rightSide));
+        return;      
+        
+      default:
+        return;
+    }
+  }
+  if(!xmlStrcmp(leftSide->name, (const xmlChar *) "var"))
+  {
+    string const val = (const char *) leftSide->properties->children->content;
+    variables[val] = evalString(rightSide);
+    evalStringCache[leftSide] = TransferInstr(ti_var, val, 0);
+  }
+  else if(!xmlStrcmp(leftSide->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = leftSide->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *) i->children->content) - 1;
+      }
+    }
+    
+
+    word[pos]->setChunkPart(attr_items[(const char *) part], 
+			    evalString(rightSide));
+    evalStringCache[leftSide] = TransferInstr(ti_clip_tl, 
+					      (const char *) part, 
+					      pos, NULL);
+  }
+}
+
+void
+Interchunk::processAppend(xmlNode *localroot)
+{
+  string name;
+  for(xmlAttr *i = localroot->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "n"))
+    {
+      name = (char *) i->children->content; 
+      break;
+    }
+  }
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      variables[name].append(evalString(i));
+    }
+  }
+}
+
+void
+Interchunk::processModifyCase(xmlNode *localroot)
+{
+  xmlNode *leftSide = NULL, *rightSide = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(leftSide == NULL)
+      {
+	leftSide = i;
+      }
+      else
+      {
+	rightSide = i;
+	break;
+      }
+    }
+  }
+
+  if(leftSide->name != NULL && !xmlStrcmp(leftSide->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = leftSide->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *) i->children->content) - 1;
+      }
+    }
+
+    string const result = copycase(evalString(rightSide), 
+				   word[pos]->chunkPart(attr_items[(const char *) part]));
+    word[pos]->setChunkPart(attr_items[(const char *) part], result);
+  }
+  else if(!xmlStrcmp(leftSide->name, (const xmlChar *) "var"))
+  {
+    string const val = (const char *) leftSide->properties->children->content;
+    variables[val] = copycase(evalString(rightSide), variables[val]);
+  }
+}
+
+void
+Interchunk::processCallMacro(xmlNode *localroot)
+{
+  const char *n = (const char *) localroot->properties->children->content;
+  int npar = 0;
+
+  xmlNode *macro = macro_map[macros[n]];
+
+  for(xmlAttr *i = macro->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "npar"))
+    {
+      npar = atoi((const char *) i->children->content);
+      break;
+    }
+  }
+
+  // ToDo: Is it at all valid if npar <= 0 ?
+
+  InterchunkWord **myword = NULL;
+  if(npar > 0)
+  {
+    myword = new InterchunkWord *[npar];
+  }
+  string **myblank = NULL;
+  if(npar > 0)
+  {
+    myblank = new string *[npar];
+    myblank[npar-1] = &emptyblank;
+  }
+
+  int idx = 0;
+  int lastpos = 0;
+  for(xmlNode *i = localroot->children; npar && i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      int pos = atoi((const char *) i->properties->children->content)-1;
+      myword[idx] = word[pos];
+      if(idx-1 >= 0)
+      {
+        myblank[idx-1] = blank[lastpos];
+      }
+      idx++;
+      lastpos = pos;
+    }
+  }
+
+  swap(myword, word);
+  swap(myblank, blank);
+  swap(npar, lword);
+
+  for(xmlNode *i = macro->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      processInstruction(i);
+    }
+  }
+
+  swap(myword, word);
+  swap(myblank, blank);
+  swap(npar, lword);
+
+  delete[] myword;
+  delete[] myblank;
+}
+
+void
+Interchunk::processChoose(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "when"))
+      {
+        bool picked_option = false;
+        
+	for(xmlNode *j = i->children; j != NULL; j = j->next)
+	{
+	  if(j->type == XML_ELEMENT_NODE)
+	  {
+	    if(!xmlStrcmp(j->name, (const xmlChar *) "test"))
+	    {
+	      if(!processTest(j))
+	      {
+		break;
+	      }
+	      else
+	      {
+	        picked_option = true;
+              }
+	    }
+	    else
+	    {
+	      processInstruction(j);
+	    }
+	  }
+	}
+        if(picked_option)
+        {
+          return;
+        }	
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "otherwise"))
+      {
+	for(xmlNode *j = i->children; j != NULL; j = j->next)
+	{
+	  if(j->type == XML_ELEMENT_NODE)
+	  {
+	    processInstruction(j);
+	  }
+	}
+      }
+    }
+  }
+}
+
+bool
+Interchunk::processLogical(xmlNode *localroot)
+{
+  if(!xmlStrcmp(localroot->name, (const xmlChar *) "equal"))
+  {
+    return processEqual(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "begins-with"))
+  {
+    return processBeginsWith(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "begins-with-list"))
+  {
+    return processBeginsWithList(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "ends-with"))
+  {
+    return processEndsWith(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "ends-with-list"))
+  {
+    return processEndsWithList(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "contains-substring"))
+  {
+    return processContainsSubstring(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "or"))
+  {
+    return processOr(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "and"))
+  {
+    return processAnd(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "not"))
+  {
+    return processNot(localroot);
+  } 
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "in"))
+  {
+    return processIn(localroot);
+  }
+
+  return false;
+}
+
+bool
+Interchunk::processIn(xmlNode *localroot)
+{
+  xmlNode *value = NULL;
+  xmlChar *idlist = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    { 
+      if(value == NULL)
+      {
+	value = i;
+      }
+      else
+      {
+	idlist = i->properties->children->content;
+	break;
+      }
+    }
+  }
+
+  string sval = evalString(value);
+
+  if(localroot->properties != NULL)
+  {
+    if(!xmlStrcmp(localroot->properties->children->content, 
+		  (const xmlChar *) "yes"))
+    {
+      set<string, Ltstr> &myset = listslow[(const char *) idlist];
+      if(myset.find(tolower(sval)) != myset.end())
+      {
+	return true;
+      }
+      else
+      {
+	return false;
+      }
+    }
+  }
+
+  set<string, Ltstr> &myset = lists[(const char *) idlist];
+  if(myset.find(sval) != myset.end())
+  {
+    return true;
+  }
+  else
+  {
+    return false;
+  }
+}
+
+bool
+Interchunk::processTest(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      return processLogical(i);
+    }
+  }  
+  return false;
+}
+
+bool
+Interchunk::processAnd(xmlNode *localroot)
+{
+  bool val = true;
+  for(xmlNode *i = localroot->children; val && i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      val = val && processLogical(i);
+    }
+  }
+
+  return val;
+}
+
+bool
+Interchunk::processOr(xmlNode *localroot)
+{
+  bool val = false;
+  for(xmlNode *i = localroot->children; !val && i != NULL ; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      val = val || processLogical(i);
+    }
+  }
+
+  return val;
+}
+
+bool
+Interchunk::processNot(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      return !processLogical(i);
+    }
+  }
+  return false;
+}
+
+bool
+Interchunk::processEqual(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return evalString(first) == evalString(second);
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return tolower(evalString(first)) == tolower(evalString(second));
+    }
+    else
+    {
+      return evalString(first) == evalString(second);
+    }
+  }
+}
+
+bool
+Interchunk::beginsWith(string const &s1, string const &s2) const
+{
+  int const limit = s2.size(), constraint = s1.size();
+  
+  if(constraint < limit)
+  {
+    return false;
+  }
+  for(int i = 0; i != limit; i++)
+  {
+    if(s1[i] != s2[i])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+bool
+Interchunk::endsWith(string const &s1, string const &s2) const
+{
+  int const limit = s2.size(), constraint = s1.size();
+  
+  if(constraint < limit)
+  {
+    return false;
+  }
+  for(int i = limit-1, j = constraint - 1; i >= 0; i--, j--)
+  {
+    if(s1[j] != s2[i])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+
+bool
+Interchunk::processBeginsWith(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return beginsWith(evalString(first), evalString(second));
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return beginsWith(tolower(evalString(first)), tolower(evalString(second)));
+    }
+    else
+    {
+      return beginsWith(evalString(first), evalString(second));
+    }
+  }
+}
+
+bool
+Interchunk::processEndsWith(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return endsWith(evalString(first), evalString(second));
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return endsWith(tolower(evalString(first)), tolower(evalString(second)));
+    }
+    else
+    {
+      return endsWith(evalString(first), evalString(second));
+    }
+  }
+}
+
+bool
+Interchunk::processBeginsWithList(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  xmlChar *idlist = second->properties->children->content;
+  string needle = evalString(first);
+  set<string, Ltstr>::iterator it, limit;
+
+  if(localroot->properties == NULL || 
+     xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+  {
+    it = lists[(const char *) idlist].begin();
+    limit = lists[(const char *) idlist].end();
+  }
+  else
+  {
+    needle = tolower(needle);
+    it = listslow[(const char *) idlist].begin();
+    limit = listslow[(const char *) idlist].end();
+  }
+  
+  for(; it != limit; it++)
+  {
+    if(beginsWith(needle, *it))
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool
+Interchunk::processEndsWithList(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  xmlChar *idlist = second->properties->children->content;
+  string needle = evalString(first);
+  set<string, Ltstr>::iterator it, limit;
+
+  if(localroot->properties == NULL || 
+     xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+  {
+    it = lists[(const char *) idlist].begin();
+    limit = lists[(const char *) idlist].end();
+  }
+  else
+  {
+    needle = tolower(needle);
+    it = listslow[(const char *) idlist].begin();
+    limit = listslow[(const char *) idlist].end();
+  }
+  
+  for(; it != limit; it++)
+  {
+    if(endsWith(needle, *it))
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool
+Interchunk::processContainsSubstring(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return evalString(first).find(evalString(second)) != string::npos;
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return tolower(evalString(first)).find(tolower(evalString(second))) != string::npos;
+    }
+    else
+    {
+      return evalString(first).find(evalString(second)) != string::npos;
+    }
+  }
+}
+
+string
+Interchunk::copycase(string const &source_word, string const &target_word)
+{
+  wstring result;
+  wstring const s_word = UtfConverter::fromUtf8(source_word);
+  wstring const t_word = UtfConverter::fromUtf8(target_word);
+
+  bool firstupper = iswupper(s_word[0]);
+  bool uppercase = firstupper && iswupper(s_word[s_word.size()-1]);
+  bool sizeone = s_word.size() == 1;
+
+  if(!uppercase || (sizeone && uppercase))
+  {
+    result = StringUtils::tolower(t_word);
+  }
+  else
+  {
+    result = StringUtils::toupper(t_word);
+  }
+  
+  if(firstupper)
+  {
+    result[0] = towupper(result[0]);
+  }
+   
+  return UtfConverter::toUtf8(result);
+}
+
+string 
+Interchunk::caseOf(string const &str)
+{
+  wstring const s = UtfConverter::fromUtf8(str);
+
+  if(s.size() > 1)
+  {
+    if(!iswupper(s[0]))
+    {
+      return "aa";
+    }
+    else if(!iswupper(s[s.size()-1]))
+    {
+      return "Aa";
+    }
+    else
+    {
+      return "AA";
+    }
+  }
+  else if(s.size() == 1)
+  {
+    if(!iswupper(s[0]))
+    {
+      return "aa";
+    }
+    else
+    {
+      return "Aa";
+    }
+  }
+  else
+  {
+    return "aa";
+  }
+}
+
+string
+Interchunk::tolower(string const &str) const
+{
+  return UtfConverter::toUtf8(StringUtils::tolower(UtfConverter::fromUtf8(str)));
+}
+
+string
+Interchunk::tags(string const &str) const
+{
+  string result = "<";
+
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+    if(str[i] == '.')
+    {
+      result.append("><");
+    }
+    else
+    {
+      result += str[i];
+    }
+  }
+  
+  result += '>';
+
+  return result;
+}
+
+void
+Interchunk::processRule(xmlNode *localroot)
+{
+  // localroot is suposed to be an 'action' tag
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      processInstruction(i);
+    }
+  }
+}
+
+TransferToken &
+Interchunk::readToken(FILE *in)
+{
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wstring content;
+  while(true)
+  {
+    int val = fgetwc_unlocked(in);
+    if(feof(in) || (internal_null_flush && val == 0))
+    {
+      return input_buffer.add(TransferToken(content, tt_eof));
+    }
+    if(val == L'\\')
+    {  
+      content += L'\\';
+      content += wchar_t(fgetwc_unlocked(in));
+    }
+    else if(val == L'[')
+    {
+      content += L'[';
+      while(true)
+      {
+	int val2 = fgetwc_unlocked(in);
+	if(val2 == L'\\')
+	{
+	  content += L'\\';
+	  content += wchar_t(fgetwc_unlocked(in));
+	}
+	else if(val2 == L']')
+	{
+	  content += L']';
+	  break;
+	}
+	else
+	{
+	  content += wchar_t(val2);
+	}
+      }
+    }
+    else if(inword && val == L'{')
+    {
+      content += L'{';
+      while(true)
+      {
+	int val2 = fgetwc_unlocked(in);
+	if(val2 == L'\\')
+	{
+	  content += L'\\';
+	  content += wchar_t(fgetwc_unlocked(in));
+	}
+	else if(val2 == L'}')
+	{
+	  wint_t val3 = wchar_t(fgetwc_unlocked(in));
+	  ungetwc(val3, in);
+	  
+	  content += L'}';
+	  if(val3 == L'$')
+	  {
+	    break;  
+	  }
+	}
+	else
+	{
+	  content += wchar_t(val2);
+	}
+      }
+    }
+    else if(inword && val == L'$')
+    {
+      inword = false;
+      return input_buffer.add(TransferToken(content, tt_word));
+    }
+    else if(val == L'^')
+    {
+      inword = true;
+      return input_buffer.add(TransferToken(content, tt_blank));
+    }
+    else
+    {
+      content += wchar_t(val);
+    }
+  }
+}
+
+bool
+Interchunk::getNullFlush(void)
+{
+  return null_flush;
+}
+
+void
+Interchunk::setNullFlush(bool null_flush)
+{
+  this->null_flush = null_flush;
+}
+
+void
+Interchunk::setTrace(bool trace)
+{
+  this->trace = trace;
+}
+
+void
+Interchunk::interchunk_wrapper_null_flush(FILE *in, FILE *out)
+{
+  null_flush = false;
+  internal_null_flush = true;
+  
+  while(!feof(in))
+  {
+    interchunk(in, out);
+    fputwc_unlocked(L'\0', out);
+    int code = fflush(out);
+    if(code != 0)
+    {
+      wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+  internal_null_flush = false;
+  null_flush = true;
+}    
+
+
+void
+Interchunk::interchunk(FILE *in, FILE *out)
+{
+  if(getNullFlush())
+  {
+    interchunk_wrapper_null_flush(in, out);
+  }
+  
+  int last = 0;
+
+  output = out;
+  ms.init(me->getInitial());
+  
+  while(true)
+  {
+    if(ms.size() == 0)
+    {
+      if(lastrule != NULL)
+      {
+	applyRule();
+	input_buffer.setPos(last);
+      }
+      else
+      {
+	if(tmpword.size() != 0)
+	{
+          fputwc_unlocked(L'^', output);
+          fputws_unlocked(tmpword[0]->c_str(), output);
+          fputwc_unlocked(L'$', output);
+	  tmpword.clear();
+	  input_buffer.setPos(last);
+	  input_buffer.next();       
+	  last = input_buffer.getPos();
+	  ms.init(me->getInitial());
+	}
+	else if(tmpblank.size() != 0)
+	{
+	  fputws_unlocked(tmpblank[0]->c_str(), output);
+	  tmpblank.clear();
+	  last = input_buffer.getPos();
+	  ms.init(me->getInitial());
+	}
+      }
+    }
+    int val = ms.classifyFinals(me->getFinals());
+    if(val != -1)
+    {
+      lastrule = rule_map[val-1];      
+      last = input_buffer.getPos();
+
+      if(trace)
+      {
+        wcerr << endl << L"apertium-interchunk: Rule " << val << L" ";
+        for (unsigned int ind = 0; ind < tmpword.size(); ind++)
+        {
+          if (ind != 0)
+          {
+            wcerr << L" ";
+          }
+          wcerr << *tmpword[ind];
+        }
+        wcerr << endl;
+      }
+    }
+
+    TransferToken &current = readToken(in);
+   
+    switch(current.getType())
+    {
+      case tt_word:
+	applyWord(current.getContent());
+        tmpword.push_back(&current.getContent());
+	break;
+
+      case tt_blank:
+	ms.step(L' ');
+	tmpblank.push_back(&current.getContent());
+	break;
+
+      case tt_eof:
+	if(tmpword.size() != 0)
+	{
+	  tmpblank.push_back(&current.getContent());
+	  ms.clear();
+	}
+	else
+	{
+	  fputws_unlocked(current.getContent().c_str(), output);
+	  tmpblank.clear();
+	  return;
+	}
+	break;
+
+      default:
+	wcerr << "Error: Unknown input token." << endl;
+	return;
+    }
+  }
+}
+
+void
+Interchunk::applyRule()
+{
+  unsigned int limit = tmpword.size();
+  
+  for(unsigned int i = 0; i != limit; i++)
+  {
+    if(i == 0)
+    {
+      word = new InterchunkWord *[limit];
+      lword = limit;
+      if(limit != 1)
+      {
+        blank = new string *[limit - 1];
+        lblank = limit - 1;
+      }
+      else
+      {
+        blank = NULL;
+        lblank = 0;
+      }
+    }
+    else
+    {
+      blank[i-1] = new string(UtfConverter::toUtf8(*tmpblank[i-1]));
+    }
+    
+    word[i] = new InterchunkWord(UtfConverter::toUtf8(*tmpword[i]));
+  }
+
+  processRule(lastrule);
+  lastrule = NULL;
+
+  if(word)
+  {
+    for(unsigned int i = 0; i != limit; i++)
+    {
+      delete word[i];
+    }
+    delete[] word;
+  }
+  if(blank)
+  {
+    for(unsigned int i = 0; i != limit - 1; i++)
+    {
+      delete blank[i];
+    }
+    delete[] blank;
+  }
+  word = NULL;
+  blank = NULL;
+  tmpword.clear();
+  tmpblank.clear();
+  ms.init(me->getInitial());
+}
+
+void
+Interchunk::applyWord(wstring const &word_str)
+{
+  ms.step(L'^');
+  for(unsigned int i = 0, limit = word_str.size(); i < limit; i++)
+  {
+    switch(word_str[i])
+    {
+      case L'\\':
+        i++;
+	ms.step(towlower(word_str[i]), any_char);
+	break;
+
+      case L'<':
+	for(unsigned int j = i+1; j != limit; j++)
+	{
+	  if(word_str[j] == L'>')
+	  {
+	    int symbol = alphabet(word_str.substr(i, j-i+1));
+	    if(symbol)
+	    {
+	      ms.step(symbol, any_tag);
+	    }
+	    else
+	    {
+	      ms.step(any_tag);
+	    }
+	    i = j;
+	    break;
+	  }
+	}
+	break;
+	
+      case L'{':  // ignore the unmodifiable part of the chunk
+        ms.step(L'$');
+        return;
+	
+      default:
+	ms.step(towlower(word_str[i]), any_char);
+	break;
+    }
+  }
+  ms.step(L'$');
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_data.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_data.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_data.cc	(revision 70339)
@@ -0,0 +1,527 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/lextor_data.h>
+#include <apertium/string_utils.h>
+#include <apertium/lextor_word.h>
+#include <apertium/lextor.h>
+
+#include <lttoolbox/compression.h>
+#include <apertium/endian_double_util.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+LexTorData::LexTorData() {
+  n_stopwords=0;
+  n_words=0;
+  n_words_per_set=0;
+  n_set=0;
+
+  index2word.push_back(NULLWORD);
+  word2index[NULLWORD]=0;
+  n_words++;
+}
+  
+LexTorData::LexTorData(const LexTorData& ltd) {
+  n_stopwords=ltd.n_stopwords;
+  n_words=ltd.n_words;
+  n_words_per_set=ltd.n_words_per_set;
+  n_set=ltd.n_set;
+
+  word2index=ltd.word2index;
+  index2word=ltd.index2word;
+
+  lexchoice_set=ltd.lexchoice_set;
+  lexchoice_sum=ltd.lexchoice_sum;
+  //lexchoice_prob=ltd.lexchoice_prob;
+
+  stopwords=ltd.stopwords;
+  words=ltd.words;
+  lexical_choices=ltd.lexical_choices;
+  reduced_lexical_choices=ltd.reduced_lexical_choices;
+}
+  
+LexTorData::~LexTorData() {
+}
+
+COUNT_DATA_TYPE
+LexTorData::vote_from_word(const wstring& lexical_choice, const wstring& word) {
+  WORD_DATA_TYPE ind_lexchoice=word2index[StringUtils::tolower(lexical_choice)];
+  WORD_DATA_TYPE ind_word=word2index[StringUtils::tolower(word)];
+
+  //To avoid creating a null entry in lexchoice_set[lexical_choice]
+  if (lexchoice_set[ind_lexchoice].find(ind_word)==lexchoice_set[ind_lexchoice].end())
+    return 0;
+  else
+    return lexchoice_set[ind_lexchoice][ind_word];
+}
+
+//double 
+//LexTorData::get_lexchoice_prob(const string& lexical_choice) {
+//  return lexchoice_prob[word2index[lexical_choice]];
+//}
+
+
+void 
+LexTorData::set_wordcount(const wstring& word, COUNT_DATA_TYPE c) {
+  WORD_DATA_TYPE ind_word=word2index[StringUtils::tolower(word)];
+  wordcount[ind_word]=c;
+}
+
+COUNT_DATA_TYPE 
+LexTorData::get_wordcount(const wstring& word) {
+  WORD_DATA_TYPE ind_word=word2index[StringUtils::tolower(word)];
+
+  if (wordcount.find(ind_word)==wordcount.end())
+    return 0;
+  else
+    return wordcount[ind_word];
+}
+
+COUNT_DATA_TYPE
+LexTorData::get_lexchoice_sum(const wstring& lexical_choice) {
+  return lexchoice_sum[word2index[StringUtils::tolower(lexical_choice)]];
+}
+
+void 
+LexTorData::set_lexchoice_sum(const wstring& lexical_choice, COUNT_DATA_TYPE sum) {
+  lexchoice_sum[word2index[StringUtils::tolower(lexical_choice)]]=sum;
+}
+
+bool
+LexTorData::is_stopword(const wstring& word) {
+  return (stopwords.find(StringUtils::tolower(word))!=stopwords.end());
+}
+
+void 
+LexTorData::read(FILE *is) {
+  //wcerr<<"LexTorData::read------------------------------------\n";
+  n_stopwords=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+  n_words=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+  n_words_per_set=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+  n_set=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+
+  //wcerr<<n_stopwords<<"\n";
+  //wcerr<<n_words<<"\n";
+  //wcerr<<n_words_per_set<<"\n";
+  //wcerr<<n_set<<"\n";
+
+
+  //Read the set of stopwords
+  //wcerr<<"stopwords--------------------------------------------\n";
+  for (unsigned int i=0; i<n_stopwords; i++) {
+    stopwords.insert(Compression::wstring_read(is));
+    //wcerr<<"len: "<<len<<" str: "<<str<<"\n";
+  }
+
+  //Read the list of words
+  //wcerr<<"list of words----------------------------------------\n";
+  for(unsigned int i=1; i<n_words; i++) {
+    wstring str = Compression::wstring_read(is);
+    index2word.push_back(str);
+    word2index[str]=i;
+    wordcount[i]=EndianDoubleUtil::read(is);
+    //wcerr<<"len: "<<len<<" str: "<<str<<" index: "<<i<<" word_count: "<<wordcount[i]<<"\n";
+  }
+
+  //Read data of each set associate to each lexical choice (or word)
+  for(unsigned int i=0; i<n_set; i++) {
+    WORD_DATA_TYPE lexchoice;
+    COUNT_DATA_TYPE sum;
+    //double prob;
+
+    lexchoice=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+    sum=EndianDoubleUtil::read(is);
+
+    //wcerr<<"lexchoice: "<<lexchoice<<" sum: "<<sum<<" "<<index2word[lexchoice]<<"\n";
+
+    reduced_lexical_choices.insert(index2word[lexchoice]);
+
+    lexchoice_sum[lexchoice]=sum;
+    //lexchoice_prob[lexchoice]=prob;
+
+    /////lexical_choices.insert(index2word[lexchoice]);
+
+    for(unsigned int j=0; j<n_words_per_set; j++) {
+      WORD_DATA_TYPE word;
+      COUNT_DATA_TYPE count;
+
+      word=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+      count=EndianDoubleUtil::read(is);
+      //wcerr<<"     word: "<<word<<" count: "<<count<<"\n";
+      lexchoice_set[lexchoice][word]=count;
+    }
+  }
+
+  //First we read the number of words to take into account
+  WORD_DATA_TYPE nwords2workwith;
+
+  nwords2workwith=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+  for (unsigned int i=0; i<nwords2workwith; i++) {
+    WORD_DATA_TYPE word;
+
+    word=(WORD_DATA_TYPE)Compression::multibyte_read(is);
+    words.insert(index2word[word]);
+    //wcerr<<"word: "<<index2word[word]<<"\n";
+  }
+}
+
+void 
+LexTorData::write(FILE *os) {
+  //wcerr<<"LexTorData::write------------------------------------\n";
+  //wcerr<<n_stopwords<<"\n";
+  //wcerr<<n_words<<"\n";
+  //wcerr<<n_words_per_set<<"\n";
+  //wcerr<<n_set<<"\n";
+  Compression::multibyte_write(n_stopwords, os);
+  Compression::multibyte_write(n_words, os);
+  Compression::multibyte_write(n_words_per_set, os);
+  Compression::multibyte_write(n_set, os);
+
+  //Write the set of stopwords
+  //wcerr<<"stopwords--------------------------------------------\n";
+  set<wstring>::iterator it;
+  for (it=stopwords.begin(); it!=stopwords.end(); it++) {
+    Compression::wstring_write(*it, os);
+  }
+
+  //Write the list of words
+  //wcerr<<"list of words----------------------------------------\n";
+  for(unsigned int i=1; i<index2word.size(); i++) {
+    Compression::wstring_write(index2word[i], os);
+    EndianDoubleUtil::write(os, wordcount[i]);
+  }
+
+  //Write data of each set associate to each lexical choice (or word)
+  map<WORD_DATA_TYPE, map<WORD_DATA_TYPE, COUNT_DATA_TYPE> >::iterator it_lch_set;
+  map<WORD_DATA_TYPE, COUNT_DATA_TYPE>::iterator it_w_lch_set;
+  //map<WORD_DATA_TYPE, double>::iterator it_lch_prob;
+
+  for(it_lch_set=lexchoice_set.begin(); it_lch_set!=lexchoice_set.end(); it_lch_set++) {
+    WORD_DATA_TYPE lexchoice=it_lch_set->first;
+    COUNT_DATA_TYPE sum=lexchoice_sum[lexchoice];
+    //double prob=lexchoice_prob[lexchoice];
+
+    //wcerr<<"lexchoice: "<<lexchoice<<" sum: "<<sum<<" "<<index2word[lexchoice]<<"\n";
+    Compression::multibyte_write(lexchoice, os);    
+    //os.write(reinterpret_cast<char * const> (&prob), sizeof(double));
+    EndianDoubleUtil::write(os, sum);
+
+    int nwritten_words=0;
+    for(it_w_lch_set=it_lch_set->second.begin(); 
+        it_w_lch_set!=it_lch_set->second.end(); 
+        it_w_lch_set++) {
+      WORD_DATA_TYPE word=it_w_lch_set->first;
+      COUNT_DATA_TYPE count=it_w_lch_set->second;
+      //wcerr<<"     word: "<<word<<" count: "<<count<<"\n";
+      Compression::multibyte_write(word, os);
+      EndianDoubleUtil::write(os, count);
+      nwritten_words++;
+    }
+
+    //If there were less written words than expected
+    while (nwritten_words<n_words_per_set){
+      WORD_DATA_TYPE word=word2index[NULLWORD];
+      COUNT_DATA_TYPE count=0;
+      //wcerr<<"     word: "<<word<<" count: "<<count<<"\n";
+      Compression::multibyte_write(word, os);
+      EndianDoubleUtil::write(os, count);
+      nwritten_words++;
+    }
+  }
+
+  //First we write the number of words to take into account
+  WORD_DATA_TYPE nwords2workwith=words.size();
+  Compression::multibyte_write(nwords2workwith, os);
+
+  set<wstring>::iterator sit;
+  for(sit=words.begin(); sit!=words.end(); sit++) {
+    WORD_DATA_TYPE word=word2index[*sit];
+    Compression::multibyte_write(word, os);
+    //wcerr<<"word: "<<*sit<<"\n";
+  }
+}
+
+void 
+LexTorData::read_stopwords(wistream& is) {
+  while (!is.eof()) {
+    wstring w;
+    getline(is,w);
+    w=StringUtils::tolower(w);
+    if (w.length()>0) {
+      stopwords.insert(w);
+      wcerr<<L"stopword: "<<w<<L"\n";
+    }
+  }
+  n_stopwords=stopwords.size();
+  wcerr<<L"# stopwords read from file: "<<n_stopwords<<L"\n";
+}  
+
+void 
+LexTorData::read_words(wistream& is) {
+  while(!is.eof()) {
+    wstring w;
+    getline(is,w);
+    w=StringUtils::tolower(w);
+    if (w.length()>0) {
+      words.insert(w);
+      new_word_register(w);
+    }
+  }
+  n_set=words.size();
+  wcerr<<L"# words: "<<n_set<<L"\n";
+}
+
+void 
+LexTorData::read_lexical_choices(FSTProcessor& fstp) {
+  set<wstring>::iterator it;
+  int nlexchoices=0;
+
+  for(it=words.begin(); it!=words.end(); it++) {
+    LexTorWord ambiguousword(*it, &fstp);
+    nlexchoices+=ambiguousword.n_lexical_choices();
+
+    for(int i=0; i<ambiguousword.n_lexical_choices(); i++) {
+      lexical_choices[*it].insert(ambiguousword.get_lexical_choice(i,false));
+      //lexical_choices[*it].insert(reduce_lexical_choice(ambiguousword.get_lexical_choice(i,false)));
+    }
+  }
+
+  n_set=nlexchoices;
+
+  wcerr<<L"# lexical choices: "<<n_set<<L"\n";
+}
+
+set<wstring>
+LexTorData::get_words() {
+  return words;
+}
+
+set<wstring> 
+LexTorData::get_lexical_choices(const wstring& word) {
+  return lexical_choices[StringUtils::tolower(word)];
+}
+
+void 
+LexTorData::set_nwords_per_set(int i){
+  n_words_per_set=i;
+  wcerr<<L"# words per co-ocurrence model: "<<n_words_per_set<<L"\n";
+}
+
+void 
+LexTorData::set_cooccurrence_context(const wstring& lexical_choice, 
+                                     const vector<pair<wstring, COUNT_DATA_TYPE> >& context) {
+  wcerr<<L"Co-occurrence model for lexical_choice/word: "<<lexical_choice<<L"\n";
+
+  if (context.size()==0) {
+    wcerr<<L"Warning: co-occurrence model for lexical_choice/word: "<<lexical_choice<<L" is empty\n";
+    wcerr<<L"It seems that training corpus is too small or thematically homogeneous\n";
+    n_set--;
+  }
+
+  new_word_register(lexical_choice);
+
+  for (unsigned int i=0; ((i<n_words_per_set)&&(i<context.size())); i++) {
+    wcerr<<context[i].first<<L" "<<context[i].second<<L"\n";
+
+    new_word_register(context[i].first);
+
+    lexchoice_set[word2index[StringUtils::tolower(lexical_choice)]][word2index[StringUtils::tolower(context[i].first)]]=context[i].second;
+
+    //////wordcount[word2index[StringUtils::tolower(context[i].first)]]+=context[i].second;
+  }
+}
+
+void
+LexTorData::ensure_stopwords_ok() {
+  set<wstring>::iterator its, itw;
+  set<wstring> swaux;
+
+  //Notice that stopwords consist of lemma and first tag while words
+  //consist of lemma and one (the first one) or more tags
+
+  for(its=stopwords.begin(); its!=stopwords.end(); its++) {
+    bool is_ok=true;
+    for(itw=words.begin(); itw!=words.end(); itw++) {
+      //wcerr<<"sw: "<<*its<<" w: "<<*itw<<"\n";
+      if (itw->find(*its)==0) {
+	wcerr<<L"Warning: Word '"<<*itw<<L"' for which co-ocurrence models will"
+	    <<L" be estimated is also a stopword. ";
+	wcerr<<L"Removing it from the stopwords list\n";
+	is_ok=false;
+	break;
+      }
+    }
+    if(is_ok)
+      swaux.insert(*its);
+  }
+
+  stopwords=swaux;
+
+  wcerr<<n_stopwords-stopwords.size()<<L" stopwords were discarded\n";
+
+  n_stopwords=stopwords.size();
+
+  wcerr<<L"# stopwords finally taken into account: "<<n_stopwords<<L"\n";
+}
+
+wstring 
+LexTorData::reduce(const wstring& s) {
+  wstring str;
+
+  if ((s.length()>0) && (s[0]=='^') && (s[s.length()-1]=='$'))
+    str=StringUtils::tolower(s.substr(1, s.length()-1));
+  else
+    str=StringUtils::tolower(s);
+
+  set<wstring>::iterator it;
+  for(it=words.begin(); it!=words.end(); it++) {
+    if (str.find(*it)==0) {
+      return (*it);
+    }
+  }
+
+  unsigned int p=str.find(L">");
+  unsigned int i=0;
+  if (p==static_cast<unsigned int>(wstring::npos)) { //s could correspond to an unknown word
+    p=str.length();
+    if ((str.length()>0) && (str[0]=='*'))
+      i=1; // to remove the star (unknown word mark)
+  }
+  else
+    p++;
+  
+  if (i>=p) {
+    wcerr<<L"Warning in LexTorData::reduce: input string: '"<<s<<L"', string after operation: '"<<str<<L"'\n";
+    wcerr<<L"begin index: "<<i<<", end index: "<<p<<L"\n";
+    i=0;
+  }
+
+  return str.substr(i,p);
+}
+
+wstring 
+LexTorData::reduce_lexical_choice(const wstring& s) {
+  wstring str;
+
+  if ((s.length()>0) && (s[0]=='^') && (s[s.length()-1]=='$'))
+    str=StringUtils::tolower(s.substr(1, s.length()-1));
+  else
+    str=StringUtils::tolower(s);
+
+  set<wstring>::iterator it;
+  for(it=reduced_lexical_choices.begin(); it!=reduced_lexical_choices.end(); it++) {
+    if (str.find(*it)==0) {
+      return (*it);
+    }
+  }
+
+  //return StringUtils::substitute(str," d<", " D<");
+
+  return str;
+}
+
+void 
+LexTorData::new_word_register(const wstring& word) {
+  wstring w=StringUtils::tolower(word);
+
+  if (word2index.find(w)==word2index.end()) {
+    index2word.push_back(w);
+    int ind=index2word.size()-1;
+    if (ind>MAX_WORD_INDEX) {
+      wcerr<<L"Error: The number of words to be considered is greater that the maximum allowed by\n";
+      wcerr<<L"the data type used to store words\n";
+      wcerr<<L"Edit source file LexTorData.H and change the WORD_DATA_TYPE define\n";
+      exit(EXIT_FAILURE);
+    }
+    word2index[w]=(WORD_DATA_TYPE)ind;
+    n_words=index2word.size();
+    wordcount[(WORD_DATA_TYPE)ind]=0;
+  }
+}
+
+/*
+vector<pair<WORD_DATA_TYPE, double> > 
+LexTorData::get_cooccurrence_vector(const string& lexical_choice) {
+  vector<pair<WORD_DATA_TYPE, double> > v;
+  WORD_DATA_TYPE ind_lexchoice=word2index[StringUtils::tolower(lexical_choice)];
+  map<WORD_DATA_TYPE, COUNT_DATA_TYPE>::iterator it;
+
+  for(it=lexchoice_set[ind_lexchoice].begin(); it!= lexchoice_set[ind_lexchoice].end(); it++) 
+    v.push_back(*it);
+  
+  return v;
+}
+*/
+
+
+double 
+LexTorData::get_module_lexchoice_vector(const wstring& lexical_choice) {
+  WORD_DATA_TYPE ind_lexchoice=word2index[StringUtils::tolower(lexical_choice)];
+  map<WORD_DATA_TYPE, COUNT_DATA_TYPE>::iterator it;
+
+  double module=0;
+
+  for(it=lexchoice_set[ind_lexchoice].begin(); it!= lexchoice_set[ind_lexchoice].end(); it++) 
+    module+=(it->second)*(it->second);
+
+  module=sqrt(module);
+
+  return module;
+}
+
+double 
+LexTorData::cosine(const wstring& reduced_lexch1, const wstring& reduced_lexch2) {
+  WORD_DATA_TYPE ind_lexchoice1=word2index[StringUtils::tolower(reduced_lexch1)];
+  WORD_DATA_TYPE ind_lexchoice2=word2index[StringUtils::tolower(reduced_lexch2)];
+  map<WORD_DATA_TYPE, COUNT_DATA_TYPE>::iterator it;
+
+  //We calculate the scalar product
+  double scalar_product=0;
+  for(it=lexchoice_set[ind_lexchoice1].begin(); it!= lexchoice_set[ind_lexchoice1].end(); it++) {
+    if (lexchoice_set[ind_lexchoice2].find(it->first)!=
+        lexchoice_set[ind_lexchoice2].end()) {
+      scalar_product+=(it->second)*lexchoice_set[ind_lexchoice2][it->first];
+    }
+  }
+
+  //We get the module of the lexchoice vectors, ||lexchoice vector||
+  double module_lexch1_vector=get_module_lexchoice_vector(reduced_lexch1);
+  double module_lexch2_vector=get_module_lexchoice_vector(reduced_lexch2);
+
+
+  if (module_lexch1_vector==0) {
+    if (LexTor::debug) {
+      wcerr<<L"Warning in LexTorData::cosine: module_lexch1_vector is equal zero.\n"
+	  <<L"The cosine cannot be compute\n";
+      wcerr<<L"reduced lexical choice: "<<reduced_lexch1<<L"\n";
+    }
+    return -2;
+  }
+
+  if (module_lexch2_vector==0) {
+    if (LexTor::debug) {
+      wcerr<<L"Warning in LexTorData::cosine: module_lexch2_vector is equal zero.\n"
+	  <<L"The cosine cannot be compute\n";
+      wcerr<<L"reduced lexical choice: "<<reduced_lexch2<<L"\n";
+    }
+    return -2;
+  }
+
+  return scalar_product/(module_lexch1_vector*module_lexch2_vector);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_eval.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_eval.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_eval.cc	(revision 70339)
@@ -0,0 +1,144 @@
+/*
+ * Copyright (C) 2004-2006 Felipe S�nchez-Mart�nez
+ * Copyright (C) 2006 Universitat d'Alacant
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <iostream>
+#include <cmath>
+#include <apertium/lextor_eval.h>
+#include <apertium/lextor.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+LexTorEval::LexTorEval(wistream* iref) {
+  nwords=0;
+  //nunknown=0;
+  nignored=0;
+  npol=0;
+  //nerrors_nopol=0;
+  nerrors_pol=0;
+  //nerrors_unk=0;
+
+  ndefault=0;
+
+  refer=iref;
+
+  //words2ignore.insert();
+  words2ignore.insert(L"as<cnjadv>");
+  words2ignore.insert(L"at<pr>");
+  words2ignore.insert(L"before<pr>");
+  words2ignore.insert(L"but<cnjcoo>");
+  words2ignore.insert(L"by<pr>");
+  words2ignore.insert(L"for<pr>");
+  words2ignore.insert(L"how<adv>");
+  words2ignore.insert(L"in<pr>");
+  words2ignore.insert(L"just<adv>");
+  words2ignore.insert(L"off<pr>");
+  words2ignore.insert(L"on<pr>");
+  words2ignore.insert(L"over<pr>");
+  words2ignore.insert(L"right<adv>");
+  words2ignore.insert(L"since<cnjadv>");
+  words2ignore.insert(L"whether<cnjadv>");
+}
+
+LexTorEval::~LexTorEval() {
+}
+
+void 
+LexTorEval::print_evaluation() {
+  wcerr<<L"# of words.......................................... "<<nwords<<L"\n"
+      <<L"# of ignored words.................................. "<<nignored<<L"\n"
+      <<L"# of polisemous words............................... "<<npol<<L"\n"
+      <<L"# of errors due to polisemous words................. "<<nerrors_pol<<L"\n"
+      <<L"# of times context does not discriminate (NODIS).... "<<ndefault<<L"\n"
+      <<L"% of polysemous words............................... "<<(npol/nwords)*100.0<<L" %\n"
+      <<L"% of error over polisemous words ................... "<<(nerrors_pol/npol)*100.0<<L" %\n"
+      <<L"% of error over all words .......................... "<<(nerrors_pol/nwords)*100.0<<L" %\n"
+      <<L"% of NODIS.......................................... "<<(ndefault/npol)*100.0<<L" %\n";
+  wcerr<<L"NOTE: # ignored words ARE NOT included in the rest of counts\n";
+
+  return;
+
+  wcerr<<L"\nReport by words:\n---------------------------------------\n";
+
+  map<wstring, double>::iterator it;
+  wcerr<<L"WORD\t\tOCCURR\tERROR\tDEFAULT\t%ERROR\t%DEFAULT\n";
+  wcerr<<L"-----------------------------------------------------------------\n";
+  for(it=nwords_per_word.begin(); it!=nwords_per_word.end(); it++) {
+    wcerr<<it->first<<L"\t"<<it->second<<L"\t"<<nerrors_per_word[it->first]<<L"\t"
+	<<ndefault_per_word[it->first]<<L"\t"<<(nerrors_per_word[it->first]/it->second)*100<<L"\t"
+	<<(ndefault_per_word[it->first]/it->second)*100<<L"\n";
+  }
+}
+
+void 
+LexTorEval::evalword(LexTorWord& ltword, int winner, LexTorData* lextor_data) {
+  wstring reduced_w=lextor_data->reduce(ltword.get_lexical_choice(winner,false));
+  wstring word=lextor_data->reduce(ltword.get_word_string());
+  wstring wref;
+  wstring reduced_wref;
+  bool ignore=false;
+
+  getline(*refer,wref);
+
+  //  if (words2ignore.find(word)!=words2ignore.end()) {
+  //  return;
+  //}
+
+  if (wref.find(L">__IGNORE") != wstring::npos) 
+    ignore=true;
+  
+  if (!ignore) {
+    nwords+=1.0;
+    reduced_wref=lextor_data->reduce(wref);
+    if (ltword. n_lexical_choices()>1) {
+      npol+=1.0;
+      nwords_per_word[word]+=1.0;
+      if (winner<0) {
+	ndefault+=1.0;
+	ndefault_per_word[word]+=1.0;
+      }
+      if (reduced_w!=reduced_wref) {
+	nerrors_pol+=1.0;
+	nerrors_per_word[word]+=1.0;
+	if (LexTor::debug) {
+	  wcerr<<L"========= ERROR\n";
+	}
+      } else {
+	if (LexTor::debug) {
+	  wcerr<<L"========= OK\n";
+	}
+      }
+    } else {
+      //if (LexTor::debug)
+      //  wcerr<<"EVAL: reduced_w="<<reduced_w<<" reduced_wref="<<reduced_wref<<"\n";
+
+      if(reduced_wref!=reduced_w) {
+	wcerr<<L"Error: Input and reference corpora are not aligned\n";
+	wcerr<<L"word="<<reduced_w<<L" ref. word="<<reduced_wref<<L"\n";
+	wcerr<<L"Number of words: "<<nwords+nignored<<L"\n";
+	exit(EXIT_FAILURE);
+      }
+    }
+  } else {
+    //reduced_wref=wref;
+    nignored+=1.0;
+    if (LexTor::debug) {
+      wcerr<<L"========= IGNORED\n";
+    }
+
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_word.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_word.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_word.cc	(revision 70339)
@@ -0,0 +1,182 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/lextor_word.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+LexTorWord::LexTorWord() {
+  ignored_string = L"";
+  word = L"";
+  default_choice = 0;
+}
+  
+LexTorWord::LexTorWord(const LexTorWord& ltw) {
+  word=ltw.word;
+  ignored_string=ltw.ignored_string;
+  lexical_choices=ltw.lexical_choices;
+  default_choice=ltw.default_choice;
+}
+
+LexTorWord::LexTorWord(const wstring &str, FSTProcessor *fstp) {
+  word=str;
+  ignored_string=L"";
+  extract_lexical_choices(fstp);
+}
+  
+LexTorWord::~LexTorWord() {
+}
+
+wstring 
+LexTorWord::get_word_string() {
+  return word;
+}
+
+int 
+LexTorWord::n_lexical_choices() {
+  return lexical_choices.size();
+}
+
+wstring 
+LexTorWord::get_lexical_choice(int choice, bool include_ignored) {
+  if (word == L"") {
+    if (include_ignored)
+      return ignored_string;
+    else 
+      return L"";
+  }
+
+  if (choice<0)
+    choice=default_choice;
+
+  if (choice>=(int)lexical_choices.size()) {
+    wcerr<<L"Error in LexTorWord::get_lexical_choice, choice position given is "
+	<<L"greater than the number of choices available\n";
+    wcerr<<L"position requested: "<<choice<<"\n";
+    wcerr<<L"number of lexical choices: "<<lexical_choices.size()<<"\n";
+    wcerr<<L"Returning default choice\n";
+    choice=default_choice;
+  }
+
+  if (include_ignored)
+    return ignored_string+L"^"+lexical_choices[choice]+L"$";
+  else
+    return lexical_choices[choice];
+}
+
+wstring 
+LexTorWord::translate(FSTProcessor& bildic, int lexchoice) {
+  wstring t;
+
+  //wcerr<<"In LexTorWord::translate, called with: "<<word<<", lexchoice: "<<lexchoice<<"\n";
+
+  if (lexchoice<0)
+    lexchoice=default_choice;
+  else if(lexchoice>=(int)lexical_choices.size()) {
+    wcerr<<L"Error in LexTorWord::translate, choice position given is "
+	 <<L"greater than the number of choices available\n";
+    wcerr<<L"position requested: "<<lexchoice<<"\n";
+    wcerr<<L"number of lexical choices: "<<lexical_choices.size()<<"\n";
+    wcerr<<L"Returning default choice\n";
+    lexchoice=default_choice;
+  }
+
+  t=bildic.biltrans(lexical_choices[lexchoice], false);
+
+  //wcerr<<"Translation: "<<t<<"\n";
+
+  return t;
+}
+
+void 
+LexTorWord::extract_lexical_choices(FSTProcessor *fstp) {
+
+  lexical_choices=StringUtils::split_wstring(fstp->biltrans(word,false), L"/");
+  default_choice=0;
+
+  if (lexical_choices.size()>1) { //lexically ambiguous word
+    for(unsigned int i=0; i<lexical_choices.size(); i++) {
+
+      unsigned int p=lexical_choices[i].find(L" D<");
+      if (p!=static_cast<unsigned int>(string::npos)) {
+	if (!((lexical_choices[i].length()>p+2) && (lexical_choices[i][p+2]=='<'))) {
+	  wcerr<<L"Error in LexTorWord::next_word when analyzing lexical options\n";
+	  wcerr<<L"Word: "<<word<<"; lexical choices: "<<fstp->biltrans(word,false)<<L"\n";
+	  exit(EXIT_FAILURE);
+	}
+	default_choice=i;
+      }
+    }
+  }
+}
+
+LexTorWord* 
+LexTorWord::next_word(wistream& is, FSTProcessor *fstp) {
+  LexTorWord w;
+  wchar_t c, prev_c=L' ';
+  bool finish=false;
+  bool reading_word=false;
+
+  while (!finish) {
+    is>>c;
+
+    if (is.fail()) {
+      if (reading_word) {
+	wcerr<<L"Error in LexTorWord::next_word while reading input word\n";
+	wcerr<<L"Malformed input string, at '"<<c<<L"'\n";
+	exit(EXIT_FAILURE);
+      } else {
+	if ((w.word.length()>0)||(w.ignored_string.length()>0)) {
+	  if(fstp!=NULL)
+	    w.extract_lexical_choices(fstp);
+	  return new LexTorWord(w);
+	} else 
+	  return NULL;
+      }
+    }
+
+    if ((c==L'^') && (prev_c!=L'\\') && (!reading_word)) {
+      reading_word=true;
+    } else if ((c==L'$') && (prev_c!=L'\\') && (reading_word)) {
+      finish=true;
+    } else {
+      if (reading_word)
+	w.word+=c;
+      else
+	w.ignored_string+=c;
+    }
+    prev_c=c;
+  }
+
+  if ((w.word.length()==0) && (w.ignored_string.length()==0))
+    return NULL;
+
+  if(fstp!=NULL)
+    w.extract_lexical_choices(fstp);
+
+  /*
+    wcerr<<"word: "<<w.word<<"\n";
+    for (unsigned int i=0; i<w.lexical_choices.size(); i++) {
+    wcerr<<"Lex choice at "<<i<<": "<<w.lexical_choices[i]<<"\n";
+    }
+    wcerr<<"Default: "<<w.default_choice<<"\n\n";
+  */
+
+  return new LexTorWord(w);
+}
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.cc	(revision 70339)
@@ -0,0 +1,2074 @@
+/*
+ * Copyright (C) 2005--2015 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/postchunk.h>
+#include <apertium/trx_reader.h>
+#include <apertium/utf_converter.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/xml_parse_util.h>
+
+#include <cctype>
+#include <cerrno>
+#include <iostream>
+#include <stack>
+#include <apertium/string_utils.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+using namespace Apertium;
+using namespace std;
+
+void
+Postchunk::destroy()
+{
+  if(me)
+  {
+    delete me;
+    me = NULL;
+  }
+  if(doc)
+  {
+    xmlFreeDoc(doc);
+    doc = NULL;
+  }  
+}
+
+Postchunk::Postchunk() :
+word(0),
+blank(0),
+lword(0),
+lblank(0),
+output(0),
+any_char(0),
+any_tag(0),
+nwords(0)
+{
+  me = NULL;
+  doc = NULL;
+  root_element = NULL;
+  lastrule = NULL;
+  inword = false;
+  null_flush = false;
+  internal_null_flush = false;
+}
+
+Postchunk::~Postchunk()
+{
+  destroy();
+}
+
+void 
+Postchunk::readData(FILE *in)
+{
+  alphabet.read(in);
+  any_char = alphabet(TRXReader::ANY_CHAR);
+  any_tag = alphabet(TRXReader::ANY_TAG);
+
+  Transducer t;
+  t.read(in, alphabet.size());
+  
+  map<int, int> finals;  
+  
+  // finals
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    int key = Compression::multibyte_read(in);
+    finals[key] = Compression::multibyte_read(in);
+  }  
+  
+  me = new MatchExe(t, finals);
+ 
+  // attr_items
+  bool recompile_attrs = Compression::string_read(in) != string(pcre_version());
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    attr_items[cad_k].read(in);
+    wstring fallback = Compression::wstring_read(in);
+    if(recompile_attrs) {
+      attr_items[cad_k].compile(UtfConverter::toUtf8(fallback));
+    }
+  }
+
+  // variables
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    variables[cad_k] = UtfConverter::toUtf8(Compression::wstring_read(in));
+  }
+
+  // macros
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    macros[cad_k] = Compression::multibyte_read(in);
+  }
+
+  // lists
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+
+    for(int j = 0, limit2 = Compression::multibyte_read(in); j != limit2; j++)
+    {
+      wstring const cad_v = Compression::wstring_read(in);
+      lists[cad_k].insert(UtfConverter::toUtf8(cad_v));
+      listslow[cad_k].insert(UtfConverter::toUtf8(StringUtils::tolower(cad_v)));
+    }  
+  }  
+}
+
+void
+Postchunk::read(string const &transferfile, string const &datafile)
+{
+  readPostchunk(transferfile);
+  
+  // datafile
+  FILE *in = fopen(datafile.c_str(), "rb");
+  if(!in)
+  {
+    wcerr << "Error: Could not open file '" << datafile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  readData(in);
+  fclose(in);
+
+}
+
+void
+Postchunk::readPostchunk(string const &in)
+{
+  doc = xmlReadFile(in.c_str(), NULL, 0);
+  
+  if(doc == NULL)
+  {
+    wcerr << "Error: Could not parse file '" << in << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  root_element = xmlDocGetRootElement(doc);
+  
+  // search for macros & rules
+  for(xmlNode *i = root_element->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "section-def-macros"))
+      {
+        collectMacros(i);
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "section-rules"))
+      {
+        collectRules(i);
+      }
+    } 
+  }
+}
+
+void
+Postchunk::collectRules(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      for(xmlNode *j = i->children; ; j = j->next)
+      {
+        if(j->type == XML_ELEMENT_NODE && !xmlStrcmp(j->name, (const xmlChar *) "action"))
+        {
+          rule_map.push_back(j);
+          break;
+        }
+      }
+    }
+  }
+}
+
+void
+Postchunk::collectMacros(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      macro_map.push_back(i);
+    }
+  }
+}
+
+bool
+Postchunk::checkIndex(xmlNode *element, int index, int limit)
+{
+  if(index > limit)
+  {
+    wcerr << L"Error in " << UtfConverter::fromUtf8((char *) doc->URL) <<L": line " << element->line << endl;
+    return false;
+  }
+  return true;
+}
+
+
+string 
+Postchunk::evalString(xmlNode *element)
+{
+  map<xmlNode *, TransferInstr>::iterator it;
+  it = evalStringCache.find(element);
+  if(it != evalStringCache.end())
+  {
+    TransferInstr &ti = it->second;
+    switch(ti.getType())
+    {
+      case ti_clip_tl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]);
+        }
+        break;
+        
+      case ti_lu_count:
+        return StringUtils::itoa_string(tmpword.size());
+
+      case ti_var:
+        return variables[ti.getContent()];
+        
+      case ti_lit_tag:
+      case ti_lit:
+        return ti.getContent();
+        
+      case ti_b:
+        if(checkIndex(element, ti.getPos(), lblank))
+        {
+          if(ti.getPos() >= 0)
+          {
+            return !blank?"":*(blank[ti.getPos()]);
+          }
+          return " ";
+        }
+        break;
+        
+      case ti_get_case_from:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return copycase(word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]),
+                          evalString((xmlNode *) ti.getPointer()));
+        }
+        break;
+        
+      case ti_case_of_tl:
+        if(checkIndex(element, ti.getPos(), lword))
+        {
+          return caseOf(word[ti.getPos()]->chunkPart(attr_items[ti.getContent()]));
+        }
+        break;
+        
+      default:
+        return "";
+    }
+    return "";
+  }
+
+  if(!xmlStrcmp(element->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = element->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *)i->children->content);
+      }
+    }
+
+    evalStringCache[element] = TransferInstr(ti_clip_tl, (const char *) part, pos, NULL);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lit-tag"))
+  {
+    evalStringCache[element] = TransferInstr(ti_lit_tag, 
+                                             tags((const char *) element->properties->children->content), 0);                                            
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lit"))
+  {
+    evalStringCache[element] = TransferInstr(ti_lit, string((char *) element->properties->children->content), 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "b"))
+  {
+    if(element->properties == NULL)
+    {
+      evalStringCache[element] = TransferInstr(ti_b, " ", -1);
+    }
+    else
+    {
+      int pos = atoi((const char *) element->properties->children->content) - 1;
+      evalStringCache[element] = TransferInstr(ti_b, "", pos);
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "get-case-from"))
+  {
+    int pos = atoi((const char *) element->properties->children->content);
+    xmlNode *param = NULL;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+	param = i;
+	break;
+      }
+    }
+
+    evalStringCache[element] = TransferInstr(ti_get_case_from, "lem", pos, param);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "var"))
+  {
+    evalStringCache[element] = TransferInstr(ti_var, (const char *) element->properties->children->content, 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lu-count"))
+  {
+    evalStringCache[element] = TransferInstr(ti_lu_count, "", 0);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "case-of"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = element->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *) i->children->content);
+      }
+    }
+      
+    evalStringCache[element] = TransferInstr(ti_case_of_tl, (const char *) part, pos);
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "concat"))
+  { 
+    string value;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+        value.append(evalString(i));
+      }
+    }
+    return value;
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "lu"))
+  {
+    string myword;
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+       if(i->type == XML_ELEMENT_NODE)
+       {
+         myword.append(evalString(i));
+       }
+    }
+    
+    if(myword != "")
+    {
+      return "^"+myword+"$";
+    }
+    else
+    {
+      return "";
+    }
+  }
+  else if(!xmlStrcmp(element->name, (const xmlChar *) "mlu"))
+  {
+    string value;
+     	  
+    bool first_time = true;
+    
+    for(xmlNode *i = element->children; i != NULL; i = i->next)
+    {
+      if(i->type == XML_ELEMENT_NODE)
+      {
+        string myword;
+	 
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+	  {
+            myword.append(evalString(j));
+	  }
+        }
+	      
+	if(!first_time)
+	{
+	  if(myword != "" && myword[0] != '#')  //'+#' problem
+	  {
+	    value.append("+");
+          }
+	}
+	else
+	{
+	  if(myword != "")
+	  {
+	    first_time = false;
+          }
+	}
+	 
+	value.append(myword);
+      }
+    }
+
+    if(value != "")
+    {
+      return "^"+value+"$";
+    }
+    else
+    {
+      return "";
+    }
+  }
+  
+  else
+  {
+    wcerr << "Error: unexpected rvalue expression '" << element->name << "'" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  return evalString(element);
+}
+
+void
+Postchunk::processOut(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "lu"))
+      {
+        string myword;
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            myword.append(evalString(j));
+          }
+        }
+        if(myword != "")
+        {
+          fputwc_unlocked(L'^', output);
+          fputws_unlocked(UtfConverter::fromUtf8(myword).c_str(), output);
+          fputwc_unlocked(L'$', output);
+        }
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "mlu"))
+      {
+        fputwc_unlocked(L'^', output);
+        bool first_time = true;
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            string myword;
+            for(xmlNode *k = j->children; k != NULL; k = k->next)
+            {
+              if(k->type == XML_ELEMENT_NODE)
+              {
+                myword.append(evalString(k));
+              }
+            }
+	      
+            if(!first_time)
+            {
+              if(myword != "")
+              {
+                fputwc_unlocked('+', output);
+              }
+            }
+	    else
+	    {
+	      if(myword != "")
+	      {
+	        first_time = false;
+              }
+	    }
+	    fputws_unlocked(UtfConverter::fromUtf8(myword).c_str(), output);	      
+	  }
+        }
+        fputwc_unlocked(L'$', output);
+      }
+      else // 'b'
+      {
+        fputws_unlocked(UtfConverter::fromUtf8(evalString(i)).c_str(), output);
+      }
+    }
+  }
+}
+
+void
+Postchunk::processTags(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (xmlChar const *) "tag"))
+      {
+        for(xmlNode *j = i->children; j != NULL; j = j->next)
+        {
+          if(j->type == XML_ELEMENT_NODE)
+          {
+            fputws_unlocked(UtfConverter::fromUtf8(evalString(j)).c_str(), output);
+          }
+        }
+      }
+    }
+  }
+}
+
+void
+Postchunk::processInstruction(xmlNode *localroot)
+{
+  if(!xmlStrcmp(localroot->name, (const xmlChar *) "choose"))
+  {
+    processChoose(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "let"))
+  {
+    processLet(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "append"))
+  {
+    processAppend(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "out"))
+  {
+    processOut(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "call-macro"))
+  {
+    processCallMacro(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "modify-case"))
+  {
+    processModifyCase(localroot);
+  }
+}
+
+void
+Postchunk::processLet(xmlNode *localroot)
+{
+  xmlNode *leftSide = NULL, *rightSide = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(leftSide == NULL)
+      {
+	leftSide = i;
+      }
+      else
+      {
+	rightSide = i;
+	break;
+      }
+    }
+  }
+
+  map<xmlNode *, TransferInstr>::iterator it = evalStringCache.find(leftSide);
+  if(it != evalStringCache.end())
+  {
+    TransferInstr &ti = it->second;
+    switch(ti.getType())
+    {
+      case ti_var:
+        variables[ti.getContent()] = evalString(rightSide);
+        return;
+        
+      case ti_clip_tl:
+        word[ti.getPos()]->setChunkPart(attr_items[ti.getContent()], evalString(rightSide));
+        return;      
+        
+      default:
+        return;
+    }
+  }
+  if(!xmlStrcmp(leftSide->name, (const xmlChar *) "var"))
+  {
+    string const val = (const char *) leftSide->properties->children->content;
+    variables[val] = evalString(rightSide);
+    evalStringCache[leftSide] = TransferInstr(ti_var, val, 0);
+  }
+  else if(!xmlStrcmp(leftSide->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = leftSide->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *) i->children->content);
+      }
+    }
+    
+
+    word[pos]->setChunkPart(attr_items[(const char *) part], 
+			    evalString(rightSide));
+    evalStringCache[leftSide] = TransferInstr(ti_clip_tl, (const char *) part, 
+					      pos, NULL);
+  }
+}
+
+void
+Postchunk::processAppend(xmlNode *localroot)
+{
+  string name;
+  for(xmlAttr *i = localroot->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "n"))
+    {
+      name = (char *) i->children->content; 
+      break;
+    }
+  }
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      variables[name].append(evalString(i));
+    }
+  }
+}
+
+void
+Postchunk::processModifyCase(xmlNode *localroot)
+{
+  xmlNode *leftSide = NULL, *rightSide = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(leftSide == NULL)
+      {
+	leftSide = i;
+      }
+      else
+      {
+	rightSide = i;
+	break;
+      }
+    }
+  }
+
+  if(!xmlStrcmp(leftSide->name, (const xmlChar *) "clip"))
+  {
+    int pos = 0;
+    xmlChar *part = NULL;
+
+    for(xmlAttr *i = leftSide->properties; i != NULL; i = i->next)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "part"))
+      {
+	part = i->children->content;
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "pos"))
+      {
+	pos = atoi((const char *) i->children->content);
+      }
+    }
+
+    string const result = copycase(evalString(rightSide), 
+				   word[pos]->chunkPart(attr_items[(const char *) part]));
+    word[pos]->setChunkPart(attr_items[(const char *) part], result);
+
+  }
+  else if(!xmlStrcmp(leftSide->name, (const xmlChar *) "var"))
+  {
+    string const val = (const char *) leftSide->properties->children->content;
+    variables[val] = copycase(evalString(rightSide), variables[val]);
+  }
+}
+
+void
+Postchunk::processCallMacro(xmlNode *localroot)
+{
+  const char *n = (const char *) localroot->properties->children->content;
+  int npar = 0;
+
+  xmlNode *macro = macro_map[macros[n]];
+
+  for(xmlAttr *i = macro->properties; i != NULL; i = i->next)
+  {
+    if(!xmlStrcmp(i->name, (const xmlChar *) "npar"))
+    {
+      npar = atoi((const char *) i->children->content);
+      break;
+    }
+  }
+  
+  if (npar <= 0)
+  {
+    throw "Postchunk::processCallMacro() assumes npar > 0, but got npar <= 0";
+  }
+
+  InterchunkWord **myword = NULL;
+  if(npar > 0)
+  {
+    myword = new InterchunkWord *[npar+1];  
+  }
+  string **myblank = NULL;
+  if(npar > 0)
+  {
+    myblank = new string *[npar];
+  }
+
+  myword[0] = word[0];
+  
+  int idx = 1;
+  int lastpos = 0;
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      int pos = atoi((const char *) i->properties->children->content);
+      if(!checkIndex(localroot, pos, lword)) {
+        pos=1; // for a rule to match, there has to be at least one word, so should be safe
+      }
+      myword[idx] = word[pos];
+      if(blank)
+      {
+        myblank[idx-1] = blank[lastpos];
+      }
+      
+      idx++;
+      lastpos = pos;
+    }
+  }
+
+  swap(myword, word);
+  swap(myblank, blank);
+  swap(npar, lword);
+  
+  for(xmlNode *i = macro->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      processInstruction(i);
+    }
+  }
+
+  swap(myword, word);
+  swap(myblank, blank);
+  swap(npar, lword);
+
+  delete[] myword;
+  delete[] myblank;
+}
+
+void
+Postchunk::processChoose(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(!xmlStrcmp(i->name, (const xmlChar *) "when"))
+      {
+        bool picked_option = false;
+        
+	for(xmlNode *j = i->children; j != NULL; j = j->next)
+	{
+	  if(j->type == XML_ELEMENT_NODE)
+	  {
+	    if(!xmlStrcmp(j->name, (const xmlChar *) "test"))
+	    {
+	      if(!processTest(j))
+	      {
+		break;
+	      }
+	      else
+	      {
+	        picked_option = true;
+              }
+	    }
+	    else
+	    {
+	      processInstruction(j);
+	    }
+	  }
+	}
+        if(picked_option)
+        {
+          return;
+        }	
+      }
+      else if(!xmlStrcmp(i->name, (const xmlChar *) "otherwise"))
+      {
+	for(xmlNode *j = i->children; j != NULL; j = j->next)
+	{
+	  if(j->type == XML_ELEMENT_NODE)
+	  {
+	    processInstruction(j);
+	  }
+	}
+      }
+    }
+  }
+}
+
+bool
+Postchunk::processLogical(xmlNode *localroot)
+{
+  if(!xmlStrcmp(localroot->name, (const xmlChar *) "equal"))
+  {
+    return processEqual(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "begins-with"))
+  {
+    return processBeginsWith(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "begins-with-list"))
+  { 
+    return processBeginsWithList(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "ends-with"))
+  {
+    return processEndsWith(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "ends-with-list"))
+  {
+    return processEndsWithList(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "contains-substring"))
+  {
+    return processContainsSubstring(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "or"))
+  {
+    return processOr(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "and"))
+  {
+    return processAnd(localroot);
+  }
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "not"))
+  {
+    return processNot(localroot);
+  } 
+  else if(!xmlStrcmp(localroot->name, (const xmlChar *) "in"))
+  {
+    return processIn(localroot);
+  }
+
+  return false;
+}
+
+bool
+Postchunk::processIn(xmlNode *localroot)
+{
+  xmlNode *value = NULL;
+  xmlChar *idlist = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    { 
+      if(value == NULL)
+      {
+	value = i;
+      }
+      else
+      {
+	idlist = i->properties->children->content;
+	break;
+      }
+    }
+  }
+
+  string sval = evalString(value);
+
+  if(localroot->properties != NULL)
+  {
+    if(!xmlStrcmp(localroot->properties->children->content, 
+		  (const xmlChar *) "yes"))
+    {
+      set<string, Ltstr> &myset = listslow[(const char *) idlist];
+      if(myset.find(tolower(sval)) != myset.end())
+      {
+	return true;
+      }
+      else
+      {
+	return false;
+      }
+    }
+  }
+
+  set<string, Ltstr> &myset = lists[(const char *) idlist];
+  if(myset.find(sval) != myset.end())
+  {
+    return true;
+  }
+  else
+  {
+    return false;
+  }
+}
+
+bool
+Postchunk::processTest(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      return processLogical(i);
+    }
+  }  
+  return false;
+}
+
+bool
+Postchunk::processAnd(xmlNode *localroot)
+{
+  bool val = true;
+  for(xmlNode *i = localroot->children; val && i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      val = val && processLogical(i);
+    }
+  }
+
+  return val;
+}
+
+bool
+Postchunk::processOr(xmlNode *localroot)
+{
+  bool val = false;
+  for(xmlNode *i = localroot->children; !val && i != NULL ; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      val = val || processLogical(i);
+    }
+  }
+
+  return val;
+}
+
+bool
+Postchunk::processNot(xmlNode *localroot)
+{
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      return !processLogical(i);
+    }
+  }
+  return false;
+}
+
+bool
+Postchunk::processEqual(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return evalString(first) == evalString(second);
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return tolower(evalString(first)) == tolower(evalString(second));
+    }
+    else
+    {
+      return evalString(first) == evalString(second);
+    }
+  }
+}
+
+bool
+Postchunk::beginsWith(string const &s1, string const &s2) const
+{
+  int const limit = s2.size(), constraint = s1.size();
+  
+  if(constraint < limit)
+  {
+    return false;
+  }
+  for(int i = 0; i != limit; i++)
+  {
+    if(s1[i] != s2[i])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+bool
+Postchunk::endsWith(string const &s1, string const &s2) const
+{
+  int const limit = s2.size(), constraint = s1.size();
+  
+  if(constraint < limit)
+  {
+    return false;
+  }
+  for(int i = limit-1, j = constraint - 1; i >= 0; i--, j--)
+  {
+    if(s1[j] != s2[i])
+    {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+
+bool
+Postchunk::processBeginsWith(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return beginsWith(evalString(first), evalString(second));
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return beginsWith(tolower(evalString(first)), tolower(evalString(second)));
+    }
+    else
+    {
+      return beginsWith(evalString(first), evalString(second));
+    }
+  }
+}
+
+bool
+Postchunk::processEndsWith(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return endsWith(evalString(first), evalString(second));
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return endsWith(tolower(evalString(first)), tolower(evalString(second)));
+    }
+    else
+    {
+      return endsWith(evalString(first), evalString(second));
+    }
+  }
+}
+
+bool
+Postchunk::processBeginsWithList(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  xmlChar *idlist = second->properties->children->content;
+  string needle = evalString(first);
+  set<string, Ltstr>::iterator it, limit;
+
+  if(localroot->properties == NULL || 
+     xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+  {
+    it = lists[(const char *) idlist].begin();
+    limit = lists[(const char *) idlist].end();
+  }
+  else
+  {
+    needle = tolower(needle);
+    it = listslow[(const char *) idlist].begin();
+    limit = listslow[(const char *) idlist].end();
+  }
+  
+  for(; it != limit; it++)
+  {
+    if(beginsWith(needle, *it))
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool
+Postchunk::processEndsWithList(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  xmlChar *idlist = second->properties->children->content;
+  string needle = evalString(first);
+  set<string, Ltstr>::iterator it, limit;
+
+  if(localroot->properties == NULL || 
+     xmlStrcmp(localroot->properties->children->content, (const xmlChar *) "yes"))
+  {
+    it = lists[(const char *) idlist].begin();
+    limit = lists[(const char *) idlist].end();
+  }
+  else
+  {
+    needle = tolower(needle);
+    it = listslow[(const char *) idlist].begin();
+    limit = listslow[(const char *) idlist].end();
+  }
+  
+  for(; it != limit; it++)
+  {
+    if(endsWith(needle, *it))
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+
+bool
+Postchunk::processContainsSubstring(xmlNode *localroot)
+{
+  xmlNode *first = NULL, *second = NULL;
+
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      if(first == NULL)
+      {
+        first = i;
+      }
+      else
+      {
+	second = i;
+	break;
+      }
+    }
+  }
+
+  if(localroot->properties == NULL)
+  {
+    return evalString(first).find(evalString(second)) != string::npos;
+  }
+  else
+  {
+    if(!xmlStrcmp(localroot->properties->children->content,
+		  (const xmlChar *) "yes"))
+    {
+      return tolower(evalString(first)).find(tolower(evalString(second))) != string::npos;
+    }
+    else
+    {
+      return evalString(first).find(evalString(second)) != string::npos;
+    }
+  }
+}
+
+string
+Postchunk::copycase(string const &source_word, string const &target_word)
+{
+  wstring result;
+  wstring const s_word = UtfConverter::fromUtf8(source_word);
+  wstring const t_word = UtfConverter::fromUtf8(target_word);
+
+  bool firstupper = iswupper(s_word[0]);
+  bool uppercase = firstupper && iswupper(s_word[s_word.size()-1]);
+  bool sizeone = s_word.size() == 1;
+
+  if(!uppercase || (sizeone && uppercase))
+  {
+    result = StringUtils::tolower(t_word);
+  }
+  else
+  {
+    result = StringUtils::toupper(t_word);
+  }
+  
+  if(firstupper)
+  {
+    result[0] = towupper(result[0]);
+  }
+   
+  return UtfConverter::toUtf8(result);
+}
+
+string 
+Postchunk::caseOf(string const &str)
+{
+  wstring const s = UtfConverter::fromUtf8(str);
+
+  if(s.size() > 1)
+  {
+    if(!iswupper(s[0]))
+    {
+      return "aa";
+    }
+    else if(!iswupper(s[s.size()-1]))
+    {
+      return "Aa";
+    }
+    else
+    {
+      return "AA";
+    }
+  }
+  else if(s.size() == 1)
+  {
+    if(!iswupper(s[0]))
+    {
+      return "aa";
+    }
+    else
+    {
+      return "Aa";
+    }
+  }
+  else
+  {
+    return "aa";
+  }
+}
+
+wstring 
+Postchunk::caseOf(wstring const &str)
+{
+  if(str.size() > 1)
+  {
+    if(!iswupper(str[0]))
+    {
+      return L"aa";
+    }
+    else if(!iswupper(str[str.size()-1]))
+    {
+      return L"Aa";
+    }
+    else
+    {
+      return L"AA";
+    }
+  }
+  else if(str.size() == 1)
+  {
+    if(!iswupper(str[0]))
+    {
+      return L"aa";
+    }
+    else
+    {
+      return L"Aa";
+    }
+  }
+  else
+  {
+    return L"aa";
+  }
+}
+
+string
+Postchunk::tolower(string const &str) const
+{
+  return UtfConverter::toUtf8(StringUtils::tolower(UtfConverter::fromUtf8(str)));
+}
+
+string
+Postchunk::tags(string const &str) const
+{
+  string result = "<";
+
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+    if(str[i] == '.')
+    {
+      result.append("><");
+    }
+    else
+    {
+      result += str[i];
+    }
+  }
+  
+  result += '>';
+
+  return result;
+}
+
+void
+Postchunk::processRule(xmlNode *localroot)
+{
+  // localroot is suposed to be an 'action' tag
+  for(xmlNode *i = localroot->children; i != NULL; i = i->next)
+  {
+    if(i->type == XML_ELEMENT_NODE)
+    {
+      processInstruction(i);
+    }
+  }
+}
+
+TransferToken &
+Postchunk::readToken(FILE *in)
+{
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wstring content;
+  while(true)
+  {
+    int val = fgetwc_unlocked(in);
+    if(feof(in) || (internal_null_flush && val == 0))
+    {
+      return input_buffer.add(TransferToken(content, tt_eof));
+    }
+    if(val == L'\\')
+    {  
+      content += L'\\';
+      content += wchar_t(fgetwc_unlocked(in));
+    }
+    else if(val == L'[')
+    {
+      content += L'[';
+      while(true)
+      {
+	int val2 = fgetwc_unlocked(in);
+	if(val2 == L'\\')
+	{
+	  content += L'\\';
+	  content += wchar_t(fgetwc_unlocked(in));
+	}
+	else if(val2 == L']')
+	{
+	  content += L']';
+	  break;
+	}
+	else
+	{
+	  content += wchar_t(val2);
+	}
+      }
+    }
+    else if(inword && val == L'{')
+    {
+      content += L'{';
+      while(true)
+      {
+	int val2 = fgetwc_unlocked(in);
+	if(val2 == L'\\')
+	{
+	  content += L'\\';
+	  content += wchar_t(fgetwc_unlocked(in));
+	}
+	else if(val2 == L'}')
+	{
+	  int val3 = wchar_t(fgetwc_unlocked(in));
+	  ungetwc(val3, in);
+	  
+	  content += L'}';
+	  if(val3 == L'$')
+	  {
+	    break;  
+	  }
+	}
+	else
+	{
+	  content += wchar_t(val2);
+	}
+      }
+    }
+    else if(inword && val == L'$')
+    {
+      inword = false;
+      return input_buffer.add(TransferToken(content, tt_word));
+    }
+    else if(val == L'^')
+    {
+      inword = true;
+      return input_buffer.add(TransferToken(content, tt_blank));
+    }
+    else
+    {
+      content += wchar_t(val);
+    }
+  }
+}
+
+bool
+Postchunk::getNullFlush(void)
+{
+  return null_flush;
+}
+
+void
+Postchunk::setNullFlush(bool null_flush)
+{
+  this->null_flush = null_flush;
+}
+
+void
+Postchunk::postchunk_wrapper_null_flush(FILE *in, FILE *out)
+{
+  null_flush = false;
+  internal_null_flush = true;
+  
+  while(!feof(in))
+  {
+    postchunk(in, out);
+    fputwc_unlocked(L'\0', out);
+    int code = fflush(out);
+    if(code != 0)
+    {
+      wcerr << L"Could not flush output " << errno << endl;
+    }
+  }
+  
+  internal_null_flush = false;
+  null_flush = true;
+}    
+
+void
+Postchunk::postchunk(FILE *in, FILE *out)
+{
+  if(getNullFlush())
+  {
+    postchunk_wrapper_null_flush(in, out);
+  }
+  
+  int last = 0;
+
+  output = out;
+  ms.init(me->getInitial());
+  
+  while(true)
+  {
+    if(ms.size() == 0)
+    {
+      if(lastrule != NULL)
+      {
+	applyRule();
+	input_buffer.setPos(last);
+      }
+      else
+      {
+	if(tmpword.size() != 0)
+	{
+	  unchunk(*tmpword[0], output);
+	  tmpword.clear();
+	  input_buffer.setPos(last);
+	  input_buffer.next();       
+	  last = input_buffer.getPos();
+	  ms.init(me->getInitial());
+	}
+	else if(tmpblank.size() != 0)
+	{
+	  fputws_unlocked(tmpblank[0]->c_str(), output);
+	  tmpblank.clear();
+	  last = input_buffer.getPos();
+	  ms.init(me->getInitial());
+	}
+      }
+    }
+    int val = ms.classifyFinals(me->getFinals());
+    if(val != -1)
+    {
+      lastrule = rule_map[val-1];      
+      last = input_buffer.getPos();
+    }
+
+    TransferToken &current = readToken(in);
+   
+    switch(current.getType())
+    {
+      case tt_word:
+	applyWord(current.getContent());
+        tmpword.push_back(&current.getContent());
+	break;
+
+      case tt_blank:
+	ms.step(L' ');
+	tmpblank.push_back(&current.getContent());
+	break;
+
+      case tt_eof:
+	if(tmpword.size() != 0)
+	{
+	  tmpblank.push_back(&current.getContent());
+	  ms.clear();
+	}
+	else
+	{
+	  fputws_unlocked(current.getContent().c_str(), output);
+	  return;
+	}
+	break;
+
+      default:
+	wcerr << "Error: Unknown input token." << endl;
+	return;
+    }
+  }
+}
+
+void
+Postchunk::applyRule()
+{
+  wstring const chunk = *tmpword[0];
+  tmpword.clear();
+  splitWordsAndBlanks(chunk, tmpword, tmpblank);
+
+  word = new InterchunkWord *[tmpword.size()+1];
+  lword = tmpword.size();
+  word[0] = new InterchunkWord(UtfConverter::toUtf8(wordzero(chunk)));
+
+  for(unsigned int i = 1, limit = tmpword.size()+1; i != limit; i++)
+  {
+    if(i == 1)
+    {
+      if(limit != 2)
+      {
+        blank = new string *[limit - 2];
+        lblank = limit - 3;
+      }
+      else
+      {
+        blank = NULL;
+        lblank = 0;
+      }
+    }
+    else
+    {
+      blank[i-2] = new string(UtfConverter::toUtf8(*tmpblank[i-1]));
+    }
+    
+    word[i] = new InterchunkWord(UtfConverter::toUtf8(*tmpword[i-1]));
+  }
+
+  processRule(lastrule);
+  lastrule = NULL;
+
+  if(word)
+  {
+    for(unsigned int i = 0, limit = tmpword.size() + 1; i != limit; i++)
+    {
+      delete word[i];
+    }
+    delete[] word;
+  }
+  if(blank)
+  {
+    for(unsigned int i = 0, limit = tmpword.size() - 1; i != limit; i++)
+    {
+      delete blank[i];
+    }
+    delete[] blank;
+  }
+  word = NULL;
+  blank = NULL;
+
+  for(unsigned int i = 0, limit = tmpword.size(); i != limit; i++)
+  {
+    if(i != 0)
+    {
+      delete tmpblank[i];
+    }
+    delete tmpword[i];
+  }
+  tmpword.clear();
+  tmpblank.clear();
+  ms.init(me->getInitial());
+}
+
+void
+Postchunk::applyWord(wstring const &word_str)
+{
+  ms.step(L'^');
+  for(unsigned int i = 0, limit = word_str.size(); i < limit; i++)
+  {
+    switch(word_str[i])
+    {
+      case L'\\':
+        i++;
+	ms.step(towlower(word_str[i]), any_char);
+	break;
+
+      case L'<':
+/*	for(unsigned int j = i+1; j != limit; j++)
+	{
+	  if(word_str[j] == '>')
+	  {
+	    int symbol = alphabet(word_str.substr(i, j-i+1));
+	    if(symbol)
+	    {
+	      ms.step(symbol, any_tag);
+	    }
+	    else
+	    {
+	      ms.step(any_tag);
+	    }
+	    i = j;
+	    break;
+	  }
+	}
+	break;*/
+	
+      case L'{':  // ignore the unmodifiable part of the chunk
+        ms.step(L'$');
+        return;
+	
+      default:
+	ms.step(towlower(word_str[i]), any_char);
+	break;
+    }
+  }
+  ms.step(L'$');
+}
+
+vector<wstring>
+Postchunk::getVecTags(wstring const &chunk)
+{
+  vector<wstring> vectags;
+
+  for(int i = 0, limit = chunk.size(); i != limit; i++)
+  {
+    if(chunk[i] == L'\\')
+    {
+      i++;
+    }
+    else if(chunk[i] == L'<')
+    {
+      wstring mytag;
+      do
+      {
+        mytag += chunk[i++];
+      }
+      while(chunk[i] != L'>');
+      vectags.push_back(mytag + L'>');
+    }
+    else if(chunk[i] == L'{')
+    {
+      break;
+    }
+  }
+  return vectags;
+}
+
+int
+Postchunk::beginChunk(wstring const &chunk)
+{
+  for(int i = 0, limit = chunk.size(); i != limit; i++)
+  {
+    if(chunk[i] == L'\\')
+    {
+      i++;
+    }
+    else if(chunk[i] == L'{')
+    {
+      return i + 1;
+    }
+  }
+  return chunk.size();
+}
+
+int
+Postchunk::endChunk(wstring const &chunk)
+{
+  return chunk.size()-2;
+}
+
+wstring
+Postchunk::wordzero(wstring const &chunk)
+{
+  for(unsigned int i = 0, limit = chunk.size(); i != limit ;i++)
+  {
+    if(chunk[i] == L'\\')
+    {
+      i++;
+    }
+    else if(chunk[i] == L'{')
+    {
+      return chunk.substr(0, i);
+    }
+  }
+
+  return L"";
+}
+
+wstring
+Postchunk::pseudolemma(wstring const &chunk)
+{
+  for(unsigned int i = 0, limit = chunk.size(); i != limit ;i++)
+  {
+    if(chunk[i] == L'\\')
+    {
+      i++;
+    }
+    else if(chunk[i] == L'<' || chunk[i] == L'{')
+    {
+      return chunk.substr(0, i);
+    }
+  }
+
+  return L"";
+}
+
+void
+Postchunk::unchunk(wstring const &chunk, FILE *output)
+{
+  vector<wstring> vectags = getVecTags(chunk);
+  wstring case_info = caseOf(pseudolemma(chunk));
+  bool uppercase_all = false;
+  bool uppercase_first = false;
+ 
+  if(case_info == L"AA")
+  {
+    uppercase_all = true;
+  }  
+  else if(case_info == L"Aa")
+  {
+    uppercase_first = true;
+  }
+
+  for(int i = beginChunk(chunk), limit = endChunk(chunk); i < limit; i++)
+  {
+    if(chunk[i] == L'\\')
+    {
+      fputwc_unlocked(L'\\', output);
+      fputwc_unlocked(chunk[++i], output);
+    }
+    else if(chunk[i] == L'^')
+    {
+      fputwc_unlocked(L'^', output);
+      while(chunk[++i] != L'$')
+      {
+        if(chunk[i] == L'\\')
+        {
+          fputwc_unlocked(L'\\', output);
+          fputwc_unlocked(chunk[++i], output);
+        }
+        else if(chunk[i] == L'<')
+        {
+          if(iswdigit(chunk[i+1]))
+          {
+            // replace tag
+            unsigned long value = wcstoul(chunk.c_str()+i+1, 
+					  NULL, 0) - 1;
+            //atoi(chunk.c_str()+i+1)-1;
+            if(vectags.size() > value)
+            {
+              fputws_unlocked(vectags[value].c_str(), output);
+            }
+            while(chunk[++i] != L'>');
+          }
+          else
+          {
+            fputwc_unlocked(L'<', output);
+	    while(chunk[++i] != L'>') fputwc_unlocked(chunk[i], output);
+            fputwc_unlocked(L'>', output);
+          }
+        }
+        else
+        {
+          if(uppercase_all)
+          {
+            fputwc_unlocked(towupper(chunk[i]), output);
+          }
+          else if(uppercase_first)
+          {
+	    if(iswalnum(chunk[i]))
+	    {
+	      fputwc_unlocked(towupper(chunk[i]), output);
+	      uppercase_first = false;
+	    }
+            else
+	    {
+	      fputwc_unlocked(chunk[i], output);
+	    }
+          }
+          else
+          {
+            fputwc_unlocked(chunk[i], output);
+          }
+        }
+      }
+      fputwc_unlocked(L'$', output);
+    }
+    else if(chunk[i] == L'[')
+    {
+      fputwc_unlocked(L'[', output);
+      while(chunk[++i] != L']')
+      {
+        if(chunk[i] == L'\\')
+        {
+          fputwc_unlocked(L'\\', output);
+          fputwc_unlocked(chunk[++i], output);
+        }
+        else
+        {
+          fputwc_unlocked(chunk[i], output);
+        }
+      }
+      fputwc_unlocked(L']', output);
+    }
+    else
+    {
+      fputwc_unlocked(chunk[i], output);
+    }
+  }
+}
+
+
+void
+Postchunk::splitWordsAndBlanks(wstring const &chunk, vector<wstring *> &words,
+                               vector<wstring *> &blanks)
+{
+  vector<wstring> vectags = getVecTags(chunk);
+  wstring case_info = caseOf(pseudolemma(chunk));
+  bool uppercase_all = false;
+  bool uppercase_first = false;
+  bool lastblank = true;
+ 
+  if(case_info == L"AA")
+  {
+    uppercase_all = true;
+  }  
+  else if(case_info == L"Aa")
+  {
+    uppercase_first = true;
+  }
+  
+  for(int i = beginChunk(chunk), limit = endChunk(chunk); i < limit; i++)
+  {
+    if(chunk[i] == L'^')
+    {
+      if(!lastblank)
+      {
+        blanks.push_back(new wstring(L""));
+      }
+      lastblank = false;
+      wstring *myword = new wstring();
+      wstring &ref = *myword;
+    
+      while(chunk[++i] != L'$')
+      {
+        if(chunk[i] == L'\\')
+        {
+          ref += L'\\';
+          ref += chunk[++i];
+        }
+        else if(chunk[i] == L'<')
+        {
+          if(iswdigit(chunk[i+1]))
+          {
+            // replace tag
+            unsigned long value = wcstoul(chunk.c_str()+i+1, 
+                                          NULL, 0) - 1;
+            if(vectags.size() > value)
+            {
+              ref.append(vectags[value]);
+            }
+            while(chunk[++i] != L'>');
+          }
+          else
+          {
+            ref += L'<';
+            while(chunk[++i] != L'>') ref += chunk[i];
+            ref += L'>';
+          }
+        }
+        else
+        {
+          if(uppercase_all)
+          {
+            ref += towupper(chunk[i]);
+          }
+          else if(uppercase_first)
+          {
+            if(iswalnum(chunk[i]))
+            {
+              ref += towupper(chunk[i]);
+              uppercase_first = false;
+            }
+            else
+            {
+              ref += chunk[i];
+            }
+          }
+          else
+          {
+            ref += chunk[i];
+          }
+        }
+      }
+
+      words.push_back(myword);
+    }
+    else if(chunk[i] == L'[')
+    {
+      if (!(lastblank && blanks.back())) 
+      {
+        blanks.push_back(new wstring());
+      }
+      wstring &ref = *(blanks.back());
+      ref += L'[';
+      while(chunk[++i] != L']')
+      {
+        if(chunk[i] == L'\\')
+        {
+          ref += L'\\';
+          ref += chunk[++i];
+        }
+        else
+        {
+          ref += chunk[i];
+        }
+      }
+      ref += chunk[i];
+
+      lastblank = true;
+    }
+    else
+    {
+      if (!lastblank)
+      {
+        wstring *myblank = new wstring(L"");
+        blanks.push_back(myblank);
+      }
+      wstring &ref = *(blanks.back());
+      if(chunk[i] == L'\\')
+      {
+        ref += L'\\';
+        ref += chunk[++i];
+      }
+      else
+      {
+        ref += chunk[i];
+      }
+      lastblank = true;
+    }
+  }
+}
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/reformat.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/reformat.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/reformat.xsl	(revision 70339)
@@ -0,0 +1,238 @@
+<?xml version="1.0" encoding="ISO-8859-1"?> <!-- -*- nxml -*- -->
+<!--
+ Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+<xsl:stylesheet version="1.0"
+                xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+  <xsl:output method="text" encoding="UTF-8"/>
+
+<xsl:template match="format">
+
+%{
+
+#ifndef GENFORMAT
+#include "apertium_config.h"
+#endif
+#include &lt;apertium/unlocked_cstdio.h&gt;
+
+#include &lt;cstdlib&gt;
+#include &lt;iostream&gt;
+#include &lt;libgen.h&gt;
+#include &lt;map&gt;
+#include &lt;string&gt;
+#include &lt;unistd.h&gt;
+#include &lt;lttoolbox/lt_locale.h&gt;
+#include &lt;lttoolbox/ltstr.h&gt;
+#include &lt;apertium/string_to_wostream.h&gt;
+#include &lt;wchar.h&gt;
+#ifdef _WIN32
+#include &lt;io.h&gt;
+#include &lt;fcntl.h&gt;
+#endif
+
+using namespace std;
+
+<xsl:for-each select="./rules/replacement-rule">
+  <xsl:variable name="varname"
+		select="concat(concat(string('S'),position()),string('_substitution'))"/>
+  <xsl:value-of select="string('map&lt;wstring, wstring, Ltstr&gt; S')"/>
+  <xsl:value-of select="position()"/>
+  <xsl:value-of select="string('_substitution;&#xA;&#xA;void S')"/>
+  <xsl:value-of select="position()"/>
+  <xsl:value-of select="string('_init()&#xA;{')"/>
+
+  <xsl:for-each select="./replace">
+    <xsl:if test="./@prefer = string('yes')">
+      <xsl:value-of select="string('&#xA;  ')"/>
+      <xsl:value-of select="$varname"/>
+      <xsl:value-of select="string('[L&quot;')"/>
+      <xsl:value-of select="./@target"/>
+      <xsl:value-of select="string('&quot;] = L&quot;')"/>
+      <xsl:value-of select="./@source"/>
+      <xsl:value-of select="string('&quot;;')"/>
+    </xsl:if>
+  </xsl:for-each>
+
+  <xsl:value-of select="string('&#xA;}&#xA;')"/>
+</xsl:for-each>
+
+string memconv;
+
+wstring convertir(char const *multibyte, int const length)
+{
+  memconv.append(multibyte, length);
+  int tam = memconv.size();
+  if (memconv == "")
+    return L"";
+  wchar_t *retval = new wchar_t[tam+1];
+  size_t l = mbstowcs(retval, memconv.c_str(), tam);
+
+  if(l == ((size_t) -1))
+  {
+    if(memconv.size() >= 4)
+    {
+      wcerr &lt;&lt; L"Warning: wrong encoding" &lt;&lt; endl;
+    }
+    if (retval != NULL)
+      delete[] retval;
+    return L"";
+  }
+  else
+  {
+    memconv = "";
+    retval[l] = 0;
+    wstring ret = retval;
+    if (retval != NULL)
+      delete[] retval;
+    return ret;
+  }
+}
+
+%}
+
+%option nounput
+%option noyywrap<xsl:if test="./options/case-sensitive/@value=string('no')">
+%option caseless</xsl:if>
+
+%%
+
+"["|"]"&#x9;{
+  // do nothing
+}
+
+"[@"[^]]+"]"&#x9;{
+  string filename = yytext;
+  filename = filename.substr(2, filename.size()-3);
+  FILE *temp = fopen(filename.c_str(), "r");
+  wint_t mychar;
+#ifdef _WIN32
+  _setmode(_fileno(temp), _O_U8TEXT);
+#endif
+
+  if(!temp)
+  {
+    wcerr &lt;&lt; "ERROR: File '" &lt;&lt; filename &lt;&lt;"' not found." &lt;&lt; endl;
+    exit(EXIT_FAILURE);
+  }
+  while(static_cast&lt;int&gt;(mychar = fgetwc_unlocked(temp)) != EOF)
+  {
+    fputwc_unlocked(mychar, yyout);
+  }
+  fclose(temp);
+  unlink(filename.c_str());
+}
+
+"[\\@"&#x9;{
+  fputwc_unlocked(L'@', yyout);
+}
+
+".[]"&#x9;{
+  // do nothing
+}
+
+"\\"<xsl:value-of select="/format/options/escape-chars/@regexp"/>&#x9;{
+  fputws_unlocked(convertir(yytext+1, yyleng-1).c_str(), yyout);
+}
+
+
+
+.|\n&#x9;{
+  wstring yytext_conv = convertir(yytext, yyleng);
+<xsl:for-each select="./rules/replacement-rule">
+  <xsl:variable name="varname"
+		select="concat(concat(string('S'),position()),string('_substitution'))"/>
+
+  <xsl:value-of select="string('  ')"/>
+  <xsl:if test="not(position()=1)">
+    <xsl:value-of select="string('else ')"/>
+  </xsl:if>
+  <xsl:value-of select="string('if(')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('.find(yytext_conv) != ')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('.end())&#xA;  {&#xA;')"/>
+  <xsl:value-of select="string('    fputws_unlocked(')"/>
+  <xsl:value-of select="$varname"/>
+  <xsl:value-of select="string('[yytext_conv].c_str(), yyout);')"/>
+  <xsl:value-of select="string('&#xA;  }&#xA;')"/>
+</xsl:for-each>
+
+<xsl:if test="not(count(./rules/replacement-rule)=0)">
+  <xsl:value-of select="string('  else&#xA;  {&#xA;  ')"/>
+</xsl:if>
+<xsl:value-of select="string('  fputws_unlocked(yytext_conv.c_str(), yyout);&#xA;')"/>
+<xsl:if test="not(count(./rules/replacement-rule)=0)">
+  <xsl:value-of select="string('  }')"/>
+</xsl:if>
+}
+
+&lt;&lt;EOF&gt;&gt;&#x9;{
+  return 0;
+}
+
+%%
+
+void usage(string const &amp;progname)
+{
+  wcerr &lt;&lt; "USAGE: " &lt;&lt; progname &lt;&lt; " [input_file [output_file]" &lt;&lt; ']' &lt;&lt; endl;
+  wcerr &lt;&lt; "<xsl:value-of select="./@name"/> format processor " &lt;&lt; endl;
+  exit(EXIT_SUCCESS);
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+
+  if(argc &gt; 3)
+  {
+    usage(argv[0]);
+  }
+
+  switch(argc)
+  {
+    case 3:
+      yyout = fopen(argv[2], "w");
+      if(!yyout)
+      {
+        usage(argv[0]);
+      }
+    case 2:
+      yyin = fopen(argv[1], "r");
+      if(!yyin)
+      {
+        usage(argv[0]);
+      }
+      break;
+    default:
+      break;
+  }
+#ifdef _WIN32
+  _setmode(_fileno(yyin), _O_U8TEXT);
+  _setmode(_fileno(yyout), _O_U8TEXT);
+#endif
+
+<xsl:for-each select="./rules/replacement-rule">
+  <xsl:value-of select="string('  S')"/>
+  <xsl:value-of select="position()"/>
+  <xsl:value-of select="string('_init();&#xA;')"/>
+</xsl:for-each>
+
+  yylex();
+  fclose(yyin);
+  fclose(yyout);
+}
+</xsl:template>
+</xsl:stylesheet>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/string_utils.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/string_utils.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/string_utils.cc	(revision 70339)
@@ -0,0 +1,185 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/string_utils.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <iostream>
+#include <cstring>
+
+#ifdef _MSC_VER
+#define snprintf _snprintf
+#endif
+
+//Delete white spaces from the end and the begining of the string
+wstring 
+StringUtils::trim(wstring const &str) 
+{ 
+  if(str == L"")
+  {
+    return L"";
+  }
+
+  int begin = 0, end = str.size() - 1;
+
+  while(begin < end && iswspace(str[begin]))
+  {
+    begin++;
+  }
+
+  while(end > begin && iswspace(str[end]))
+  {
+    end--;
+  }
+
+  if(!iswspace(str[end]))
+  {
+    end++;
+  }
+ 
+  return str.substr(begin, end-begin);
+}
+
+vector<wstring>
+StringUtils::split_wstring(wstring const &input, wstring const &delimiter) 
+{
+  unsigned pos;
+  int new_pos;
+  vector<wstring> result;
+  wstring s = L"";
+  pos=0;
+
+  while(pos<input.size())
+  {
+    new_pos=input.find(delimiter, pos);
+    if(new_pos<0)
+      new_pos=input.size();
+    s=input.substr(pos, new_pos-pos);
+    if (s.length()==0) {
+      wcerr<<L"Warning in StringUtils::split_wstring: After splitting there is an empty string\n";
+      wcerr<<L"Skipping this empty string\n";
+    } else
+      result.push_back(s);
+    pos=new_pos+delimiter.size();
+  }
+
+  return result;
+}
+
+wstring 
+StringUtils::vector2wstring(vector<wstring> const &v)
+{
+  wstring s = L"";
+  for(unsigned i=0; i<v.size(); i++)
+  {
+    if (i>0)
+      s+=L' ';
+    s.append(v[i]);
+  }
+  return s;
+}
+
+wstring 
+StringUtils::substitute(wstring const &source, wstring const &olds, wstring const &news) {
+  wstring s = source;
+
+  unsigned int p=s.find(olds , 0);
+  while (p!=static_cast<unsigned int>(wstring::npos))
+  {
+    s.replace(p, olds.length(), news);
+    p+=news.length();
+    p=s.find(olds,p);
+  }
+
+  return s;
+}
+
+wstring
+StringUtils::itoa(int n)
+{
+  return XMLParseUtil::stows(itoa_string(n));
+}
+
+string
+StringUtils::itoa_string(int n)
+{
+  char str[256];
+  snprintf(str, 256, "%d", n);
+  return str;
+}
+
+wstring
+StringUtils::ftoa(double f)
+{
+  char str[256];
+  sprintf(str, "%f",f);
+  return XMLParseUtil::stows(str);
+}
+
+wstring
+StringUtils::tolower(wstring const &s)
+{
+  wstring l=s;
+  for(unsigned i=0; i<s.length(); i++)
+  {
+    l[i] = (wchar_t) towlower(s[i]);
+  }
+  return l;
+}
+
+wstring
+StringUtils::toupper(wstring const &s) {
+  wstring l=s;
+  for(unsigned i=0; i<s.length(); i++)
+  {
+    l[i]  = (wchar_t) towupper(s[i]);
+  }
+
+  return l;
+}
+
+bool Apertium::operator==(string const &s1, string const &s2)
+{
+  return strcmp(s1.c_str(), s2.c_str()) == 0;
+}
+
+bool Apertium::operator==(string const &s1, char const *s2)
+{
+  return strcmp(s1.c_str(), s2) == 0;
+}
+
+bool Apertium::operator==(char const *s1, string const &s2)
+{
+  return strcmp(s1, s2.c_str()) == 0;
+}
+
+bool Apertium::operator!=(string const &s1, string const &s2)
+{
+  return strcmp(s1.c_str(), s2.c_str()) != 0;
+}
+
+bool Apertium::operator!=(string const &s1, char const *s2)
+{
+  return strcmp(s1.c_str(), s2) != 0;
+}
+
+bool Apertium::operator!=(char const *s1, string const &s2)
+{
+  return strcmp(s1, s2.c_str()) != 0;
+}
+
+#include "string_to_wostream.h"
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/string_utils.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/string_utils.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/string_utils.h	(revision 70339)
@@ -0,0 +1,62 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __STRINGUTILS_H_
+#define __STRINGUTILS_H_
+
+#include <string>
+#include <cstring>
+#include <vector>
+
+using namespace std;
+
+namespace Apertium
+{
+  bool operator==(string const &s1, string const &s2);
+  bool operator==(string const &s1, char const *s2);
+  bool operator==(char const *s1, string const &s2);
+  bool operator!=(string const &s1, string const &s2);
+  bool operator!=(string const &s1, char const *s2);
+  bool operator!=(char const *s1, string const &s2);
+}
+
+class StringUtils {
+  public:
+  
+  static wstring trim(wstring const &str);
+
+  static vector<wstring> split_wstring(wstring const &input, wstring const &delimiter);
+
+  static wstring vector2wstring(vector<wstring> const &v);
+
+  //Replace each ocurrence of the string 'olds' by the string 'news' in string 'source'
+  static wstring substitute(const wstring &source, const wstring &olds, const wstring &news);
+
+  static wstring itoa(int n);
+  
+  static string itoa_string(int n);
+  
+  static wstring ftoa(double f);
+
+  static wstring tolower(wstring const &s);
+
+  static wstring toupper(wstring const &s);
+};
+
+std::wostream & operator<< (std::wostream & ostr, std::string const & str);
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_utils.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_utils.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_utils.cc	(revision 70339)
@@ -0,0 +1,260 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/tagger_utils.h>
+#include <apertium/morpho_stream.h>
+
+#include <stdio.h>
+#include <sstream>
+#include <apertium/string_utils.h>
+#ifdef _MSC_VER
+#define wcstok wcstok_s
+#endif
+#ifdef __MINGW32__
+
+wchar_t *_wcstok(wchar_t *wcs, const wchar_t *delim, wchar_t **ptr) {
+  (void)ptr;
+  return wcstok(wcs, delim);
+}
+
+#define wcstok _wcstok
+#endif
+
+using namespace Apertium;
+
+
+void tagger_utils::fatal_error (wstring const &s) {
+  wcerr<<L"Error: "<<s<<L"\n";
+  exit(1);
+}
+
+void tagger_utils::file_name_error (string const &s) { 
+  wcerr << "Error: " << s << endl;
+  exit(1);
+}
+
+char * tagger_utils::itoa(int i) {                 
+  static char buf[512];
+  sprintf(buf,"%d",i);
+  return buf;
+}
+
+void tagger_utils::clear_array_double(double a[], int l) {
+  for(int i=0; i<l; i++)
+    a[i]=0.0;
+}
+
+void tagger_utils::clear_array_vector(vector<TTag> v[], int l) {
+  for(int i=0; i<l; i++)
+    v[i].clear();
+}
+
+int tagger_utils::ntokens_multiword(wstring const &s) 
+{
+   wchar_t *news = new wchar_t[s.size()+1];
+   wcscpy(news, s.c_str());
+   news[s.size()] = 0;
+   wcerr << news << endl;
+   
+   wchar_t const *delim = L"_";
+   wchar_t *ptr;
+   int n=0;
+   
+   if (wcstok(news, delim, &ptr))
+     n++;  
+   while (wcstok(NULL, delim, &ptr))
+     n++;
+     
+   delete[] news;
+     
+   return n;   
+}
+ 
+int tagger_utils::nguiones_fs(wstring const & s) {
+   wchar_t *news = new wchar_t[s.size()+1];
+   wcscpy(news, s.c_str());
+   news[s.size()] = 0;
+   wcerr << news << endl;   
+   wchar_t const *delim = L"-";
+   wchar_t *ptr;
+   int n=0;
+   
+   if (wcstok(news, delim, &ptr))
+     n++;  
+   while (wcstok(NULL, delim, &ptr))
+     n++;
+     
+   delete[] news;
+     
+   return n;   
+} 
+
+wstring tagger_utils::trim(wstring s) 
+{
+  if (s.length()==0)
+    return L"";
+      
+  for (unsigned int i=0; i<(s.length()-1); i++) {
+    if ((s.at(i)==L' ')&&(s.at(i+1)==L' ')) {
+      s.erase(i,1);
+      i--;
+    }
+  }
+                              
+  if ((s.length()>0)&&(s.at(s.length()-1)==L' '))
+    s.erase(s.length()-1,1);
+  if ((s.length()>0)&&(s.at(0)==L' '))
+    s.erase(0,1);  
+
+  return s;
+}
+
+void
+tagger_utils::read_dictionary(FILE *fdic, TaggerData &td) {
+  int i, k, nw = 0;
+  TaggerWord *word = NULL;
+  set <TTag> tags;
+  Collection &output = td.getOutput();
+
+  MorphoStream morpho_stream(fdic, true, &td);
+
+  // In the input dictionary there must be all punctuation marks, including the end-of-sentece mark
+
+  word = morpho_stream.get_next_word();
+
+  while (word) {
+    if (++nw % 10000 == 0)
+      wcerr << L'.' << flush;
+
+    tags = word->get_tags();
+
+    if (tags.size() > 0)
+      k = output[tags];
+
+    delete word;
+    word = morpho_stream.get_next_word();
+  }
+  wcerr << L"\n";
+
+  // OPEN AMBIGUITY CLASS
+  // It contains all tags that are not closed.
+  // Unknown words are assigned the open ambiguity class
+  k = output[td.getOpenClass()];
+
+  // Create ambiguity class holding one single tag for each tag.
+  // If not created yet
+  int N = (td.getTagIndex()).size();
+  for(i = 0; i != N; i++) {
+    set<TTag> amb_class;
+    amb_class.insert(i);
+    k = output[amb_class];
+  }
+}
+
+set<TTag>
+tagger_utils::find_similar_ambiguity_class(TaggerData &td, set<TTag> &c) {
+  int size_ret = -1;
+  set<TTag> ret = td.getOpenClass(); // return open-class as default, if no better is found.
+  bool skip_class;
+  Collection &output = td.getOutput();
+
+  for(int k=0; k<output.size(); k++) {
+    if ((((int)output[k].size())>((int)size_ret)) && (((int)output[k].size())<((int)c.size()))) {
+      skip_class = false;
+      // Test if output[k] is a subset of class
+      for(set<TTag>::const_iterator it=output[k].begin(); it!=output[k].end(); it++) {
+        if (c.find(*it)==c.end()) {
+           skip_class = true; //output[k] is not a subset of class
+           break;
+        }
+      }
+      if (!skip_class) {
+        size_ret = output[k].size();
+             ret = output[k];
+      }
+    }
+  }
+  return ret;
+}
+
+void
+tagger_utils::require_ambiguity_class(TaggerData &td, set<TTag> &tags, TaggerWord &word, int nw) {
+  if (td.getOutput().has_not(tags)) {
+    wstring errors;
+    errors = L"A new ambiguity class was found. I cannot continue.\n";
+    errors+= L"Word '" + word.get_superficial_form() + L"' not found in the dictionary.\n";
+    errors+= L"New ambiguity class: " + word.get_string_tags() + L"\n";
+    if (nw >= 0) {
+      std::wostringstream ws;
+      ws << (nw + 1);
+      errors+= L"Line number: " + ws.str() + L"\n";
+    }
+    errors+= L"Take a look at the dictionary, then retrain.";
+    fatal_error(errors);
+  }
+}
+
+set<TTag>
+tagger_utils::require_similar_ambiguity_class(TaggerData &td, set<TTag> &tags, TaggerWord &word, bool debug) {
+  if (td.getOutput().has_not(tags)) {
+    if (debug) {
+      wstring errors;
+      errors = L"A new ambiguity class was found. \n";
+      errors += L"Retraining the tagger is necessary so as to take it into account.\n";
+      errors += L"Word '" + word.get_superficial_form() + L"'.\n";
+      errors += L"New ambiguity class: " + word.get_string_tags() + L"\n";
+      wcerr << L"Error: " << errors;
+    }
+    return find_similar_ambiguity_class(td, tags);
+  }
+  return tags;
+}
+
+template <class T>
+ostream& operator<< (ostream& os, const map <int, T> & f){
+  typename map <int, T>::const_iterator it;
+  os<<f.size();
+  for (it=f.begin(); it!=f.end(); it++) 
+    os<<' '<<it->first<<' '<<it->second;
+  return os;
+}
+
+template <class T>
+istream& operator>> (istream& is, map <int, T> & f) {
+  int n, i, k;
+  f.clear();
+  is>>n; 
+  for (k=0; k<n; k++) {
+    is>>i;     // warning: does not work if both
+    is>>f[i];  // lines merged in a single one
+  }
+  if (is.bad()) tagger_utils::fatal_error(L"reading map");
+  return is;
+}
+
+template <class T>
+ostream& operator<< (ostream& os, const set<T>& s) {
+  typename set<T>::iterator it = s.begin();
+  os<<'{';
+  if (it!=s.end()) {
+    os<<*it;
+    while (++it!=s.end()) os<<','<<*it;
+  }
+  os<<'}';
+  return os;
+}
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.cc	(revision 70339)
@@ -0,0 +1,745 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_aligner_tool.h>
+#include <apertium/string_utils.h>
+
+namespace TMXAligner
+{
+
+extern std::string hunglishDictionaryHome;
+extern std::string hunglishExperimentsHome;
+
+void readTrailOrBisentenceList( std::istream& is, Trail& trail )
+{
+  trail.clear();
+  while ( is.peek() != -1 )
+  {
+    int huPos, enPos;
+
+    is >> huPos;
+    if (is.peek()!=' ')
+    {
+      std::wcerr << "no space in line" << std::endl;
+      throw "data error";
+    }
+    is.ignore();
+
+    is >> enPos;
+    if (is.peek()!='\n')
+    {
+      std::wcerr << "too much data in line" << std::endl;
+      throw "data error";
+    }
+    is.ignore();
+
+    trail.push_back(std::make_pair(huPos,enPos));
+  }
+}
+
+void scoreBisentenceListByFile( const BisentenceList& bisentenceList, const std::string& handAlignFile )
+{
+  Trail trailHand;
+  std::ifstream is( handAlignFile.c_str() );
+  readTrailOrBisentenceList( is, trailHand );
+
+  scoreBisentenceList( bisentenceList, trailHand );
+}
+
+void scoreTrailByFile( const Trail& bestTrail, const std::string& handAlignFile )
+{
+  Trail trailHand;
+  std::ifstream is( handAlignFile.c_str() );
+  readTrailOrBisentenceList( is, trailHand );
+
+  scoreTrail( bestTrail, trailHand );
+}
+
+// TEMP TEMP
+void logLexiconCoverageOfBicorpus( SentenceList& huSentenceList, SentenceList& enSentenceList,
+                                   const DictionaryItems& dictionaryItems );
+
+
+// The <p> scores should not be counted. This causes some complications.
+// Otherwise, this is just the average score of segments.
+// Currently this does not like segment lengths of more than two.
+double globalScoreOfTrail( const Trail& trail, const AlignMatrix& dynMatrix,
+                         const SentenceList& huSentenceListGarbled, const SentenceList& enSentenceListGarbled )
+{
+  TrailScoresInterval trailScoresInterval( trail, dynMatrix, huSentenceListGarbled, enSentenceListGarbled );
+
+  return trailScoresInterval(0,trail.size()-1);
+}
+
+
+void collectBisentences( const Trail& bestTrail, const AlignMatrix& dynMatrix,
+                         const SentenceList& huSentenceListPretty, const SentenceList& enSentenceListPretty,
+                         SentenceList& huBisentences, SentenceList& enBisentences,
+                         double qualityThreshold )
+{
+  huBisentences.clear();
+  enBisentences.clear();
+
+  BisentenceList bisentenceList;
+
+  TrailScores trailScores( bestTrail, dynMatrix );
+  trailToBisentenceList( bestTrail, trailScores, qualityThreshold, bisentenceList );
+
+  for (size_t i=0; i<bisentenceList.size(); ++i )
+  {
+    huBisentences.push_back( huSentenceListPretty[ bisentenceList[i].first  ] );
+    enBisentences.push_back( enSentenceListPretty[ bisentenceList[i].second ] );
+  }
+
+//  std::wcerr << huBisentences.size() << " bisentences collected." << std::endl;
+
+}
+
+
+void temporaryDumpOfAlignMatrix( std::ostream& os, const AlignMatrix& alignMatrix )
+{
+  for ( int huPos=0; huPos<alignMatrix.size(); ++huPos )
+  {
+    int rowStart = alignMatrix.rowStart(huPos);
+    int rowEnd   = alignMatrix.rowEnd(huPos);
+    for ( int enPos=rowStart; enPos<rowEnd; ++enPos )
+    {
+      bool numeric = true;
+      if (numeric)
+      {
+        os << alignMatrix[huPos][enPos] << "\t" ;
+      }
+      else
+      {
+        if (alignMatrix[huPos][enPos]<0)
+        {
+          os << ". " ;
+        }
+        else if (alignMatrix[huPos][enPos]<10)
+        {
+          os << alignMatrix[huPos][enPos] << " " ;
+        }
+        else
+        {
+          os << "X " ;
+        }
+      }
+    }
+    os << std::endl;
+  }
+}
+
+
+double alignerToolWithObjects( const DictionaryItems& dictionary,
+                 SentenceList& huSentenceListPretty,
+                 SentenceList& enSentenceList,
+                 const AlignParameters& alignParameters,
+                 std::ostream& os )
+{
+  int huBookSize = huSentenceListPretty.size();
+  int enBookSize = enSentenceList.size();
+
+  SentenceValues huLength,enLength;
+  setSentenceValues( huSentenceListPretty, huLength, alignParameters.utfCharCountingMode ); // Here we use the most originalest Hungarian text.
+  setSentenceValues( enSentenceList,       enLength, alignParameters.utfCharCountingMode );
+
+  bool quasiglobal_stopwordRemoval = false;
+//  std::wcerr << "quasiglobal_stopwordRemoval is set to " << quasiglobal_stopwordRemoval << std::endl;
+  if (quasiglobal_stopwordRemoval)
+  {
+    removeStopwords( huSentenceListPretty, enSentenceList );
+//    std::wcerr << "Stopwords removed." << std::endl;
+  }
+
+  SentenceList huSentenceListGarbled, enSentenceListGarbled;
+
+  normalizeTextsForIdentity( dictionary,
+                             huSentenceListPretty,  enSentenceList,
+                             huSentenceListGarbled, enSentenceListGarbled );
+
+  const int minimalThickness = 500;
+
+  const double quasiglobal_maximalSizeInMegabytes = 4000;
+
+  const int maximalThickness = (int) (
+    quasiglobal_maximalSizeInMegabytes
+    * 1024*1024 /*bytes*/
+    / ( 2*sizeof(double)+sizeof(char) ) /* for the similarity, dynprog and trelli matrices */
+    / (double)( huBookSize ) /* the memory consumption of alignMatrix( huBookSize, enBookSize, thickness ) is huBookSize*thickness. */
+    / 2.4 /* unexplained empirically observed factor. linux top is weird. :) */
+    ) ;
+
+  // Note that thickness is not a radius, it's a diameter.
+  const double thicknessRatio = 10.0;
+
+  int thickness = (int) ( (double)( huBookSize>enBookSize ? huBookSize : enBookSize ) / thicknessRatio ) ;
+
+  thickness = ( thickness>minimalThickness ? thickness : minimalThickness ) ;
+
+  if (thickness>maximalThickness)
+  {
+//    std::wcerr << "WARNING: Downgrading planned thickness " << thickness << " to " << maximalThickness ;
+//    std::wcerr << " to obey memory constraint of " << quasiglobal_maximalSizeInMegabytes << " megabytes " << std::endl;
+//    std::wcerr << "You should recompile if you have much more physical RAM than that. People of the near-future, forgive me for the inconvenience." << std::endl;
+
+    thickness = maximalThickness;
+  }
+
+  AlignMatrix similarityMatrix( huBookSize, enBookSize, thickness, outsideOfRadiusValue );
+
+  sentenceListsToAlignMatrixIdentity( huSentenceListGarbled, enSentenceListGarbled, similarityMatrix );
+//  std::wcerr << std::endl;
+//  std::wcerr << "Rough translation-based similarity matrix ready." << std::endl;
+
+  Trail bestTrail;
+  AlignMatrix dynMatrix( huBookSize+1, enBookSize+1, thickness, 1e30 );
+
+  align( similarityMatrix, huLength, enLength, bestTrail, dynMatrix );
+//  std::wcerr << "Align ready." << std::endl;
+
+  double globalQuality;
+  globalQuality = globalScoreOfTrail( bestTrail, dynMatrix,
+                                      huSentenceListGarbled, enSentenceListGarbled );
+
+  //  std::wcerr << "Global quality of unfiltered align " << globalQuality << std::endl;
+
+  if (alignParameters.realignType==AlignParameters::NoRealign)
+  {
+  }
+  else
+  {
+    AlignMatrix similarityMatrixDetailed( huBookSize, enBookSize, thickness, outsideOfRadiusValue );
+
+    bool success = borderDetailedAlignMatrix( similarityMatrixDetailed, bestTrail, 5/*radius*/ );
+
+    if (!success)
+    {
+//      std::wcerr << "Realign zone too close to quasidiagonal border. Abandoning realign. The align itself is suspicious." << std::endl;
+    }
+    else
+    {
+//      std::wcerr << "Border of realign zone determined." << std::endl;
+
+      switch (alignParameters.realignType)
+      {
+      case AlignParameters::ModelOneRealign:
+        {
+          IBMModelOne modelOne;
+
+          SentenceList huBisentences,enBisentences;
+
+          throw "unimplemented";
+//          std::wcerr << "Plausible bisentences filtered." << std::endl;
+
+          modelOne.build(huBisentences,enBisentences);
+//          std::wcerr << "IBM Model I ready." << std::endl;
+
+          sentenceListsToAlignMatrixIBMModelOne( huSentenceListPretty, enSentenceList, modelOne, similarityMatrixDetailed );
+//          std::wcerr << "IBM Model I based similarity matrix ready." << std::endl;
+          break;
+        }
+      case AlignParameters::FineTranslationRealign:
+        {
+          TransLex transLex;
+          transLex.build(dictionary);
+//          std::wcerr << "Hashtable for dictionary ready." << std::endl;
+
+          sentenceListsToAlignMatrixTranslation( huSentenceListPretty, enSentenceList, transLex, similarityMatrixDetailed );
+
+//          std::wcerr << "Fine translation-based similarity matrix ready." << std::endl;
+          break;
+        }
+
+      case AlignParameters::NoRealign:
+      default:
+	{
+	  break;
+	}
+      }
+
+      Trail bestTrailDetailed;
+      AlignMatrix dynMatrixDetailed( huBookSize+1, enBookSize+1, thickness, 1e30 );
+      align( similarityMatrixDetailed, huLength, enLength, bestTrailDetailed, dynMatrixDetailed );
+//      std::wcerr << "Detail realign ready." << std::endl;
+
+      bestTrail = bestTrailDetailed;
+      dynMatrix = dynMatrixDetailed;
+
+      globalQuality = globalScoreOfTrail( bestTrail, dynMatrix,
+                                          huSentenceListGarbled, enSentenceListGarbled );
+
+      //      std::wcerr << "Global quality of unfiltered align after realign " << globalQuality << std::endl;
+    }
+  }
+
+  TrailScoresInterval trailScoresInterval( bestTrail, dynMatrix, huSentenceListGarbled, enSentenceListGarbled );
+
+  if ( alignParameters.postprocessTrailQualityThreshold != -1 )
+  {
+    postprocessTrail( bestTrail, trailScoresInterval, alignParameters.postprocessTrailQualityThreshold );
+//    std::wcerr << "Trail start and end postprocessed by score." << std::endl;
+  }
+
+  if ( alignParameters.postprocessTrailStartAndEndQualityThreshold != -1 )
+  {
+    postprocessTrailStartAndEnd( bestTrail, trailScoresInterval, alignParameters.postprocessTrailStartAndEndQualityThreshold );
+//    std::wcerr << "Trail start and end postprocessed by score." << std::endl;
+  }
+
+  if ( alignParameters.postprocessTrailByTopologyQualityThreshold != -1 )
+  {
+    postprocessTrailByTopology( bestTrail, alignParameters.postprocessTrailByTopologyQualityThreshold );
+//    std::wcerr << "Trail postprocessed by topology." << std::endl;
+  }
+
+  bool quasiglobal_spaceOutBySentenceLength = true;
+//  std::wcerr << "quasiglobal_spaceOutBySentenceLength is set to " << quasiglobal_spaceOutBySentenceLength << std::endl;
+  if (quasiglobal_spaceOutBySentenceLength)
+  {
+    spaceOutBySentenceLength( bestTrail, huSentenceListPretty, enSentenceList, alignParameters.utfCharCountingMode );
+//    std::wcerr << "Trail spaced out by sentence length." << std::endl;
+  }
+
+  // In cautious mode, auto-aligned rundles are thrown away if
+  // their left or right neighbour holes are not one-to-one.
+  if (alignParameters.cautiousMode)
+  {
+    cautiouslyFilterTrail( bestTrail );
+//    std::wcerr << "Trail filtered by topology." << std::endl;
+  }
+
+  globalQuality = globalScoreOfTrail( bestTrail, dynMatrix,
+                                    huSentenceListGarbled, enSentenceListGarbled );
+
+  //  std::wcerr << "Global quality of unfiltered align after realign " << globalQuality << std::endl;
+
+  bool textual = ! alignParameters.justSentenceIds ;
+
+  if (alignParameters.justBisentences)
+  {
+    BisentenceList bisentenceList;
+    trailToBisentenceList( bestTrail, bisentenceList );
+
+    filterBisentenceListByQuality( bisentenceList, dynMatrix, alignParameters.qualityThreshold );
+
+    BisentenceListScores bisentenceListScores(bisentenceList, dynMatrix);
+
+    for ( size_t i=0; i<bisentenceList.size(); ++i )
+    {
+      int huPos = bisentenceList[i].first;
+      int enPos = bisentenceList[i].second;
+
+      if (textual)
+      {
+        os << huSentenceListPretty[huPos].words;
+      }
+      else
+      {
+        os << huPos ;
+      }
+
+      os << "\t" ;
+
+      if (textual)
+      {
+        os << enSentenceList[enPos].words;
+      }
+      else
+      {
+        os << enPos ;
+      }
+
+      os << "\t" << bisentenceListScores(i);
+
+      os << std::endl;
+    }
+
+    if (! alignParameters.handAlignFilename.empty())
+    {
+      scoreBisentenceListByFile( bisentenceList, alignParameters.handAlignFilename );
+    }
+  }
+  else
+  {
+    filterTrailByQuality( bestTrail, trailScoresInterval, alignParameters.qualityThreshold );
+
+    for ( size_t i=0; i<bestTrail.size()-1; ++i )
+    {
+      // The [huPos, nexthuPos) interval corresponds to the [enPos, nextenPos) interval.
+      int huPos = bestTrail[i].first;
+      int enPos = bestTrail[i].second;
+      int nexthuPos = bestTrail[i+1].first;
+      int nextenPos = bestTrail[i+1].second;
+
+      if (textual)
+      {
+        int j;
+        for ( j=huPos; j<nexthuPos; ++j )
+        {
+            os << huSentenceListPretty[j].words;
+
+            if (j+1<nexthuPos)
+              os << " "; // os << " ~~~ ";
+        }
+
+        os << "\t" ;
+
+        for ( j=enPos; j<nextenPos; ++j )
+        {
+          os << enSentenceList[j].words;
+          if (j+1<nextenPos)
+          {
+            os << " "; // os << " ~~~ ";
+          }
+        }
+      }
+      else // (!textual)
+      {
+        os << huPos << "\t" << enPos ;
+      }
+
+      os << "\t" << trailScoresInterval(i);
+
+      os << std::endl;
+    }
+
+    if (! alignParameters.handAlignFilename.empty())
+    {
+      scoreTrailByFile( bestTrail, alignParameters.handAlignFilename );
+    }
+  }
+
+  return globalQuality;
+}
+
+
+void alignerToolWithFilenames( const DictionaryItems& dictionary,
+                 const std::string& huFilename, const std::string& enFilename,
+                 const AlignParameters& alignParameters,
+                 const std::string& outputFilename)
+{
+  std::ifstream hus(huFilename.c_str());
+  SentenceList huSentenceListPretty;
+  huSentenceListPretty.readNoIds( hus );
+//  std::wcerr << huSentenceListPretty.size() << " hungarian sentences read." << std::endl;
+
+  std::ifstream ens(enFilename.c_str());
+  SentenceList enSentenceList;
+  enSentenceList.readNoIds( ens );
+//  std::wcerr << enSentenceList.size() << " english sentences read." << std::endl;
+
+  if ( (enSentenceList.      size() < huSentenceListPretty.size()/5) ||
+       (huSentenceListPretty.size() < enSentenceList.      size()/5) )
+  {
+//    std::wcerr << "Sizes differing too much. Ignoring files to avoid a rare loop bug." << std::endl;
+    return;
+  }
+
+  if (outputFilename.empty())
+  {
+    /* double globalQuality = */alignerToolWithObjects
+     ( dictionary, huSentenceListPretty, enSentenceList, alignParameters, std::cout );
+
+//    std::wcerr << "Quality " << globalQuality << std::endl ;
+      
+  }
+  else
+  {
+    std::ofstream os(outputFilename.c_str());
+    /*double globalQuality = */ alignerToolWithObjects
+     ( dictionary, huSentenceListPretty, enSentenceList, alignParameters, os );
+
+    // If you want to collect global quality information in batch mode, grep "^Quality" of stderr must do.
+//    std::wcerr << "Quality\t" << outputFilename << "\t" << globalQuality << std::endl ;
+  }
+
+}
+
+void fillPercentParameter( Arguments& args, const std::string& argName, double& value )
+{
+  int valueInt;
+  if ( args.getNumericParam(argName, valueInt))
+  {
+    value = 1.0 * valueInt / 100 ;
+  }
+}
+
+void main_alignerToolUsage()
+{
+  std::wcerr << "Usage (either):\n\
+    alignerTool [ common_arguments ] [ -hand=hand_align_file ] dictionary_file source_text target_text\n\
+\n\
+or:\n\
+    alignerTool [ common_arguments ] -batch dictionary_file batch_file\n\
+\n\
+where\n\
+common_arguments ::= [ -text ] [ -bisent ] [ -utf ] [ -cautious ] [ -realign [ -autodict=filename ] ]\n\
+    [ -thresh=n ] [ -ppthresh=n ] [ -headerthresh=n ] [ -topothresh=n ]\n\
+\n\
+Arguments:\n\
+\n\
+-text\n\
+	The output should be in text format, rather than the default (numeric) ladder format.\n\
+\n\
+-bisent\n\
+	Only bisentences (one-to-one alignment segments) are printed. In non-text mode, their\n\
+	starting rung is printed.\n\
+\n\
+-cautious\n\
+	In -bisent mode, only bisentences for which both the preceding and the following\n\
+	segments are one-to-one are printed. In the default non-bisent mode, only rungs\n\
+	for which both the preceding and the following segments are one-to-one are printed.\n\
+\n\
+-hand=file\n\
+	When this argument is given, the precision and recall of the alignment is calculated\n\
+	based on the manually built ladder file. Information like the following is written\n\
+	on the standard error: \n\
+	53 misaligned out of 6446 correct items, 6035 bets.\n\
+	Precision: 0.991218, Recall: 0.928017\n\
+	\n\
+        Note that by default, 'item' means rung. The switch -bisent also changes the semantics\n\
+	of the scoring from rung-based to bisentence-based and in this case 'item' means bisentences.\n\
+	See File formats about the format of this input align file.\n\
+\n\
+-autodict=filename\n\
+	The dictionary built during realign is saved to this file. By default, it is not saved.\n\
+\n\
+-utf\n\
+	The system uses the character counts of the sentences as information for the\n\
+	pairing of sentences. By default, it assumes one-byte character encoding such\n\
+	as ISO Latin-1 when calculating these counts. If our text is in UTF-8 format,\n\
+	byte counts and character counts are different, and we must use the -utf switch\n\
+	to force the system to properly calculate character counts.\n\
+	Note: UTF-16 input is not supported.\n\
+\n\
+Postfiltering options:\n\
+There are various postprocessors which remove implausible rungs based on various heuristics.\n\
+\n\
+-thresh=n\n\
+	Don't print out segments with score lower than n/100.\n\
+\n\
+-ppthresh=n\n\
+	Filter rungs with less than n/100 average score in their vicinity.\n\
+\n\
+-headerthresh=n\n\
+	Filter all rungs at the start and end of texts until finding a reliably\n\
+	plausible region.\n\
+\n\
+-topothresh=n\n\
+	Filter rungs with less than n percent of one-to-one segments in their vicinity.\n\
+\n\
+";
+}
+
+int main_alignerTool(int argC, char* argV[])
+{
+#ifndef _DEBUG
+  try
+#endif
+  {
+    if (argC<4)
+    {
+      main_alignerToolUsage();
+      throw "";
+    }
+
+    Arguments args;
+    std::vector<const char*> remains;
+    args.read( argC, argV, remains );
+
+    AlignParameters alignParameters;
+    
+    if (args.getSwitchCompact("text"))
+    {
+      alignParameters.justSentenceIds = false;
+    }
+
+    if (args.getSwitchCompact("bisent"))
+    {
+      alignParameters.justBisentences = true;
+    }
+
+    if (args.getSwitchCompact("cautious"))
+    {
+      alignParameters.cautiousMode = true;
+    }
+
+    alignParameters.utfCharCountingMode = args.getSwitchCompact("utf");
+
+    fillPercentParameter( args, "thresh", alignParameters.qualityThreshold );
+
+    fillPercentParameter( args, "ppthresh", alignParameters.postprocessTrailQualityThreshold );
+
+    fillPercentParameter( args, "headerthresh", alignParameters.postprocessTrailStartAndEndQualityThreshold );
+
+    fillPercentParameter( args, "topothresh", alignParameters.postprocessTrailByTopologyQualityThreshold );
+
+    bool batchMode = args.getSwitchCompact("batch") ;
+
+    if (batchMode && (remains.size()!=2) )
+    {
+      std::wcerr << "Batch mode requires exactly two file arguments." << std::endl;
+      std::wcerr << std::endl;
+
+      main_alignerToolUsage();
+      throw "argument error";
+    }
+
+    std::string handArgumentname = "hand";
+    if (args.find(handArgumentname)!=args.end())
+    {
+      if (batchMode)
+      {
+        std::wcerr << "-batch and -" << handArgumentname << " are incompatible switches." << std::endl;
+        throw "argument error";
+      }
+      else
+      {
+        alignParameters.handAlignFilename = args[handArgumentname].dString ;
+        args.erase(handArgumentname);
+
+        if (alignParameters.handAlignFilename.empty())
+        {
+          std::wcerr << "-" << handArgumentname << " switch requires a filename value." << std::endl;
+          throw "argument error";
+        }
+      }
+    }
+
+    std::string autoDictDumpArgumentname = "autodict";
+    if (args.find(autoDictDumpArgumentname)!=args.end())
+    {
+      if (batchMode)
+      {
+        std::wcerr << "-batch and -" << autoDictDumpArgumentname << " are incompatible switches." << std::endl;
+        throw "argument error";
+      }
+      else
+      {
+        alignParameters.autoDictionaryDumpFilename = args[autoDictDumpArgumentname].dString ;
+        args.erase(autoDictDumpArgumentname);
+
+        if (alignParameters.autoDictionaryDumpFilename.empty())
+        {
+          std::wcerr << "-" << autoDictDumpArgumentname << " switch requires a filename value." << std::endl;
+          throw "argument error";
+        }
+      }
+    }
+
+    if (!batchMode && (remains.size()!=3) )
+    {
+      std::wcerr << "Nonbatch mode requires exactly three file arguments." << std::endl;
+      std::wcerr << std::endl;
+
+      main_alignerToolUsage();
+      throw "argument error";
+    }
+
+    try
+    {
+      args.checkEmptyArgs();
+    }
+    catch (...)
+    {
+      std::wcerr << std::endl;
+
+      main_alignerToolUsage();
+      throw "argument error";
+    }
+
+//    std::wcerr << "Reading dictionary..." << std::endl;
+    const char* dicFilename = remains[0] ;
+    DictionaryItems dictionary;
+    std::ifstream dis(dicFilename);
+    dictionary.read(dis);
+
+    if (batchMode)
+    {
+      const char* batchFilename = remains[1] ;
+      std::ifstream bis(batchFilename);
+      
+      while (bis.good()&&!bis.eof())
+      {
+        std::string line;
+        std::getline(bis,line);
+
+        std::vector<std::string> words;
+        split( line, words, '\t' );
+
+        if (words.size()!=3)
+        {
+          std::wcerr << "Batch file has incorrect format." << std::endl;
+          throw "data error";
+        }
+
+        std::string huFilename, enFilename, outFilename;
+        huFilename  = words[0];
+        enFilename  = words[1];
+        outFilename = words[2];
+
+//        std::wcerr << "Processing " << outFilename << std::endl;
+        bool failed = false;
+        try
+        {
+          alignerToolWithFilenames( dictionary, huFilename, enFilename, alignParameters, outFilename );
+        }
+        catch ( const char* errorType )
+        {
+          std::wcerr << errorType << std::endl;
+          failed = true;
+        }
+        catch ( std::exception& e )
+        {
+          std::wcerr << "some failed assertion:" << e.what() << std::endl;
+          failed = true;
+        }
+        catch ( ... )
+        {
+          std::wcerr << "some unknown failed assertion..." << std::endl;
+          failed = true;
+        }
+
+        if (failed)
+        {
+          std::wcerr << "Align failed for " << outFilename << std::endl;
+        }
+      }
+    }
+    else
+    {
+      const char* huFilename  = remains[1] ;
+      const char* enFilename  = remains[2] ;
+
+      alignerToolWithFilenames( dictionary, huFilename, enFilename, alignParameters );
+    }
+  }
+#ifndef _DEBUG
+  catch ( const char* errorType )
+  {
+    std::wcerr << errorType << std::endl;
+    return -1;
+  }
+  catch ( std::exception& e )
+  {
+    std::wcerr << "some failed assertion:" << e.what() << std::endl;
+    return -1;
+  }
+  catch ( ... )
+  {
+    std::wcerr << "some unknown failed assertion..." << std::endl;
+    return -1;
+  }
+#endif
+  return 0;
+}
+
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_alignment.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_alignment.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_alignment.cc	(revision 70339)
@@ -0,0 +1,615 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_alignment.h>
+
+#include <apertium/tmx_words.h> // For SentenceList
+#include <apertium/tmx_dictionary.h> // For FrequencyMap
+#include <apertium/string_utils.h>
+
+#include <iostream>
+#include <map>
+#include <set>
+#include <algorithm>
+
+// Copypaste-elve. TODO Elhelyezni.
+#define massert(e) if (!(e)) { std::wcerr << #e << " failed" << std::endl; throw "assert"; }
+
+std::ostream& operator<<( std::ostream& os, std::pair<int,int> p )
+{
+  os << p.first << "," << p.second;
+  return os;
+}
+
+namespace TMXAligner
+{
+
+
+// Attention, the two-sentence length is the first argument. Usually the Hungarian is, but not here.
+// The bigger the better. closeness is always smaller than bestScore.
+double closeness( double twoSentenceLength, double oneSentenceLength )
+{
+  const double bestScore = 0.3;
+  const double quasiglobal_closenessMultiplier = 0.3;
+
+  double ratio;
+
+  if (twoSentenceLength>oneSentenceLength)
+  {
+    ratio = (twoSentenceLength+1)/(oneSentenceLength+1);
+  }
+  else
+  {
+    ratio = (oneSentenceLength+1)/(twoSentenceLength+1);
+  }
+
+  ratio -= 1.0;
+
+  // assert(ratio>=0);
+  return bestScore - quasiglobal_closenessMultiplier * ratio;
+}
+
+const unsigned char Diag = 1;
+const unsigned char HuSkip = 2;
+const unsigned char EnSkip = 3;
+const unsigned char HuHuEnSkip = 4;
+const unsigned char HuEnEnSkip = 5;
+const unsigned char Dead = 6;
+
+void buildDynProgMatrix( const AlignMatrix& w, const SentenceValues& huLength, const SentenceValues& enLength,
+                         QuasiDiagonal<double>& v, TrelliMatrix& trellis )
+{
+  const int huBookSize = w.size();
+
+
+  int huPos,enPos;
+
+  // v[huPos][enPos] gives the similarity of the [0,huPos) and [0,enPos) intervals.
+  // The smaller value, the better similarity. (Unlike in the original similarity matrix w, where bigger is better.)
+
+  double infinity = 1e6;
+
+  for ( huPos=0; huPos<=huBookSize; ++huPos )
+  {
+    int rowStart = v.rowStart(huPos);
+    int rowEnd   = v.rowEnd(huPos);
+    for ( enPos=rowStart; enPos<rowEnd; ++enPos )
+    {
+      double& val = v.cell(huPos,enPos);
+      unsigned char& trail = trellis.cell(huPos,enPos);
+
+      bool quasiglobal_knightsMoveAllowed = true;
+      if (quasiglobal_knightsMoveAllowed)
+      {
+        double lengthFitness(0);
+
+        bool quasiglobal_lengthFitnessApplied = true;
+
+        // The array is indexed by the step directions. The smaller value, the better.
+        double values[Dead];
+        int i;
+        for ( i=1; i<Dead; ++i )
+          values[i] = infinity;
+
+        if (huPos>0)
+        {
+          values[HuSkip] = v[huPos-1][enPos]   - skipScore;
+        }
+
+        if (enPos>0)
+        {
+          values[EnSkip] = v[huPos][enPos-1]   - skipScore;
+        }
+
+        if ((huPos>0) && (enPos>0))
+        {
+          if (quasiglobal_lengthFitnessApplied)
+          {
+            lengthFitness = closeness(huLength[huPos-1], enLength[enPos-1]);
+          }
+          else
+          {
+            lengthFitness = 0;
+          }
+
+          values[Diag] = v[huPos-1][enPos-1] - w[huPos-1][enPos-1] - lengthFitness ;
+        }
+
+        const double dotLength = 2.0 ;
+
+        if ((huPos>1) && (enPos>0))
+        {
+          if (quasiglobal_lengthFitnessApplied)
+          {
+            lengthFitness = closeness(huLength[huPos-2]+huLength[huPos-1]+dotLength, enLength[enPos-1]);
+          }
+          else
+          {
+            lengthFitness = 0;
+          }
+
+        }
+
+        if ((huPos>0) && (enPos>1))
+        {
+          if (quasiglobal_lengthFitnessApplied)
+          {
+            // Attention, the two-sentence length is the first argument. Usually the Hungarian is the first argument, but not here.
+            lengthFitness = closeness(enLength[enPos-2]+enLength[enPos-1]+dotLength, huLength[huPos-1]);
+          }
+          else
+          {
+            lengthFitness = 0;
+          }
+
+          const double& a = w[huPos-1][enPos-1] ;
+          const double& b = w[huPos-1][enPos-2] ;
+          values[HuEnEnSkip] = v[huPos-1][enPos-2] - ( a<b ? a : b ) - skipScore - lengthFitness ; // The worse of the two crossed square.
+        }
+
+        unsigned char direction = Dead;
+        double bestValue = infinity;
+        for ( i=1; i<Dead; ++i )
+        {
+          if (values[i]<bestValue)
+          {
+            bestValue = values[i];
+            direction = i;
+          }
+        }
+
+        trail = direction;
+        if (direction==Dead)
+        {
+          val = 0;
+        }
+        else
+        {
+          val = bestValue;
+        }
+      }
+      else // (!quasiglobal_knightsMoveAllowed)
+      {
+        int borderCase = ( (huPos==0) ? 0 : 2 ) + ( (enPos==0) ? 0 : 1 ) ;
+
+        switch (borderCase)
+        {
+        case 0:
+          {
+            val = 0;
+            trail = Dead;
+            break;
+          }
+        case 1: // huPos==0
+          {
+            val = v[0][enPos-1] - skipScore ;
+            trail = EnSkip;
+            break;
+          }
+        case 2: // enPos==0
+          {
+            val = v[huPos-1][0] - skipScore ;
+            trail = HuSkip;
+            break;
+          }
+        case 3:
+          {
+            double x  = v[huPos-1][enPos]   - skipScore ;
+            double y  = v[huPos]  [enPos-1] - skipScore ;
+            double xy = v[huPos-1][enPos-1] - w[huPos-1][enPos-1] ;
+
+            double best = xy;
+            trail = Diag;
+            if (x<best)
+            {
+              best = x;
+              trail = HuSkip;
+            }
+            if (y<best)
+            {
+              best = y;
+              trail = EnSkip;
+            }
+            val = best;
+            break;
+          }
+        }
+      }
+    }
+  }
+}
+
+void trelliToLadder( const TrelliMatrix& trellis, Trail& bestTrail )
+{
+  bestTrail.clear();
+
+  // The -1 is needed because the trellis matrix is one larger than the similarity matrix.
+  // This points to its downmost rightmost element.
+  const int huBookSize = trellis.size()-1;
+  const int enBookSize = trellis.otherSize()-1;
+
+  int huPos=huBookSize;
+  int enPos=enBookSize;
+
+  bool logging = false;
+
+  if (logging) std::wcerr << std::endl;
+
+  bool over = false;
+  bool hopelesslyBadTrail = false;
+  bestTrail.push_back(std::make_pair(huPos,enPos));
+
+  while (true)
+  {
+    unsigned char trelli = trellis[huPos][enPos];
+
+    if ((huPos==0) || (enPos==0))
+      break;
+
+    switch (trelli)
+    {
+    case Diag :
+    {
+      --huPos;
+      --enPos;
+      break;
+    }
+    case HuSkip :
+    {
+      --huPos;
+      break;
+    }
+    case EnSkip :
+    {
+      --enPos;
+      break;
+    }
+    case HuHuEnSkip :
+    {
+      huPos -= 2;
+      --enPos;
+      break;
+    }
+    case HuEnEnSkip :
+    {
+      --huPos;
+      enPos -= 2;
+      break;
+    }
+    case Dead :
+    {
+      over = true;
+      break;
+    }
+    default:
+    {
+      hopelesslyBadTrail = true;
+      over = true;
+      break;
+    }
+    }
+
+    if (over)
+      break;
+
+    bestTrail.push_back(std::make_pair(huPos,enPos));
+
+    if (logging)
+    {
+      std::wcerr << huPos << " \t" << enPos << std::endl;
+    }
+
+  }
+
+  if (hopelesslyBadTrail)
+  {
+    bestTrail.clear();
+    bestTrail.push_back(std::make_pair(huBookSize,enBookSize));
+    bestTrail.push_back(std::make_pair(0,0));
+    std::wcerr << "Error: hopelessly bad trail." << std::endl;
+  }
+
+  std::reverse(bestTrail.begin(),  bestTrail.end()  );
+}
+
+
+void align( const AlignMatrix& w, const SentenceValues& huLength, const SentenceValues& enLength,
+            Trail& bestTrail, AlignMatrix& v )
+{
+  const int huBookSize = w.size();
+  const int enBookSize = w.otherSize();
+  const int thickness  = w.thickness();
+
+  massert(w.size()+1 == v.size());
+  massert(w.otherSize()+1 == v.otherSize());
+
+  TrelliMatrix trellis( huBookSize+1,enBookSize+1,thickness, Dead );
+
+  buildDynProgMatrix( w, huLength, enLength, v, trellis );
+
+//  std::wcerr << "Matrix built." << std::endl;
+
+  trelliToLadder( trellis, bestTrail );
+
+//  std::wcerr << "Trail found." << std::endl;
+}
+
+
+bool oneToOne( const Trail& bestTrail, int pos )
+{
+  return (
+      ( bestTrail[pos+1].first -bestTrail[pos].first  == 1 )
+        &&
+      ( bestTrail[pos+1].second-bestTrail[pos].second == 1 )
+     );
+}
+
+
+int countIntersectionOfTrails( const Trail& sx, const Trail& sy )
+{
+  int inter(0);
+
+  Trail::const_iterator sxt = sx.begin();
+  Trail::const_iterator syt = sy.begin();
+  Trail::const_iterator sxe = sx.end();
+  Trail::const_iterator sye = sy.end();
+  for ( ; sxt!=sxe && syt!=sye ; )
+  {
+    if ( *sxt < *syt )
+      ++sxt;
+    else if ( *sxt > *syt )
+      ++syt;
+    else
+    {
+      ++inter;
+      ++sxt;
+      ++syt;
+    }
+  }
+  return inter;
+}
+
+
+// A bit of an abuse of the fact that Trail and BisentenceList are typedef'd to the same structure.
+double scoreTrailOrBisentenceList( const Trail& trailAuto, const Trail& trailHand )
+{
+  int score = countIntersectionOfTrails( trailAuto, trailHand );
+
+  std::wcerr << trailAuto.size()-score << " misaligned out of " << trailHand.size() << " correct items, "
+    << trailAuto.size() << " bets." << std::endl;
+
+  std::wcerr << "Precision: " << 1.0*score/trailAuto.size()
+    << ", Recall: " << 1.0*score/trailHand.size() << std::endl;
+
+  double ratio = 1.0*(trailAuto.size()-score)/trailAuto.size();
+  return ratio;
+}
+
+
+void trailToBisentenceList( const Trail& bestTrail,
+                            BisentenceList& bisentenceList )
+{
+  bisentenceList.clear();
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=0; pos<trailSize-1; ++pos )
+  {
+    if ( oneToOne(bestTrail,pos) )
+    {
+      bisentenceList.push_back(bestTrail  [pos]);
+    }
+  }
+}
+
+
+double scoreBisentenceList( const BisentenceList& bisentenceListAuto, const Trail& trailHand )
+{
+  BisentenceList bisentenceListHand;
+  trailToBisentenceList( trailHand, bisentenceListHand );
+
+  double score = scoreTrailOrBisentenceList( bisentenceListAuto, bisentenceListHand ) ;
+
+  return score;
+}
+
+double scoreTrail( const Trail& trailAuto, const Trail& trailHand )
+{
+  return ( scoreTrailOrBisentenceList( trailAuto, trailHand ) );
+}
+
+
+void setBox( AlignMatrix& m, int huPos, int enPos, int radius, int insideOfRadiusValue )
+{
+  for ( int x=huPos-radius; x<=huPos+radius; ++x )
+  {
+    for ( int y=enPos-radius; y<=enPos+radius; ++y )
+    {
+      if ( (x>=0) && (x<m.size()) && (y>=0) && (y<m.otherSize()) )
+      {
+        m.cell(x,y) = insideOfRadiusValue ; // ToDo: Should this be (y,x) instead? Function has args y,x not x,y. Fix here or function
+      }
+    }
+  }
+}
+
+// Fills the complement of the radius of the trail with minus infties.
+// The return value true means success. Failure means that during the fill,
+// we intersected the outside of the quasidiagonal area.
+// In this case, the operation is not finished.
+bool borderDetailedAlignMatrix( AlignMatrix& alignMatrix, const Trail& trail, int radius )
+{
+  int huBookSize = alignMatrix.size();
+
+  int huPos, enPos;
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    int rowStart = alignMatrix.rowStart(huPos);
+    int rowEnd   = alignMatrix.rowEnd(huPos);
+    for ( enPos=rowStart; enPos<rowEnd; ++enPos )
+    {
+      alignMatrix.cell(huPos,enPos) = outsideOfRadiusValue;
+    }
+  }
+
+  // We seriously use the fact that many-to-zero segments are subdivided into one-to-zero segments.
+  // Inside setBox, an exception is thrown if we try to write outside the quasidiagonal.
+  // If we catch such an exception, it means that the quasidiagonal is not thick enough.
+  // In this case, we abandon the whole align, just to be sure.
+  try
+  {
+    for ( size_t i=0; i<trail.size(); ++i )
+    {
+      setBox( alignMatrix, trail[i].first, trail[i].second, radius, insideOfRadiusValue );
+    }
+  }
+  catch ( const char* errorType )
+  {
+    massert( std::string(errorType) == "out of quasidiagonal" )
+    return false;
+  }
+
+  bool verify = true;
+  if (verify)
+  {
+    int numberOfEvaluatedItems(0);
+    for ( huPos=0; huPos<huBookSize; ++huPos )
+    {
+      int rowStart = alignMatrix.rowStart(huPos);
+      int rowEnd   = alignMatrix.rowEnd(huPos);
+      for ( enPos=rowStart; enPos<rowEnd; ++enPos )
+      {
+        if (alignMatrix[huPos][enPos]==insideOfRadiusValue)
+        {
+          ++numberOfEvaluatedItems;
+        }
+      }
+    }
+
+    std::wcerr << numberOfEvaluatedItems << " items inside the border." << std::endl;
+  }
+
+  return true;
+}
+
+template <class T>
+void dumpAlignMatrix( const QuasiDiagonal<T>& alignMatrix )
+{
+  int huPos,enPos;
+
+  int huBookSize = alignMatrix.size();
+  int enBookSize = alignMatrix.otherSize();
+
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    for ( enPos=0; enPos<enBookSize; ++enPos )
+    {
+      int start = alignMatrix.rowStart(huPos);
+      int end   = alignMatrix.rowEnd  (huPos);
+
+      if ( (enPos<start) || (enPos>=end) )
+      {
+        std::cout << "-1\t";
+        continue;
+      }
+
+      std::cout << alignMatrix[huPos][enPos] << "\t";
+    }
+    std::cout << std::endl;
+  }
+}
+
+void dumpAlignMatrix( const QuasiDiagonal<int>& alignMatrix, bool graphical )
+{
+  int huPos,enPos;
+
+  int huBookSize = alignMatrix.size();
+  int enBookSize = alignMatrix.otherSize();
+
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    for ( enPos=0; enPos<enBookSize; ++enPos )
+    {
+      int start = alignMatrix.rowStart(huPos);
+      int end   = alignMatrix.rowEnd  (huPos);
+
+      if ( (enPos<start) || (enPos>=end) )
+      {
+        if (graphical)
+        {
+          std::cout << "   ";
+        }
+        else
+        {
+          std::cout << "-1\t";
+        }
+        continue;
+      }
+
+      if (graphical)
+      {
+        char c(' ');
+        switch (alignMatrix[huPos][enPos])
+        {
+          case 0: c=' '; break;
+          case 1: c='.'; break;
+          case 2: c=':'; break;
+          case 3: c='|'; break;
+          case 4: c='+'; break;
+          default: c='X'; break;
+        }
+        std::cout << c << " ";
+      }
+      else
+      {
+        std::cout << alignMatrix[huPos][enPos] << "\t";
+      }
+    }
+    std::cout << std::endl;
+  }
+}
+
+void dumpTrelliMatrix( const TrelliMatrix& trellis )
+{
+  std::map<int, std::string> directions;
+
+  directions[Diag] = "HuEn";
+  directions[HuSkip] = "Hu";
+  directions[EnSkip] = "En";
+  directions[HuHuEnSkip] = "HuHuEn";
+  directions[HuEnEnSkip] = "HuEnEn";
+  directions[Dead] = "Dead";
+
+  int huPos,enPos;
+
+  int huBookSize = trellis.size();
+  int enBookSize = trellis.otherSize();
+
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    for ( enPos=0; enPos<enBookSize; ++enPos )
+    {
+      int start = trellis.rowStart(huPos);
+      int end   = trellis.rowEnd  (huPos);
+
+      if ( (enPos<start) || (enPos>=end) )
+      {
+        std::cout << "-1\t";
+        continue;
+      }
+
+      std::cout << directions[trellis[huPos][enPos]] << "\t";
+    }
+    std::cout << std::endl;
+  }
+}
+
+} // namespace TMXAligner
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_arguments_parser.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_arguments_parser.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_arguments_parser.cc	(revision 70339)
@@ -0,0 +1,204 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_arguments_parser.h>
+#include <apertium/string_utils.h>
+#include <iostream>
+#include <stdlib.h>
+
+// Could be better.
+bool alphabetic( char c)
+{
+  return ((c>='a')&&(c<='z')) || ((c>='A')&&(c<='Z')) || (c=='_');
+}
+
+bool Arguments::read( int argc, char **argv )
+{
+  for ( int i=1; i<argc; ++i )
+  {
+    std::string p = argv[i];
+    if (p.empty() || p[0]!='-')
+    {
+      std::wcerr << p << ": unable to parse argument\n";
+      throw "argument error";
+      return false;
+    }
+    p.erase(0,1);
+
+    if (p.empty())
+    {
+      std::wcerr << "Empty argument\n";
+      throw "argument error";
+      return false;
+    }
+
+    size_t j;
+
+    for (j = 0 ; j<p.size(); ++j )
+    {
+      if (! alphabetic(p[j]) )
+      {
+        if (p[j]=='=')
+          p.erase(j,1);
+        break;
+      }
+    }
+
+    ArgName name = p.substr(0,j);
+    std::string val = p.substr(j, p.size()-j);
+    int num = atoi(val.c_str());
+
+    AnyData anyData(val);
+    if ( (num!=0) || (val=="0") )
+    {
+      anyData.dInt = num;
+      anyData.kind = AnyData::Int;
+    }
+    operator[](name) = anyData;
+
+  }
+
+  return true;
+}
+
+bool Arguments::read( int argc, char **argv, std::vector<const char*>& remains )
+{
+  remains.clear();
+
+  for ( int i=1; i<argc; ++i )
+  {
+    std::string p = argv[i];
+    if (p.empty() || p[0]!='-')
+    {
+      remains.push_back(argv[i]);
+      continue;
+    }
+
+    p.erase(0,1);
+
+    if (p.empty())
+    {
+      std::wcerr << "Empty argument\n";
+      throw "argument error";
+      return false;
+    }
+
+    size_t j;
+    for (j = 0; j<p.size(); ++j )
+    {
+      if (! alphabetic(p[j]) )
+      {
+        if (p[j]=='=')
+          p.erase(j,1);
+        break;
+      }
+    }
+
+    ArgName name = p.substr(0,j);
+    std::string val = p.substr(j, p.size()-j);
+    int num = atoi(val.c_str());
+
+    AnyData anyData(val);
+    if ( (num!=0) || (val=="0") )
+    {
+      anyData.dInt = num;
+      anyData.kind = AnyData::Int;
+    }
+    operator[](name) = anyData;
+
+  }
+
+  return true;
+}
+
+bool Arguments::getNumericParam( const std::string& name, int& num )
+{
+  const_iterator it=find(name);
+  if (it==end())
+  {
+    // std::wcerr << "Argument -" << name << " missing.\n";
+    return false;
+  }
+
+  if (it->second.kind != AnyData::Int)
+  {
+    std::wcerr << "Argument -" << name << ": integer expected.\n";
+    throw "argument error";
+  }
+
+  num = it->second.dInt;
+  erase(name);
+  return true;
+}
+
+bool Arguments::getSwitchConst( const ArgName& name, bool& sw ) const
+{
+  const_iterator it=find(name);
+  if (it==end())
+  {
+    sw = false;
+    return true;
+  }
+  else if (! it->second.dString.empty())
+  {
+    std::wcerr << "Argument -" << name << ": value is not allowed.\n";
+    return false;
+  }
+  else
+  {
+    sw = true;
+    return true;
+  }
+}
+
+bool Arguments::getSwitch( const ArgName& name, bool& sw )
+{
+  bool ok = getSwitchConst(name, sw);
+  if (ok)
+    erase(name);
+
+  return ok;
+}
+
+bool Arguments::getSwitchCompact( const ArgName& name )
+{
+  bool sw(false);
+  bool ok = getSwitchConst(name, sw);
+  if (ok)
+  {
+    erase(name);
+    return sw;
+  }
+  else
+  {
+    std::wcerr << "No value is allowed for argument -" << name << ".\n";
+    throw "argument error";
+  }
+}
+
+void Arguments::checkEmptyArgs() const
+{
+  if (!empty())
+  {
+    std::wcerr << "Invalid argument: ";
+
+    for ( Arguments::const_iterator it=begin(); it!=end(); ++it )
+    {
+      std::wcerr << "-" << it->first;
+      if (!it->second.dString.empty())
+        std::wcerr << "=" << it->second.dString;
+      std::wcerr << " ";
+    }
+    std::wcerr << std::endl;
+
+    throw "argument error";
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_book_to_matrix.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_book_to_matrix.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_book_to_matrix.cc	(revision 70339)
@@ -0,0 +1,382 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_book_to_matrix.h>
+#include <apertium/tmx_alignment.h>
+#include <apertium/tmx_dictionary.h> // For IBMModelOne
+
+#include <iostream>
+#include <cmath>
+
+#include <fstream> // Just for similarityEvaluator, which should go anyway. TODO.
+
+namespace TMXAligner
+{
+
+
+// (!!!) We assert that sx and sy are ordered sets of Word-s!
+int intersectionSize( const WordList& sx, const WordList& sy )
+{
+  int inter=0;
+  WordList::const_iterator sxt = sx.begin();
+  WordList::const_iterator syt = sy.begin();
+  WordList::const_iterator sxe = sx.end();
+  WordList::const_iterator sye = sy.end();
+  for ( ; sxt!=sxe && syt!=sye ; )
+  {
+    if ( *sxt < *syt )
+      ++sxt;
+    else if ( *sxt > *syt )
+      ++syt;
+    else
+    {
+      ++inter;
+      ++sxt;
+      ++syt;
+    }
+  }
+  return inter;
+}
+
+bool isNumber( const std::string& s )
+{
+  int n = s.size();
+  for ( int i=0; i<n; ++i )
+  {
+    if ( (s[i]<'0') || (s[i]>'9') )
+    {
+      return false;
+    }
+  }
+  return true;
+}
+
+// (!!!) We assert that sx and sy are ordered sets of Word-s!
+int specializedIntersectionSize( const WordList& sx, const WordList& sy )
+{
+  int inter=0;
+  WordList::const_iterator sxt = sx.begin();
+  WordList::const_iterator syt = sy.begin();
+  WordList::const_iterator sxe = sx.end();
+  WordList::const_iterator sye = sy.end();
+
+  int numberOfDifferingNumbers = 0;
+  int numberOfSameNumbers = 0;
+
+  for ( ; sxt!=sxe && syt!=sye ; )
+  {
+    if ( *sxt < *syt )
+    {
+      if (isNumber(*sxt))
+      {
+        ++numberOfDifferingNumbers;
+      }
+      ++sxt;
+    }
+    else if ( *sxt > *syt )
+    {
+      if (isNumber(*syt))
+      {
+        ++numberOfDifferingNumbers;
+      }
+      ++syt;
+    }
+    else
+    {
+      if (isNumber(*syt))
+      {
+        ++numberOfSameNumbers;
+      }
+      ++inter;
+      ++sxt;
+      ++syt;
+    }
+  }
+
+  if ( (numberOfSameNumbers>0) && ( numberOfDifferingNumbers <= numberOfSameNumbers/5 ) )
+  {
+    inter += 10;
+  }
+
+  return inter;
+}
+
+const std::string paragraphString = "<p>";
+
+bool isParagraph( const Phrase& phrase )
+{
+  return ( (phrase.size()==1) && (phrase[0]==paragraphString) );
+}
+
+bool exceptionalScoring( const Phrase& hu, const Phrase& en, double& score )
+{
+  bool huIsParagraph = isParagraph(hu);
+  bool enIsParagraph = isParagraph(en);
+
+  // We like it if both are paragraph delimiters
+  if ( huIsParagraph && enIsParagraph )
+  {
+    score = scoreOfParagraphMatch;
+    return true;
+  }
+
+  if ( huIsParagraph || enIsParagraph )
+  {
+    score = scoreOfParagraphMisMatch;
+    return true;
+  }
+
+  return false;
+}
+
+
+const double maximumScore = 3.0;
+
+double scoreByIdentity( const Phrase& hu, const Phrase& en )
+{
+  double score = 0;
+  if ( ! exceptionalScoring( hu, en, score ) )
+  {
+    score = specializedIntersectionSize( hu, en );
+
+    // If we divide with max here, we are better at avoiding global mistakes.
+    // If we divide with min here, we are better at avoiding local mistakes.
+    // I think. This is just a theory. :)
+    // What is fact? If we divide with min, we give higher scores to valid 2-to-1 segments.
+    // But we make silly mistakes because we give higher scores to some invalid 1-to-1 segments like this:
+    // Kocogtam. -Like I said, I was out jogging-- -ObviousIy, you weren't jogging.
+    // Remember the day that they threw you out?
+    // 
+    // Hopefully Gale-Church scoring compensates for this. Sometimes does not compensate enough.
+    score /= ( (hu.size()<en.size() ? hu.size() : en.size() ) + 1 ) ;
+    score *= maximumScore ;
+  }
+
+  return score;
+}
+
+void sentenceListsToAlignMatrixIdentity( const SentenceList& huSentenceList, const SentenceList& enSentenceList, AlignMatrix& alignMatrix )
+{
+  int huPos,enPos;
+
+  int huBookSize = huSentenceList.size();
+
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    int rowStart = alignMatrix.rowStart(huPos);
+    int rowEnd   = alignMatrix.rowEnd(huPos);
+    for ( enPos=rowStart; enPos<rowEnd; ++enPos )
+    {
+      const Phrase& hu = huSentenceList[huPos].words;
+      const Phrase& en = enSentenceList[enPos].words;
+
+      alignMatrix.setCell( huPos, enPos, scoreByIdentity(hu,en) );
+    }
+
+    bool rarelyLogging = true;
+
+    if (!rarelyLogging || (huPos%100==0))
+    {
+     // std::wcerr << huPos << " ";
+    }
+  }
+}
+
+double scoreByTranslation( const Phrase& hu, const Phrase& en, const TransLex& transLex )
+{
+  double score = 0;
+  if ( ! exceptionalScoring( hu, en, score ) )
+  {
+    for ( size_t huPos=0; huPos<hu.size(); ++huPos )
+    {
+      const Word& huWord = hu[huPos];
+      // TODO Ezt lookupLeftWord es intersection_size kombinaciojaval kell:
+      for ( size_t enPos=0; enPos<en.size(); ++enPos )
+      {
+        const Word& enWord = en[enPos];
+        if ( (huWord==enWord) && (huWord!="is") && (huWord!="a") )
+        {
+          ++score;
+        }
+        else if (transLex.isPresent(huWord,enWord))
+        {
+          ++score;
+        }
+      }
+    }
+  }
+
+  return score;
+}
+
+// This is much-much slower, but instead of identity, uses a many-to-many dictionary.
+// For performance reasons, by convention does not calculate the similarity if the 
+// alignMatrix element contains outsideOfRadiusValue, a big negative number.
+void sentenceListsToAlignMatrixTranslation(
+                                           const SentenceList& huSentenceList, const SentenceList& enSentenceList,
+                                           const TransLex& transLex,
+                                           AlignMatrix& alignMatrix )
+{
+
+  int huPos,enPos;
+
+  int huBookSize = huSentenceList.size();
+
+  int numberOfEvaluatedItems(0);
+
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    int rowStart = alignMatrix.rowStart(huPos);
+    int rowEnd   = alignMatrix.rowEnd(huPos);
+    for ( enPos=rowStart; enPos<rowEnd; ++enPos )
+    {
+      if (alignMatrix[huPos][enPos]==outsideOfRadiusValue)
+      {
+        continue;
+      }
+
+      ++numberOfEvaluatedItems;
+
+      const Phrase& hu = huSentenceList[huPos].words;
+      const Phrase& en = enSentenceList[enPos].words;
+
+      alignMatrix.setCell( huPos, enPos, scoreByTranslation( hu, en, transLex ) );
+    }
+
+    bool rarelyLogging = true;
+
+    if (!rarelyLogging || (huPos%100==0))
+    {
+     // std::wcerr << huPos << " (" << numberOfEvaluatedItems << ") ";
+    }
+  }
+}
+
+double scoreByModelOne( const Phrase& hu, const Phrase& en, const IBMModelOne& modelOne )
+{
+  double score = 0;
+  if ( ! exceptionalScoring( hu, en, score ) )
+  {
+    score = - modelOne.distance(hu,en);
+  }
+
+  return score;
+}
+
+void sentenceListsToAlignMatrixIBMModelOne(
+                                           const SentenceList& huSentenceList, const SentenceList& enSentenceList,
+                                           const IBMModelOne& modelOne,
+                                           AlignMatrix& alignMatrix )
+{
+  int huPos,enPos;
+
+  int huBookSize = huSentenceList.size();
+
+  for ( huPos=0; huPos<huBookSize; ++huPos )
+  {
+    int rowStart = alignMatrix.rowStart(huPos);
+    int rowEnd   = alignMatrix.rowEnd(huPos);
+    for ( enPos=rowStart; enPos<rowEnd; ++enPos )
+    {
+      if (alignMatrix[huPos][enPos]==outsideOfRadiusValue)
+      {
+        continue;
+      }
+
+      const Phrase& hu = huSentenceList[huPos].words;
+      const Phrase& en = enSentenceList[enPos].words;
+
+      alignMatrix.setCell( huPos, enPos, scoreByModelOne( hu, en, modelOne ) );
+    }
+
+    bool rarelyLogging = true;
+
+    if (!rarelyLogging || (huPos%100==0))
+    {
+     // std::wcerr << huPos << " ";
+    }
+  }
+}
+
+const double paragraphDelimiterFictiveLength = 0.1973;
+
+int characterLength( const Word& word, bool utfCharCountingMode )
+{
+  if (utfCharCountingMode)
+  {
+    int length = 0;
+    for ( size_t i=0; i<word.size(); ++i )
+    {
+      // A code is the start of an utf-8 byte-sequence describing a character
+      // iff it is not in the [128,192) range. 
+      if (((unsigned char)word[i]<(unsigned char)128)||((unsigned char)word[i]>=(unsigned char)192))
+      {
+        ++length;
+      }
+    }
+    return length;
+  }
+  else
+  {
+    return word.size();
+  }
+}
+
+double characterLength( const Phrase& words, bool utfCharCountingMode )
+{
+  // A space ennyi betut er:
+  const double spaceValue = 0; // 1.5;
+
+
+  if (isParagraph(words))
+  {
+    return paragraphDelimiterFictiveLength;
+  }
+
+  double sum(0);
+  for ( size_t i=0; i<words.size(); ++i )
+  {
+    sum += characterLength( words[i], utfCharCountingMode ) + spaceValue ;
+  }
+  return sum;
+}
+
+double characterLength( int start, int end,
+                 const SentenceList& sentenceList, bool utfCharCountingMode )
+{
+  // A mondat vege ennyi betut er:
+  const double sentenceValue = 3 ;
+
+  double sum(0);
+  for ( int i=start; i<end; ++i )
+  {
+    double len = characterLength( sentenceList[i].words, utfCharCountingMode );
+
+    if ( len != paragraphDelimiterFictiveLength )
+    {
+      sum += len + sentenceValue ;
+    }
+  }
+  return sum;
+}
+
+void setSentenceValues( const SentenceList& sentences, SentenceValues& lengths, bool utfCharCountingMode )
+{
+  lengths.clear();
+
+  for ( size_t i=0; i<sentences.size(); ++i )
+  {
+    lengths.push_back( characterLength(sentences[i].words,utfCharCountingMode) );
+  }
+}
+
+
+} // namespace TMXAligner
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dic_tree.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dic_tree.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dic_tree.h	(revision 70339)
@@ -0,0 +1,215 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_TEIREADER_DICTIONARIES_H
+#define __TMXALIGNER_TEIREADER_DICTIONARIES_H
+
+#include <map>
+#include <vector>
+#include <set>
+#include <iostream>
+
+namespace TMXAligner
+{
+
+// A simple tree class.
+// 
+template <class Atom, class Identifier>
+class DicTree
+{
+public:
+  // Gets value a bit below. Ugly C++.
+  static const bool WarnOnConflict;
+
+  DicTree() : id(0) {}
+  DicTree( const Identifier& id_ ) : id(id_) {}
+
+  ~DicTree();
+
+  const Identifier& getIdentifier() const { return id; }
+  void setIdentifier( const Identifier& id_) { id=id_; }
+  DicTree<Atom, Identifier>* lookup( const Atom& word ) const;
+  DicTree& add( const Atom& word, const Identifier& id );
+  bool empty() const { return children.empty(); }
+
+  void dump( std::ostream& os ) const;
+
+private:
+  typedef std::map<Atom,DicTree*> DicTreeMap;
+  DicTreeMap children;
+  Identifier id;
+};
+
+template <class Atom, class Identifier>
+const bool DicTree<Atom,Identifier>::WarnOnConflict = false;
+
+// This structure stores a very sparse set-system of words.
+// (A dictionary of complex expressions.)
+// 
+// It supports the following query:
+// It receives a set of words S. It gives back the sets 
+// of the set system that are contained in this set S.
+// 
+// For it to be effective, we must be careful during the building phase:
+// words in vector 'words' must be ordered by INCREASING frequency. Rare words first.
+
+template <class Atom, class Identifier>
+class SubsetLookup
+{
+public:
+
+  typedef std::vector<Atom> Atoms;
+
+  void add( const Atoms& words, const Identifier& id );
+
+  void lookup( const Atoms& words, std::set<Identifier>& results ) const;
+
+  void dump( std::ostream& os ) const;
+
+private:
+  DicTree<Atom,Identifier> tree;
+};
+
+// Implementation. F.ck C++ for having to put this in a header.
+
+template <class Atom, class Identifier>
+DicTree<Atom, Identifier>::~DicTree()
+{
+  for ( typename DicTreeMap::iterator it=children.begin(); it!=children.end(); ++it )
+  {
+    delete it->second;
+  }
+}
+
+// Az id-t soha nem irja at nullarol nemnullara.
+// Ha nemnullarol nemnullara irja at, akkor kiabal elotte.
+template <class Atom, class Identifier>
+DicTree<Atom, Identifier>& DicTree<Atom, Identifier>::add( const Atom& word, const Identifier& id )
+{
+  DicTree* v = lookup(word);
+  if (!v)
+  {
+    v = new DicTree<Atom, Identifier>();
+    v->id = id;
+    children[word] = v;
+  }
+  else
+  {
+    if ( ( v->id != 0 ) && ( id != 0 ) )
+    {
+      if (WarnOnConflict)
+        std::wcerr << "warning: conflict in tree" << std::endl;
+    }
+    if ( id != 0 )
+    {
+      v->id = id;
+    }
+  }
+
+  return (*v);
+}
+
+template <class Atom, class Identifier>
+DicTree<Atom, Identifier>* DicTree<Atom, Identifier>::lookup( const Atom& word ) const
+{
+  typename DicTreeMap::const_iterator ft = children.find(word);
+
+  if (ft==children.end())
+  {
+    return 0;
+  }
+  else
+  {
+    return ft->second;
+  }
+}
+
+template <class Atom, class Identifier>
+void DicTree<Atom, Identifier>::dump( std::ostream& os ) const
+{
+  if (id!=0)
+  {
+    os << id << " ";
+  }
+  os << "{" << std::endl;
+  for ( typename DicTreeMap::const_iterator it=children.begin(); it!=children.end(); ++it )
+  {
+    os << it->first << " ";
+    it->second->dump(os);
+  }
+  os << "}" << std::endl;
+}
+
+template <class Atom, class Identifier>
+void SubsetLookup<Atom, Identifier>::add( const Atoms& words, const Identifier& id )
+{
+  DicTree<Atom, Identifier>* v = &tree;
+
+  for ( typename Atoms::const_iterator it=words.begin(); it!=words.end(); ++it )
+  {
+    DicTree<Atom, Identifier>& newv = v->add(*it,0);
+    v = &newv;
+  }
+  if ( v->getIdentifier() == 0 )
+  {
+    v->setIdentifier(id);
+  }
+  else
+  {
+    if (DicTree<Atom, Identifier>::WarnOnConflict)
+      std::wcerr << "warning: conflict in tree" << std::endl;
+  }
+}
+
+template <class Atom, class Identifier>
+void SubsetLookup<Atom, Identifier>::lookup( const Atoms& words, std::set<Identifier>& results ) const
+{
+  typedef std::set<const DicTree<Atom, Identifier>*> Pebbles;
+  Pebbles pebbles;
+  pebbles.insert(&tree);
+
+  results.clear();
+
+  for ( typename Atoms::const_iterator it=words.begin(); it!=words.end(); ++it )
+  {
+    const Atom& word = *it;
+
+    for ( typename Pebbles::const_iterator jt=pebbles.begin(); jt!=pebbles.end(); ++jt )
+    {
+      const DicTree<Atom, Identifier>* subTree = (*jt)->lookup(word) ;
+      
+      if (!subTree)
+        continue;
+
+      const Identifier& id = subTree->getIdentifier();
+      if (id!=0)
+      {
+        results.insert(id);
+      }
+
+      if (!subTree->empty())
+      {
+        pebbles.insert(subTree);
+      }
+    }
+  }
+}
+
+template <class Atom, class Identifier>
+void SubsetLookup<Atom, Identifier>::dump( std::ostream& os ) const
+{
+  tree.dump(os);
+}
+
+} // namespace TMXAligner
+
+
+#endif // #define __TMXALIGNER_TEIREADER_DICTIONARIES_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dictionary.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dictionary.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dictionary.cc	(revision 70339)
@@ -0,0 +1,671 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_dictionary.h>
+
+#include <apertium/tmx_serialize_impl.h>
+#include <apertium/tmx_strings_and_streams.h>
+
+#include <fstream>
+#include <iostream>
+#include <set>
+#include <cassert>
+#include <sstream>
+
+#include <cmath>
+
+#define massert(e) if (!(e)) { std::wcerr << #e << " failed" << std::endl; throw "assert"; }
+
+namespace TMXAligner
+{
+
+void eatwhite( std::istream& is )
+{
+  while (true)
+  {
+    char c=is.peek();
+    if ( (c!=' ') && (c!='\t') )
+    {
+      break;
+    }
+    is.ignore();
+    if (is.eof())
+      break;
+  }
+}
+
+void read( WordList& ph, std::istream& is )
+{
+  ph.clear();
+
+  while (true)
+  {
+    if (is.eof())
+    {
+      break;
+    }
+    if (is.peek()=='\r')
+    {
+      is.ignore();
+    }
+    if (is.peek()=='\n')
+    {
+      is.ignore();
+      break;
+    }
+
+    Word w;
+    is >> w;
+
+    eatwhite(is);
+
+    if (w.empty())
+      break;
+
+    ph.push_back(w);
+  }
+}
+
+void SentenceList::read( std::istream& is )
+{
+  clear();
+
+  while (!is.eof())
+  {
+    Sentence sentence;
+
+    is >> sentence.id;
+
+    if (sentence.id.empty())
+      break;
+
+    if (is.peek()!='\t')
+      break;
+    is.ignore();
+
+    TMXAligner::read( sentence.words, is );
+
+    push_back(sentence);
+  }
+}
+
+void SentenceList::readNoIds( std::istream& is )
+{
+  clear();
+
+  while ( (is.good()) && (!is.eof()) )
+  {
+    Sentence sentence;
+
+    TMXAligner::read( sentence.words, is );
+
+    push_back(sentence);
+  }
+}
+
+void SentenceList::write( std::ostream& os ) const
+{
+  for ( size_t i=0; i<size(); ++i )
+  {
+    const Sentence& sentence = operator[](i);
+    os << sentence.id << "\t" << sentence.words << "\n";
+  }
+  os.flush();
+}
+
+void SentenceList::writeNoIds( std::ostream& os ) const
+{
+  for ( size_t i=0; i<size(); ++i )
+  {
+    const Sentence& sentence = operator[](i);
+    os << sentence.words << "\n";
+  }
+  os.flush();
+}
+
+void readBicorpus( std::istream& is, SentenceList& huSentenceList, SentenceList& enSentenceList)
+{
+  huSentenceList.clear();
+  enSentenceList.clear();
+
+  while ( (is.good()) && (!is.eof()) )
+  {
+    std::string line;
+
+    std::vector<std::string> halfs;
+    std::getline(is,line,'\n');
+
+    if (line.empty())
+    {
+      break;
+    }
+
+    split( line, halfs );
+    if (halfs.size()!=2)
+    {
+      std::wcerr << "Incorrect bicorpus file: " << halfs.size() << " records in line " << huSentenceList.size() << std::endl;
+      throw "data error";
+    }
+
+    {
+      std::istringstream iss(halfs[0]);
+
+      Sentence sentence;
+      read( sentence.words, iss );
+
+      huSentenceList.push_back(sentence);
+    }
+    {
+      std::istringstream iss(halfs[1]);
+
+      Sentence sentence;
+      read( sentence.words, iss );
+
+      enSentenceList.push_back(sentence);
+    }
+  }
+}
+
+void writeBicorpus( std::ostream& os, const SentenceList& huSentenceList, const SentenceList& enSentenceList)
+{
+  assert(huSentenceList.size()==enSentenceList.size());
+
+  for ( size_t i=0; i<huSentenceList.size(); ++i )
+  {
+    os << huSentenceList[i].words << "\t" << enSentenceList[i].words << "\n";
+  }
+  os.flush();
+}
+
+void HalfDictionary::read( std::istream& is )
+{
+  clear();
+
+  while (!is.eof())
+  {
+    WordList ph;
+    TMXAligner::read(ph,is);
+
+    if (ph.empty())
+      continue;
+
+    push_back(ph);
+  }
+}
+
+void DictionaryItems::read( std::istream& is )
+{
+  clear();
+
+  while (!is.eof())
+  {
+    WordList hu;
+    WordList en;
+    Word delimiter;
+
+    bool engPart = true;
+
+    while (true)
+    {
+      Word w;
+      is >> w;
+
+      if (w.empty())
+        break;
+
+      // We allow vonyo7's "@" delimiter, and vonyokornai's "@V", "@N" etc. delimiters.
+      if ( (w.size()<=2) && (w[0]=='@') )
+      {
+        engPart = false;
+        delimiter = w;
+      }
+      else if (engPart)
+      {
+        en.push_back(w);
+      }
+      else
+      {
+        hu.push_back(w);
+      }
+
+      while ( (is.peek()==' ') || (is.peek()=='\r') )
+      {
+        is.ignore();
+      }
+      
+      if (is.peek()=='\n')
+      {
+        is.ignore();
+        break;
+      }
+    }
+
+    if (en.empty())
+      break;
+
+    push_back(std::make_pair(en,hu));
+
+  }
+
+}
+
+
+void Dictionary::read( const char* dictionaryFile )
+{
+  throw "unimplemented";
+}
+
+void Dictionary::build( const DictionaryItems& dictionaryItems )
+{
+  throw "unimplemented";
+}
+
+void Dictionary::reverse( const Dictionary& dic )
+{
+  throw "unimplemented";
+}
+
+bool Dictionary::lookupWord( const Word& word, DictionaryItems& results ) const
+{
+  return false;
+}
+
+bool Dictionary::lookupWordSet( const WordList& words, DictionaryItems& results ) const
+{
+  return false;
+}
+
+void FrequencyMap::add( const Word& word )
+{
+  ++operator[](word);
+}
+
+void FrequencyMap::remove( const Word& word )
+{
+  --operator[](word);
+}
+
+void FrequencyMap::build( const WordList& wordList )
+{
+  for ( size_t j=0; j<wordList.size(); ++j )
+  {
+    add(wordList[j]);
+  }
+}
+
+void FrequencyMap::remove( const WordList& wordList )
+{
+  for ( size_t j=0; j<wordList.size(); ++j )
+  {
+    remove(wordList[j]);
+  }
+}
+
+void FrequencyMap::build( const SentenceList& sentenceList )
+{
+  for ( size_t i=0; i<sentenceList.size(); ++i )
+  {
+    for ( size_t j=0; j<sentenceList[i].words.size(); ++j )
+    {
+      add(sentenceList[i].words[j]);
+    }
+  }
+}
+
+int FrequencyMap::total() const
+{
+  const_iterator it;
+
+  int totalItemNum(0);
+  for ( it=begin(); it!=end(); ++it )
+  {
+    totalItemNum += it->second;
+  }
+  return totalItemNum;
+}
+
+void FrequencyMap::dump( std::ostream& os, int itemNum ) const
+{
+  FrequencyMap::ReFrequencyMap reFrequencyMap;
+  reverseMap(reFrequencyMap);
+
+  FrequencyMap::ReFrequencyMap::reverse_iterator rit;
+  for ( rit=reFrequencyMap.rbegin(); rit!=reFrequencyMap.rend(); ++rit )
+  {
+    os << rit->first << "\t" << rit->second << "\n";
+
+    --itemNum;
+    if (itemNum==0)
+      break;
+  }
+  os.flush();
+}
+
+void FrequencyMap::highPassFilter( WordList& allowedWords, double ratio ) const
+{
+  allowedWords.clear();
+
+  FrequencyMap::ReFrequencyMap reFrequencyMap;
+  reverseMap(reFrequencyMap);
+
+  FrequencyMap::ReFrequencyMap::reverse_iterator rit;
+
+  int totalItemNum = total();
+
+  int localItemNum(0);
+  for ( rit=reFrequencyMap.rbegin(); rit!=reFrequencyMap.rend(); ++rit )
+  {
+    localItemNum += rit->first;
+    if ( ((double)localItemNum)/totalItemNum > ratio )
+      break;
+
+    allowedWords.push_back(rit->second);
+  }
+}
+
+void FrequencyMap::lowPassFilter( WordList& allowedWords, double ratio ) const
+{
+  allowedWords.clear();
+
+  FrequencyMap::ReFrequencyMap reFrequencyMap;
+  reverseMap(reFrequencyMap);
+
+  FrequencyMap::ReFrequencyMap::iterator rit;
+
+  int totalItemNum = total();
+
+  int localItemNum(0);
+  for ( rit=reFrequencyMap.begin(); rit!=reFrequencyMap.end(); ++rit )
+  {
+    localItemNum += rit->first;
+
+    if ( ((double)localItemNum)/totalItemNum > ratio )
+      break;
+
+    allowedWords.push_back(rit->second);
+  }
+}
+
+void FrequencyMap::reverseMap( FrequencyMap::ReFrequencyMap& reFrequencyMap ) const
+{
+  reFrequencyMap.clear();
+
+  for ( const_iterator it=begin(); it!=end(); ++it )
+  {
+    reFrequencyMap.insert( FrequencyMap::ReFrequencyMap::value_type(it->second,it->first) );
+  }
+}
+
+
+void filterSentences( SentenceList& sentenceList, const WordList& words )
+{
+  std::set<Word> wordSet;
+
+  for (size_t i=0; i<words.size(); ++i )
+  {
+    wordSet.insert(words[i]);
+  }
+
+  for (size_t i=0; i<sentenceList.size(); ++i )
+  {
+    WordList& wordList = sentenceList[i].words;
+
+    for ( size_t j=0; j<wordList.size(); ++j )
+    {
+      if ( wordSet.find(wordList[j]) == wordSet.end() )
+      {
+        wordList.erase(wordList.begin()+j);
+        --j;
+      }
+    }
+  }
+}
+
+
+void cStyleStringsToStringSet( const char** wordsPtr, std::set<Word>& words )
+{
+  words.clear();
+  const char** currWordsPtr=wordsPtr;
+  while (**currWordsPtr!='\0')
+  {
+    words.insert(*currWordsPtr);
+    ++currWordsPtr;
+  }
+}
+
+void removeHungarianStopwords( SentenceList& huSentenceList )
+{
+  const char* huStopwordsC[] =
+  {
+    "a", "az",
+
+    "egy",
+
+    "�s",
+
+    "nem", "ne",
+
+    "is",
+
+    "van",
+
+    "�",
+
+    "ha",
+
+    ""
+  };
+
+  std::set<Word> stopwords;
+  cStyleStringsToStringSet( huStopwordsC, stopwords );
+
+  
+  for ( size_t i=0; i<huSentenceList.size(); ++i )
+  {
+
+
+    WordList& huWords = huSentenceList[i].words;
+    for ( size_t j=0; j<huWords.size(); )
+    {
+      if (stopwords.find(huWords[j])!=stopwords.end())
+      {
+        huWords.erase(huWords.begin()+j);
+      }
+      else
+      {
+        ++j;
+      }
+    }
+  }
+}
+
+void removeEnglishStopwords( SentenceList& enSentenceList )
+{
+  // Mar megbocsasson mindenki, hogy ezt programkodban rogzitem, de rogzitem.
+  const char* enStopwordsC[] = 
+  {
+    "the", "it",
+
+    "a", "an", "one",
+
+    "and",
+
+    "not", "no",
+
+    "too",
+
+    "is", "be", // Az 1984 be-re stemmeli az is-t.
+
+    "to",
+
+    "he", "she",
+
+    "if",
+
+    "of",
+
+    ""
+  };
+
+  std::set<Word> stopwords;
+  cStyleStringsToStringSet( enStopwordsC, stopwords );
+
+
+  for (size_t i=0; i<enSentenceList.size(); ++i )
+  {
+
+    WordList& enWords = enSentenceList[i].words;
+    for (size_t j=0; j<enWords.size(); )
+    {
+      if (stopwords.find(enWords[j])!=stopwords.end())
+      {
+        enWords.erase(enWords.begin()+j);
+      }
+      else
+      {
+        ++j;
+      }
+    }
+  }
+}
+
+void removeStopwords( SentenceList& huSentenceList, SentenceList& enSentenceList )
+{
+  removeHungarianStopwords( huSentenceList );
+  removeEnglishStopwords  ( enSentenceList );
+}
+
+void TransLex::add( const Word& huWord, const Word& enWord )
+{
+  forward .insert( WordMultimap::value_type( huWord, enWord ) );
+  backward.insert( WordMultimap::value_type( enWord, huWord ) );
+}
+
+// Note that multiword phrases are simply ignored.
+void TransLex::build( const DictionaryItems& dictionaryItems )
+{
+  int added(0), ignored(0);
+  for ( size_t i=0; i<dictionaryItems.size(); ++i )
+  {
+    if ( (dictionaryItems[i].first.size()==1) && (dictionaryItems[i].second.size()==1) )
+    {
+      add( dictionaryItems[i].first[0], dictionaryItems[i].second[0] );
+      ++added;
+    }
+    else
+    {
+      ++ignored;
+    }
+  }
+  std::wcerr << added << " items added to TransLex, " << ignored << " multiword items ignored." << std::endl;
+}
+
+TransLex::DictInterval TransLex::lookupLeftWord ( const Word& huWord ) const
+{
+  return (forward.equal_range(huWord));
+}
+
+TransLex::DictInterval TransLex::lookupRightWord( const Word& enWord ) const
+{
+  return (backward.equal_range(enWord));
+}
+
+bool TransLex::isPresent( const Word& huWord, const Word& enWord ) const
+{
+  DictInterval dictInterval = lookupLeftWord(huWord);
+
+  for ( WordMultimapIt it=dictInterval.first; it!=dictInterval.second; ++it )
+  {
+    if (it->second == enWord)
+    {
+      return true;
+    }
+  }
+  return false;
+}
+
+double IBMModelOne::lookup( const Word& hu, const Word& en ) const
+{
+  TransProbs::const_iterator ft = transProbs.find( std::make_pair(hu,en) );
+
+  if (ft==transProbs.end())
+  {
+    return 0;
+  }
+  else
+  {
+    return ft->second;
+  }
+}
+
+void IBMModelOne::build( const SentenceList& huSentenceList, const SentenceList& enSentenceList )
+{
+  transProbs.clear();
+
+  massert( huSentenceList.size()==enSentenceList.size() );
+
+
+  std::map<Word,double> huProb;
+
+  for ( size_t sen=0; sen<huSentenceList.size(); ++sen )
+  {
+    const Phrase& hu = huSentenceList[sen].words;
+    const Phrase& en = enSentenceList[sen].words;
+
+    double huRatio = 1.0 / hu.size();
+
+    for ( size_t huPos=0; huPos<hu.size(); ++huPos )
+    {
+      const Word& huWord = hu[huPos];
+      huProb[huWord] += huRatio;
+
+      for ( size_t enPos=0; enPos<en.size(); ++enPos )
+      {
+        transProbs[ std::make_pair(huWord, en[enPos]) ] += huRatio ;
+      }
+    }
+  }
+
+  for ( TransProbs::iterator it=transProbs.begin(); it!=transProbs.end(); ++it )
+  {
+    it->second /= huProb[it->first.first];
+  }
+}
+
+void IBMModelOne::reestimate( const SentenceList& huSentenceList, const SentenceList& enSentenceList )
+{
+  throw "unimplemented";
+}
+
+// 
+double IBMModelOne::distance( const Phrase& hu, const Phrase& en ) const
+{
+  double val = log(1.0+hu.size()) / en.size() ;
+
+  for ( size_t enPos=0; enPos<en.size(); ++enPos )
+  {
+    double sum = 0;
+    const Word& enWord = en[enPos];
+
+    for ( size_t huPos=0; huPos<hu.size(); ++huPos )
+    {
+      sum += lookup( hu[huPos], enWord );
+    }
+
+    massert( sum>0 );
+
+    val -= log(sum);
+  }
+
+  throw "unimplemented";
+}
+
+} // namespace TMXAligner
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_trail_postprocessors.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_trail_postprocessors.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_trail_postprocessors.cc	(revision 70339)
@@ -0,0 +1,481 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_trail_postprocessors.h>
+
+#include <apertium/tmx_words.h>
+#include <apertium/tmx_book_to_matrix.h>
+
+#include <iostream>
+#include <cmath>
+
+namespace TMXAligner
+{
+
+const bool global_postprocessLogging = false;
+
+TrailScores::TrailScores( const Trail& trail_, const AlignMatrix& dynMatrix_ ) : trail(trail_), dynMatrix(dynMatrix_) {}
+
+double TrailScores::operator()( int j ) const
+{
+  return
+    dynMatrix[trail[j  ].first][trail[j  ].second]
+    -
+    dynMatrix[trail[j+1].first][trail[j+1].second] ;
+}
+
+BisentenceListScores::BisentenceListScores( const BisentenceList& bisentenceList_, const AlignMatrix& dynMatrix_ ) 
+  : bisentenceList(bisentenceList_), dynMatrix(dynMatrix_) {}
+
+double BisentenceListScores::operator()( int j ) const
+{
+  return
+    dynMatrix[bisentenceList[j].first  ][bisentenceList[j].second]
+    -
+    dynMatrix[bisentenceList[j].first+1][bisentenceList[j].second+1] ;
+}
+
+
+TrailScoresInterval::TrailScoresInterval( const Trail& trail_, const AlignMatrix& dynMatrix_,
+    const SentenceList& huSentenceList_, const SentenceList& enSentenceList_ )
+    : trail(trail_), dynMatrix(dynMatrix_), huSentenceList(huSentenceList_), enSentenceList(enSentenceList_) {}
+
+// The average score of the jth segmentum. The bigger the better.
+// Division is by the maximum of the Hungarian and English intervals.
+// This is a somewhat arbritary decision, and goes very badly with the
+// scoring of the knight's moves. But we really have no better choice.
+// 
+// Also, the method applies some very ugly hacks to avoid the effect of
+// paragraph-delimiters. It strips both intervals of <p>s, and
+// modifies the dynMatrix-based score assuming that all <p>s got paired.
+// except surplus <p>s.
+double TrailScoresInterval::scoreSegmentum( const Rundle& start, const Rundle& end ) const
+{
+  int huDiff = end.first  - start.first  ;
+  int enDiff = end.second - start.second ;
+
+  double score = 
+    dynMatrix[start.first][start.second]
+    -
+    dynMatrix[end.  first][end.  second] ;
+
+  int i;
+  int huParagraphNum(0), enParagraphNum(0) ;
+  for ( i=start.first; i<end.first; ++i )
+  {
+    if (isParagraph(huSentenceList[i].words))
+    {
+      ++huParagraphNum;
+    }
+  }
+  for ( i=start.second; i<end.second; ++i )
+  {
+    if (isParagraph(enSentenceList[i].words))
+    {
+      ++enParagraphNum;
+    }
+  }
+
+  int estimatedParagraphMatches = huParagraphNum<enParagraphNum ? huParagraphNum : enParagraphNum ;
+
+  int estimatedParagraphMismatches = ( huParagraphNum>enParagraphNum ? huParagraphNum : enParagraphNum ) - estimatedParagraphMatches ;
+
+  double scoreDeviationBecauseOfThoseStupidParagraphs =
+    scoreOfParagraphMatch * estimatedParagraphMatches + skipScore * estimatedParagraphMismatches;
+
+  int huDiffParagraphAdjusted = huDiff - huParagraphNum ;
+  int enDiffParagraphAdjusted = enDiff - enParagraphNum ;
+
+  int maxDiffParagraphAdjusted = huDiffParagraphAdjusted>enDiffParagraphAdjusted ? huDiffParagraphAdjusted : enDiffParagraphAdjusted ;
+
+  if (maxDiffParagraphAdjusted==0)
+  {
+    return 0;
+  }
+  else
+  {
+    return ( score - scoreDeviationBecauseOfThoseStupidParagraphs ) / maxDiffParagraphAdjusted ;
+  }
+}
+
+// The score of the jth segmentum. The bigger the better.
+double TrailScoresInterval::operator()( int j ) const
+{
+  Rundle start = trail[j];
+  Rundle end   = trail[j+1];
+
+  return scoreSegmentum( start, end );
+}
+
+double TrailScoresInterval::operator()( int j, int k ) const
+{
+  Rundle start = trail[j];
+  Rundle end   = trail[k];
+
+  return scoreSegmentum( start, end );
+}
+
+
+void removeRundles( Trail& trail, const std::set<int>& rundlesToKill )
+{
+  // Not a speed bottleneck.
+  Trail newTrail;
+  for ( size_t i=0; i<trail.size(); ++i )
+  {
+    if (rundlesToKill.find(i)==rundlesToKill.end())
+    {
+      newTrail.push_back(trail[i]);
+    }
+  }
+
+  trail = newTrail;
+}
+
+
+// In cautious mode, auto-aligned rundles are thrown away if
+// their left or right neighbour holes are not one-to-one.
+// From the -bisent point of view:
+// In cautious mode, auto-aligned one-to-one bisentences are thrown away if
+// they have left or right neighbours which are not one-to-one.
+// This of course dramatically improves precision while slightly degrading recall.
+void cautiouslyFilterTrail( Trail& bestTrail )
+{
+  Trail bestTrailNew;
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=0; pos<trailSize-1; ++pos )
+  {
+    if (
+         (pos==0)
+           || 
+         ( oneToOne(bestTrail,pos-1) && oneToOne(bestTrail,pos) )
+       )
+    {
+      bestTrailNew.push_back(bestTrail  [pos]);
+    }
+  }
+
+  bestTrail = bestTrailNew ;
+}
+
+
+// O, hogy szomorodna meg a C++.
+inline double absValue( double x )
+{
+  return ( x>0 ? x : -x );
+}
+
+// Egy zero-to-nonzero hole valamelyik oldalan levo rundle-t kiirtom, ha a
+// rundle torlese kozeliti az uj hezagban a magyar karakterszam / angol karakterszam
+// hanyadost egyhez. A bal es a jobb kozul azt valasztom, amelyik tobbet javit.
+// 
+// Meg akkor is olvasztok, ha ezzel kicsit rontok, mivel a valodi zero-to-one eleg ritka.
+// Legalabbis regenyekben. Az improvementSlack konstansnak domainfuggonek kellene lennie.
+void spaceOutBySentenceLength( Trail& bestTrail, 
+                 const SentenceList& huSentenceListPretty,
+                 const SentenceList& enSentenceList,
+		 bool utfCharCountingMode )
+{
+  // i most egy hole es nem egy rundle indexe.
+  for ( size_t i=1; i<bestTrail.size()-2; ) // Figyelem, direkt nincs ++i.
+  {
+    bool huZero = (bestTrail[i].first == bestTrail[i+1].first);
+    bool enZero = (bestTrail[i].second== bestTrail[i+1].second);
+
+    bool huParagraph = ( (bestTrail[i].first +1 == bestTrail[i+1].first) && isParagraph(huSentenceListPretty[bestTrail[i].first].words) );
+    bool enParagraph = ( (bestTrail[i].second+1 == bestTrail[i+1].second) && isParagraph(enSentenceList[bestTrail[i].second].words) );
+
+    if (
+         ( huZero && enParagraph )
+         ||
+         ( enZero && huParagraph )
+       )
+    {
+      ++i;
+      continue;
+    }
+
+    // It is a zero-to-any, and the "any" is not a lonely paragraph-delimiter.
+    if (
+         ( huZero && !enParagraph )
+         ||
+         ( enZero && !huParagraph )
+       )
+    {
+      // continue is not allowed here, because of the ++i in the else branch.
+
+      double huRightBlock  = characterLength( bestTrail[i+1].first, bestTrail[i+2].first, huSentenceListPretty, utfCharCountingMode );
+      double huMiddleBlock = characterLength( bestTrail[i].first,   bestTrail[i+1].first, huSentenceListPretty, utfCharCountingMode );
+      double huLeftBlock   = characterLength( bestTrail[i-1].first, bestTrail[i].first,   huSentenceListPretty, utfCharCountingMode );
+    
+      double enRightBlock  = characterLength( bestTrail[i+1].second, bestTrail[i+2].second, enSentenceList, utfCharCountingMode );
+      double enMiddleBlock = characterLength( bestTrail[i].second,   bestTrail[i+1].second, enSentenceList, utfCharCountingMode );
+      double enLeftBlock   = characterLength( bestTrail[i-1].second, bestTrail[i].second,   enSentenceList, utfCharCountingMode );
+
+      // A middleBlock-ok kozul az egyik nulla.
+      double oldLeftRatio = (huLeftBlock+1)/(enLeftBlock+1);
+      double newLeftRatio = (huLeftBlock+huMiddleBlock+1)/(enLeftBlock+enMiddleBlock+1);
+
+      double oldRightRatio = (huRightBlock+1)/(enRightBlock+1);
+      double newRightRatio = (huRightBlock+huMiddleBlock+1)/(enRightBlock+enMiddleBlock+1);
+
+      double improvesLeft  = absValue(log(oldLeftRatio )) - absValue(log(newLeftRatio )) ;
+      double improvesRight = absValue(log(oldRightRatio)) - absValue(log(newRightRatio)) ;
+
+      const double improvementSlack = log(0.8);
+      if ( (improvesLeft>improvementSlack) || (improvesRight>improvementSlack) )
+      {
+        bool eraseLeft = (improvesLeft>improvesRight);
+
+        if (eraseLeft)
+        {
+          bestTrail.erase(bestTrail.begin()+i);
+        }
+        else
+        {
+          bestTrail.erase(bestTrail.begin()+i+1);
+        }
+
+      }
+      else
+      {
+        ++i;
+      }
+    }
+    else
+    {
+      ++i;
+    }
+  }
+}
+
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrailStart( Trail& bestTrail,
+                            const TrailScoresInterval& trailScoresInterval,
+                            const double& qualityThreshold )
+{
+  const int window = 10;
+
+  std::set<int> rundlesToKill;
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=1; pos<trailSize-1-window; ++pos )
+  {
+    double avg = trailScoresInterval( pos, pos+window );
+
+    if (avg<qualityThreshold)
+    {
+      if (global_postprocessLogging)
+      {
+        std::wcerr << "Thrown away at position " << pos
+          << ", avarage " << avg << ", threshold " << qualityThreshold << std::endl;
+      }
+
+      for ( size_t j=pos; (j<size_t(pos+window)) && (j<bestTrail.size()-1); ++j )
+      {
+        rundlesToKill.insert(j);
+      }
+    }
+    else
+    {
+      break;
+    }
+  }
+
+  removeRundles( bestTrail, rundlesToKill );
+}
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrailEnd( Trail& bestTrail,
+                            const TrailScoresInterval& trailScoresInterval,
+                            const double& qualityThreshold )
+{
+  const int window = 10;
+
+  std::set<int> rundlesToKill;
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=trailSize-1-window-1; pos>0; --pos )
+  {
+    double avg = trailScoresInterval( pos, pos+window );
+
+    if (avg<qualityThreshold)
+    {
+      if (global_postprocessLogging)
+      {
+        std::wcerr << "Thrown away at position " << pos
+          << ", avarage " << avg << ", threshold " << qualityThreshold << std::endl;
+      }
+
+      for ( size_t j=pos; (j<size_t(pos+window)) && (j<bestTrail.size()-1); ++j )
+      {
+        rundlesToKill.insert(j);
+      }
+    }
+    else
+    {
+      break;
+    }
+  }
+
+  removeRundles( bestTrail, rundlesToKill );
+}
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrailStartAndEnd( Trail& bestTrail, const TrailScoresInterval& trailScoresInterval, double qualityThreshold )
+{
+  postprocessTrailStart( bestTrail, trailScoresInterval, qualityThreshold );
+  postprocessTrailEnd  ( bestTrail, trailScoresInterval, qualityThreshold );
+}
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrail( Trail& bestTrail, const TrailScoresInterval& trailScoresInterval, double qualityThreshold )
+{
+  const int window = 10;
+
+  std::set<int> rundlesToKill;
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=1; pos<trailSize-1-window; ++pos )
+  {
+    double avg = trailScoresInterval( pos, pos+window );
+
+    if (avg<qualityThreshold)
+    {
+      if (global_postprocessLogging)
+      {
+        std::wcerr << "Thrown away at position " << pos
+          << ", avarage " << avg << ", threshold " << qualityThreshold << std::endl;
+      }
+
+      for ( size_t j=pos; (j<size_t(pos+window)) && (j<bestTrail.size()-1); ++j )
+      {
+        rundlesToKill.insert(j);
+      }
+    }
+  }
+
+  removeRundles( bestTrail, rundlesToKill );
+}
+
+
+// Erases rundles which are predominantly surrounded by not-one-to-one holes.
+void postprocessTrailByTopology( Trail& bestTrail, double qualityThreshold )
+{
+  const int window = 10;
+
+  std::set<int> rundlesToKill;
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=1; pos<trailSize-1-window; ++pos )
+  {
+    double sum=0;
+
+    for ( int j=pos; j<pos+window; ++j )
+    {
+      sum += ( oneToOne(bestTrail,j) ? 1 : 0 ) ;
+    }
+
+    double avg = sum / window ;
+
+    if (avg<qualityThreshold)
+    {
+      if (global_postprocessLogging)
+      {
+        std::wcerr << "Thrown away at position " << pos
+          << ", avarage " << avg << std::endl;
+      }
+
+      for ( size_t j=pos; (j<size_t(pos+window)) && (j<bestTrail.size()-1); ++j )
+      {
+        rundlesToKill.insert(j);
+      }
+    }
+  }
+
+  removeRundles( bestTrail, rundlesToKill );
+}
+
+
+void trailToBisentenceList( const Trail& bestTrail, const TrailScores& trailScores, double qualityThreshold,
+                            BisentenceList& bisentenceList )
+{
+  bisentenceList.clear();
+
+  int trailSize = bestTrail.size();
+
+  for ( int pos=0; pos<trailSize-1; ++pos )
+  {
+    if ( oneToOne(bestTrail,pos) && (trailScores(pos)>=qualityThreshold) )
+    {
+      bisentenceList.push_back(bestTrail[pos]);
+    }
+  }
+}
+
+
+// This is basically incorrect.
+// Here we use the score of the right-hand segment to decide about the rundle.
+//
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void filterTrailByQuality( Trail& trail, const TrailScoresInterval& trailScoresInterval,
+                           const double& qualityThreshold )
+{
+  Trail newTrail;
+
+  newTrail.push_back(trail.front());
+  for ( size_t i=1; i<trail.size()-1; ++i )
+  {
+    if ( trailScoresInterval(i) >= qualityThreshold )
+    {
+      newTrail.push_back(trail[i]);
+    }
+  }
+  newTrail.push_back(trail.back());
+
+  trail = newTrail;
+}
+
+void filterBisentenceListByQuality( BisentenceList& bisentenceList, const AlignMatrix& dynMatrix,
+                                    const double& qualityThreshold )
+{
+  BisentenceList newBisentenceList;
+
+  BisentenceListScores bisentenceListScores(bisentenceList,dynMatrix);
+
+  for ( size_t i=0; i<bisentenceList.size(); ++i )
+  {
+    if ( bisentenceListScores(i) >= qualityThreshold )
+    {
+      newBisentenceList.push_back(bisentenceList[i]);
+    }
+  }
+
+  bisentenceList = newBisentenceList;
+}
+
+} // namespace TMXAligner
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_translate.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_translate.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_translate.cc	(revision 70339)
@@ -0,0 +1,363 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_translate.h>
+
+#include <apertium/tmx_words.h>
+#include <apertium/tmx_dictionary.h>
+#include <apertium/tmx_dic_tree.h>
+#include <apertium/string_utils.h>
+
+#include <algorithm>
+#include <fstream>
+
+namespace TMXAligner
+{
+
+void buildDumbDictionary( const DictionaryItems& dictionary, DumbDictionary& dumbDictionary )
+{
+  dumbDictionary.clear();
+
+  for (size_t i=0; i<dictionary.size(); ++i )
+  {
+    const Phrase& en = dictionary[i].first;
+    const Phrase& hu = dictionary[i].second;
+
+    if (hu.size()==1)
+    {
+      dumbDictionary[ hu[0] ] = en ;
+      // std::wcerr << hu[0] << "\t" << en << std::endl;
+    }
+  }
+}
+
+void buildDumbDictionaryUsingFrequencies( 
+       const DictionaryItems& dictionary, 
+       FrequencyMap& enFreq, 
+       DumbDictionary& dumbDictionary )
+{
+  dumbDictionary.clear();
+
+
+  for (size_t i=0; i<dictionary.size(); ++i )
+  {
+    const Phrase& en = dictionary[i].first;
+    const Phrase& hu = dictionary[i].second;
+
+    if (hu.size()==1)
+    {
+      Word originalWord = hu[0];
+      DumbDictionary::const_iterator ft = dumbDictionary.find(originalWord);
+      bool overWrite = false;
+      if (ft!=dumbDictionary.end())
+      {
+        // Phrases with both length of k>1 are incomparable.
+
+        const Phrase& oldTrans = ft->second;
+
+        // Shorter phrases are better than longer ones.
+        if (oldTrans.size()>en.size())
+        {
+          overWrite = true;
+        }
+
+        // More frequent words are better than less frequent ones.
+        if ( (oldTrans.size()==1) && (en.size()==1) )
+        {
+          if ( enFreq[oldTrans[0]] < enFreq[en[0]] )
+          {
+            overWrite = true;
+          }
+        }
+      }
+      else
+      {
+        overWrite = true;
+      }
+
+      if (overWrite)
+        dumbDictionary[originalWord] = en ;
+    }
+  }
+}
+
+void buildDumbDictionary( TMXAligner::DumbDictionary& dumbDictionary,
+                          const std::string& dictionaryFilename,
+                          const TMXAligner::SentenceList& enSentenceList
+                        )
+{
+  TMXAligner::DictionaryItems dictionary;
+  {
+    std::ifstream is( dictionaryFilename.c_str() );
+    dictionary.read( is );
+    std::wcerr << dictionary.size() << " dictionary items read." << std::endl;
+  }
+
+  if (!enSentenceList.empty())
+  {
+    TMXAligner::FrequencyMap enFreq;
+    enFreq.build(enSentenceList);
+    TMXAligner::buildDumbDictionaryUsingFrequencies( dictionary, enFreq, dumbDictionary );
+  }
+  else
+  {
+    TMXAligner::buildDumbDictionary( dictionary, dumbDictionary );
+  }
+}
+
+void trivialTranslateWord(
+                     const DumbDictionary& dumbDictionary,
+                     const Word& originalWord,
+                     Phrase& words
+                     )
+{
+  words.clear();
+
+  DumbDictionary::const_iterator ft = dumbDictionary.find(originalWord);
+  if (ft!=dumbDictionary.end())
+  {
+    words = ft->second;
+  }
+  else
+  {
+    bool leaveAsItis(false);
+
+    // This worsens the score for the 1984 corpus, most possibly because of the false cognates a(a), is(is), van(van).
+    bool alwaysLeaveAsItis = true;
+    if (alwaysLeaveAsItis)
+    {
+      leaveAsItis = true;
+    }
+
+    if ( !leaveAsItis && (originalWord[0]>='A') && (originalWord[0]<='Z') )
+    {
+      leaveAsItis = true;
+    }
+
+    if (!leaveAsItis)
+    {
+      bool isNumber(true);
+      for ( size_t k=0; k<originalWord.size(); ++k )
+      {
+        char c = originalWord[k];
+        if ( (c!='.') && ( (c<'0') || (c>'9') ) )
+        {
+          isNumber = false;
+          break;
+        }
+      }
+
+      if (isNumber)
+      {
+        leaveAsItis = true;
+      }
+    }
+
+    if (leaveAsItis)
+    {
+      words.push_back(originalWord);
+    }
+  }
+}
+
+void trivialTranslate(
+                     const DumbDictionary& dumbDictionary,
+                     const Sentence& sentence,
+                           Sentence& translatedSentence
+                     )
+{
+  bool logging = false;
+
+  std::ofstream* translateLogsPtr = 0;
+  if (logging)
+  {
+    translateLogsPtr = new std::ofstream( "/dev/null", std::ios::app );
+  }
+  std::ostream& logs = translateLogsPtr ? *translateLogsPtr : std::cout ;
+
+  translatedSentence.id = sentence.id;
+  Phrase& words = translatedSentence.words;
+
+  if (logging && !translatedSentence.id.empty())
+    logs << translatedSentence.id << "\t";
+
+  const Phrase& originalWords = sentence.words;
+
+  for ( size_t j=0; j<originalWords.size(); ++j )
+  {
+    Word originalWord = originalWords[j];
+
+    Phrase phrase;
+    trivialTranslateWord( dumbDictionary, originalWord, phrase );
+    
+    for (size_t k=0; k<phrase.size(); ++k )
+    {
+      words.push_back(phrase[k]);
+    }
+
+    if (logging)
+      logs << originalWord << "(";
+    for (size_t k=0; k<phrase.size(); ++k )
+    {
+      if (logging)
+      {
+        logs << phrase[k];
+        if (k<phrase.size()-1)
+          logs << " ";
+      }
+    }
+    if (logging)
+      logs << ") ";
+  }
+
+  if (logging)
+    logs << "\n";
+
+  if (logging)
+  {
+    delete translateLogsPtr;
+  }
+}
+
+void trivialTranslateSentenceList(
+                     const DumbDictionary& dumbDictionary,
+                     const SentenceList& sentenceList,
+                           SentenceList& translatedSentenceList
+                     )
+{
+  {
+    std::ofstream translateLogs( "/dev/null" );
+  }
+  
+  translatedSentenceList.clear();
+
+  for ( size_t i=0; i<sentenceList.size(); ++i )
+  {
+    Sentence translatedSentence;
+
+    trivialTranslate( dumbDictionary, 
+                      sentenceList[i],
+                      translatedSentence
+                     );
+
+    translatedSentenceList.push_back(translatedSentence);
+  }
+}
+
+
+void naiveTranslate(
+                     const DictionaryItems& dictionary,
+                     const SentenceList& sentenceList,
+                           SentenceList& translatedSentenceList
+                     )
+{
+  translatedSentenceList.clear();
+
+  SubsetLookup<Word,int> subsetLookup;
+  {
+    for ( size_t i=0; i<dictionary.size(); ++i )
+    {
+      subsetLookup.add( dictionary[i].second, i+1 ); // !!! i+1
+    }
+    std::wcerr << "Index tree built." << std::endl;
+  }
+
+  for ( size_t i=0; i<sentenceList.size(); ++i )
+  {
+    Sentence sentence;
+    sentence.id = sentenceList[i].id;
+    Phrase& words = sentence.words;
+
+    std::set<int> results;
+    subsetLookup.lookup( sentenceList[i].words, results );
+
+    for ( std::set<int>::const_iterator it=results.begin(); it!=results.end(); ++it )
+    {
+      const Phrase& phrase = dictionary[*it-1].first; // !!! i-1
+
+      for ( size_t i=0; i<phrase.size(); ++i )
+      {
+        words.push_back(phrase[i]);
+      }
+    }
+
+    translatedSentenceList.push_back(sentence);
+  }
+
+  std::wcerr << "Analysis ready." << std::endl;
+}
+
+
+void buildDumbMultiDictionary( const DictionaryItems& dictionary, DumbMultiDictionary& dumbMultiDictionary, bool reverse )
+{
+  dumbMultiDictionary.clear();
+
+  for (size_t i=0; i<dictionary.size(); ++i )
+  {
+    const Phrase& en = dictionary[i].first;
+    const Phrase& hu = dictionary[i].second;
+
+    if (!reverse)
+    {
+      if (hu.size()==1)
+      {
+        dumbMultiDictionary.insert( DumbMultiDictionary::value_type( hu[0], en ) );
+      }
+    }
+    else
+    {
+      if (en.size()==1)
+      {
+        dumbMultiDictionary.insert( DumbMultiDictionary::value_type( en[0], hu ) );
+      }
+    }
+  }
+}
+
+
+void sortNormalizeSentences( TMXAligner::SentenceList& sentenceList )
+{
+  {
+    for ( size_t pos=0; pos<sentenceList.size(); ++pos )
+    {
+      TMXAligner::Phrase& sentence = sentenceList[pos].words;
+      std::sort(sentence.begin(),sentence.end());
+    }
+  }
+}
+
+
+void normalizeTextsForIdentity( const DictionaryItems& dictionary,
+                                const SentenceList& huSentenceListPretty,  const SentenceList& enSentenceListPretty,
+                                      SentenceList& huSentenceListGarbled,       SentenceList& enSentenceListGarbled )
+{
+  DumbDictionary dumbDictionary;
+
+  FrequencyMap enFreq;
+  enFreq.build(enSentenceListPretty);
+  buildDumbDictionaryUsingFrequencies( dictionary, enFreq, dumbDictionary );
+
+//  std::wcerr << "Simplified dictionary ready." << std::endl;
+
+  SentenceList huSentenceList;
+
+  trivialTranslateSentenceList( dumbDictionary, huSentenceListPretty, huSentenceListGarbled );
+
+//  std::wcerr << "Rough translation ready." << std::endl;
+
+  sortNormalizeSentences(huSentenceListGarbled);
+
+  enSentenceListGarbled = enSentenceListPretty;
+  sortNormalizeSentences(enSentenceListGarbled);
+}
+
+
+} // namespace TMXAligner
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_mult.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_mult.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_mult.cc	(revision 70339)
@@ -0,0 +1,514 @@
+/*
+ * Copyright (C) 2005--2015 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer_mult.h>
+#include <apertium/trx_reader.h>
+#include <lttoolbox/compression.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <apertium/utf_converter.h>
+#include <apertium/string_utils.h>
+
+#include <cctype>
+#include <iostream>
+#include <stack>
+
+using namespace std;
+
+void
+TransferMult::destroy()
+{
+  if(me)
+  {
+    delete me;
+    me = NULL;
+  }
+}
+
+TransferMult::TransferMult() :
+word(0),
+blank(0),
+output(0),
+any_char(0),
+any_tag(0),
+nwords(0)
+{
+  me = NULL;
+  isRule = false;
+  defaultAttrs = lu;
+  numwords = 0;
+}
+
+TransferMult::~TransferMult()
+{
+  destroy();
+}
+
+string
+TransferMult::tolower(string const &str) const
+{
+  string result = str;
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+    result[i] = ::tolower(result[i]);
+  }
+
+  return result;
+}
+
+void 
+TransferMult::readData(FILE *in)
+{
+  alphabet.read(in);
+  any_char = alphabet(TRXReader::ANY_CHAR);
+  any_tag = alphabet(TRXReader::ANY_TAG);
+
+  Transducer t;
+  t.read(in, alphabet.size());
+  
+  map<int, int> finals;  
+  
+  // finals
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    int key = Compression::multibyte_read(in);
+    finals[key] = Compression::multibyte_read(in);
+  }  
+  
+  me = new MatchExe(t, finals);
+ 
+  // attr_items
+  bool recompile_attrs = Compression::string_read(in) != string(pcre_version());
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    attr_items[cad_k].read(in);
+    wstring fallback = Compression::wstring_read(in);
+    if(recompile_attrs) {
+      attr_items[cad_k].compile(UtfConverter::toUtf8(fallback));
+    }
+  }
+
+  // variables
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    variables[cad_k] = UtfConverter::toUtf8(Compression::wstring_read(in));
+  }
+
+  // macros
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+    macros[cad_k] = Compression::multibyte_read(in);
+  }
+
+  // lists
+  for(int i = 0, limit = Compression::multibyte_read(in); i != limit; i++)
+  {
+    string const cad_k = UtfConverter::toUtf8(Compression::wstring_read(in));
+
+    for(int j = 0, limit2 = Compression::multibyte_read(in); j != limit2; j++)
+    {
+      wstring const cad_v = Compression::wstring_read(in);
+      lists[cad_k].insert(UtfConverter::toUtf8(cad_v));
+      listslow[cad_k].insert(UtfConverter::toUtf8(StringUtils::tolower(cad_v)));
+    }  
+  }
+}
+
+void
+TransferMult::readBil(string const &fstfile)
+{
+  FILE *in = fopen(fstfile.c_str(), "r");
+  if(!in)
+  {
+    wcerr << "Error: Could not open file '" << fstfile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  fstp.load(in);
+  fstp.initBiltrans();
+  fclose(in);
+}
+
+void
+TransferMult::read(string const &datafile, string const &fstfile)
+{
+  // datafile
+  FILE *in = fopen(datafile.c_str(), "r");
+  if(!in)
+  {
+    wcerr << "Error: Could not open file '" << datafile << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+  readData(in);
+  fclose(in);
+  
+  readBil(fstfile);
+}
+
+TransferToken &
+TransferMult::readToken(FILE *in)
+{
+  if(!input_buffer.isEmpty())
+  {
+    return input_buffer.next();
+  }
+
+  wstring content = L"";
+  while(true)
+  {
+    int val = fgetwc_unlocked(in);
+    if(feof(in))
+    {
+      return input_buffer.add(TransferToken(content, tt_eof));
+    }
+    if(val == L'\\')
+    {  
+      content += L'\\';
+      content += wchar_t(fgetwc_unlocked(in));
+    }
+    else if(val == L'[')
+    {
+      content += L'[';
+      while(true)
+      {
+	int val2 = fgetwc_unlocked(in);
+	if(val2 == L'\\')
+	{
+	  content += L'\\';
+	  content += wchar_t(fgetwc_unlocked(in));
+	}
+	else if(val2 == L']')
+	{
+	  content += L']';
+	  break;
+	}
+	else
+	{
+	  content += wchar_t(val2);
+	}
+      }
+    }
+    else if(val == L'$')
+    {
+      return input_buffer.add(TransferToken(content, tt_word));
+    }
+    else if(val == L'^')
+    {
+      return input_buffer.add(TransferToken(content, tt_blank));
+    }
+    else
+    {
+      content += wchar_t(val);
+    }
+  }
+}
+
+void
+TransferMult::transfer(FILE *in, FILE *out)
+{
+  int last = 0;
+
+  output = out;
+  ms.init(me->getInitial());
+  
+  while(true)
+  {
+    if(ms.size() == 0)
+    {
+      if(isRule)
+      {
+	applyRule();
+	isRule = false;
+	input_buffer.setPos(last);
+      }
+      else
+      {
+	if(tmpword.size() != 0)
+	{
+	  pair<wstring, int> tr = fstp.biltransWithQueue(*tmpword[0], false);
+	  if(tr.first.size() != 0)
+	  {
+	    vector<wstring> multiword = acceptions(tr.first);
+	    if(multiword.size() > 1)
+	    {
+	      fputws_unlocked(L"[{]", output);
+	    }	    
+	    for(unsigned int i = 0, limit = multiword.size(); i != limit; i++)
+	    {
+	      if(i > 0)
+	      {
+	        fputws_unlocked(L"[|]", output);
+	      }
+	      fputwc_unlocked(L'^', output);
+	      fputws_unlocked(multiword[i].c_str(), output);
+	      fputwc_unlocked(L'$', output);
+	    }
+	    if(multiword.size() > 1)
+	    {
+	      fputws_unlocked(L".[][}]", output);
+            }
+	  }
+	  tmpword.clear();
+	  isRule = false;
+	  input_buffer.setPos(last);
+	  input_buffer.next();       
+	  last = input_buffer.getPos();
+	  ms.init(me->getInitial());
+	}
+	else if(tmpblank.size() != 0)
+	{
+	  fputws_unlocked(tmpblank[0]->c_str(), output);
+	  tmpblank.clear();
+	  last = input_buffer.getPos();
+	  ms.init(me->getInitial());
+	}
+      }
+    }
+    int val = ms.classifyFinals(me->getFinals());
+    if(val != -1)
+    {
+      isRule = true;
+      numwords = tmpword.size();
+      last = input_buffer.getPos();
+    }
+
+    TransferToken &current = readToken(in);
+   
+    switch(current.getType())
+    {
+      case tt_word:
+	applyWord(current.getContent());
+        tmpword.push_back(&current.getContent());
+	break;
+
+      case tt_blank:
+	ms.step(L' ');
+	tmpblank.push_back(&current.getContent());
+	break;
+
+      case tt_eof:
+	if(tmpword.size() != 0)
+	{
+	  tmpblank.push_back(&current.getContent());
+	  ms.clear();
+	}
+	else
+	{
+	  fputws_unlocked(current.getContent().c_str(), output);
+	  return;
+	}
+	break;
+
+      default:
+	wcerr << L"Error: Unknown input token." << endl;
+	return;
+    }
+  }
+}
+
+bool
+TransferMult::isDefaultWord(wstring const &str)
+{
+  return str.find(L" D<");
+}
+
+vector<wstring> 
+TransferMult::acceptions(wstring str)
+{
+  vector<wstring> result;
+  int low = 0;
+
+  // removing '@'  
+  if(str[0] == L'@')
+  {
+    str = str.substr(1);
+  }
+  
+  for(unsigned int i = 0, limit = str.size(); i != limit; i++)
+  {
+     if(str[i] == L'\\')
+     {
+       i++;
+     }
+     else if(str[i] == L'/')
+     {
+       wstring new_word = str.substr(low, i-low);
+      
+       if(result.size() > 1 && isDefaultWord(new_word))
+       {
+	 result.push_back(result[0]);
+	 result[0] = new_word;
+       }
+       else
+       {
+         result.push_back(new_word);
+       }
+       low = i + 1;
+     }
+  }
+  
+  wstring otherword = str.substr(low);
+  if(result.size() > 0 && isDefaultWord(otherword))
+  {
+    result.push_back(result[0]);
+    result[0] = otherword;
+  }
+  else
+  {
+    result.push_back(otherword);
+  }
+
+  // eliminar las acepciones sin sentido marcado
+  if(result.size() >= 2)
+  {
+    vector<wstring> result2;
+    for(unsigned int i = 0, limit = result.size(); i != limit; i++)
+    {
+      if(result[i].find(L"__") != wstring::npos)
+      {
+        result2.push_back(result[i]);
+      }
+    } 
+    if(result2.size() >= 2)
+    {
+      return result2;
+    }
+  }
+
+  return result;
+}
+
+void 
+TransferMult::writeMultiple(list<vector<wstring> >::iterator itwords,
+                            list<wstring>::iterator itblanks, 
+                            list<vector<wstring> >::const_iterator limitwords, 
+                            wstring acum , bool multiple)
+{
+  if(itwords == limitwords)
+  {
+    if(multiple)
+    {
+      output_string.append(L"[|]");
+    }      
+    output_string.append(acum);
+  }
+  else
+  {
+    vector<wstring> &refword = *itwords;
+
+    itwords++;
+  
+    if(itwords == limitwords)
+    {
+      for(unsigned int i = 0, limit = refword.size(); i != limit; i++)
+      {
+        writeMultiple(itwords, itblanks, limitwords, 
+                      acum + L"^" + refword[i] + L"$", multiple || (i > 0));
+      }
+    }
+    else
+    {
+      wstring &refblank = *itblanks;
+      itblanks++;
+      
+      for(unsigned int i = 0, limit = refword.size(); i != limit; i++)
+      {
+        writeMultiple(itwords, itblanks, limitwords, 
+                      acum + L"^" + refword[i] + L"$" + refblank, 
+                      multiple || (i > 0));
+      }
+    }
+  }
+}
+
+void
+TransferMult::applyRule()
+{
+  list<wstring> blanks;
+  list<vector<wstring> > words;  
+
+  pair<wstring, int> tr = fstp.biltransWithQueue(*tmpword[0], false);
+  words.push_back(acceptions(tr.first));
+  
+  for(unsigned int i = 1; i != numwords; i++)
+  {
+    blanks.push_back(*tmpblank[i-1]);    
+    pair<wstring, int> tr = fstp.biltransWithQueue(*tmpword[i], false);
+    words.push_back(acceptions(tr.first));
+  }
+
+  output_string = L"";
+  writeMultiple(words.begin(), blanks.begin(), words.end());
+  
+  if(output_string.find(L"[|]") != wstring::npos)
+  {
+    fputws_unlocked(L"[{]", output);
+    fputws_unlocked(output_string.c_str(), output);
+    fputws_unlocked(L".[][}]", output);
+  }
+  else
+  {
+    fputws_unlocked(output_string.c_str(), output);
+  }
+  
+  ms.init(me->getInitial());
+  
+  tmpblank.clear();
+  tmpword.clear();
+  numwords = 0;
+}
+
+void
+TransferMult::applyWord(wstring const &word_str)
+{
+  ms.step(L'^');
+  for(unsigned int i = 0, limit = word_str.size(); i < limit; i++)
+  {
+    switch(word_str[i])
+    {
+      case L'\\':
+        i++;
+	ms.step(towlower(word_str[i]), any_char);
+	break;
+
+      case L'<':
+	for(unsigned int j = i+1; j != limit; j++)
+	{
+	  if(word_str[j] == L'>')
+	  {
+	    int symbol = alphabet(word_str.substr(i, j-i+1));
+	    if(symbol)
+	    {
+	      ms.step(symbol, any_tag);
+	    }
+	    else
+	    {
+	      ms.step(any_tag);
+	    }
+	    i = j;
+	    break;
+	  }
+	}
+	break;
+	
+      default:
+	ms.step(towlower(word_str[i]), any_char);
+	break;
+    }
+  }
+  ms.step(L'$');
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transferpp.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transferpp.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transferpp.cc	(revision 70339)
@@ -0,0 +1,42 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/trx_reader.h>
+#include <lttoolbox/lt_locale.h>
+#include <cstdlib>
+#include <iostream>
+#include <apertium/string_utils.h>
+#include <libgen.h>
+
+using namespace Apertium;
+using namespace std;
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+
+  if(argc != 3)
+  {
+    wcerr << "USAGE: " << basename(argv[0]) << " rules_file transfer_file" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  TRXReader myReader;
+  myReader.read(argv[1]);
+  myReader.write(argv[2]);
+  
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/trx_reader.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/trx_reader.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/trx_reader.cc	(revision 70339)
@@ -0,0 +1,631 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/trx_reader.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <lttoolbox/compression.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+wstring const
+TRXReader::ANY_TAG = L"<ANY_TAG>";
+
+wstring const
+TRXReader::ANY_CHAR = L"<ANY_CHAR>";
+
+void
+TRXReader::destroy()
+{
+  xmlFreeTextReader(reader);
+}
+
+TRXReader::TRXReader() :
+reader(0),
+type(0)
+{
+  td.getAlphabet().includeSymbol(ANY_TAG);
+  td.getAlphabet().includeSymbol(ANY_CHAR);
+}
+
+TRXReader::~TRXReader()
+{
+  destroy();
+}
+
+void
+TRXReader::step()
+{
+  int retval = xmlTextReaderRead(reader);
+  if(retval != 1)
+  {
+    parseError(L"unexpected EOF");
+  }
+  name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  type = xmlTextReaderNodeType(reader);
+}
+
+wstring
+TRXReader::attrib(wstring const &name)
+{
+  return XMLParseUtil::attrib(reader, name);
+} 
+
+void
+TRXReader::parseError(wstring const &message)
+{
+  wcerr << L"Error: (" << xmlTextReaderGetParserLineNumber(reader);
+  wcerr << L"): " << message << L"." << endl;
+  exit(EXIT_FAILURE);
+}
+
+int
+TRXReader::insertLemma(int const base, wstring const &lemma)
+{
+  int retval = base;
+  static int const any_char = td.getAlphabet()(ANY_CHAR);
+  if(lemma == L"")
+  {
+    retval = td.getTransducer().insertSingleTransduction(any_char, retval);
+    td.getTransducer().linkStates(retval, retval, any_char);
+    int another = td.getTransducer().insertSingleTransduction(L'\\', retval);
+    td.getTransducer().linkStates(another, retval, any_char);
+  }
+  else
+  {
+    for(unsigned int i = 0, limit = lemma.size();  i != limit; i++)
+    {
+      if(lemma[i] == L'\\')
+      {
+        retval = td.getTransducer().insertSingleTransduction(L'\\', retval);
+	i++;
+        retval = td.getTransducer().insertSingleTransduction(int(lemma[i]), 
+							     retval);
+      }
+      else if(lemma[i] == L'*')
+      {
+	retval = td.getTransducer().insertSingleTransduction(any_char, retval);
+	td.getTransducer().linkStates(retval, retval, any_char);
+      }
+      else
+      {
+	retval = td.getTransducer().insertSingleTransduction(int(lemma[i]), 
+							     retval);
+      }
+    }
+  }
+  
+  return retval;
+}
+
+int
+TRXReader::insertTags(int const base, wstring const &tags)
+{
+  int retval = base;
+  static int const any_tag = td.getAlphabet()(ANY_TAG);
+  if(tags.size() != 0)
+  {
+    for(unsigned int i = 0, limit = tags.size(); i < limit; i++)
+    {
+      if(tags[i] == L'*')
+      {
+        retval = td.getTransducer().insertSingleTransduction(any_tag, retval);
+        td.getTransducer().linkStates(retval, retval, any_tag);
+        i++;
+      }  
+      else
+      {
+        wstring symbol = L"<";
+        for(unsigned int j = i; j != limit; j++)
+        {
+          if(tags[j] == L'.')
+          {  
+            symbol.append(tags.substr(i, j-i));
+            i = j;
+            break;
+          }
+        }
+        
+        if(symbol == L"<")
+        {
+          symbol.append(tags.substr(i));
+          i = limit;
+        }
+        symbol += L'>';
+        td.getAlphabet().includeSymbol(symbol);
+        retval = td.getTransducer().insertSingleTransduction(td.getAlphabet()(symbol), retval);
+      }
+    }
+  }
+  else
+  {
+    return base; // new line
+  }
+  
+  return retval;
+}
+
+void
+TRXReader::read(string const &filename)
+{
+  reader = xmlReaderForFile(filename.c_str(), NULL, 0);
+  if(reader == NULL)
+  {
+    wcerr << "Error: Cannot open '" << filename << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  procDefCats();
+  step();
+  while(name == L"#text" || name == L"#comment")
+  {
+    step();
+  }
+ 
+  if(name == L"section-def-attrs")
+  {
+    procDefAttrs();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+  
+  if(name == L"section-def-vars")
+  {
+    procDefVars();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+
+  if(name == L"section-def-lists")
+  {
+    procDefLists();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+
+  if(name == L"section-def-macros")
+  {
+    procDefMacros();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+
+  if(name == L"section-rules")
+  {
+    procRules();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }  
+}
+
+void
+TRXReader::procRules()
+{
+  int count = 0;
+  set<int> alive_states;
+  
+  while(type != XML_READER_TYPE_END_ELEMENT || 
+	name != L"section-rules")
+  {
+    step();
+    if(name == L"rule")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	count++;
+      }
+    }
+    else if(name == L"pattern")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        alive_states.clear();
+        alive_states.insert(td.getTransducer().getInitial());
+      }
+      else
+      {
+        for(set<int>::iterator it = alive_states.begin(), limit = alive_states.end();
+            it != limit; it++)
+        {
+          td.getTransducer().setFinal(*it);
+          if(td.getFinals().find(*it) == td.getFinals().end())
+          {
+            td.getFinals()[*it] = count;
+          }       
+          else
+          {
+            wcerr << L"Warning (" << xmlTextReaderGetParserLineNumber(reader);
+            wcerr << L"): "
+              << L"Paths to rule " << count << " blocked by rule " << td.getFinals()[*it]
+              << L"." << endl;
+
+          }
+        }
+      }
+    }
+    else if(name == L"pattern-item")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        pair<multimap<wstring, LemmaTags, Ltstr>::iterator,
+             multimap<wstring, LemmaTags, Ltstr>::iterator> range;
+
+        range = cat_items.equal_range(attrib(L"n"));
+      
+        if(range.first == range.second)
+        {
+          parseError(L"Undefined cat-item '" + attrib(L"n"));
+        }
+
+// new code
+      
+        set<int> alive_states_new;
+        
+        for(; range.first != range.second; range.first++)
+        {
+          for(set<int>::iterator it = alive_states.begin(), limit = alive_states.end();
+              it != limit; it++)
+          {
+            // mark of begin of word
+            int tmp = td.getTransducer().insertSingleTransduction(L'^', *it);
+            if(*it != td.getTransducer().getInitial())
+            {
+              // insert optional blank between two words
+              int alt = td.getTransducer().insertSingleTransduction(L' ', *it);
+              td.getTransducer().linkStates(alt, tmp, L'^');
+            }
+            
+            // insert word
+            tmp = insertLemma(tmp, range.first->second.lemma);
+            tmp = insertTags(tmp, range.first->second.tags);
+            
+            // insert mark of end of word
+            tmp = td.getTransducer().insertSingleTransduction(L'$', tmp);
+            
+            // set as alive_state
+            alive_states_new.insert(tmp);
+          }
+        } 
+        
+        // copy new alive states on alive_states set
+        alive_states = alive_states_new;      
+      }
+    }
+    else if(name == L"let")
+    {
+      int count = 0;
+      int lineno = xmlTextReaderGetParserLineNumber(reader); 
+      while(name != L"let" || type != XML_READER_TYPE_END_ELEMENT)
+      {
+        step();
+        if(type == XML_ELEMENT_NODE)
+        {
+          count++;
+          
+          if(name == L"clip" && attrib(L"side") == L"sl")
+          {
+            wcerr << L"Warning (" << lineno;
+            wcerr << L"): assignment to 'sl' side has no effect." << endl;
+          }    
+        }
+        
+        if(count != 0)
+        {
+          break;
+        }
+      }
+      
+    }
+  }
+}
+
+void
+TRXReader::write(string const &filename)
+{
+  FILE *out = fopen(filename.c_str(), "wb");
+  if(!out)
+  {
+    wcerr << "Error: cannot open '" << filename;
+    wcerr << "' for writing" << endl;
+    exit(EXIT_FAILURE);
+  }
+  
+  td.write(out);
+
+  fclose(out);
+}
+
+void
+TRXReader::procDefAttrs()
+{
+  wstring attrname;
+
+  while(type != XML_READER_TYPE_END_ELEMENT || 
+	name != L"section-def-attrs")
+  {
+    step();
+    if(name == L"attr-item")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        insertAttrItem(attrname, attrib(L"tags"));
+      }
+    }
+    else if(name == L"def-attr")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        attrname = attrib(L"n");
+      }
+      else
+      {
+        wstring all = td.getAttrItems()[attrname];
+        td.getAttrItems()[attrname] = L"(" + all + L")";
+        attrname = L"";
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"section-def-attrs")
+    {
+      // do nothing
+    }
+    else
+    {
+      parseError(L"Unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void 
+TRXReader::procDefCats()
+{
+  while(type == XML_READER_TYPE_END_ELEMENT || !(name == L"transfer" || name == L"interchunk" || name == L"postchunk"))
+  {
+    step();
+    if(name != L"#text" && name != L"transfer" &&  name != L"interchunk" &&
+       name != L"postchunk" && name != L"section-def-cats" && name != L"#comment")
+    {
+      parseError(L"'<" + name + L">' tag unexpected");
+    }
+  }
+  
+  wstring catname;
+
+  while(type != XML_READER_TYPE_END_ELEMENT || 
+	name != L"section-def-cats")
+  {
+    step();
+    if(name == L"cat-item")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        if(attrib(L"tags") != L"")
+        {
+          insertCatItem(catname, attrib(L"lemma"), attrib(L"tags"));
+        }
+        else
+        {
+          insertCatItem(catname, attrib(L"name"), L"");
+        }
+      }
+    }
+    else if(name == L"def-cat")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        catname = attrib(L"n");
+      }
+      else
+      {
+        catname = L"";
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"section-def-cats")
+    {
+      // do nothing
+    }
+    else
+    {
+      parseError(L"Unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void
+TRXReader::procDefVars()
+{
+  while(type != XML_READER_TYPE_END_ELEMENT || 
+	name != L"section-def-vars")
+  {
+    step();
+    if(name == L"def-var")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        createVar(attrib(L"n"), attrib(L"v"));
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"section-def-vars")
+    {
+      // do nothing
+    }
+    else
+    {
+      parseError(L"Unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void
+TRXReader::procDefLists()
+{
+  wstring listname;
+
+  while(type != XML_READER_TYPE_END_ELEMENT || 
+	name != L"section-def-lists")
+  {
+    step();
+    if(name == L"list-item")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        insertListItem(listname, attrib(L"v"));
+      }
+    }
+    else if(name == L"def-list")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        listname = attrib(L"n");
+      }
+      else
+      {
+        listname = L"";
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"section-def-lists")
+    {
+      // do nothing
+    }
+    else
+    {
+      parseError(L"Unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void
+TRXReader::procDefMacros()
+{
+  int count = 0;
+  while(type != XML_READER_TYPE_END_ELEMENT || 
+	name != L"section-def-macros")
+  {
+    step();
+    if(name == L"def-macro")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        createMacro(attrib(L"n"), count++);
+      }
+    }
+  }
+}
+
+void
+TRXReader::createMacro(wstring const &name, int const value)
+{
+  if(td.getMacros().find(name) != td.getMacros().end())
+  {
+    parseError(L"Macro '" + name + L"' defined at least twice");    
+  }
+  td.getMacros()[name] = value;
+}
+
+void
+TRXReader::insertListItem(wstring const &name, wstring const &value)
+{
+  td.getLists()[name].insert(value);
+}
+
+void
+TRXReader::createVar(wstring const &name, wstring const &initial_value)
+{
+  td.getVariables()[name] = initial_value;
+}
+
+void
+TRXReader::insertCatItem(wstring const &name, wstring const &lemma, 
+			 wstring const &tags)
+{
+  LemmaTags lt;
+  lt.lemma = lemma;
+  lt.tags = tags;
+  cat_items.insert(pair<wstring, LemmaTags>(name, lt));
+}
+
+void 
+TRXReader::insertAttrItem(wstring const &name, wstring const &tags)
+{
+  if(td.getAttrItems()[name].size() != 0)
+  {
+    td.getAttrItems()[name] += L'|';
+  }  
+  
+  td.getAttrItems()[name] += '<';
+
+  for(unsigned int i = 0, limit = tags.size(); i != limit; i++)
+  {
+    if(tags[i] == L'.')
+    {
+      td.getAttrItems()[name].append(L"><");
+    }
+    else
+    {
+	td.getAttrItems()[name] += tags[i];
+    }
+  }
+  td.getAttrItems()[name] += L'>';
+  
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tsx_reader.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tsx_reader.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tsx_reader.cc	(revision 70339)
@@ -0,0 +1,596 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/tsx_reader.h>
+#include <lttoolbox/xml_parse_util.h>
+#include <lttoolbox/compression.h>
+#include <apertium/string_utils.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+void
+TSXReader::copy(TSXReader const &o)
+{
+}
+
+void
+TSXReader::destroy()
+{
+}
+
+TSXReader::TSXReader() :
+reader(0),
+type(0)
+{
+  open_class = &(tdata.getOpenClass());
+  forbid_rules = &(tdata.getForbidRules());
+  tag_index = &(tdata.getTagIndex());
+  array_tags = &(tdata.getArrayTags());
+  enforce_rules = &(tdata.getEnforceRules());
+  prefer_rules = &(tdata.getPreferRules());
+  plist = &(tdata.getPatternList());
+  constants = &(tdata.getConstants());
+}
+
+TSXReader::~TSXReader()
+{
+  destroy();
+}
+
+TSXReader::TSXReader(TSXReader const &o)
+{
+  copy(o);
+}
+
+
+void
+TSXReader::clearTagIndex()
+{
+  tag_index->clear();
+  array_tags->clear();
+  newTagIndex(L"LPAR");
+  newTagIndex(L"RPAR");
+  newTagIndex(L"LQUEST");
+  newTagIndex(L"CM");
+  newTagIndex(L"SENT");
+  newTagIndex(L"kEOF");
+  newTagIndex(L"kUNDEF");
+}
+
+void
+TSXReader::step()
+{
+  int retval = xmlTextReaderRead(reader);
+  if(retval != 1)
+  {
+    parseError(L"unexpected EOF");
+  }
+  name = XMLParseUtil::towstring(xmlTextReaderConstName(reader));
+  type = xmlTextReaderNodeType(reader);
+}
+
+TSXReader &
+TSXReader::operator =(TSXReader const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+wstring
+TSXReader::attrib(wstring const &name)
+{
+  return XMLParseUtil::attrib(reader, name);
+} 
+
+void
+TSXReader::parseError(wstring const &message)
+{
+  wcerr << L"Error: (" << xmlTextReaderGetParserLineNumber(reader);
+  wcerr << L"): " << message << L"." << endl;
+  exit(EXIT_FAILURE);
+}
+
+void
+TSXReader::newTagIndex(wstring const &tag)
+{
+  if(tag_index->find(L"TAG_" + tag) != tag_index->end())
+  {
+    parseError(L"'" + tag + L"' already defined");
+  }
+
+  array_tags->push_back(L"TAG_" + tag);
+  (*tag_index)[L"TAG_" + tag] = array_tags->size() - 1;
+}
+
+void
+TSXReader::newDefTag(wstring const &tag)
+{
+  if(tag_index->find(L"TAG_" + tag) != tag_index->end())
+  {
+    parseError(L"'" + tag + L"' already defined");
+  }
+
+  array_tags->push_back(tag);
+  (*tag_index)[L"TAG_" + tag] = array_tags->size() - 1;
+}
+
+void
+TSXReader::newConstant(wstring const &constant)
+{
+  constants->setConstant(constant, array_tags->size());
+  array_tags->push_back(constant);
+}
+
+void
+TSXReader::procDiscardOnAmbiguity()
+{
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"discard-on-ambiguity")
+  {
+    step();
+
+    if(name == L"discard")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        tdata.addDiscard(L"<" + StringUtils::substitute(attrib(L"tags"), L".", L"><") + L">");
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"discard-on-ambiguity")
+    {
+      if(type == XML_READER_TYPE_END_ELEMENT)
+      {
+	break;
+      }
+      else
+      {
+	parseError(L"Unexpected 'discard-on-ambiguity' open tag");
+      }
+    }
+    else
+    {
+      parseError(L"unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void
+TSXReader::procDefLabel()
+{
+  wstring name_attr = attrib(L"name");
+  wstring closed_attr = attrib(L"closed");
+  newDefTag(name_attr);
+
+  if(closed_attr != L"true")
+  {
+    open_class->insert((*tag_index)[L"TAG_"+name_attr]);
+  }
+
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"def-label")
+  {
+    step();
+
+    if(name == L"tags-item")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	plist->insert((*tag_index)[L"TAG_"+name_attr], attrib(L"lemma"),
+		     attrib(L"tags"));
+      }
+    }
+    else if(name == L"def-label")
+    {
+      return;
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else
+    {
+      parseError(L"unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void
+TSXReader::procDefMult()
+{
+  wstring name_attr = attrib(L"name");
+  wstring closed_attr = attrib(L"closed");
+  newDefTag(name_attr);
+  if(closed_attr != L"true")
+  {
+    open_class->insert((*tag_index)[L"TAG_"+name_attr]);
+  }
+
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"def-mult")
+  {
+    step();
+    if(name == L"sequence")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	plist->beginSequence();
+	while(type != XML_READER_TYPE_END_ELEMENT || name != L"sequence")
+	{
+	  step();
+	  if(name == L"label-item")
+	  {
+	    if(type != XML_READER_TYPE_END_ELEMENT)
+	    {
+	      plist->insert((*tag_index)[L"TAG_"+name_attr],
+                            (*tag_index)[L"TAG_"+attrib(L"label")]);
+	    }
+	  }
+	  else if(name == L"tags-item")
+	  {
+	    if(type != XML_READER_TYPE_END_ELEMENT)
+	    {
+	      plist->insert((*tag_index)[L"TAG_"+name_attr],
+			    attrib(L"lemma"), attrib(L"tags"));
+	    }
+	  }
+	  else if(name == L"sequence")
+	  {
+	    break;
+	  }
+	  else if(name == L"#text")
+	  {
+	    // do nothing
+	  }
+	  else if(name == L"#comment")
+	  {
+	    // do nothing
+          }
+	}
+	plist->endSequence();
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"def-mult")
+    { 
+      // do nothing
+    }
+    else
+    {
+      parseError(L"unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+void
+TSXReader::procTagset()
+{ 
+  while(type == XML_READER_TYPE_END_ELEMENT || name != L"tagset")
+  {
+    step();
+    if(name != L"#text" && name != L"tagger" && name != L"tagset")
+    {
+      parseError(L"'<" + name + L">' tag unexpected");
+    }
+  }
+  
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"tagset")
+  {
+    step();
+    if(name == L"def-label")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	procDefLabel();
+      }
+    }
+    else if(name == L"def-mult")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        procDefMult();
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"tagset")
+    {
+      // do nothing
+    }
+    else
+    {
+      parseError(L"Unexpected '<" + name + L">' tag");
+    }
+  }
+}
+
+
+void
+TSXReader::procLabelSequence()
+{
+  TForbidRule forbid_rule;
+
+  step();
+  while(name == L"#text" || name == L"#comment")
+  {
+    step();
+  }
+  if(name != L"label-item")
+  {
+    parseError(L"<label-item> tag expected");
+  }
+  
+  forbid_rule.tagi = (*tag_index)[L"TAG_" + attrib(L"label")];
+
+  step();
+  while(name == L"#text" || name == L"#comment")
+  {
+    step();
+  }
+  if(name != L"label-item")
+  {
+    parseError(L"<label-item> tag expected");
+  }
+  forbid_rule.tagj = (*tag_index)[L"TAG_" + attrib(L"label")];
+  
+  forbid_rules->push_back(forbid_rule);
+}
+
+void
+TSXReader::procForbid()
+{
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"forbid")
+  {
+    step();
+    if(name == L"label-sequence")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	procLabelSequence();
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"forbid")
+    {
+      if(type == XML_READER_TYPE_END_ELEMENT)
+      {
+	break;
+      }
+      else
+      {
+	parseError(L"Unexpected '" + name + L"' open tag");
+      }
+    }
+    else
+    {
+      parseError(L"Unexpected '" + name + L"' tag");
+    }
+  }  
+}
+
+void
+TSXReader::procEnforce()
+{
+  TEnforceAfterRule aux;
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"enforce-rules")
+  {
+    step();
+    if(name == L"enforce-after")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	aux.tagi = (*tag_index)[L"TAG_" + attrib(L"label")];
+      }
+      else
+      {
+	enforce_rules->push_back(aux);
+	aux.tagsj.clear();
+      }
+    }
+    else if(name == L"label-set")
+    {
+      // do nothing
+    }
+    else if(name == L"label-item")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+	aux.tagsj.push_back((*tag_index)[L"TAG_" + attrib(L"label")]);
+      }
+    }
+    else if(name == L"#text")
+    {
+      // do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"enforce-rules")
+    {
+      if(type == XML_READER_TYPE_END_ELEMENT)
+      {
+	break;
+      }
+      else
+      {
+	parseError(L"Unexpected 'enforce-rules' open tag");
+      }
+    }
+    else
+    {
+      parseError(L"Unexpected '" + name + L"' tag");
+    }
+  }
+}
+
+void
+TSXReader::procPreferences()
+{
+  while(type != XML_READER_TYPE_END_ELEMENT || name != L"preferences")
+  {
+    step();
+    if(name == L"prefer")
+    {
+      if(type != XML_READER_TYPE_END_ELEMENT)
+      {
+        wstring const tags = L"<" + StringUtils::substitute(attrib(L"tags"), L".", L"><") + L">";
+	prefer_rules->push_back(tags);
+      }
+    }
+    else if(name == L"#text")
+    {
+      //do nothing
+    }
+    else if(name == L"#comment")
+    {
+      // do nothing
+    }
+    else if(name == L"preferences")
+    {
+      if(type == XML_READER_TYPE_END_ELEMENT)
+      {
+	break;
+      }
+      else
+      {
+	parseError(L"Unexpected 'preferences' open tag");
+      }
+    }
+    else
+    {
+      parseError(L"Unexpected '" + name + L"' tag");
+    }
+  }
+}
+
+void
+TSXReader::read(string const &filename)
+{
+  reader = xmlReaderForFile(filename.c_str(), NULL, 0);
+  if(reader == NULL)
+  {
+    wcerr << "Error: Cannot open '" << filename << "'." << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  open_class->clear();
+  forbid_rules->clear();
+  clearTagIndex();
+  enforce_rules->clear();
+
+  procTagset();
+
+  step();
+  while(name == L"#text" || name == L"#comment")
+  {
+    step();
+  }
+  if(name == L"forbid")
+  {
+    procForbid();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+  if(name == L"enforce-rules")
+  {
+    procEnforce();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+  if(name == L"preferences")
+  {
+    procPreferences();
+    step();
+    while(name == L"#text" || name == L"#comment")
+    {
+      step();
+    }
+  }
+  if(name == L"discard-on-ambiguity")
+  {
+    if(type != XML_READER_TYPE_END_ELEMENT)
+    {
+      procDiscardOnAmbiguity();
+    }
+  }
+
+  xmlFreeTextReader(reader);
+  xmlCleanupParser();
+
+  newConstant(L"kMOT");
+  newConstant(L"kDOLLAR");
+  newConstant(L"kBARRA");
+  newConstant(L"kMAS");
+  newConstant(L"kIGNORAR");
+  newConstant(L"kBEGIN");
+  newConstant(L"kUNKNOWN");
+  
+  plist->insert((*tag_index)[L"TAG_LPAR"], L"", L"lpar");
+  plist->insert((*tag_index)[L"TAG_RPAR"], L"", L"rpar");
+  plist->insert((*tag_index)[L"TAG_LQUEST"], L"", L"lquest");
+  plist->insert((*tag_index)[L"TAG_CM"], L"", L"cm");
+  plist->insert((*tag_index)[L"TAG_SENT"], L"", L"sent");
+//  plist->insert((*tag_index)[L"TAG_kMAS"], L"+", L"");
+  plist->buildTransducer();
+}
+
+TaggerData &
+TSXReader::getTaggerData()
+{
+  return tdata;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/exception.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/exception.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/exception.h	(revision 70339)
@@ -0,0 +1,92 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef EXCEPTION_APERTIUM_TAGGER_H
+#define EXCEPTION_APERTIUM_TAGGER_H
+
+#include "exception_type.h"
+
+#include <sstream>
+
+namespace Apertium {
+namespace Exception {
+
+#define EXCEPTION(EXCEPTION_TYPE)                                              \
+  class EXCEPTION_TYPE : public ::Apertium::ExceptionType {                    \
+  public:                                                                      \
+    EXCEPTION_TYPE(const char *const what_) : ExceptionType(what_) {}          \
+    EXCEPTION_TYPE(const std::string &what_) : ExceptionType(what_) {}         \
+    EXCEPTION_TYPE(const std::stringstream &what_) : ExceptionType(what_) {}   \
+    ~EXCEPTION_TYPE() throw() {}                                               \
+  };
+
+namespace Analysis {
+EXCEPTION(TheMorphemes_empty)
+}
+
+namespace apertium_tagger {
+EXCEPTION(deserialise)
+EXCEPTION(fclose)
+EXCEPTION(fopen)
+EXCEPTION(open_stream_fail)
+EXCEPTION(optarg_eq_NULL)
+EXCEPTION(str_end_not_eq_NULL)
+EXCEPTION(ERANGE_)
+EXCEPTION(InvalidArgument)
+EXCEPTION(InvalidOption)
+EXCEPTION(UnexpectedFileArgumentCount)
+EXCEPTION(UnexpectedFlagOption)
+EXCEPTION(UnexpectedFunctionTypeOption)
+EXCEPTION(UnexpectedFunctionTypeTypeOption)
+}
+
+namespace Deserialiser {
+EXCEPTION(size_t_)
+EXCEPTION(not_Stream_good)
+EXCEPTION(wchar_t_)
+}
+
+namespace LexicalUnit {
+EXCEPTION(TheAnalyses_empty)
+}
+
+namespace Morpheme {
+EXCEPTION(TheLemma_empty)
+EXCEPTION(TheTags_empty)
+}
+
+namespace Optional {
+EXCEPTION(TheOptionalTypePointer_null)
+}
+
+namespace Serialiser {
+EXCEPTION(not_Stream_good)
+EXCEPTION(size_t_)
+EXCEPTION(wchar_t_)
+}
+
+namespace Tag {
+EXCEPTION(TheTags_empty)
+}
+
+namespace wchar_t_ExceptionType {
+EXCEPTION(EILSEQ_)
+}
+
+#undef EXCEPTION
+}
+}
+
+#endif // EXCEPTION_APERTIUM_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lswpost.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lswpost.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lswpost.cc	(revision 70339)
@@ -0,0 +1,405 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+/**
+ *  Light Sliding-Window Part of Speech Tagger (LSWPoST) implementation (source)
+ *
+ *  @author   Gang Chen - pkuchengang@gmail.com
+ */
+
+
+#include <apertium/lswpost.h>
+#include <apertium/tagger_utils.h>
+#include  "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+#include <lttoolbox/compression.h>
+
+#ifdef WIN32
+#define isnan(n) _isnan(n)
+#define isinf(n) (!_finite(n))
+#endif
+
+#ifdef __clang__
+#undef __GNUC__
+#endif
+
+#include <stdio.h>
+#include <unistd.h>
+#include <vector>
+#include <algorithm>
+#include <apertium/string_utils.h>
+#include <cstdlib>
+
+using namespace std;
+using namespace Apertium;
+using namespace tagger_utils;
+
+void LSWPoST::deserialise(FILE *Serialised_FILE_Tagger) {
+  tdlsw.read(Serialised_FILE_Tagger);
+  eos = (tdlsw.getTagIndex())[L"TAG_SENT"];
+}
+
+std::vector<std::wstring> &LSWPoST::getArrayTags() {
+  return tdlsw.getArrayTags();
+}
+
+void LSWPoST::serialise(FILE *Stream_) { tdlsw.write(Stream_); }
+
+void LSWPoST::deserialise(const TaggerData &Deserialised_FILE_Tagger) {
+  tdlsw = TaggerDataLSW(Deserialised_FILE_Tagger);
+  eos = (tdlsw.getTagIndex())[L"TAG_SENT"];
+}
+
+void LSWPoST::init_probabilities_from_tagged_text_(FILE *TaggedCorpus,
+                                                   FILE *UntaggedCorpus) {
+  std::abort();
+}
+
+void LSWPoST::init_probabilities_kupiec_(FILE *Corpus) {
+  init_probabilities(Corpus);
+}
+
+void LSWPoST::train(FILE *Corpus, unsigned long Count) {
+  for (; Count > 0; --Count) {
+    std::fseek(Corpus, 0, SEEK_SET);
+    train(Corpus);
+  }
+}
+
+LSWPoST::LSWPoST() {}
+
+LSWPoST::LSWPoST(TaggerDataLSW t) {
+  tdlsw = t;
+  eos = (tdlsw.getTagIndex())[L"TAG_SENT"];  
+}
+
+LSWPoST::~LSWPoST() {}
+
+LSWPoST::LSWPoST(TaggerDataLSW *tdlsw) : tdlsw(*tdlsw) {}
+
+void
+LSWPoST::set_eos(TTag t) { 
+  eos = t; 
+} 
+
+void
+LSWPoST::init_probabilities(FILE *ftxt) {
+
+  int N = tdlsw.getN();
+  int nw = 0;
+  TaggerWord *word = NULL;
+  set<TTag> tags_left, tags_mid, tags_right;
+  set<TTag>::iterator iter_left, iter_mid, iter_right;
+  vector<vector<vector<double> > > para_matrix(N, vector<vector<double> >(N, vector<double>(N, 0)));
+  MorphoStream morpho_stream(ftxt, true, &tdlsw);
+  int num_valid_seq = 0;
+  
+  word = new TaggerWord();          // word for tags left
+  word->add_tag(eos, L"sent", tdlsw.getPreferRules());
+  tags_left = word->get_tags();     // tags left
+  if (tags_left.size()==0) { //This is an unknown word
+    tags_left = tdlsw.getOpenClass();
+  }
+
+  require_ambiguity_class(tdlsw, tags_left, *word, nw);
+  ++nw;
+  delete word;
+  word = morpho_stream.get_next_word();  // word for tags mid
+  tags_mid = word->get_tags();           // tags mid
+  if (tags_mid.size()==0) { //This is an unknown word
+    tags_mid = tdlsw.getOpenClass();
+  }
+  require_ambiguity_class(tdlsw, tags_mid, *word, nw);
+  ++nw;
+  delete word;
+  if (morpho_stream.getEndOfFile()) {
+    return;
+  }
+
+  word = morpho_stream.get_next_word();   // word for tags right
+
+  // count each element of the para matrix
+  while (word != NULL) {
+    if (++nw % 10000 == 0) {
+      wcerr << L'.' << flush;
+    }
+
+    tags_right = word->get_tags();       // tags right
+    if (tags_right.size()==0) { //This is an unknown word
+      tags_right = tdlsw.getOpenClass();
+    }
+    require_ambiguity_class(tdlsw, tags_right, *word, nw);
+
+    num_valid_seq = tags_left.size() * tags_mid.size() * tags_right.size();
+    for (iter_left = tags_left.begin(); iter_left != tags_left.end(); ++iter_left) {
+      for (iter_mid = tags_mid.begin(); iter_mid != tags_mid.end(); ++iter_mid) {
+        for (iter_right = tags_right.begin(); iter_right != tags_right.end(); ++iter_right) {
+          if (!is_valid_seq(*iter_left, *iter_mid, *iter_right)) {
+            --num_valid_seq;
+          }
+        } // for iter_right
+      } // for iter_mid
+    } // for iter_left
+
+    if (num_valid_seq != 0) {
+      for (iter_left = tags_left.begin(); iter_left != tags_left.end(); ++iter_left) {
+        for (iter_mid = tags_mid.begin(); iter_mid != tags_mid.end(); ++iter_mid) {
+          for (iter_right = tags_right.begin(); iter_right != tags_right.end(); ++iter_right) {
+            if (is_valid_seq(*iter_left, *iter_mid, *iter_right)) {
+              para_matrix[*iter_left][*iter_mid][*iter_right] += 1.0 / num_valid_seq;
+            }
+          } // for iter_right
+        } // for iter_mid
+      } // for iter_left
+    }
+
+    tags_left = tags_mid;
+    tags_mid = tags_right;
+    delete word;
+    word = morpho_stream.get_next_word();
+  } // while word != NULL
+
+  for (int i = 0; i < N; ++i) {
+    for (int j = 0; j < N; ++j) {
+      for (int k = 0; k < N; ++k) {
+        tdlsw.getD()[i][j][k] = para_matrix[i][j][k];
+      }
+    }
+  }
+
+  wcerr << L"\n";
+}
+
+bool LSWPoST::is_valid_seq(TTag left, TTag mid, TTag right) {
+
+  vector<TForbidRule> &forbid_rules = tdlsw.getForbidRules();
+  vector<TEnforceAfterRule> &enforce_rules = tdlsw.getEnforceRules();
+
+  for (size_t r = 0; r < forbid_rules.size(); ++r) {
+    if ((left == forbid_rules[r].tagi && mid == forbid_rules[r].tagj)
+        || (mid == forbid_rules[r].tagi && right == forbid_rules[r].tagj)) {
+      return false;
+    }
+  }// for r in forbid rules
+
+  for (size_t r = 0; r < enforce_rules.size(); ++r) {
+    if (left == enforce_rules[r].tagi) {
+      bool found = false;
+      for (size_t j = 0; j < enforce_rules[r].tagsj.size(); ++j) {
+        if (enforce_rules[r].tagsj[j] == mid) {
+          found = true;
+          break;
+        }
+      }
+      if (!found) {
+        return false;
+      }
+    } else if (mid == enforce_rules[r].tagi) {
+      bool found = false;
+      for (size_t j = 0; j < enforce_rules[r].tagsj.size(); ++j) {
+        if (enforce_rules[r].tagsj[j] == right) {
+          found = true;
+          break;
+        }
+      }
+      if (!found) {
+        return false;
+      }
+    }
+  } // for r in enforce rules
+
+  return true;
+}
+
+void
+LSWPoST::read_dictionary(FILE *fdic) {
+  tagger_utils::read_dictionary(fdic, tdlsw);
+  int N = (tdlsw.getTagIndex()).size();
+  int M = (tdlsw.getOutput()).size();
+  wcerr << N << L" states and " << M <<L" ambiguity classes\n";
+
+  // set up the probability matrix of tdlsw, the pointer to the TaggerDataLSW object
+  tdlsw.setProbabilities(N);
+}
+
+void
+LSWPoST::train(FILE *ftxt) {
+
+  int N = tdlsw.getN();
+  int nw = 0;
+  TaggerWord *word = NULL;
+  set<TTag> tags_left, tags_mid, tags_right;
+  set<TTag>::iterator iter_left, iter_mid, iter_right;
+  vector<vector<vector<double> > > para_matrix_new(N, vector<vector<double> >(N, vector<double>(N, 0)));
+  MorphoStream morpho_stream(ftxt, true, &tdlsw);
+
+  word = new TaggerWord();          // word for tags left
+  word->add_tag(eos, L"sent", tdlsw.getPreferRules());
+  tags_left = word->get_tags();     // tags left
+  if (tags_left.size()==0) { //This is an unknown word
+    tags_left = tdlsw.getOpenClass();
+  }
+  require_ambiguity_class(tdlsw, tags_left, *word, nw);
+  ++nw;
+  delete word;
+  word = morpho_stream.get_next_word();  // word for tags mid
+  tags_mid = word->get_tags();           // tags mid
+  if (tags_mid.size()==0) { //This is an unknown word
+    tags_mid = tdlsw.getOpenClass();
+  }
+  require_ambiguity_class(tdlsw, tags_mid, *word, nw);
+  ++nw;
+  delete word;
+  if (morpho_stream.getEndOfFile()) {
+    return;
+  }
+
+  word = morpho_stream.get_next_word();   // word for tags right
+
+  while (word) {
+    if (++nw % 10000 == 0) {
+      wcerr << L'.' << flush;
+    }
+
+    tags_right = word->get_tags();       // tags right
+    if (tags_right.size()==0) { //This is an unknown word
+      tags_right = tdlsw.getOpenClass();
+    }
+    require_ambiguity_class(tdlsw, tags_right, *word, nw);
+
+    double normalization = 0;
+
+    for (iter_left = tags_left.begin(); iter_left != tags_left.end(); ++iter_left) {
+      for (iter_mid = tags_mid.begin(); iter_mid != tags_mid.end(); ++iter_mid) {
+        for (iter_right = tags_right.begin(); iter_right != tags_right.end(); ++iter_right) {
+          normalization += tdlsw.getD()[*iter_left][*iter_mid][*iter_right];
+        }
+      }
+    }
+
+    for (iter_left = tags_left.begin(); iter_left != tags_left.end(); ++iter_left) {
+      for (iter_mid = tags_mid.begin(); iter_mid != tags_mid.end(); ++iter_mid) {
+        for (iter_right = tags_right.begin(); iter_right != tags_right.end(); ++iter_right) {
+          if (normalization > ZERO) {
+            para_matrix_new[*iter_left][*iter_mid][*iter_right] +=
+                tdlsw.getD()[*iter_left][*iter_mid][*iter_right] / normalization;
+          }
+        }
+      }
+    }
+
+    tags_left = tags_mid;
+    tags_mid = tags_right;
+    delete word;
+    word = morpho_stream.get_next_word();
+  }
+
+  for (int i = 0; i < N; ++i) {
+    for (int j = 0; j < N; ++j) {
+      for (int k = 0; k < N; ++k) {
+        tdlsw.getD()[i][j][k] = para_matrix_new[i][j][k];
+      }
+    }
+  }
+}
+
+void
+LSWPoST::print_para_matrix() {
+  wcout << L"para matrix D\n----------------------------\n";
+  for (int i = 0; i < tdlsw.getN(); ++i) {
+    for (int j = 0; j < tdlsw.getN(); ++j) {
+      for (int k = 0; k < tdlsw.getN(); ++k) {
+        wcout << L"D[" << i << L"][" << j << L"][" << k << L"] = "
+            << tdlsw.getD()[i][j][k] << "\n";
+      }
+    }
+  }
+}
+
+void 
+LSWPoST::tagger(FILE *Input, FILE *Output, const bool &First) {
+  TaggerWord *word_left = NULL, *word_mid = NULL, *word_right = NULL;
+  set<TTag> tags_left, tags_mid, tags_right;
+  set<TTag>::iterator iter_left, iter_mid, iter_right;
+  MorphoStream morpho_stream(Input, debug, &tdlsw);
+  morpho_stream.setNullFlush(null_flush);                      
+ 
+  word_left = new TaggerWord();          // word left
+  word_left->add_tag(eos, L"sent", tdlsw.getPreferRules());
+  word_left->set_show_sf(show_sf);
+  tags_left = word_left->get_tags();          // tags left
+
+  tags_left = require_similar_ambiguity_class(tdlsw, tags_left, *word_left, debug);
+  
+  word_mid = morpho_stream.get_next_word(); // word mid
+  word_mid->set_show_sf(show_sf);
+  tags_mid = word_mid->get_tags();          // tags mid
+
+  tags_mid = require_similar_ambiguity_class(tdlsw, tags_mid, *word_mid, debug);
+
+  if (morpho_stream.getEndOfFile()) {
+    delete word_left;
+    delete word_mid;
+    return;
+  }
+  word_right = morpho_stream.get_next_word(); // word_right
+  word_right->set_show_sf(show_sf);
+
+  wstring micad;
+
+  while (word_right) {
+
+    tags_right = word_right->get_tags();
+    tags_right = require_similar_ambiguity_class(tdlsw, tags_right, *word_right, debug);
+
+    double max = -1;
+    TTag tag_max = *tags_mid.begin();
+    for (iter_mid = tags_mid.begin(); iter_mid != tags_mid.end(); ++iter_mid) {
+      double n = 0;
+      for (iter_left = tags_left.begin(); iter_left != tags_left.end(); ++iter_left) {
+        for (iter_right = tags_right.begin(); iter_right != tags_right.end(); ++iter_right) {
+          n += tdlsw.getD()[*iter_left][*iter_mid][*iter_right];
+        }
+      }
+      if (n > max) {
+        max = n;
+        tag_max = *iter_mid;
+      }
+    }
+
+    micad = word_mid->get_lexical_form(tag_max, (tdlsw.getTagIndex())[L"TAG_kEOF"]);
+    fputws_unlocked(micad.c_str(), Output);
+    if (morpho_stream.getEndOfFile()) {
+      if (null_flush) {
+        fputwc_unlocked(L'\0', Output);
+      }
+      fflush(Output);
+      morpho_stream.setEndOfFile(false);
+    }
+  
+    delete word_left;
+    word_left = word_mid;
+    tags_left = tags_mid;
+    word_mid = word_right;
+    tags_mid = tags_right;
+    word_right = morpho_stream.get_next_word();
+    if (word_right != NULL) {
+      word_right->set_show_sf(show_sf);
+    }
+  }
+  delete word_left;
+  delete word_mid;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_utils.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_utils.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_utils.h	(revision 70339)
@@ -0,0 +1,105 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __TAGGERUTILS_H
+#define __TAGGERUTILS_H
+
+#include <map>
+#include <string>
+#include <set>
+#include <fstream>
+#include <iostream>
+#include <vector>
+#include <apertium/ttag.h>
+#include <cstdlib>
+#include <apertium/tagger_data.h>
+#include <apertium/tagger_word.h>
+
+using namespace std;
+
+namespace tagger_utils
+{
+/** Print a fatal error message
+ *  @param s the error message to print
+ */
+void fatal_error (wstring const &s);
+
+/** Print a fatal error message related to a file
+ *  @param s the file name to be printted in the error message
+ */
+void file_name_error (string const &s);
+
+/** Convert from int to string
+ *  @param i the int value to convert
+ *  @return an string representing the number recived as input
+ */
+char *itoa(int i);
+
+/** Make all array positions equal to zero
+ *  @param a the array
+ *  @param l length of the array a
+ */
+void clear_array_double(double a[], int l);
+
+/** Clear all vectors stored in array v
+ *  @param v array of vectors
+ *  @param l length of the array v
+ */
+void clear_array_vector(vector<TTag> v[], int l);
+
+/** Return the number of tokens in the multiword unit
+ */
+ int ntokens_multiword(wstring const &s);
+ 
+/** Devuelve el n� de guiones que contiene la cadena pasada como argumento
+  */
+int nguiones_fs(wstring const &cadena);
+
+/** Reads the expanded dictionary received as a parameter puts the resulting
+ *  ambiguity classes that the tagger will manage.
+ *  @param fdic the input stream with the expanded dictionary to read
+ *  @param td the tagger data instance to mutate
+ */
+void read_dictionary(FILE *fdic, TaggerData &td);
+
+/** This method returns a known ambiguity class that is a subset of
+*  the one received as a parameter. This is useful when a new
+*  ambiguity class is found because of changes in the morphological
+*  dictionary used by the MT system.
+*  @param c set of tags (ambiguity class)
+*  @return a known ambiguity class
+*/
+set<TTag> find_similar_ambiguity_class(TaggerData &td, set<TTag> &c);
+
+/** Dies with an error message if the tags aren't in the tagger data */
+void require_ambiguity_class(TaggerData &td, set<TTag> &tags, TaggerWord &word, int nw);
+
+/** As with find_similar_ambiguity_class, but returns tags if it's already fine
+ * & prints a warning if debug */
+set<TTag> require_similar_ambiguity_class(TaggerData &td, set<TTag> &tags, TaggerWord &word, bool debug);
+
+wstring trim(wstring s);
+
+};
+
+template <class T>
+ostream& operator<< (ostream& os, const map <int, T> & f);
+template <class T>
+istream& operator>> (istream& is, map <int, T> & f);
+template <class T>
+ostream& operator<< (ostream& os, const set<T>& s);
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-createmodes.awk
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-createmodes.awk	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-createmodes.awk	(revision 70339)
@@ -0,0 +1,30 @@
+#!/usr/bin/awk -f
+
+# Parse output from modes2bash.xsl
+
+BEGIN {
+  FS="^ *# *"
+  guesswarned=0
+}
+
+NF==2 && /\.mode$/ {
+  filename = $2
+  if(filename ~ /NAMEME/ && !guesswarned) {
+    print "apertium-createmodes.awk: At least one program in a gendebug=\"yes\" mode needs a debug-suff attribute; couldn't guess what suffix to use for the debug mode." > "/dev/stderr"
+    guesswarned=1
+  }
+  if(seen[filename]) {
+    print "apertium-createmodes.awk: "filename" seen twice" > "/dev/stderr"
+    filename = 0
+  }
+  else {
+    print "" > filename
+    seen[filename] = 1
+  }
+  next
+}
+
+filename {
+  print $0 >> filename
+  close(filename)
+}

Property changes on: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-createmodes.awk
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/modes.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/modes.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/modes.dtd	(revision 70339)
@@ -0,0 +1,38 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+   Copyright (C) 2005-2016 Universitat d'Alacant / Universidad de Alicante
+
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+  DTD for the modes.xml file
+-->
+
+<!ELEMENT modes (mode+)>
+
+<!ELEMENT mode (pipeline)>
+<!ATTLIST mode name ID #REQUIRED>
+<!ATTLIST mode install CDATA #IMPLIED>
+<!ATTLIST mode gendebug CDATA #IMPLIED>
+
+<!ELEMENT pipeline (program+)>
+
+<!ELEMENT program (file|arg)*>
+<!ATTLIST program name CDATA #REQUIRED>
+<!ATTLIST program debug-suff CDATA #IMPLIED>
+
+<!ELEMENT file EMPTY>
+<!ATTLIST file name CDATA #REQUIRED>
+
+<!ELEMENT arg EMPTY>
+<!ATTLIST arg name CDATA #REQUIRED>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/modes.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/modes.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/modes.rnc	(revision 70339)
@@ -0,0 +1,33 @@
+#  Copyright (C) 2005-2016 Universitat d'Alacant / Universidad de Alicante
+# 
+#  This program is free software; you can redistribute it and/or
+#  modify it under the terms of the GNU General Public License as
+#  published by the Free Software Foundation; either version 2 of the
+#  License, or (at your option) any later version.
+# 
+#  This program is distributed in the hope that it will be useful, but
+#  WITHOUT ANY WARRANTY; without even the implied warranty of
+#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+#  General Public License for more details.
+# 
+#  You should have received a copy of the GNU General Public License
+#  along with this program; if not, see <http://www.gnu.org/licenses/>.
+# 
+# DTD for the modes.xml file
+
+modes = element modes { attlist.modes, mode+ }
+attlist.modes &= empty
+mode = element mode { attlist.mode, pipeline }
+attlist.mode &= attribute name { xsd:ID }
+attlist.mode &= attribute install { text }?
+attlist.mode &= attribute gendebug { text }?
+pipeline = element pipeline { attlist.pipeline, program+ }
+attlist.pipeline &= empty
+program = element program { attlist.program, (file | arg)* }
+attlist.program &= attribute name { text }
+attlist.program &= attribute debug-suff { text }?
+file = element file { attlist.file, empty }
+attlist.file &= attribute name { text }
+arg = element arg { attlist.arg, empty }
+attlist.arg &= attribute name { text }
+start = modes
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/modes.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/modes.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/modes.rng	(revision 70339)
@@ -0,0 +1,106 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+   Copyright (C) 2005-2016 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+  
+  DTD for the modes.xml file
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0" datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes">
+  <define name="modes">
+    <element name="modes">
+      <ref name="attlist.modes"/>
+      <oneOrMore>
+        <ref name="mode"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.modes" combine="interleave">
+    <empty/>
+  </define>
+  <define name="mode">
+    <element name="mode">
+      <ref name="attlist.mode"/>
+      <ref name="pipeline"/>
+    </element>
+  </define>
+  <define name="attlist.mode" combine="interleave">
+    <attribute name="name">
+      <data type="ID"/>
+    </attribute>
+  </define>
+  <define name="attlist.mode" combine="interleave">
+    <optional>
+      <attribute name="install"/>
+    </optional>
+  </define>
+  <define name="attlist.mode" combine="interleave">
+    <optional>
+      <attribute name="gendebug"/>
+    </optional>
+  </define>
+  <define name="pipeline">
+    <element name="pipeline">
+      <ref name="attlist.pipeline"/>
+      <oneOrMore>
+        <ref name="program"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.pipeline" combine="interleave">
+    <empty/>
+  </define>
+  <define name="program">
+    <element name="program">
+      <ref name="attlist.program"/>
+      <zeroOrMore>
+        <choice>
+          <ref name="file"/>
+          <ref name="arg"/>
+        </choice>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.program" combine="interleave">
+    <attribute name="name"/>
+  </define>
+  <define name="attlist.program" combine="interleave">
+    <optional>
+      <attribute name="debug-suff"/>
+    </optional>
+  </define>
+  <define name="file">
+    <element name="file">
+      <ref name="attlist.file"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.file" combine="interleave">
+    <attribute name="name"/>
+  </define>
+  <define name="arg">
+    <element name="arg">
+      <ref name="attlist.arg"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.arg" combine="interleave">
+    <attribute name="name"/>
+  </define>
+  <start>
+    <choice>
+      <ref name="modes"/>
+    </choice>
+  </start>
+</grammar>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/modes2bash.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/modes2bash.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/modes2bash.xsl	(revision 70339)
@@ -0,0 +1,99 @@
+<?xml version="1.0" encoding="UTF-8"?><!-- -*- nxml -*- -->
+<!--
+ Copyright (C) 2005-2014 Universitat d'Alacant / Universidad de Alicante
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+
+<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+<xsl:output method="text" encoding="UTF-8" indent="no"/>
+
+<xsl:param name="installdir"/>
+<xsl:param name="devdir"/>
+
+<xsl:template match="modes">
+  <xsl:apply-templates/>
+</xsl:template>
+
+
+<!-- Print filenames first, then the contents of each file. This gets
+     parsed by apertium-createmodes.awk which splits it into the
+     specific files. -->
+<xsl:template match="mode">
+  <xsl:choose>
+    <xsl:when test="@install = 'yes'">
+      <xsl:text>
+# </xsl:text>
+      <xsl:value-of select="./@name"/>
+      <xsl:text>.mode
+      </xsl:text>
+      <xsl:apply-templates>
+        <xsl:with-param name="dir"><xsl:value-of select="$installdir"/></xsl:with-param>
+      </xsl:apply-templates>
+    </xsl:when>
+  </xsl:choose>
+  <xsl:variable name="dir">
+    <xsl:text>'</xsl:text>
+    <xsl:value-of select="$devdir"/>
+    <xsl:text>'</xsl:text>
+  </xsl:variable>
+  <xsl:text>
+# modes/</xsl:text>
+  <xsl:value-of select="./@name"/>
+  <xsl:text>.mode
+  </xsl:text>
+  <xsl:apply-templates>
+    <xsl:with-param name="dir"><xsl:value-of select="$devdir"/></xsl:with-param>
+  </xsl:apply-templates>
+</xsl:template>
+
+
+<xsl:template match="pipeline">
+  <xsl:param name="dir" />
+  <xsl:for-each select="./*">
+    <xsl:if test="not(position()=1)">
+      <xsl:text>| </xsl:text>
+    </xsl:if>
+    <xsl:apply-templates select=".">
+      <xsl:with-param name="dir"><xsl:value-of select="$dir"/></xsl:with-param>
+    </xsl:apply-templates>
+  </xsl:for-each>
+</xsl:template>
+
+<xsl:template match="program">
+  <xsl:param name="dir" />
+  <xsl:value-of select="./@name"/>
+  <xsl:for-each select="./*">
+    <xsl:text> </xsl:text>
+    <xsl:apply-templates select=".">
+      <xsl:with-param name="dir"><xsl:value-of select="$dir"/></xsl:with-param>
+    </xsl:apply-templates>
+  </xsl:for-each>
+</xsl:template>
+
+<xsl:template match="arg">
+  <xsl:value-of select="./@name"/>
+</xsl:template>
+
+<xsl:template match="file">
+  <xsl:param name="dir" />
+  <xsl:text>'</xsl:text>
+  <xsl:value-of select="$dir" />
+  <xsl:text>/</xsl:text>
+  <xsl:value-of select="./@name"/>
+  <xsl:text>' </xsl:text>
+</xsl:template>
+
+
+</xsl:stylesheet>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/modes2debugmodes.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/modes2debugmodes.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/modes2debugmodes.xsl	(revision 70339)
@@ -0,0 +1,167 @@
+<?xml version="1.0" encoding="UTF-8"?> <!-- -*- nxml -*- -->
+<!--
+Copyright (C) 2016 Universitat d'Alacant / Universidad de Alicante
+
+This program is free software; you can redistribute it and/or
+modify it under the terms of the GNU General Public License as
+published by the Free Software Foundation; either version 2 of the
+License, or (at your option) any later version.
+
+This program is distributed in the hope that it will be useful, but
+WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+  <xsl:output method="xml" encoding="UTF-8"/>
+
+  <xsl:template name="replaceString">
+    <xsl:param name="haystack"/>
+    <xsl:param name="needle"/>
+    <xsl:param name="replacement"/>
+    <xsl:choose>
+      <xsl:when test="contains($haystack, $needle)">
+        <xsl:value-of select="substring-before($haystack, $needle)"/>
+        <xsl:value-of select="$replacement"/>
+        <xsl:call-template name="replaceString">
+          <xsl:with-param name="haystack"
+                          select="substring-after($haystack, $needle)"/>
+          <xsl:with-param name="needle" select="$needle"/>
+          <xsl:with-param name="replacement" select="$replacement"/>
+        </xsl:call-template>
+      </xsl:when>
+      <xsl:otherwise>
+        <xsl:value-of select="$haystack"/>
+      </xsl:otherwise>
+    </xsl:choose>
+  </xsl:template>
+
+  <xsl:template match="mode[not(@gendebug='yes')]">
+    <!-- Output these unchanged; don't apply templates here -->
+    <xsl:copy-of select="."/>
+  </xsl:template>
+
+  <xsl:template match="mode[@gendebug='yes']">
+    <xsl:comment>
+      <xsl:text> **************** </xsl:text>
+      <xsl:value-of select="./@name"/>
+      <xsl:text>: **************** </xsl:text>
+    </xsl:comment>
+    <xsl:copy-of select="."/>
+    <xsl:apply-templates select="./pipeline/program"/>
+  </xsl:template>
+
+  <xsl:template name="debugSuffix">
+    <xsl:param name="progname"/>
+    <xsl:param name="suff-attr"/>
+    <xsl:variable name="p" select="normalize-space($progname)"/>
+    <!-- TODO: We also need to know what names have been used already
+         to make them unique! Might be easier to do uniquifying
+         outside XSLT -->
+    <xsl:choose>
+      <xsl:when test="$suff-attr != ''">
+        <xsl:text>-</xsl:text><xsl:value-of select="$suff-attr"/>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'cg-proc')">
+        <xsl:text>-disam</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-tagger')">
+        <xsl:text>-tagger</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-pretransfer')">
+        <xsl:text>-pretransfer</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'lrx-proc')">
+        <xsl:text>-lex</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-transfer')">
+        <xsl:text>-chunker</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-interchunk')">
+        <xsl:text>-interchunk</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-postchunk')">
+        <xsl:text>-postchunk</xsl:text>
+      </xsl:when>
+      <xsl:when test="contains($p, '$1')">
+        <xsl:text>-dgen</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'lt-proc') and contains($p, ' -b')">
+        <xsl:text>-biltrans</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'lt-proc') and contains($p, ' -p')">
+        <xsl:text>-pgen</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'lt-proc')">
+        <xsl:text>-morph</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'hfst-proc')">
+        <xsl:text>-morph</xsl:text>
+      </xsl:when>
+      <xsl:otherwise>
+        <xsl:text>-NAMEME</xsl:text>
+      </xsl:otherwise>
+    </xsl:choose>
+  </xsl:template>
+
+  <xsl:template name="traceOpt">
+    <xsl:param name="progname"/>
+    <xsl:variable name="p" select="normalize-space($progname)"/>
+    <xsl:choose>
+      <xsl:when test="starts-with($p, 'cg-proc')">
+        <xsl:text> -t</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'lrx-proc')">
+        <xsl:text> -t</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-transfer')">
+        <xsl:text> -t</xsl:text>
+      </xsl:when>
+      <xsl:when test="starts-with($p, 'apertium-interchunk')">
+        <xsl:text> -t</xsl:text>
+      </xsl:when>
+      <xsl:otherwise>
+        <xsl:text></xsl:text>
+      </xsl:otherwise>
+    </xsl:choose>
+  </xsl:template>
+
+  <xsl:template match="program">
+    <mode install="no">
+      <xsl:attribute name="name">
+        <xsl:value-of select="../../@name"/>
+        <xsl:call-template name="debugSuffix">
+          <xsl:with-param name="progname" select="./@name"/>
+          <xsl:with-param name="suff-attr" select="./@debug-suff"/>
+        </xsl:call-template>
+      </xsl:attribute>
+      <pipeline>
+        <xsl:copy-of select="./preceding-sibling::*"/>
+        <program>
+          <xsl:attribute name="name">
+            <xsl:call-template name="replaceString">
+              <xsl:with-param name="haystack" select="./@name"/>
+              <xsl:with-param name="needle" select="'$1'"/>
+              <xsl:with-param name="replacement" select="'-d'"/>
+            </xsl:call-template>
+            <xsl:call-template name="traceOpt">
+              <xsl:with-param name="progname" select="./@name"/>
+            </xsl:call-template>
+          </xsl:attribute>
+          <xsl:copy-of select="./*"/>
+        </program>
+      </pipeline>
+    </mode>
+  </xsl:template>
+
+  <!-- catch-all -->
+  <xsl:template match="@* | node()">
+    <xsl:copy>
+      <xsl:apply-templates select="@* | node()"/>
+    </xsl:copy>
+  </xsl:template>
+
+</xsl:stylesheet>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_gen_wlist_lextor_translation.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_gen_wlist_lextor_translation.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_gen_wlist_lextor_translation.cc	(revision 70339)
@@ -0,0 +1,177 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * 
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <iostream>
+#include <fstream>
+#include "getopt_long.h"
+#include <string>
+
+#include <lttoolbox/fst_processor.h>
+
+#include <apertium/lextor_word.h>
+#include <apertium/utf_converter.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+using namespace std;
+
+
+void help(char *name) {
+  wcerr<<L"USAGE:\n";
+  wcerr<<name<<L" --mono dic.bin --bil bildic.bin --wlist wlistfile\n\n";
+  wcerr<<L"ARGUMENTS: \n"
+      <<L"   --mono|-m: Specifies the monolingual lexical selection dictionary to use.\n"
+      <<L"   --bil|-b: Specifies the bilingual lexical selection dictionary to use.\n"
+      <<L"   --wlist|-w: Specifies the list of words to translate.\n"
+      <<L"   --help|-h: Show this help\n"
+      <<L"   --version|-v: Show version information\n\n"
+      <<L"Write to standard output all possible translations of words found in wlistfile\n";
+}
+
+int main(int argc, char* argv[]) {
+  int c;
+  
+  int option_index=0;
+  string monodic_file="";
+  string bildic_file="";
+  string wlist_file="";
+
+  while (true) {
+    static struct option long_options[] =
+      {
+	{"mono",    required_argument, 0, 'm'},
+	{"bil",     required_argument, 0, 'b'},
+	{"wlist",   required_argument, 0, 'w'},
+	{"help",        no_argument,   0, 'h'},
+	{"version",     no_argument,   0, 'v'},
+	{0, 0, 0, 0}
+      };
+
+    c=getopt_long(argc, argv, "m:b:w:hv",long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c) {
+    case 'm':
+      monodic_file=optarg;
+      break;
+    case 'b':
+      bildic_file=optarg;
+      break;
+    case 'w':
+      wlist_file=optarg;
+      break;
+    case 'h': 
+      help(argv[0]);
+      exit(EXIT_SUCCESS);
+      break;
+    case 'v':
+      wcerr<<L"APERTIUM"<<L"\n"; //"APERTIUM" era PACKAGE_STRING
+      wcerr<<L"LICENSE:\n\n"
+	  <<L"   Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante\n\n"
+	  <<L"   This program is free software; you can redistribute it and/or\n"
+	  <<L"   modify it under the terms of the GNU General Public License as\n"
+	  <<L"   published by the Free Software Foundation; either version 2 of the\n"
+	  <<L"   License, or (at your option) any later version.\n"
+	  <<L"   This program is distributed in the hope that it will be useful, but\n"
+	  <<L"   WITHOUT ANY WARRANTY; without even the implied warranty of\n"
+	  <<L"   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU\n"
+	  <<L"   General Public License for more details.\n"
+	  <<L"\n"
+	  <<L"   You should have received a copy of the GNU General Public License\n"
+	  <<L"   along with this program; if not, see <http://www.gnu.org/licenses/>.\n";
+      exit(EXIT_SUCCESS);
+      break;    
+    default:
+      help(argv[0]);
+      exit(EXIT_FAILURE);
+      break;
+    }
+  }
+
+  if(monodic_file=="") {
+    wcerr<<L"Error: no monolingual dictionary file was given\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  if (bildic_file=="") {
+    wcerr<<L"Error: no bilingual dictionary file was given\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  if (wlist_file=="") {
+    wcerr<<L"Error: no word list file was given\n";
+    help(argv[0]);
+    exit(EXIT_FAILURE);
+  }
+
+  wifstream fwlist;
+  FILE *fmonodic, *fbildic;
+
+  fmonodic=fopen(monodic_file.c_str(), "rb");
+  if (!fmonodic) {
+    wcerr<<L"Error: Cannot open file '"
+         <<UtfConverter::fromUtf8(monodic_file)<<L"'\n";
+    exit(EXIT_FAILURE);
+  }
+
+  fbildic=fopen(bildic_file.c_str(), "rb");
+  if (!fbildic) {
+    wcerr<<L"Error: Cannot open file '"
+         <<UtfConverter::fromUtf8(bildic_file)<<L"'\n";
+    exit(EXIT_FAILURE);
+  }
+
+  fwlist.open(wlist_file.c_str(), ios::in);
+  if (fwlist.fail()) {
+    wcerr<<L"Error: Cannot open file '"
+         <<UtfConverter::fromUtf8(wlist_file)<<L"'\n";
+    exit(EXIT_FAILURE);
+  }
+
+  FSTProcessor fstp_monodic, fstp_bildic;
+
+  fstp_monodic.load(fmonodic);
+  fstp_monodic.initBiltrans();
+  fclose(fmonodic);
+
+  fstp_bildic.load(fbildic);
+  fstp_bildic.initBiltrans();
+  fclose(fbildic);
+
+  wstring strword=L"";
+  while (!fwlist.eof()) {
+    getline(fwlist, strword);
+    if (!fwlist.eof()) {
+      LexTorWord word(strword, &fstp_monodic);
+      wcerr<<strword<<L" =>\n";
+      for (int i=0; i<word.n_lexical_choices(); i++) {
+	wcerr<<L"\t"<<word.translate(fstp_bildic,i)<<L" ("<<word.get_lexical_choice(i)<<L")\n";
+	wcout<<word.translate(fstp_bildic,i)<<L"\n";
+      }
+      if (word.n_lexical_choices()<=1) {
+        wcerr<<L"Warning: word '"<<strword<<L"' is supossed to be polysemous, but it has "<<word.n_lexical_choices()<<L" different translations\n";
+      }
+    }
+  }
+
+  fwlist.close();
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_pretransfer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_pretransfer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_pretransfer.cc	(revision 70339)
@@ -0,0 +1,277 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <cstdio>
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <string>
+#include "getopt_long.h"
+
+#include <lttoolbox/lt_locale.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+using namespace std;
+
+bool compound_sep = false;
+
+void readAndWriteUntil(FILE *input, FILE *output, int const charcode)
+{
+  int mychar;
+
+  while((mychar = fgetwc_unlocked(input)) != charcode)
+  {
+    if(feof(input))
+    {
+      wcerr << L"ERROR: Unexpected EOF" << endl;
+      exit(EXIT_FAILURE);
+    }
+    fputwc_unlocked(mychar, output);
+    if(mychar == L'\\')
+    {
+      mychar = fgetwc(input);
+      fputwc(mychar, output);
+    }
+  }
+}
+
+void procWord(FILE *input, FILE *output, bool surface_forms)
+{
+  int mychar;
+  wstring buffer = L"";
+
+  bool buffer_mode = false;
+  bool in_tag = false;
+  bool queuing = false;
+
+  if(surface_forms)
+  {
+    while((mychar = fgetwc_unlocked(input)) != L'/') ;
+  } 
+
+  while((mychar = fgetwc_unlocked(input)) != L'$')
+  {
+    if(feof(input))
+    {
+      wcerr << L"ERROR: Unexpected EOF" << endl;
+      exit(EXIT_FAILURE);
+    }
+  
+    switch(mychar)
+    {
+    case L'<':
+      in_tag = true;
+      if(!buffer_mode)
+      {
+        buffer_mode = true;
+      }
+      break;
+      
+    case L'>':
+      in_tag = false;
+      break;
+      
+    case L'#':
+      if(buffer_mode)
+      {
+        buffer_mode = false;
+        queuing = true;
+      }
+      break;
+    }
+
+    if(buffer_mode)
+    { 
+      if((mychar != L'+' || (mychar == L'+' && in_tag == true)) && 
+         (mychar != L'~' || (mychar == L'~' && in_tag == true)))
+      {
+        buffer += static_cast<wchar_t>(mychar);
+      }
+      else if(in_tag == false && mychar == L'+')
+      {
+        buffer.append(L"$ ^");
+      }
+      else if(in_tag == false && mychar == L'~' and compound_sep == true)
+      {
+        buffer.append(L"$^");
+      }
+    }
+    else
+    {
+      if(mychar == L'+' && queuing == true)  
+      {
+        buffer.append(L"$ ^");
+        buffer_mode = true;
+      }
+      else 
+      {
+        fputwc_unlocked(mychar, output);
+      }
+    }
+
+  }
+  fputws_unlocked(buffer.c_str(), output);
+}
+
+void processStream(FILE *input, FILE *output, bool null_flush, bool surface_forms)
+{
+  while(true)
+  {
+    int mychar = fgetwc_unlocked(input);
+    if(feof(input))
+    {
+      break;
+    }
+    switch(mychar)
+    {
+      case L'[':
+        fputwc_unlocked(L'[', output);
+        readAndWriteUntil(input, output, L']');
+        fputwc_unlocked(L']', output);
+        break;
+ 
+      case L'\\':
+        fputwc_unlocked(mychar, output);
+        fputwc_unlocked(fgetwc_unlocked(input), output);
+        break;
+ 
+      case L'^':
+        fputwc_unlocked(mychar, output);
+        procWord(input, output, surface_forms);
+        fputwc_unlocked(L'$', output);
+        break;
+      
+      case L'\0':
+        fputwc_unlocked(mychar, output);
+        
+        if(null_flush)
+        {
+          fflush(output);
+        }
+        break;  
+ 
+      default:
+        fputwc_unlocked(mychar, output);
+        break;
+    }
+  }
+}
+
+void usage(char *progname)
+{
+  wcerr << L"USAGE: " << basename(progname) << L" [input_file [output_file]]" << endl;
+  exit(EXIT_FAILURE);
+}
+
+
+
+
+int main(int argc, char *argv[])
+{ 
+  LtLocale::tryToSetLocale();
+  bool null_flush = false;
+  bool surface_forms = false;
+  
+  int option_index=0;
+
+  while (true) {
+    static struct option long_options[] =
+    {
+      {"null-flush", no_argument, 0, 'z'},
+      {"no-surface-forms", no_argument, 0, 'n'},
+      {"compounds", no_argument, 0, 'e'},
+      {"help", no_argument, 0, 'h'},
+      {0, 0, 0, 0}
+    };
+
+    int c=getopt_long(argc, argv, "enzh", long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c)
+    {
+      case 'z':
+        null_flush = true;
+        break;
+
+      case 'e':
+        compound_sep = true;
+        break;
+     
+      case 'n':
+        surface_forms = true;
+        break;
+       
+      case 'h':
+      default:
+        usage(argv[0]);
+        break;
+    }
+  }
+
+  if((argc-optind+1) > 3)
+  {
+    usage(argv[0]);
+  }
+
+  FILE *input, *output;
+  
+  if((argc-optind+1) == 1)
+  {
+    input = stdin;
+    output = stdout;
+  }
+  else if ((argc-optind+1) == 2)
+  {
+    input = fopen(argv[argc-1], "r");
+    if(!input)
+    {
+      usage(argv[0]);
+    }
+    output = stdout;
+  }
+  else
+  {
+    input = fopen(argv[argc-2], "r");
+    output = fopen(argv[argc-1], "w");
+
+    if(!input || !output)
+    {
+      usage(argv[0]);
+    }
+  }
+
+  if(feof(input))
+  {
+    wcerr << L"ERROR: Can't read file '" << argv[1] << L"'" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+#ifdef _MSC_VER
+    _setmode(_fileno(input), _O_U8TEXT);
+    _setmode(_fileno(output), _O_U8TEXT);
+#endif
+
+  processStream(input, output, null_flush, surface_forms);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tagger.h	(revision 70339)
@@ -0,0 +1,88 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef APERTIUM_TAGGER_H
+#define APERTIUM_TAGGER_H
+
+#include "apertium_config.h"
+
+#include "basic_stream_tagger.h"
+#include "basic_stream_tagger_trainer.h"
+#include "basic_tagger.h"
+#include "constructor_eq_delete.h"
+#include "file_tagger.h"
+#include "optional.h"
+
+#include "getopt_long.h"
+#include <string>
+
+namespace Apertium {
+class apertium_tagger : private constructor_eq_delete {
+public:
+  apertium_tagger(int &argc, char **&argv);
+
+private:
+  enum FunctionTypeType { Unigram, SlidingWindow };
+  enum UnigramType { Stream_5_3_1, Stream_5_3_2, Stream_5_3_3 };
+  enum FunctionType { Tagger, Retrain, Supervised, Train };
+  static void help();
+
+
+  static std::string option_string(const int &indexptr_);
+  static std::string option_string(const struct option &option_);
+
+
+  static void locale_global_();
+
+
+  static const struct option longopts[];
+
+
+
+  void set_indexptr();
+
+
+  void flagOptionCase(bool (basic_Tagger::Flags::*GetFlag)() const,
+                      void (basic_Tagger::Flags::*SetFlag)(const bool &));
+  std::string option_string();
+  void functionTypeTypeOptionCase(const FunctionTypeType &FunctionTypeType_);
+  void functionTypeOptionCase(const FunctionType &FunctionType_);
+  void getIterationsArgument();
+  unsigned long optarg_unsigned_long() const;
+  void g_StreamTagger(basic_StreamTagger &StreamTagger_);
+  void s_StreamTaggerTrainer(basic_StreamTaggerTrainer &StreamTaggerTrainer_);
+  void g_FILE_Tagger(FILE_Tagger &FILE_Tagger_);
+  void r_FILE_Tagger(FILE_Tagger &FILE_Tagger_);
+  void s_FILE_Tagger(FILE_Tagger &FILE_Tagger_);
+  void t_FILE_Tagger(FILE_Tagger &FILE_Tagger_);
+  int &argc;
+  char **&argv;
+  int The_val;
+
+
+  int The_indexptr;
+  Optional<int> FunctionTypeTypeOption_indexptr;
+  Optional<int> FunctionTypeOption_indexptr;
+
+
+  Optional<FunctionTypeType> TheFunctionTypeType;
+  Optional<UnigramType> TheUnigramType;
+  Optional<FunctionType> TheFunctionType;
+  unsigned long TheFunctionTypeOptionArgument;
+  basic_Tagger::Flags TheFlags;
+};
+}
+
+#endif // APERTIUM_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tmxbuild.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tmxbuild.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_tmxbuild.cc	(revision 70339)
@@ -0,0 +1,209 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <cstdlib>
+#include "getopt_long.h"
+#include <iostream>
+#include <libgen.h>
+#include <string>
+#include <cstdio>
+#include <lttoolbox/lt_locale.h>
+
+#include <apertium/apertium_config.h>
+#include <apertium/tmx_builder.h>
+#include <apertium/utf_converter.h>
+#include <apertium/string_utils.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+using namespace Apertium;
+using namespace std;
+
+void usage(char *progname)
+{
+  wcerr << L"USAGE: " << basename(progname) << L" [options] code1 code2 doc1 doc2 [output_file]" << endl;
+  wcerr << L"Options:" << endl;
+  wcerr << L"  -p percent    number 0 < n <= 1 to set margin of confidence of TU's " << endl;
+  wcerr << L"                (0.85 by default) in length terms" << endl;
+  wcerr << L"  -e edit       number 0 < n <= 1 to set margin of confidence of TU's " << endl;
+  wcerr << L"                (0.30 by default) in edit distance terms" << endl;
+  wcerr << L"  -l low-limit  ignore percent if the segment is less than lowlimit" <<endl;
+  wcerr << L"                (15 by default)" << endl;
+  wcerr << L"  -m max-edit   characters to be taken into account when aligning" << endl;
+  wcerr << L"                sentences (50 by default)" << endl;
+  wcerr << L"  -d diagonal   diagonal width for using edit distance, 10 by default" << endl;
+  wcerr << L"  -w window     window size of the edit distance with sentences" << endl;
+  wcerr << L"                (100 sentences by default)" << endl;
+  wcerr << L"  -s step       step for moving the window during the alingment" <<endl;
+  wcerr << L"                (75 sentences by default)" << endl;
+  wcerr << L"  -h help       display this help" << endl;
+  wcerr << L"Other parameters:" << endl;
+  wcerr << L"  code1, code2 codes of the languages (i.e. ISO-631 ones)" << endl;
+  wcerr << L"  doc1, doc2    unformatted docs to build the TMX file" << endl;
+  wcerr << L"  output_file   if not specified, the result will be printed to stdout" << endl;
+  
+  exit(EXIT_FAILURE);
+}
+
+
+int main(int argc, char *argv[])
+{ 
+  LtLocale::tryToSetLocale();
+  string output_file = "";
+  string doc1 = "", doc2 = "";
+  string lang1 = "", lang2 = "";
+
+  double percent = 0.85;
+  int low_limit = 15;
+  int max_edit = 50;
+  int diagonal_width = 10;
+  int window_size = 100;
+  int step = 75;
+  double edit_distance_percent = 0.30;
+  string translation = "";
+
+
+  int option_index=0;
+
+  while (true) {
+    static struct option long_options[] =
+    {
+      {"percent",      required_argument, 0, 'p'},
+      {"edit-distance-percent",      required_argument, 0, 'e'},
+      {"low-limit", required_argument, 0, 'l'},
+      {"max-edit", required_argument, 0, 'm'},
+      {"diagonal", required_argument, 0, 'd'},
+      {"window", required_argument, 0, 'w'},
+      {"step", required_argument, 0, 's'},
+      {"translation", required_argument, 0, 't'},
+      {"help",       no_argument,       0, 'h'}, 
+      {0, 0, 0, 0}
+    };
+
+    int c=getopt_long(argc, argv, "p:e:l:m:d:w:s:t:h", long_options, &option_index);
+    if (c==-1)
+      break;
+      
+    switch (c)
+    {
+      case 'p':
+        percent = strtod(optarg, NULL);
+        if(percent <= 0 || percent > 1)
+        {
+          usage(argv[0]);
+        }
+        break;
+      case 'e':
+        edit_distance_percent = strtod(optarg, NULL);
+        if(edit_distance_percent <= 0 || edit_distance_percent > 1)
+        {
+          usage(argv[0]);
+        }
+        break;
+        
+      case 'l':
+        low_limit = atoi(optarg);
+        if(low_limit < 0)
+        {
+          usage(argv[0]);
+        }
+        break;
+
+      case 'm':
+        max_edit = atoi(optarg);
+        if(max_edit < 0)
+        {
+          usage(argv[0]);
+        }
+        break;
+
+      case 'd':
+        diagonal_width = atoi(optarg);
+        if(diagonal_width < 0)
+        {
+          usage(argv[0]);
+        }
+        break;
+
+      case 'w':
+        window_size = atoi(optarg);
+        if(window_size < 0)
+        {
+          usage(argv[0]);
+        }
+        break;
+
+      case 's':
+        step = atoi(optarg);
+        if(step < 0)
+        {
+          usage(argv[0]);
+        }
+        break;
+     
+      case 't':
+	translation = optarg;
+	break;
+
+
+      default:
+        //wcerr<<L"Error: getopt() returned the char code '"<<c<<L"'\n";
+        usage(argv[0]);
+        break;
+    }    
+  }
+
+  switch(argc - optind + 1)
+  {
+    case 6:
+      output_file = argv[optind - 1 + 5];
+      // continued down  
+    case 5:
+      doc1 = argv[optind - 1 + 3];
+      doc2 = argv[optind - 1 + 4];
+      lang1 = argv[optind - 1 + 1];
+      lang2 = argv[optind - 1 + 2];
+      break;
+      
+    default:
+      usage(argv[0]);
+      return EXIT_FAILURE;
+  } 
+  
+  TMXBuilder tmxb(UtfConverter::fromUtf8(lang1), UtfConverter::fromUtf8(lang2));
+//  if(!tmxb.check(doc1, doc2))
+//  {
+//    wcerr << L"Error: The two files are incompatible for building a TMX." << endl;
+//    exit(EXIT_FAILURE);
+//  }
+   
+  // Set parameters
+
+  tmxb.setPercent(percent);
+  tmxb.setEditDistancePercent(edit_distance_percent);
+  tmxb.setMaxEdit(max_edit);
+  tmxb.setDiagonalWidth(diagonal_width);
+  tmxb.setWindowSize(window_size);
+  tmxb.setStep(step);
+  tmxb.setLowLimit(low_limit);
+  if(translation != "")
+  {
+    tmxb.setTranslation(translation);  
+  }
+  
+  tmxb.generate(doc1, doc2, output_file);
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/getopt_long.c
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/getopt_long.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/getopt_long.c	(revision 70339)
@@ -0,0 +1,1236 @@
+/*
+ * THIS IS NOT A CLEAN COPY OF GETOPT.C AND GETOPT1.C 
+ *
+ * Implementation of getopt_long, cobbled together from getopt.c and
+ * getopt1.c from the GNU binutils distribution.  This is more-or-less
+ * getopt.c inserted into getopt1.c, with the definition of getopt()
+ * commented out.
+ *
+ * Need to ifdef out optarg, optind, opterr, optopt, to handle the
+ * case where these are already defined for the benefit of system
+ * getopt()
+ *
+ * No, it's not pretty.
+ */
+
+/* getopt_long and getopt_long_only entry points for GNU getopt.
+   Copyright (C) 1987,88,89,90,91,92,93,94,96,97,98
+     Free Software Foundation, Inc.
+
+   NOTE: This source is derived from an old version taken from the GNU C
+   Library (glibc).
+
+   This program is free software; you can redistribute it and/or modify it
+   under the terms of the GNU General Public License as published by the
+   Free Software Foundation; either version 2, or (at your option) any
+   later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+   USA.  */
+
+#include <apertium_config.h>
+
+#ifndef HAVE_GETOPT_LONG
+/* We shouldn't be compiling this module in this case, but we clearly
+   are (damned configuration tools!), so avoid messing up. */
+
+#include "getopt_long.h"
+/* See getopt_long.h for discussion of THIS_IS__STDC__ */
+
+
+#if !defined THIS_IS__STDC__ || !THIS_IS__STDC__
+/* This is a separate conditional since some stdc systems
+   reject `defined (const)'.  */
+#ifndef const
+#define const
+#endif
+#endif
+
+#include <stdio.h>
+
+
+
+/* ******************** getopt.c ******************** */
+/* Getopt for GNU.
+   NOTE: getopt is now part of the C library, so if you don't know what
+   "Keep this file name-space clean" means, talk to drepper@gnu.org
+   before changing it!
+
+   Copyright (C) 1987, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98
+   	Free Software Foundation, Inc.
+
+   NOTE: This source is derived from an old version taken from the GNU C
+   Library (glibc).
+
+   This program is free software; you can redistribute it and/or modify it
+   under the terms of the GNU General Public License as published by the
+   Free Software Foundation; either version 2, or (at your option) any
+   later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+   USA.  */
+
+/* This tells Alpha OSF/1 not to define a getopt prototype in <stdio.h>.
+   Ditto for AIX 3.2 and <stdlib.h>.  */
+#ifndef _NO_PROTO
+# define _NO_PROTO
+#endif
+
+
+#if !defined THIS_IS__STDC__ || !THIS_IS__STDC__
+/* This is a separate conditional since some stdc systems
+   reject `defined (const)'.  */
+# ifndef const
+#  define const
+# endif
+#endif
+
+#include <stdio.h>
+
+/* Comment out all this code if we are using the GNU C Library, and are not
+   actually compiling the library itself.  This code is part of the GNU C
+   Library, but also included in many other GNU distributions.  Compiling
+   and linking in this code is a waste when using the GNU C library
+   (especially if it is a shared library).  Rather than having every GNU
+   program understand `configure --with-gnu-libc' and omit the object files,
+   it is simpler to just do this in the source for each such file.  */
+
+#define GETOPT_INTERFACE_VERSION 2
+#if !defined _LIBC && defined __GLIBC__ && __GLIBC__ >= 2
+# include <gnu-versions.h>
+# if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION
+#  define ELIDE_CODE
+# endif
+#endif
+
+#ifndef ELIDE_CODE
+
+
+/* This needs to come after some library #include
+   to get __GNU_LIBRARY__ defined.  */
+#ifdef	__GNU_LIBRARY__
+/* Don't include stdlib.h for non-GNU C libraries because some of them
+   contain conflicting prototypes for getopt.  */
+# include <stdlib.h>
+# include <unistd.h>
+#endif	/* GNU C library.  */
+
+#ifdef VMS
+# include <unixlib.h>
+# if HAVE_STRING_H - 0
+#  include <string.h>
+# endif
+#endif
+
+#ifndef _
+/* This is for other GNU distributions with internationalized messages.
+   When compiling libc, the _ macro is predefined.  */
+# ifdef HAVE_LIBINTL_H
+#  include <libintl.h>
+#  define _(msgid)	gettext (msgid)
+# else
+#  define _(msgid)	(msgid)
+# endif
+#endif
+
+/* This version of `getopt' appears to the caller like standard Unix `getopt'
+   but it behaves differently for the user, since it allows the user
+   to intersperse the options with the other arguments.
+
+   As `getopt' works, it permutes the elements of ARGV so that,
+   when it is done, all the options precede everything else.  Thus
+   all application programs are extended to handle flexible argument order.
+
+   Setting the environment variable POSIXLY_CORRECT disables permutation.
+   Then the behavior is completely standard.
+
+   GNU application programs can use a third alternative mode in which
+   they can distinguish the relative order of options and other arguments.  */
+
+
+
+/* Define HAVE_GETOPT if the getopt function (and thus, which is more
+ * important to us, the getopt globals, optarg, optind, opterr and
+ * optopt) is defined by the system.  Leave undefined if they should be
+ * defined here instead.
+ */
+#ifndef HAVE_GETOPT
+
+/* For communication from `getopt' to the caller.
+   When `getopt' finds an option that takes an argument,
+   the argument value is returned here.
+   Also, when `ordering' is RETURN_IN_ORDER,
+   each non-option ARGV-element is returned here.  */
+
+char *optarg = NULL;
+
+/* Index in ARGV of the next element to be scanned.
+   This is used for communication to and from the caller
+   and for communication between successive calls to `getopt'.
+
+   On entry to `getopt', zero means this is the first call; initialize.
+
+   When `getopt' returns -1, this is the index of the first of the
+   non-option elements that the caller should itself scan.
+
+   Otherwise, `optind' communicates from one call to the next
+   how much of ARGV has been scanned so far.  */
+
+/* 1003.2 says this must be 1 before any call.  */
+int optind = 1;
+
+/* Callers store zero here to inhibit the error message
+   for unrecognized options.  */
+
+int opterr = 1;
+
+/* Set to an option character which was unrecognized.
+   This must be initialized on some systems to avoid linking in the
+   system's own getopt implementation.  */
+
+int optopt = '?';
+
+#endif /* #ifndef HAVE_GETOPT */
+
+/* Formerly, initialization of getopt depended on optind==0, which
+   causes problems with re-calling getopt as programs generally don't
+   know that. */
+
+int __getopt_initialized = 0;
+
+/* The next char to be scanned in the option-element
+   in which the last option character we returned was found.
+   This allows us to pick up the scan where we left off.
+
+   If this is zero, or a null string, it means resume the scan
+   by advancing to the next ARGV-element.  */
+
+static char *nextchar;
+
+/* Describe how to deal with options that follow non-option ARGV-elements.
+
+   If the caller did not specify anything,
+   the default is REQUIRE_ORDER if the environment variable
+   POSIXLY_CORRECT is defined, PERMUTE otherwise.
+
+   REQUIRE_ORDER means don't recognize them as options;
+   stop option processing when the first non-option is seen.
+   This is what Unix does.
+   This mode of operation is selected by either setting the environment
+   variable POSIXLY_CORRECT, or using `+' as the first character
+   of the list of option characters.
+
+   PERMUTE is the default.  We permute the contents of ARGV as we scan,
+   so that eventually all the non-options are at the end.  This allows options
+   to be given in any order, even with programs that were not written to
+   expect this.
+
+   RETURN_IN_ORDER is an option available to programs that were written
+   to expect options and other ARGV-elements in any order and that care about
+   the ordering of the two.  We describe each non-option ARGV-element
+   as if it were the argument of an option with character code 1.
+   Using `-' as the first character of the list of option characters
+   selects this mode of operation.
+
+   The special argument `--' forces an end of option-scanning regardless
+   of the value of `ordering'.  In the case of RETURN_IN_ORDER, only
+   `--' can cause `getopt' to return -1 with `optind' != ARGC.  */
+
+static enum
+{
+  REQUIRE_ORDER, PERMUTE, RETURN_IN_ORDER
+} ordering;
+
+/* Value of POSIXLY_CORRECT environment variable.  */
+static char *posixly_correct;
+
+#ifdef	__GNU_LIBRARY__
+/* We want to avoid inclusion of string.h with non-GNU libraries
+   because there are many ways it can cause trouble.
+   On some systems, it contains special magic macros that don't work
+   in GCC.  */
+# include <string.h>
+# define my_index	strchr
+#else
+
+# if HAVE_STRING_H
+#  include <string.h>
+# else
+#  if HAVE_STRINGS_H
+#   include <strings.h>
+#  endif
+# endif
+
+/* Avoid depending on library functions or files
+   whose names are inconsistent.  */
+
+#ifndef getenv
+extern char *getenv ();
+#endif
+
+static char *
+my_index (str, chr)
+     const char *str;
+     int chr;
+{
+  while (*str)
+    {
+      if (*str == chr)
+	return (char *) str;
+      str++;
+    }
+  return 0;
+}
+
+/* If using GCC, we can safely declare strlen this way.
+   If not using GCC, it is ok not to declare it.  */
+#ifdef __GNUC__
+/* Note that Motorola Delta 68k R3V7 comes with GCC but not stddef.h.
+   That was relevant to code that was here before.  */
+# if (!defined THIS_IS__STDC__ || !THIS_IS__STDC__) && !defined strlen
+/* gcc with -traditional declares the built-in strlen to return int,
+   and has done so at least since version 2.4.5. -- rms.  */
+extern int strlen (const char *);
+# endif /* not THIS_IS__STDC__ */
+#endif /* __GNUC__ */
+
+#endif /* not __GNU_LIBRARY__ */
+
+/* Handle permutation of arguments.  */
+
+/* Describe the part of ARGV that contains non-options that have
+   been skipped.  `first_nonopt' is the index in ARGV of the first of them;
+   `last_nonopt' is the index after the last of them.  */
+
+static int first_nonopt;
+static int last_nonopt;
+
+#ifdef _LIBC
+/* Bash 2.0 gives us an environment variable containing flags
+   indicating ARGV elements that should not be considered arguments.  */
+
+/* Defined in getopt_init.c  */
+extern char *__getopt_nonoption_flags;
+
+static int nonoption_flags_max_len;
+static int nonoption_flags_len;
+
+static int original_argc;
+static char *const *original_argv;
+
+/* Make sure the environment variable bash 2.0 puts in the environment
+   is valid for the getopt call we must make sure that the ARGV passed
+   to getopt is that one passed to the process.  */
+static void
+__attribute__ ((unused))
+store_args_and_env (int argc, char *const *argv)
+{
+  /* XXX This is no good solution.  We should rather copy the args so
+     that we can compare them later.  But we must not use malloc(3).  */
+  original_argc = argc;
+  original_argv = argv;
+}
+# ifdef text_set_element
+text_set_element (__libc_subinit, store_args_and_env);
+# endif /* text_set_element */
+
+# define SWAP_FLAGS(ch1, ch2) \
+  if (nonoption_flags_len > 0)						      \
+    {									      \
+      char __tmp = __getopt_nonoption_flags[ch1];			      \
+      __getopt_nonoption_flags[ch1] = __getopt_nonoption_flags[ch2];	      \
+      __getopt_nonoption_flags[ch2] = __tmp;				      \
+    }
+#else	/* !_LIBC */
+# define SWAP_FLAGS(ch1, ch2)
+#endif	/* _LIBC */
+
+/* Exchange two adjacent subsequences of ARGV.
+   One subsequence is elements [first_nonopt,last_nonopt)
+   which contains all the non-options that have been skipped so far.
+   The other is elements [last_nonopt,optind), which contains all
+   the options processed since those non-options were skipped.
+
+   `first_nonopt' and `last_nonopt' are relocated so that they describe
+   the new indices of the non-options in ARGV after they are moved.  */
+
+#if defined THIS_IS__STDC__ && THIS_IS__STDC__
+static void exchange (char **);
+#endif
+
+static void
+exchange (argv)
+     char **argv;
+{
+  int bottom = first_nonopt;
+  int middle = last_nonopt;
+  int top = optind;
+  char *tem;
+
+  /* Exchange the shorter segment with the far end of the longer segment.
+     That puts the shorter segment into the right place.
+     It leaves the longer segment in the right place overall,
+     but it consists of two parts that need to be swapped next.  */
+
+#ifdef _LIBC
+  /* First make sure the handling of the `__getopt_nonoption_flags'
+     string can work normally.  Our top argument must be in the range
+     of the string.  */
+  if (nonoption_flags_len > 0 && top >= nonoption_flags_max_len)
+    {
+      /* We must extend the array.  The user plays games with us and
+	 presents new arguments.  */
+      char *new_str = malloc (top + 1);
+      if (new_str == NULL)
+	nonoption_flags_len = nonoption_flags_max_len = 0;
+      else
+	{
+	  memset (__mempcpy (new_str, __getopt_nonoption_flags,
+			     nonoption_flags_max_len),
+		  '\0', top + 1 - nonoption_flags_max_len);
+	  nonoption_flags_max_len = top + 1;
+	  __getopt_nonoption_flags = new_str;
+	}
+    }
+#endif
+
+  while (top > middle && middle > bottom)
+    {
+      if (top - middle > middle - bottom)
+	{
+	  /* Bottom segment is the short one.  */
+	  int len = middle - bottom;
+	  register int i;
+
+	  /* Swap it with the top part of the top segment.  */
+	  for (i = 0; i < len; i++)
+	    {
+	      tem = argv[bottom + i];
+	      argv[bottom + i] = argv[top - (middle - bottom) + i];
+	      argv[top - (middle - bottom) + i] = tem;
+	      SWAP_FLAGS (bottom + i, top - (middle - bottom) + i);
+	    }
+	  /* Exclude the moved bottom segment from further swapping.  */
+	  top -= len;
+	}
+      else
+	{
+	  /* Top segment is the short one.  */
+	  int len = top - middle;
+	  register int i;
+
+	  /* Swap it with the bottom part of the bottom segment.  */
+	  for (i = 0; i < len; i++)
+	    {
+	      tem = argv[bottom + i];
+	      argv[bottom + i] = argv[middle + i];
+	      argv[middle + i] = tem;
+	      SWAP_FLAGS (bottom + i, middle + i);
+	    }
+	  /* Exclude the moved top segment from further swapping.  */
+	  bottom += len;
+	}
+    }
+
+  /* Update records for the slots the non-options now occupy.  */
+
+  first_nonopt += (optind - last_nonopt);
+  last_nonopt = optind;
+}
+
+/* Initialize the internal data when the first call is made.  */
+
+#if defined THIS_IS__STDC__ && THIS_IS__STDC__
+static const char *_getopt_initialize (int, char *const *, const char *);
+#endif
+static const char *
+_getopt_initialize (argc, argv, optstring)
+     int argc;
+     char *const *argv;
+     const char *optstring;
+{
+  /* Start processing options with ARGV-element 1 (since ARGV-element 0
+     is the program name); the sequence of previously skipped
+     non-option ARGV-elements is empty.  */
+
+  first_nonopt = last_nonopt = optind;
+
+  nextchar = NULL;
+
+  posixly_correct = getenv ("POSIXLY_CORRECT");
+
+  /* Determine how to handle the ordering of options and nonoptions.  */
+
+  if (optstring[0] == '-')
+    {
+      ordering = RETURN_IN_ORDER;
+      ++optstring;
+    }
+  else if (optstring[0] == '+')
+    {
+      ordering = REQUIRE_ORDER;
+      ++optstring;
+    }
+  else if (posixly_correct != NULL)
+    ordering = REQUIRE_ORDER;
+  else
+    ordering = PERMUTE;
+
+#ifdef _LIBC
+  if (posixly_correct == NULL
+      && argc == original_argc && argv == original_argv)
+    {
+      if (nonoption_flags_max_len == 0)
+	{
+	  if (__getopt_nonoption_flags == NULL
+	      || __getopt_nonoption_flags[0] == '\0')
+	    nonoption_flags_max_len = -1;
+	  else
+	    {
+	      const char *orig_str = __getopt_nonoption_flags;
+	      int len = nonoption_flags_max_len = strlen (orig_str);
+	      if (nonoption_flags_max_len < argc)
+		nonoption_flags_max_len = argc;
+	      __getopt_nonoption_flags =
+		(char *) malloc (nonoption_flags_max_len);
+	      if (__getopt_nonoption_flags == NULL)
+		nonoption_flags_max_len = -1;
+	      else
+		memset (__mempcpy (__getopt_nonoption_flags, orig_str, len),
+			'\0', nonoption_flags_max_len - len);
+	    }
+	}
+      nonoption_flags_len = nonoption_flags_max_len;
+    }
+  else
+    nonoption_flags_len = 0;
+#endif
+
+  return optstring;
+}
+
+/* Scan elements of ARGV (whose length is ARGC) for option characters
+   given in OPTSTRING.
+
+   If an element of ARGV starts with '-', and is not exactly "-" or "--",
+   then it is an option element.  The characters of this element
+   (aside from the initial '-') are option characters.  If `getopt'
+   is called repeatedly, it returns successively each of the option characters
+   from each of the option elements.
+
+   If `getopt' finds another option character, it returns that character,
+   updating `optind' and `nextchar' so that the next call to `getopt' can
+   resume the scan with the following option character or ARGV-element.
+
+   If there are no more option characters, `getopt' returns -1.
+   Then `optind' is the index in ARGV of the first ARGV-element
+   that is not an option.  (The ARGV-elements have been permuted
+   so that those that are not options now come last.)
+
+   OPTSTRING is a string containing the legitimate option characters.
+   If an option character is seen that is not listed in OPTSTRING,
+   return '?' after printing an error message.  If you set `opterr' to
+   zero, the error message is suppressed but we still return '?'.
+
+   If a char in OPTSTRING is followed by a colon, that means it wants an arg,
+   so the following text in the same ARGV-element, or the text of the following
+   ARGV-element, is returned in `optarg'.  Two colons mean an option that
+   wants an optional arg; if there is text in the current ARGV-element,
+   it is returned in `optarg', otherwise `optarg' is set to zero.
+
+   If OPTSTRING starts with `-' or `+', it requests different methods of
+   handling the non-option ARGV-elements.
+   See the comments about RETURN_IN_ORDER and REQUIRE_ORDER, above.
+
+   Long-named options begin with `--' instead of `-'.
+   Their names may be abbreviated as long as the abbreviation is unique
+   or is an exact match for some defined option.  If they have an
+   argument, it follows the option name in the same ARGV-element, separated
+   from the option name by a `=', or else the in next ARGV-element.
+   When `getopt' finds a long-named option, it returns 0 if that option's
+   `flag' field is nonzero, the value of the option's `val' field
+   if the `flag' field is zero.
+
+   The elements of ARGV aren't really const, because we permute them.
+   But we pretend they're const in the prototype to be compatible
+   with other systems.
+
+   LONGOPTS is a vector of `struct option' terminated by an
+   element containing a name which is zero.
+
+   LONGIND returns the index in LONGOPT of the long-named option found.
+   It is only valid when a long-named option has been found by the most
+   recent call.
+
+   If LONG_ONLY is nonzero, '-' as well as '--' can introduce
+   long-named options.  */
+
+#if 0
+int
+_getopt_internal (argc, argv, optstring, longopts, longind, long_only)
+     int argc;
+     char *const *argv;
+     const char *optstring;
+     const struct option *longopts;
+     int *longind;
+     int long_only;
+#endif
+int
+_getopt_internal (int argc,
+	char *const *argv,
+	const char *optstring,
+	const struct option *longopts,
+	int *longind,
+	int long_only)
+{
+  optarg = NULL;
+
+  if (optind == 0 || !__getopt_initialized)
+    {
+      if (optind == 0)
+	optind = 1;	/* Don't scan ARGV[0], the program name.  */
+      optstring = _getopt_initialize (argc, argv, optstring);
+      __getopt_initialized = 1;
+    }
+
+  /* Test whether ARGV[optind] points to a non-option argument.
+     Either it does not have option syntax, or there is an environment flag
+     from the shell indicating it is not an option.  The later information
+     is only used when the used in the GNU libc.  */
+#ifdef _LIBC
+# define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0'	      \
+		      || (optind < nonoption_flags_len			      \
+			  && __getopt_nonoption_flags[optind] == '1'))
+#else
+# define NONOPTION_P (argv[optind][0] != '-' || argv[optind][1] == '\0')
+#endif
+
+  if (nextchar == NULL || *nextchar == '\0')
+    {
+      /* Advance to the next ARGV-element.  */
+
+      /* Give FIRST_NONOPT & LAST_NONOPT rational values if OPTIND has been
+	 moved back by the user (who may also have changed the arguments).  */
+      if (last_nonopt > optind)
+	last_nonopt = optind;
+      if (first_nonopt > optind)
+	first_nonopt = optind;
+
+      if (ordering == PERMUTE)
+	{
+	  /* If we have just processed some options following some non-options,
+	     exchange them so that the options come first.  */
+
+	  if (first_nonopt != last_nonopt && last_nonopt != optind)
+	    exchange ((char **) argv);
+	  else if (last_nonopt != optind)
+	    first_nonopt = optind;
+
+	  /* Skip any additional non-options
+	     and extend the range of non-options previously skipped.  */
+
+	  while (optind < argc && NONOPTION_P)
+	    optind++;
+	  last_nonopt = optind;
+	}
+
+      /* The special ARGV-element `--' means premature end of options.
+	 Skip it like a null option,
+	 then exchange with previous non-options as if it were an option,
+	 then skip everything else like a non-option.  */
+
+      if (optind != argc && !strcmp (argv[optind], "--"))
+	{
+	  optind++;
+
+	  if (first_nonopt != last_nonopt && last_nonopt != optind)
+	    exchange ((char **) argv);
+	  else if (first_nonopt == last_nonopt)
+	    first_nonopt = optind;
+	  last_nonopt = argc;
+
+	  optind = argc;
+	}
+
+      /* If we have done all the ARGV-elements, stop the scan
+	 and back over any non-options that we skipped and permuted.  */
+
+      if (optind == argc)
+	{
+	  /* Set the next-arg-index to point at the non-options
+	     that we previously skipped, so the caller will digest them.  */
+	  if (first_nonopt != last_nonopt)
+	    optind = first_nonopt;
+	  return -1;
+	}
+
+      /* If we have come to a non-option and did not permute it,
+	 either stop the scan or describe it to the caller and pass it by.  */
+
+      if (NONOPTION_P)
+	{
+	  if (ordering == REQUIRE_ORDER)
+	    return -1;
+	  optarg = argv[optind++];
+	  return 1;
+	}
+
+      /* We have found another option-ARGV-element.
+	 Skip the initial punctuation.  */
+
+      nextchar = (argv[optind] + 1
+		  + (longopts != NULL && argv[optind][1] == '-'));
+    }
+
+  /* Decode the current option-ARGV-element.  */
+
+  /* Check whether the ARGV-element is a long option.
+
+     If long_only and the ARGV-element has the form "-f", where f is
+     a valid short option, don't consider it an abbreviated form of
+     a long option that starts with f.  Otherwise there would be no
+     way to give the -f short option.
+
+     On the other hand, if there's a long option "fubar" and
+     the ARGV-element is "-fu", do consider that an abbreviation of
+     the long option, just like "--fu", and not "-f" with arg "u".
+
+     This distinction seems to be the most useful approach.  */
+
+  if (longopts != NULL
+      && (argv[optind][1] == '-'
+	  || (long_only && (argv[optind][2] || !my_index (optstring, argv[optind][1])))))
+    {
+      char *nameend;
+      const struct option *p;
+      const struct option *pfound = NULL;
+      int exact = 0;
+      int ambig = 0;
+      int indfound = -1;
+      int option_index;
+
+      for (nameend = nextchar; *nameend && *nameend != '='; nameend++)
+	/* Do nothing.  */ ;
+
+      /* Test all long options for either exact match
+	 or abbreviated matches.  */
+      for (p = longopts, option_index = 0; p->name; p++, option_index++)
+	if (!strncmp (p->name, nextchar, nameend - nextchar))
+	  {
+	    if ((unsigned int) (nameend - nextchar)
+		== (unsigned int) strlen (p->name))
+	      {
+		/* Exact match found.  */
+		pfound = p;
+		indfound = option_index;
+		exact = 1;
+		break;
+	      }
+	    else if (pfound == NULL)
+	      {
+		/* First nonexact match found.  */
+		pfound = p;
+		indfound = option_index;
+	      }
+	    else
+	      /* Second or later nonexact match found.  */
+	      ambig = 1;
+	  }
+
+      if (ambig && !exact)
+	{
+	  if (opterr)
+	    fprintf (stderr, _("%s: option `%s' is ambiguous\n"),
+		     argv[0], argv[optind]);
+	  nextchar += strlen (nextchar);
+	  optind++;
+	  optopt = 0;
+	  return '?';
+	}
+
+      if (pfound != NULL)
+	{
+	  option_index = indfound;
+	  optind++;
+	  if (*nameend)
+	    {
+	      /* Don't test has_arg with >, because some C compilers don't
+		 allow it to be used on enums.  */
+	      if (pfound->has_arg)
+		optarg = nameend + 1;
+	      else
+		{
+		  if (opterr)
+		    {
+		      if (argv[optind - 1][1] == '-')
+			/* --option */
+			fprintf (stderr,
+				 _("%s: option `--%s' doesn't allow an argument\n"),
+				 argv[0], pfound->name);
+		      else
+			/* +option or -option */
+			fprintf (stderr,
+				 _("%s: option `%c%s' doesn't allow an argument\n"),
+				 argv[0], argv[optind - 1][0], pfound->name);
+
+		      nextchar += strlen (nextchar);
+
+		      optopt = pfound->val;
+		      return '?';
+		    }
+		}
+	    }
+	  else if (pfound->has_arg == 1)
+	    {
+	      if (optind < argc)
+		optarg = argv[optind++];
+	      else
+		{
+		  if (opterr)
+		    fprintf (stderr,
+			   _("%s: option `%s' requires an argument\n"),
+			   argv[0], argv[optind - 1]);
+		  nextchar += strlen (nextchar);
+		  optopt = pfound->val;
+		  return optstring[0] == ':' ? ':' : '?';
+		}
+	    }
+	  nextchar += strlen (nextchar);
+	  if (longind != NULL)
+	    *longind = option_index;
+	  if (pfound->flag)
+	    {
+	      *(pfound->flag) = pfound->val;
+	      return 0;
+	    }
+	  return pfound->val;
+	}
+
+      /* Can't find it as a long option.  If this is not getopt_long_only,
+	 or the option starts with '--' or is not a valid short
+	 option, then it's an error.
+	 Otherwise interpret it as a short option.  */
+      if (!long_only || argv[optind][1] == '-'
+	  || my_index (optstring, *nextchar) == NULL)
+	{
+	  if (opterr)
+	    {
+	      if (argv[optind][1] == '-')
+		/* --option */
+		fprintf (stderr, _("%s: unrecognized option `--%s'\n"),
+			 argv[0], nextchar);
+	      else
+		/* +option or -option */
+		fprintf (stderr, _("%s: unrecognized option `%c%s'\n"),
+			 argv[0], argv[optind][0], nextchar);
+	    }
+	  nextchar = (char *) "";
+	  optind++;
+	  optopt = 0;
+	  return '?';
+	}
+    }
+
+  /* Look at and handle the next short option-character.  */
+
+  {
+    char c = *nextchar++;
+    char *temp = my_index (optstring, c);
+
+    /* Increment `optind' when we start to process its last character.  */
+    if (*nextchar == '\0')
+      ++optind;
+
+    if (temp == NULL || c == ':')
+      {
+	if (opterr)
+	  {
+	    if (posixly_correct)
+	      /* 1003.2 specifies the format of this message.  */
+	      fprintf (stderr, _("%s: illegal option -- %c\n"),
+		       argv[0], c);
+	    else
+	      fprintf (stderr, _("%s: invalid option -- %c\n"),
+		       argv[0], c);
+	  }
+	optopt = c;
+	return '?';
+      }
+    /* Convenience. Treat POSIX -W foo same as long option --foo */
+    if (temp[0] == 'W' && temp[1] == ';')
+      {
+	char *nameend;
+	const struct option *p;
+	const struct option *pfound = NULL;
+	int exact = 0;
+	int ambig = 0;
+	int indfound = 0;
+	int option_index;
+
+	/* This is an option that requires an argument.  */
+	if (*nextchar != '\0')
+	  {
+	    optarg = nextchar;
+	    /* If we end this ARGV-element by taking the rest as an arg,
+	       we must advance to the next element now.  */
+	    optind++;
+	  }
+	else if (optind == argc)
+	  {
+	    if (opterr)
+	      {
+		/* 1003.2 specifies the format of this message.  */
+		fprintf (stderr, _("%s: option requires an argument -- %c\n"),
+			 argv[0], c);
+	      }
+	    optopt = c;
+	    if (optstring[0] == ':')
+	      c = ':';
+	    else
+	      c = '?';
+	    return c;
+	  }
+	else
+	  /* We already incremented `optind' once;
+	     increment it again when taking next ARGV-elt as argument.  */
+	  optarg = argv[optind++];
+
+	/* optarg is now the argument, see if it's in the
+	   table of longopts.  */
+
+	for (nextchar = nameend = optarg; *nameend && *nameend != '='; nameend++)
+	  /* Do nothing.  */ ;
+
+	/* Test all long options for either exact match
+	   or abbreviated matches.  */
+	for (p = longopts, option_index = 0; p->name; p++, option_index++)
+	  if (!strncmp (p->name, nextchar, nameend - nextchar))
+	    {
+	      if ((unsigned int) (nameend - nextchar) == strlen (p->name))
+		{
+		  /* Exact match found.  */
+		  pfound = p;
+		  indfound = option_index;
+		  exact = 1;
+		  break;
+		}
+	      else if (pfound == NULL)
+		{
+		  /* First nonexact match found.  */
+		  pfound = p;
+		  indfound = option_index;
+		}
+	      else
+		/* Second or later nonexact match found.  */
+		ambig = 1;
+	    }
+	if (ambig && !exact)
+	  {
+	    if (opterr)
+	      fprintf (stderr, _("%s: option `-W %s' is ambiguous\n"),
+		       argv[0], argv[optind]);
+	    nextchar += strlen (nextchar);
+	    optind++;
+	    return '?';
+	  }
+	if (pfound != NULL)
+	  {
+	    option_index = indfound;
+	    if (*nameend)
+	      {
+		/* Don't test has_arg with >, because some C compilers don't
+		   allow it to be used on enums.  */
+		if (pfound->has_arg)
+		  optarg = nameend + 1;
+		else
+		  {
+		    if (opterr)
+		      fprintf (stderr, _("\
+%s: option `-W %s' doesn't allow an argument\n"),
+			       argv[0], pfound->name);
+
+		    nextchar += strlen (nextchar);
+		    return '?';
+		  }
+	      }
+	    else if (pfound->has_arg == 1)
+	      {
+		if (optind < argc)
+		  optarg = argv[optind++];
+		else
+		  {
+		    if (opterr)
+		      fprintf (stderr,
+			       _("%s: option `%s' requires an argument\n"),
+			       argv[0], argv[optind - 1]);
+		    nextchar += strlen (nextchar);
+		    return optstring[0] == ':' ? ':' : '?';
+		  }
+	      }
+	    nextchar += strlen (nextchar);
+	    if (longind != NULL)
+	      *longind = option_index;
+	    if (pfound->flag)
+	      {
+		*(pfound->flag) = pfound->val;
+		return 0;
+	      }
+	    return pfound->val;
+	  }
+	  nextchar = NULL;
+	  return 'W';	/* Let the application handle it.   */
+      }
+    if (temp[1] == ':')
+      {
+	if (temp[2] == ':')
+	  {
+	    /* This is an option that accepts an argument optionally.  */
+	    if (*nextchar != '\0')
+	      {
+		optarg = nextchar;
+		optind++;
+	      }
+	    else
+	      optarg = NULL;
+	    nextchar = NULL;
+	  }
+	else
+	  {
+	    /* This is an option that requires an argument.  */
+	    if (*nextchar != '\0')
+	      {
+		optarg = nextchar;
+		/* If we end this ARGV-element by taking the rest as an arg,
+		   we must advance to the next element now.  */
+		optind++;
+	      }
+	    else if (optind == argc)
+	      {
+		if (opterr)
+		  {
+		    /* 1003.2 specifies the format of this message.  */
+		    fprintf (stderr,
+			   _("%s: option requires an argument -- %c\n"),
+			   argv[0], c);
+		  }
+		optopt = c;
+		if (optstring[0] == ':')
+		  c = ':';
+		else
+		  c = '?';
+	      }
+	    else
+	      /* We already incremented `optind' once;
+		 increment it again when taking next ARGV-elt as argument.  */
+	      optarg = argv[optind++];
+	    nextchar = NULL;
+	  }
+      }
+    return c;
+  }
+}
+
+/*
+int
+getopt (argc, argv, optstring)
+     int argc;
+     char *const *argv;
+     const char *optstring;
+{
+  return _getopt_internal (argc, argv, optstring,
+			   (const struct option *) 0,
+			   (int *) 0,
+			   0);
+}
+*/
+
+#endif	/* Not ELIDE_CODE.  */
+/* ******************** ...getopt.c ******************** */
+
+
+
+/* Comment out all this code if we are using the GNU C Library, and are not
+   actually compiling the library itself.  This code is part of the GNU C
+   Library, but also included in many other GNU distributions.  Compiling
+   and linking in this code is a waste when using the GNU C library
+   (especially if it is a shared library).  Rather than having every GNU
+   program understand `configure --with-gnu-libc' and omit the object files,
+   it is simpler to just do this in the source for each such file.  */
+
+#define GETOPT_INTERFACE_VERSION 2
+#if !defined _LIBC && defined __GLIBC__ && __GLIBC__ >= 2
+#include <gnu-versions.h>
+#if _GNU_GETOPT_INTERFACE_VERSION == GETOPT_INTERFACE_VERSION
+#define ELIDE_CODE
+#endif
+#endif
+
+#ifndef ELIDE_CODE
+
+
+/* This needs to come after some library #include
+   to get __GNU_LIBRARY__ defined.  */
+#ifdef __GNU_LIBRARY__
+#include <stdlib.h>
+#endif
+
+#ifndef	NULL
+#define NULL 0
+#endif
+
+/* K&R declarations!?  C'mon... */
+/* Just say no to all this gymnastics */
+#if 0
+int
+getopt_long (argc, argv, options, long_options, opt_index)
+     int argc;
+     char *const *argv;
+     const char *options;
+     const struct option *long_options;
+     int *opt_index;
+#endif
+int getopt_long (int argc,
+	char *const *argv,
+	const char *options,
+	const struct option *long_options,
+	int *opt_index)
+{
+  return _getopt_internal (argc, argv, options, long_options, opt_index, 0);
+}
+
+/* Like getopt_long, but '-' as well as '--' can indicate a long option.
+   If an option that starts with '-' (not '--') doesn't match a long option,
+   but does match a short option, it is parsed as a short option
+   instead.  */
+
+#if 0
+int
+getopt_long_only (argc, argv, options, long_options, opt_index)
+     int argc;
+     char *const *argv;
+     const char *options;
+     const struct option *long_options;
+     int *opt_index;
+#endif
+int
+getopt_long_only (int argc,
+	char *const *argv,
+	const char *options,
+	const struct option *long_options,
+	int *opt_index)
+{
+  return _getopt_internal (argc, argv, options, long_options, opt_index, 1);
+}
+
+
+#endif	/* Not ELIDE_CODE.  */
+
+#ifdef TEST
+
+#include <stdio.h>
+
+int
+main (argc, argv)
+     int argc;
+     char **argv;
+{
+  int c;
+  int digit_optind = 0;
+
+  while (1)
+    {
+      int this_option_optind = optind ? optind : 1;
+      int option_index = 0;
+      static struct option long_options[] =
+      {
+	{"add", 1, 0, 0},
+	{"append", 0, 0, 0},
+	{"delete", 1, 0, 0},
+	{"verbose", 0, 0, 0},
+	{"create", 0, 0, 0},
+	{"file", 1, 0, 0},
+	{0, 0, 0, 0}
+      };
+
+      c = getopt_long (argc, argv, "abc:d:0123456789",
+		       long_options, &option_index);
+      if (c == -1)
+	break;
+
+      switch (c)
+	{
+	case 0:
+	  printf ("option %s", long_options[option_index].name);
+	  if (optarg)
+	    printf (" with arg %s", optarg);
+	  printf ("\n");
+	  break;
+
+	case '0':
+	case '1':
+	case '2':
+	case '3':
+	case '4':
+	case '5':
+	case '6':
+	case '7':
+	case '8':
+	case '9':
+	  if (digit_optind != 0 && digit_optind != this_option_optind)
+	    printf ("digits occur in two different argv-elements.\n");
+	  digit_optind = this_option_optind;
+	  printf ("option %c\n", c);
+	  break;
+
+	case 'a':
+	  printf ("option a\n");
+	  break;
+
+	case 'b':
+	  printf ("option b\n");
+	  break;
+
+	case 'c':
+	  printf ("option c with value `%s'\n", optarg);
+	  break;
+
+	case 'd':
+	  printf ("option d with value `%s'\n", optarg);
+	  break;
+
+	case '?':
+	  break;
+
+	default:
+	  printf ("?? getopt returned character code 0%o ??\n", c);
+	}
+    }
+
+  if (optind < argc)
+    {
+      printf ("non-option ARGV-elements: ");
+      while (optind < argc)
+	printf ("%s ", argv[optind++]);
+      printf ("\n");
+    }
+
+  exit (0);
+}
+
+#endif /* TEST */
+
+#endif /* #ifndef HAVE_GETOPT_LONG */
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/getopt_long.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/getopt_long.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/getopt_long.h	(revision 70339)
@@ -0,0 +1,175 @@
+/* Declarations for getopt.
+   Copyright 1989, 1990, 1991, 1992, 1993, 1994, 1996, 1997, 1998, 2000
+   Free Software Foundation, Inc.
+
+   NOTE: The canonical source of this file is maintained with the GNU C Library.
+   Bugs can be reported to bug-glibc@gnu.org.
+
+   This program is free software; you can redistribute it and/or modify it
+   under the terms of the GNU General Public License as published by the
+   Free Software Foundation; either version 2, or (at your option) any
+   later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
+   USA.  */
+
+#ifndef _GETOPT_LONG_H
+#define _GETOPT_LONG_H 1
+
+#include <apertium_config.h>
+
+#if HAVE_UNISTD_H
+/* Declares getopt, if present */
+#include <unistd.h>
+#endif
+
+#ifdef	__cplusplus
+extern "C" {
+#endif
+
+/* We're building this with a C++ compiler, essentially.  Such
+   compilers are not required to define __STDC__, but the path we
+   should follow, below, is indeed that marked by __STDC__.  We don't
+   want to force a definition of __STDC__ (though that works), because
+   (a) that feels bad, and (b) some compilers perfectly reasonable
+   complain bitterly about it.  So define THIS_IS__STDC__, and replace
+   occurrences of __STDC__ throughout with that.
+
+   That means that all of the occurrences of THIS_IS__STDC__ in this
+   file and in getopt_long.c are redundant, but I'm leaving them here
+   in case it becomes necessary to do cleverer things with it than
+   simply define it to be 1, and also as a sort of warped documentation. */
+#define THIS_IS__STDC__ 1
+
+#if !HAVE_DECL_GETOPT
+/* For communication from `getopt' to the caller.
+   When `getopt' finds an option that takes an argument,
+   the argument value is returned here.
+   Also, when `ordering' is RETURN_IN_ORDER,
+   each non-option ARGV-element is returned here.  */
+
+extern char *optarg;
+
+/* Index in ARGV of the next element to be scanned.
+   This is used for communication to and from the caller
+   and for communication between successive calls to `getopt'.
+
+   On entry to `getopt', zero means this is the first call; initialize.
+
+   When `getopt' returns -1, this is the index of the first of the
+   non-option elements that the caller should itself scan.
+
+   Otherwise, `optind' communicates from one call to the next
+   how much of ARGV has been scanned so far.  */
+
+extern int optind;
+
+/* Callers store zero here to inhibit the error message `getopt' prints
+   for unrecognized options.  */
+
+extern int opterr;
+
+/* Set to an option character which was unrecognized.  */
+
+extern int optopt;
+
+#endif /* ifndef HAVE_DECL_GETOPT */
+
+#if !HAVE_DECL_GETOPT_LONG
+/* Describe the long-named options requested by the application.
+   The LONG_OPTIONS argument to getopt_long or getopt_long_only is a vector
+   of `struct option' terminated by an element containing a name which is
+   zero.
+
+   The field `has_arg' is:
+   no_argument		(or 0) if the option does not take an argument,
+   required_argument	(or 1) if the option requires an argument,
+   optional_argument 	(or 2) if the option takes an optional argument.
+
+   If the field `flag' is not NULL, it points to a variable that is set
+   to the value given in the field `val' when the option is found, but
+   left unchanged if the option is not found.
+
+   To have a long-named option do something other than set an `int' to
+   a compiled-in constant, such as set a value from `optarg', set the
+   option's `flag' field to zero and its `val' field to a nonzero
+   value (the equivalent single-letter option character, if there is
+   one).  For long options that have a zero `flag' field, `getopt'
+   returns the contents of the `val' field.  */
+
+struct option
+{
+#if defined (THIS_IS__STDC__) && THIS_IS__STDC__
+  const char *name;
+#else
+  char *name;
+#endif
+  /* has_arg can't be an enum because some compilers complain about
+     type mismatches in all the code that assumes it is an int.  */
+  int has_arg;
+  int *flag;
+  int val;
+};
+
+/* Names for the values of the `has_arg' field of `struct option'.  */
+
+#define	no_argument		0
+#define required_argument	1
+#define optional_argument	2
+
+#endif /* #if !HAVE_DECL_GETOPT_LONG */
+
+#if defined (THIS_IS__STDC__) && THIS_IS__STDC__
+/* HAVE_DECL_* is a three-state macro: undefined, 0 or 1.  If it is
+   undefined, we haven't run the autoconf check so provide the
+   declaration without arguments.  If it is 0, we checked and failed
+   to find the declaration so provide a fully prototyped one.  If it
+   is 1, we found it so don't provide any declaration at all.  */
+#if defined (__GNU_LIBRARY__) || (defined (HAVE_DECL_GETOPT) && !HAVE_DECL_GETOPT)
+/* Many other libraries have conflicting prototypes for getopt, with
+   differences in the consts, in stdlib.h.  To avoid compilation
+   errors, only prototype getopt for the GNU C library.  */
+extern int getopt (int argc, char *const *argv, const char *shortopts);
+#else /* not __GNU_LIBRARY__ */
+# if !defined (HAVE_DECL_GETOPT)
+extern int getopt ();
+# endif
+#endif /* __GNU_LIBRARY__ */
+#if !HAVE_DECL_GETOPT_LONG
+extern int getopt_long (int argc, char *const *argv, const char *shortopts,
+		        const struct option *longopts, int *longind);
+extern int getopt_long_only (int argc, char *const *argv,
+			     const char *shortopts,
+		             const struct option *longopts, int *longind);
+
+/* Internal only.  Users should not call this directly.  */
+extern int _getopt_internal (int argc, char *const *argv,
+			     const char *shortopts,
+		             const struct option *longopts, int *longind,
+			     int long_only);
+#endif /* HAVE_DECL_GETOPT_LONG */
+#else /* not THIS_IS__STDC__ */
+#if !HAVE_DECL_GETOPT
+extern int getopt ();
+#endif /* HAVE_DECL_GETOPT */
+#if !HAVE_DECL_GETOPT_LONG
+extern int getopt_long ();
+extern int getopt_long_only ();
+
+extern int _getopt_internal ();
+#endif /* HAVE_DECL_GETOPT_LONG */
+#endif /* THIS_IS__STDC__ */
+
+
+#ifdef	__cplusplus
+}
+#endif
+
+#endif /* getopt.h */
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/unistd.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/unistd.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/unistd.h	(revision 70339)
@@ -0,0 +1,13 @@
+// This should really be defined elsewhere
+#define YY_INPUT(buf,result,max_size) \
+	if ( (result = fread( (char *) buf, 1, max_size, yyin )) < 0 ) \
+		YY_FATAL_ERROR( "input in flex scanner failed" );
+
+#define fileno _fileno
+
+#if defined(_WIN32) && defined(isatty)
+#undef isatty
+#define isatty _isatty
+#endif
+
+#define unlink _unlink
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/snprintf.c
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/snprintf.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/snprintf.c	(revision 70339)
@@ -0,0 +1,1025 @@
+/*
+ * snprintf.c - a portable implementation of snprintf
+ *
+ * AUTHOR
+ *   Mark Martinec <mark.martinec@ijs.si>, April 1999.
+ *
+ *   Copyright 1999, Mark Martinec. All rights reserved.
+ *
+ * TERMS AND CONDITIONS
+ *   This program is free software; you can redistribute it and/or modify
+ *   it under the terms of the "Frontier Artistic License" which comes
+ *   with this Kit.
+ *
+ *   This program is distributed in the hope that it will be useful,
+ *   but WITHOUT ANY WARRANTY; without even the implied warranty
+ *   of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ *   See the Frontier Artistic License for more details.
+ *
+ *   You should have received a copy of the Frontier Artistic License
+ *   with this Kit in the file named LICENSE.txt .
+ *   If not, I'll be glad to provide one.
+ *
+ * FEATURES
+ * - careful adherence to specs regarding flags, field width and precision;
+ * - good performance for large string handling (large format, large
+ *   argument or large paddings). Performance is similar to system's sprintf
+ *   and in several cases significantly better (make sure you compile with
+ *   optimizations turned on, tell the compiler the code is strict ANSI
+ *   if necessary to give it more freedom for optimizations);
+ * - return value semantics per ISO/IEC 9899:1999 ("ISO C99");
+ * - written in standard ISO/ANSI C - requires an ANSI C compiler.
+ *
+ * SUPPORTED CONVERSION SPECIFIERS AND DATA TYPES
+ *
+ * This snprintf only supports the following conversion specifiers:
+ * s, c, d, u, o, x, X, p  (and synonyms: i, D, U, O - see below)
+ * with flags: '-', '+', ' ', '0' and '#'.
+ * An asterisk is supported for field width as well as precision.
+ *
+ * Length modifiers 'h' (short int), 'l' (long int),
+ * and 'll' (long long int) are supported.
+ * NOTE:
+ *   If macro SNPRINTF_LONGLONG_SUPPORT is not defined (default) the
+ *   length modifier 'll' is recognized but treated the same as 'l',
+ *   which may cause argument value truncation! Defining
+ *   SNPRINTF_LONGLONG_SUPPORT requires that your system's sprintf also
+ *   handles length modifier 'll'.  long long int is a language extension
+ *   which may not be portable.
+ *
+ * Conversion of numeric data (conversion specifiers d, u, o, x, X, p)
+ * with length modifiers (none or h, l, ll) is left to the system routine
+ * sprintf, but all handling of flags, field width and precision as well as
+ * c and s conversions is done very carefully by this portable routine.
+ * If a string precision (truncation) is specified (e.g. %.8s) it is
+ * guaranteed the string beyond the specified precision will not be referenced.
+ *
+ * Length modifiers h, l and ll are ignored for c and s conversions (data
+ * types wint_t and wchar_t are not supported).
+ *
+ * The following common synonyms for conversion characters are supported:
+ *   - i is a synonym for d
+ *   - D is a synonym for ld, explicit length modifiers are ignored
+ *   - U is a synonym for lu, explicit length modifiers are ignored
+ *   - O is a synonym for lo, explicit length modifiers are ignored
+ * The D, O and U conversion characters are nonstandard, they are supported
+ * for backward compatibility only, and should not be used for new code.
+ *
+ * The following is specifically NOT supported:
+ *   - flag ' (thousands' grouping character) is recognized but ignored
+ *   - numeric conversion specifiers: f, e, E, g, G and synonym F,
+ *     as well as the new a and A conversion specifiers
+ *   - length modifier 'L' (long double) and 'q' (quad - use 'll' instead)
+ *   - wide character/string conversions: lc, ls, and nonstandard
+ *     synonyms C and S
+ *   - writeback of converted string length: conversion character n
+ *   - the n$ specification for direct reference to n-th argument
+ *   - locales
+ *
+ * It is permitted for str_m to be zero, and it is permitted to specify NULL
+ * pointer for resulting string argument if str_m is zero (as per ISO C99).
+ *
+ * The return value is the number of characters which would be generated
+ * for the given input, excluding the trailing null. If this value
+ * is greater or equal to str_m, not all characters from the result
+ * have been stored in str, output bytes beyond the (str_m-1) -th character
+ * are discarded. If str_m is greater than zero it is guaranteed
+ * the resulting string will be null-terminated.
+ *
+ * NOTE that this matches the ISO C99, OpenBSD, and GNU C library 2.1,
+ * but is different from some older and vendor implementations,
+ * and is also different from XPG, XSH5, SUSv2 specifications.
+ * For historical discussion on changes in the semantics and standards
+ * of snprintf see printf(3) man page in the Linux programmers manual.
+ *
+ * Routines asprintf and vasprintf return a pointer (in the ptr argument)
+ * to a buffer sufficiently large to hold the resulting string. This pointer
+ * should be passed to free(3) to release the allocated storage when it is
+ * no longer needed. If sufficient space cannot be allocated, these functions
+ * will return -1 and set ptr to be a NULL pointer. These two routines are a
+ * GNU C library extensions (glibc).
+ *
+ * Routines asnprintf and vasnprintf are similar to asprintf and vasprintf,
+ * yet, like snprintf and vsnprintf counterparts, will write at most str_m-1
+ * characters into the allocated output string, the last character in the
+ * allocated buffer then gets the terminating null. If the formatted string
+ * length (the return value) is greater than or equal to the str_m argument,
+ * the resulting string was truncated and some of the formatted characters
+ * were discarded. These routines present a handy way to limit the amount
+ * of allocated memory to some sane value.
+ *
+ * AVAILABILITY
+ *   http://www.ijs.si/software/snprintf/
+ *
+ * REVISION HISTORY
+ * 1999-04	V0.9  Mark Martinec
+ *		- initial version, some modifications after comparing printf
+ *		  man pages for Digital Unix 4.0, Solaris 2.6 and HPUX 10,
+ *		  and checking how Perl handles sprintf (differently!);
+ * 1999-04-09	V1.0  Mark Martinec <mark.martinec@ijs.si>
+ *		- added main test program, fixed remaining inconsistencies,
+ *		  added optional (long long int) support;
+ * 1999-04-12	V1.1  Mark Martinec <mark.martinec@ijs.si>
+ *		- support the 'p' conversion (pointer to void);
+ *		- if a string precision is specified
+ *		  make sure the string beyond the specified precision
+ *		  will not be referenced (e.g. by strlen);
+ * 1999-04-13	V1.2  Mark Martinec <mark.martinec@ijs.si>
+ *		- support synonyms %D=%ld, %U=%lu, %O=%lo;
+ *		- speed up the case of long format string with few conversions;
+ * 1999-06-30	V1.3  Mark Martinec <mark.martinec@ijs.si>
+ *		- fixed runaway loop (eventually crashing when str_l wraps
+ *		  beyond 2^31) while copying format string without
+ *		  conversion specifiers to a buffer that is too short
+ *		  (thanks to Edwin Young <edwiny@autonomy.com> for
+ *		  spotting the problem);
+ *		- added macros PORTABLE_SNPRINTF_VERSION_(MAJOR|MINOR)
+ *		  to snprintf.h
+ * 2000-02-14	V2.0 (never released) Mark Martinec <mark.martinec@ijs.si>
+ *		- relaxed license terms: The Artistic License now applies.
+ *		  You may still apply the GNU GENERAL PUBLIC LICENSE
+ *		  as was distributed with previous versions, if you prefer;
+ *		- changed REVISION HISTORY dates to use ISO 8601 date format;
+ *		- added vsnprintf (patch also independently proposed by
+ *		  Caolan McNamara 2000-05-04, and Keith M Willenson 2000-06-01)
+ * 2000-06-27	V2.1  Mark Martinec <mark.martinec@ijs.si>
+ *		- removed POSIX check for str_m<1; value 0 for str_m is
+ *		  allowed by ISO C99 (and GNU C library 2.1) - (pointed out
+ *		  on 2000-05-04 by Caolan McNamara, caolan@ csn dot ul dot ie).
+ *		  Besides relaxed license this change in standards adherence
+ *		  is the main reason to bump up the major version number;
+ *		- added nonstandard routines asnprintf, vasnprintf, asprintf,
+ *		  vasprintf that dynamically allocate storage for the
+ *		  resulting string; these routines are not compiled by default,
+ *		  see comments where NEED_V?ASN?PRINTF macros are defined;
+ *		- autoconf contributed by Caolan McNamara
+ * 2000-10-06	V2.2  Mark Martinec <mark.martinec@ijs.si>
+ *		- BUG FIX: the %c conversion used a temporary variable
+ *		  that was no longer in scope when referenced,
+ *		  possibly causing incorrect resulting character;
+ *		- BUG FIX: make precision and minimal field width unsigned
+ *		  to handle huge values (2^31 <= n < 2^32) correctly;
+ *		  also be more careful in the use of signed/unsigned/size_t
+ *		  internal variables - probably more careful than many
+ *		  vendor implementations, but there may still be a case
+ *		  where huge values of str_m, precision or minimal field
+ *		  could cause incorrect behaviour;
+ *		- use separate variables for signed/unsigned arguments,
+ *		  and for short/int, long, and long long argument lengths
+ *		  to avoid possible incompatibilities on certain
+ *		  computer architectures. Also use separate variable
+ *		  arg_sign to hold sign of a numeric argument,
+ *		  to make code more transparent;
+ *		- some fiddling with zero padding and "0x" to make it
+ *		  Linux compatible;
+ *		- systematically use macros fast_memcpy and fast_memset
+ *		  instead of case-by-case hand optimization; determine some
+ *		  breakeven string lengths for different architectures;
+ *		- terminology change: 'format' -> 'conversion specifier',
+ *		  'C9x' -> 'ISO/IEC 9899:1999 ("ISO C99")',
+ *		  'alternative form' -> 'alternate form',
+ *		  'data type modifier' -> 'length modifier';
+ *		- several comments rephrased and new ones added;
+ *		- make compiler not complain about 'credits' defined but
+ *		  not used;
+ */
+
+
+/* Define HAVE_SNPRINTF if your system already has snprintf and vsnprintf.
+ *
+ * If HAVE_SNPRINTF is defined this module will not produce code for
+ * snprintf and vsnprintf, unless PREFER_PORTABLE_SNPRINTF is defined as well,
+ * causing this portable version of snprintf to be called portable_snprintf
+ * (and portable_vsnprintf).
+ */
+/* #define HAVE_SNPRINTF */
+
+/* Define PREFER_PORTABLE_SNPRINTF if your system does have snprintf and
+ * vsnprintf but you would prefer to use the portable routine(s) instead.
+ * In this case the portable routine is declared as portable_snprintf
+ * (and portable_vsnprintf) and a macro 'snprintf' (and 'vsnprintf')
+ * is defined to expand to 'portable_v?snprintf' - see file snprintf.h .
+ * Defining this macro is only useful if HAVE_SNPRINTF is also defined,
+ * but does does no harm if defined nevertheless.
+ */
+/* #define PREFER_PORTABLE_SNPRINTF */
+
+/* Define SNPRINTF_LONGLONG_SUPPORT if you want to support
+ * data type (long long int) and length modifier 'll' (e.g. %lld).
+ * If undefined, 'll' is recognized but treated as a single 'l'.
+ *
+ * If the system's sprintf does not handle 'll'
+ * the SNPRINTF_LONGLONG_SUPPORT must not be defined!
+ *
+ * This is off by default as (long long int) is a language extension.
+ */
+/* #define SNPRINTF_LONGLONG_SUPPORT */
+
+/* Define NEED_SNPRINTF_ONLY if you only need snprintf, and not vsnprintf.
+ * If NEED_SNPRINTF_ONLY is defined, the snprintf will be defined directly,
+ * otherwise both snprintf and vsnprintf routines will be defined
+ * and snprintf will be a simple wrapper around vsnprintf, at the expense
+ * of an extra procedure call.
+ */
+/* #define NEED_SNPRINTF_ONLY */
+
+/* Define NEED_V?ASN?PRINTF macros if you need library extension
+ * routines asprintf, vasprintf, asnprintf, vasnprintf respectively,
+ * and your system library does not provide them. They are all small
+ * wrapper routines around portable_vsnprintf. Defining any of the four
+ * NEED_V?ASN?PRINTF macros automatically turns off NEED_SNPRINTF_ONLY
+ * and turns on PREFER_PORTABLE_SNPRINTF.
+ *
+ * Watch for name conflicts with the system library if these routines
+ * are already present there.
+ *
+ * NOTE: vasprintf and vasnprintf routines need va_copy() from stdarg.h, as
+ * specified by C99, to be able to traverse the same list of arguments twice.
+ * I don't know of any other standard and portable way of achieving the same.
+ * With some versions of gcc you may use __va_copy(). You might even get away
+ * with "ap2 = ap", in this case you must not call va_end(ap2) !
+ *   #define va_copy(ap2,ap) ap2 = ap
+ */
+/* #define NEED_ASPRINTF   */
+/* #define NEED_ASNPRINTF  */
+/* #define NEED_VASPRINTF  */
+/* #define NEED_VASNPRINTF */
+
+
+/* Define the following macros if desired:
+ *   SOLARIS_COMPATIBLE, SOLARIS_BUG_COMPATIBLE,
+ *   HPUX_COMPATIBLE, HPUX_BUG_COMPATIBLE, LINUX_COMPATIBLE,
+ *   DIGITAL_UNIX_COMPATIBLE, DIGITAL_UNIX_BUG_COMPATIBLE,
+ *   PERL_COMPATIBLE, PERL_BUG_COMPATIBLE,
+ *
+ * - For portable applications it is best not to rely on peculiarities
+ *   of a given implementation so it may be best not to define any
+ *   of the macros that select compatibility and to avoid features
+ *   that vary among the systems.
+ *
+ * - Selecting compatibility with more than one operating system
+ *   is not strictly forbidden but is not recommended.
+ *
+ * - 'x'_BUG_COMPATIBLE implies 'x'_COMPATIBLE .
+ *
+ * - 'x'_COMPATIBLE refers to (and enables) a behaviour that is
+ *   documented in a sprintf man page on a given operating system
+ *   and actually adhered to by the system's sprintf (but not on
+ *   most other operating systems). It may also refer to and enable
+ *   a behaviour that is declared 'undefined' or 'implementation specific'
+ *   in the man page but a given implementation behaves predictably
+ *   in a certain way.
+ *
+ * - 'x'_BUG_COMPATIBLE refers to (and enables) a behaviour of system's sprintf
+ *   that contradicts the sprintf man page on the same operating system.
+ *
+ * - I do not claim that the 'x'_COMPATIBLE and 'x'_BUG_COMPATIBLE
+ *   conditionals take into account all idiosyncrasies of a particular
+ *   implementation, there may be other incompatibilities.
+ */
+
+
+
+/* ============================================= */
+/* NO USER SERVICABLE PARTS FOLLOWING THIS POINT */
+/* ============================================= */
+
+#define PORTABLE_SNPRINTF_VERSION_MAJOR 2
+#define PORTABLE_SNPRINTF_VERSION_MINOR 2
+
+#if defined(NEED_ASPRINTF) || defined(NEED_ASNPRINTF) || defined(NEED_VASPRINTF) || defined(NEED_VASNPRINTF)
+# if defined(NEED_SNPRINTF_ONLY)
+# undef NEED_SNPRINTF_ONLY
+# endif
+# if !defined(PREFER_PORTABLE_SNPRINTF)
+# define PREFER_PORTABLE_SNPRINTF
+# endif
+#endif
+
+#if defined(SOLARIS_BUG_COMPATIBLE) && !defined(SOLARIS_COMPATIBLE)
+#define SOLARIS_COMPATIBLE
+#endif
+
+#if defined(HPUX_BUG_COMPATIBLE) && !defined(HPUX_COMPATIBLE)
+#define HPUX_COMPATIBLE
+#endif
+
+#if defined(DIGITAL_UNIX_BUG_COMPATIBLE) && !defined(DIGITAL_UNIX_COMPATIBLE)
+#define DIGITAL_UNIX_COMPATIBLE
+#endif
+
+#if defined(PERL_BUG_COMPATIBLE) && !defined(PERL_COMPATIBLE)
+#define PERL_COMPATIBLE
+#endif
+
+#if defined(LINUX_BUG_COMPATIBLE) && !defined(LINUX_COMPATIBLE)
+#define LINUX_COMPATIBLE
+#endif
+
+#include <sys/types.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stdio.h>
+#include <stdarg.h>
+#include <assert.h>
+#include <errno.h>
+
+#ifdef isdigit
+#undef isdigit
+#endif
+#define isdigit(c) ((c) >= '0' && (c) <= '9')
+
+/* For copying strings longer or equal to 'breakeven_point'
+ * it is more efficient to call memcpy() than to do it inline.
+ * The value depends mostly on the processor architecture,
+ * but also on the compiler and its optimization capabilities.
+ * The value is not critical, some small value greater than zero
+ * will be just fine if you don't care to squeeze every drop
+ * of performance out of the code.
+ *
+ * Small values favor memcpy, large values favor inline code.
+ */
+#if defined(__alpha__) || defined(__alpha)
+#  define breakeven_point   2	/* AXP (DEC Alpha)     - gcc or cc or egcs */
+#endif
+#if defined(__i386__)  || defined(__i386)
+#  define breakeven_point  12	/* Intel Pentium/Linux - gcc 2.96 */
+#endif
+#if defined(__hppa)
+#  define breakeven_point  10	/* HP-PA               - gcc */
+#endif
+#if defined(__sparc__) || defined(__sparc)
+#  define breakeven_point  33	/* Sun Sparc 5         - gcc 2.8.1 */
+#endif
+
+/* some other values of possible interest: */
+/* #define breakeven_point  8 */  /* VAX 4000          - vaxc */
+/* #define breakeven_point 19 */  /* VAX 4000          - gcc 2.7.0 */
+
+#ifndef breakeven_point
+#  define breakeven_point   6	/* some reasonable one-size-fits-all value */
+#endif
+
+#define fast_memcpy(d,s,n) \
+  { register size_t nn = (size_t)(n); \
+    if (nn >= breakeven_point) memcpy((d), (s), nn); \
+    else if (nn > 0) { /* proc call overhead is worth only for large strings*/\
+      register char *dd; register const char *ss; \
+      for (ss=(s), dd=(d); nn>0; nn--) *dd++ = *ss++; } }
+
+#define fast_memset(d,c,n) \
+  { register size_t nn = (size_t)(n); \
+    if (nn >= breakeven_point) memset((d), (int)(c), nn); \
+    else if (nn > 0) { /* proc call overhead is worth only for large strings*/\
+      register char *dd; register const int cc=(int)(c); \
+      for (dd=(d); nn>0; nn--) *dd++ = cc; } }
+
+/* prototypes */
+
+#if defined(NEED_ASPRINTF)
+int asprintf   (char **ptr, const char *fmt, /*args*/ ...);
+#endif
+#if defined(NEED_VASPRINTF)
+int vasprintf  (char **ptr, const char *fmt, va_list ap);
+#endif
+#if defined(NEED_ASNPRINTF)
+int asnprintf  (char **ptr, size_t str_m, const char *fmt, /*args*/ ...);
+#endif
+#if defined(NEED_VASNPRINTF)
+int vasnprintf (char **ptr, size_t str_m, const char *fmt, va_list ap);
+#endif
+
+#if defined(HAVE_SNPRINTF)
+/* declare our portable snprintf  routine under name portable_snprintf  */
+/* declare our portable vsnprintf routine under name portable_vsnprintf */
+#else
+/* declare our portable routines under names snprintf and vsnprintf */
+#define portable_snprintf snprintf
+#if !defined(NEED_SNPRINTF_ONLY)
+#define portable_vsnprintf vsnprintf
+#endif
+#endif
+
+#if !defined(HAVE_SNPRINTF) || defined(PREFER_PORTABLE_SNPRINTF)
+int portable_snprintf(char *str, size_t str_m, const char *fmt, /*args*/ ...);
+#if !defined(NEED_SNPRINTF_ONLY)
+int portable_vsnprintf(char *str, size_t str_m, const char *fmt, va_list ap);
+#endif
+#endif
+
+/* declarations */
+
+static char credits[] = "\n\
+@(#)snprintf.c, v2.2: Mark Martinec, <mark.martinec@ijs.si>\n\
+@(#)snprintf.c, v2.2: Copyright 1999, Mark Martinec. Frontier Artistic License applies.\n\
+@(#)snprintf.c, v2.2: http://www.ijs.si/software/snprintf/\n";
+
+#if defined(NEED_ASPRINTF)
+int asprintf(char **ptr, const char *fmt, /*args*/ ...) {
+  va_list ap;
+  size_t str_m;
+  int str_l;
+
+  *ptr = NULL;
+  va_start(ap, fmt);                            /* measure the required size */
+  str_l = portable_vsnprintf(NULL, (size_t)0, fmt, ap);
+  va_end(ap);
+  assert(str_l >= 0);        /* possible integer overflow if str_m > INT_MAX */
+  *ptr = (char *) malloc(str_m = (size_t)str_l + 1);
+  if (*ptr == NULL) { errno = ENOMEM; str_l = -1; }
+  else {
+    int str_l2;
+    va_start(ap, fmt);
+    str_l2 = portable_vsnprintf(*ptr, str_m, fmt, ap);
+    va_end(ap);
+    assert(str_l2 == str_l);
+  }
+  return str_l;
+}
+#endif
+
+#if defined(NEED_VASPRINTF)
+int vasprintf(char **ptr, const char *fmt, va_list ap) {
+  size_t str_m;
+  int str_l;
+
+  *ptr = NULL;
+  { va_list ap2;
+    va_copy(ap2, ap);  /* don't consume the original ap, we'll need it again */
+    str_l = portable_vsnprintf(NULL, (size_t)0, fmt, ap2);/*get required size*/
+    va_end(ap2);
+  }
+  assert(str_l >= 0);        /* possible integer overflow if str_m > INT_MAX */
+  *ptr = (char *) malloc(str_m = (size_t)str_l + 1);
+  if (*ptr == NULL) { errno = ENOMEM; str_l = -1; }
+  else {
+    int str_l2 = portable_vsnprintf(*ptr, str_m, fmt, ap);
+    assert(str_l2 == str_l);
+  }
+  return str_l;
+}
+#endif
+
+#if defined(NEED_ASNPRINTF)
+int asnprintf (char **ptr, size_t str_m, const char *fmt, /*args*/ ...) {
+  va_list ap;
+  int str_l;
+
+  *ptr = NULL;
+  va_start(ap, fmt);                            /* measure the required size */
+  str_l = portable_vsnprintf(NULL, (size_t)0, fmt, ap);
+  va_end(ap);
+  assert(str_l >= 0);        /* possible integer overflow if str_m > INT_MAX */
+  if ((size_t)str_l + 1 < str_m) str_m = (size_t)str_l + 1;      /* truncate */
+  /* if str_m is 0, no buffer is allocated, just set *ptr to NULL */
+  if (str_m == 0) {  /* not interested in resulting string, just return size */
+  } else {
+    *ptr = (char *) malloc(str_m);
+    if (*ptr == NULL) { errno = ENOMEM; str_l = -1; }
+    else {
+      int str_l2;
+      va_start(ap, fmt);
+      str_l2 = portable_vsnprintf(*ptr, str_m, fmt, ap);
+      va_end(ap);
+      assert(str_l2 == str_l);
+    }
+  }
+  return str_l;
+}
+#endif
+
+#if defined(NEED_VASNPRINTF)
+int vasnprintf (char **ptr, size_t str_m, const char *fmt, va_list ap) {
+  int str_l;
+
+  *ptr = NULL;
+  { va_list ap2;
+    va_copy(ap2, ap);  /* don't consume the original ap, we'll need it again */
+    str_l = portable_vsnprintf(NULL, (size_t)0, fmt, ap2);/*get required size*/
+    va_end(ap2);
+  }
+  assert(str_l >= 0);        /* possible integer overflow if str_m > INT_MAX */
+  if ((size_t)str_l + 1 < str_m) str_m = (size_t)str_l + 1;      /* truncate */
+  /* if str_m is 0, no buffer is allocated, just set *ptr to NULL */
+  if (str_m == 0) {  /* not interested in resulting string, just return size */
+  } else {
+    *ptr = (char *) malloc(str_m);
+    if (*ptr == NULL) { errno = ENOMEM; str_l = -1; }
+    else {
+      int str_l2 = portable_vsnprintf(*ptr, str_m, fmt, ap);
+      assert(str_l2 == str_l);
+    }
+  }
+  return str_l;
+}
+#endif
+
+/*
+ * If the system does have snprintf and the portable routine is not
+ * specifically required, this module produces no code for snprintf/vsnprintf.
+ */
+#if !defined(HAVE_SNPRINTF) || defined(PREFER_PORTABLE_SNPRINTF)
+
+#if !defined(NEED_SNPRINTF_ONLY)
+int portable_snprintf(char *str, size_t str_m, const char *fmt, /*args*/ ...) {
+  va_list ap;
+  int str_l;
+
+  va_start(ap, fmt);
+  str_l = portable_vsnprintf(str, str_m, fmt, ap);
+  va_end(ap);
+  return str_l;
+}
+#endif
+
+#if defined(NEED_SNPRINTF_ONLY)
+int portable_snprintf(char *str, size_t str_m, const char *fmt, /*args*/ ...) {
+#else
+int portable_vsnprintf(char *str, size_t str_m, const char *fmt, va_list ap) {
+#endif
+
+#if defined(NEED_SNPRINTF_ONLY)
+  va_list ap;
+#endif
+  size_t str_l = 0;
+  const char *p = fmt;
+
+/* In contrast with POSIX, the ISO C99 now says
+ * that str can be NULL and str_m can be 0.
+ * This is more useful than the old:  if (str_m < 1) return -1; */
+
+#if defined(NEED_SNPRINTF_ONLY)
+  va_start(ap, fmt);
+#endif
+  if (!p) p = "";
+  while (*p) {
+    if (*p != '%') {
+   /* if (str_l < str_m) str[str_l++] = *p++;    -- this would be sufficient */
+   /* but the following code achieves better performance for cases
+    * where format string is long and contains few conversions */
+      const char *q = strchr(p+1,'%');
+      size_t n = !q ? strlen(p) : (q-p);
+      if (str_l < str_m) {
+        size_t avail = str_m-str_l;
+        fast_memcpy(str+str_l, p, (n>avail?avail:n));
+      }
+      p += n; str_l += n;
+    } else {
+      const char *starting_p;
+      size_t min_field_width = 0, precision = 0;
+      int zero_padding = 0, precision_specified = 0, justify_left = 0;
+      int alternate_form = 0, force_sign = 0;
+      int space_for_positive = 1; /* If both the ' ' and '+' flags appear,
+                                     the ' ' flag should be ignored. */
+      char length_modifier = '\0';            /* allowed values: \0, h, l, L */
+      char tmp[32];/* temporary buffer for simple numeric->string conversion */
+
+      const char *str_arg;      /* string address in case of string argument */
+      size_t str_arg_l;         /* natural field width of arg without padding
+                                   and sign */
+      unsigned char uchar_arg;
+        /* unsigned char argument value - only defined for c conversion.
+           N.B. standard explicitly states the char argument for
+           the c conversion is unsigned */
+
+      size_t number_of_zeros_to_pad = 0;
+        /* number of zeros to be inserted for numeric conversions
+           as required by the precision or minimal field width */
+
+      size_t zero_padding_insertion_ind = 0;
+        /* index into tmp where zero padding is to be inserted */
+
+      char fmt_spec = '\0';
+        /* current conversion specifier character */
+
+      str_arg = credits;/* just to make compiler happy (defined but not used)*/
+      str_arg = NULL;
+      starting_p = p; p++;  /* skip '%' */
+   /* parse flags */
+      while (*p == '0' || *p == '-' || *p == '+' ||
+             *p == ' ' || *p == '#' || *p == '\'') {
+        switch (*p) {
+        case '0': zero_padding = 1; break;
+        case '-': justify_left = 1; break;
+        case '+': force_sign = 1; space_for_positive = 0; break;
+        case ' ': force_sign = 1;
+     /* If both the ' ' and '+' flags appear, the ' ' flag should be ignored */
+#ifdef PERL_COMPATIBLE
+     /* ... but in Perl the last of ' ' and '+' applies */
+                  space_for_positive = 1;
+#endif
+                  break;
+        case '#': alternate_form = 1; break;
+        case '\'': break;
+        }
+        p++;
+      }
+   /* If the '0' and '-' flags both appear, the '0' flag should be ignored. */
+
+   /* parse field width */
+      if (*p == '*') {
+        int j;
+        p++; j = va_arg(ap, int);
+        if (j >= 0) min_field_width = j;
+        else { min_field_width = -j; justify_left = 1; }
+      } else if (isdigit((int)(*p))) {
+        /* size_t could be wider than unsigned int;
+           make sure we treat argument like common implementations do */
+        unsigned int uj = *p++ - '0';
+        while (isdigit((int)(*p))) uj = 10*uj + (unsigned int)(*p++ - '0');
+        min_field_width = uj;
+      }
+   /* parse precision */
+      if (*p == '.') {
+        p++; precision_specified = 1;
+        if (*p == '*') {
+          int j = va_arg(ap, int);
+          p++;
+          if (j >= 0) precision = j;
+          else {
+            precision_specified = 0; precision = 0;
+         /* NOTE:
+          *   Solaris 2.6 man page claims that in this case the precision
+          *   should be set to 0.  Digital Unix 4.0, HPUX 10 and BSD man page
+          *   claim that this case should be treated as unspecified precision,
+          *   which is what we do here.
+          */
+          }
+        } else if (isdigit((int)(*p))) {
+          /* size_t could be wider than unsigned int;
+             make sure we treat argument like common implementations do */
+          unsigned int uj = *p++ - '0';
+          while (isdigit((int)(*p))) uj = 10*uj + (unsigned int)(*p++ - '0');
+          precision = uj;
+        }
+      }
+   /* parse 'h', 'l' and 'll' length modifiers */
+      if (*p == 'h' || *p == 'l') {
+        length_modifier = *p; p++;
+        if (length_modifier == 'l' && *p == 'l') {   /* double l = long long */
+#ifdef SNPRINTF_LONGLONG_SUPPORT
+          length_modifier = '2';                  /* double l encoded as '2' */
+#else
+          length_modifier = 'l';                 /* treat it as a single 'l' */
+#endif
+          p++;
+        }
+      }
+      fmt_spec = *p;
+   /* common synonyms: */
+      switch (fmt_spec) {
+      case 'i': fmt_spec = 'd'; break;
+      case 'D': fmt_spec = 'd'; length_modifier = 'l'; break;
+      case 'U': fmt_spec = 'u'; length_modifier = 'l'; break;
+      case 'O': fmt_spec = 'o'; length_modifier = 'l'; break;
+      default: break;
+      }
+   /* get parameter value, do initial processing */
+      switch (fmt_spec) {
+      case '%': /* % behaves similar to 's' regarding flags and field widths */
+      case 'c': /* c behaves similar to 's' regarding flags and field widths */
+      case 's':
+        length_modifier = '\0';          /* wint_t and wchar_t not supported */
+     /* the result of zero padding flag with non-numeric conversion specifier*/
+     /* is undefined. Solaris and HPUX 10 does zero padding in this case,    */
+     /* Digital Unix and Linux does not. */
+#if !defined(SOLARIS_COMPATIBLE) && !defined(HPUX_COMPATIBLE)
+        zero_padding = 0;    /* turn zero padding off for string conversions */
+#endif
+        str_arg_l = 1;
+        switch (fmt_spec) {
+        case '%':
+          str_arg = p; break;
+        case 'c': {
+          int j = va_arg(ap, int);
+          uchar_arg = (unsigned char) j;   /* standard demands unsigned char */
+          str_arg = (const char *) &uchar_arg;
+          break;
+        }
+        case 's':
+          str_arg = va_arg(ap, const char *);
+          if (!str_arg) str_arg_l = 0;
+       /* make sure not to address string beyond the specified precision !!! */
+          else if (!precision_specified) str_arg_l = strlen(str_arg);
+       /* truncate string if necessary as requested by precision */
+          else if (precision == 0) str_arg_l = 0;
+          else {
+       /* memchr on HP does not like n > 2^31  !!! */
+            const char *q = memchr(str_arg, '\0',
+                             precision <= 0x7fffffff ? precision : 0x7fffffff);
+            str_arg_l = !q ? precision : (q-str_arg);
+          }
+          break;
+        default: break;
+        }
+        break;
+      case 'd': case 'u': case 'o': case 'x': case 'X': case 'p': {
+        /* NOTE: the u, o, x, X and p conversion specifiers imply
+                 the value is unsigned;  d implies a signed value */
+
+        int arg_sign = 0;
+          /* 0 if numeric argument is zero (or if pointer is NULL for 'p'),
+            +1 if greater than zero (or nonzero for unsigned arguments),
+            -1 if negative (unsigned argument is never negative) */
+
+        int int_arg = 0;  unsigned int uint_arg = 0;
+          /* only defined for length modifier h, or for no length modifiers */
+
+        long int long_arg = 0;  unsigned long int ulong_arg = 0;
+          /* only defined for length modifier l */
+
+        void *ptr_arg = NULL;
+          /* pointer argument value -only defined for p conversion */
+
+#ifdef SNPRINTF_LONGLONG_SUPPORT
+        long long int long_long_arg = 0;
+        unsigned long long int ulong_long_arg = 0;
+          /* only defined for length modifier ll */
+#endif
+        if (fmt_spec == 'p') {
+        /* HPUX 10: An l, h, ll or L before any other conversion character
+         *   (other than d, i, u, o, x, or X) is ignored.
+         * Digital Unix:
+         *   not specified, but seems to behave as HPUX does.
+         * Solaris: If an h, l, or L appears before any other conversion
+         *   specifier (other than d, i, u, o, x, or X), the behavior
+         *   is undefined. (Actually %hp converts only 16-bits of address
+         *   and %llp treats address as 64-bit data which is incompatible
+         *   with (void *) argument on a 32-bit system).
+         */
+#ifdef SOLARIS_COMPATIBLE
+#  ifdef SOLARIS_BUG_COMPATIBLE
+          /* keep length modifiers even if it represents 'll' */
+#  else
+          if (length_modifier == '2') length_modifier = '\0';
+#  endif
+#else
+          length_modifier = '\0';
+#endif
+          ptr_arg = va_arg(ap, void *);
+          if (ptr_arg != NULL) arg_sign = 1;
+        } else if (fmt_spec == 'd') {  /* signed */
+          switch (length_modifier) {
+          case '\0':
+          case 'h':
+         /* It is non-portable to specify a second argument of char or short
+          * to va_arg, because arguments seen by the called function
+          * are not char or short.  C converts char and short arguments
+          * to int before passing them to a function.
+          */
+            int_arg = va_arg(ap, int);
+            if      (int_arg > 0) arg_sign =  1;
+            else if (int_arg < 0) arg_sign = -1;
+            break;
+          case 'l':
+            long_arg = va_arg(ap, long int);
+            if      (long_arg > 0) arg_sign =  1;
+            else if (long_arg < 0) arg_sign = -1;
+            break;
+#ifdef SNPRINTF_LONGLONG_SUPPORT
+          case '2':
+            long_long_arg = va_arg(ap, long long int);
+            if      (long_long_arg > 0) arg_sign =  1;
+            else if (long_long_arg < 0) arg_sign = -1;
+            break;
+#endif
+          }
+        } else {  /* unsigned */
+          switch (length_modifier) {
+          case '\0':
+          case 'h':
+            uint_arg = va_arg(ap, unsigned int);
+            if (uint_arg) arg_sign = 1;
+            break;
+          case 'l':
+            ulong_arg = va_arg(ap, unsigned long int);
+            if (ulong_arg) arg_sign = 1;
+            break;
+#ifdef SNPRINTF_LONGLONG_SUPPORT
+          case '2':
+            ulong_long_arg = va_arg(ap, unsigned long long int);
+            if (ulong_long_arg) arg_sign = 1;
+            break;
+#endif
+          }
+        }
+        str_arg = tmp; str_arg_l = 0;
+     /* NOTE:
+      *   For d, i, u, o, x, and X conversions, if precision is specified,
+      *   the '0' flag should be ignored. This is so with Solaris 2.6,
+      *   Digital UNIX 4.0, HPUX 10, Linux, FreeBSD, NetBSD; but not with Perl.
+      */
+#ifndef PERL_COMPATIBLE
+        if (precision_specified) zero_padding = 0;
+#endif
+        if (fmt_spec == 'd') {
+          if (force_sign && arg_sign >= 0)
+            tmp[str_arg_l++] = space_for_positive ? ' ' : '+';
+         /* leave negative numbers for sprintf to handle,
+            to avoid handling tricky cases like (short int)(-32768) */
+#ifdef LINUX_COMPATIBLE
+        } else if (fmt_spec == 'p' && force_sign && arg_sign > 0) {
+          tmp[str_arg_l++] = space_for_positive ? ' ' : '+';
+#endif
+        } else if (alternate_form) {
+          if (arg_sign != 0 && (fmt_spec == 'x' || fmt_spec == 'X') )
+            { tmp[str_arg_l++] = '0'; tmp[str_arg_l++] = fmt_spec; }
+         /* alternate form should have no effect for p conversion, but ... */
+#ifdef HPUX_COMPATIBLE
+          else if (fmt_spec == 'p'
+         /* HPUX 10: for an alternate form of p conversion,
+          *          a nonzero result is prefixed by 0x. */
+#ifndef HPUX_BUG_COMPATIBLE
+         /* Actually it uses 0x prefix even for a zero value. */
+                   && arg_sign != 0
+#endif
+                  ) { tmp[str_arg_l++] = '0'; tmp[str_arg_l++] = 'x'; }
+#endif
+        }
+        zero_padding_insertion_ind = str_arg_l;
+        if (!precision_specified) precision = 1;   /* default precision is 1 */
+        if (precision == 0 && arg_sign == 0
+#if defined(HPUX_BUG_COMPATIBLE) || defined(LINUX_COMPATIBLE)
+            && fmt_spec != 'p'
+         /* HPUX 10 man page claims: With conversion character p the result of
+          * converting a zero value with a precision of zero is a null string.
+          * Actually HP returns all zeroes, and Linux returns "(nil)". */
+#endif
+        ) {
+         /* converted to null string */
+         /* When zero value is formatted with an explicit precision 0,
+            the resulting formatted string is empty (d, i, u, o, x, X, p).   */
+        } else {
+          char f[5]; int f_l = 0;
+          f[f_l++] = '%';    /* construct a simple format string for sprintf */
+          if (!length_modifier) { }
+          else if (length_modifier=='2') { f[f_l++] = 'l'; f[f_l++] = 'l'; }
+          else f[f_l++] = length_modifier;
+          f[f_l++] = fmt_spec; f[f_l++] = '\0';
+          if (fmt_spec == 'p') str_arg_l += sprintf(tmp+str_arg_l, f, ptr_arg);
+          else if (fmt_spec == 'd') {  /* signed */
+            switch (length_modifier) {
+            case '\0':
+            case 'h': str_arg_l+=sprintf(tmp+str_arg_l, f, int_arg);  break;
+            case 'l': str_arg_l+=sprintf(tmp+str_arg_l, f, long_arg); break;
+#ifdef SNPRINTF_LONGLONG_SUPPORT
+            case '2': str_arg_l+=sprintf(tmp+str_arg_l,f,long_long_arg); break;
+#endif
+            }
+          } else {  /* unsigned */
+            switch (length_modifier) {
+            case '\0':
+            case 'h': str_arg_l+=sprintf(tmp+str_arg_l, f, uint_arg);  break;
+            case 'l': str_arg_l+=sprintf(tmp+str_arg_l, f, ulong_arg); break;
+#ifdef SNPRINTF_LONGLONG_SUPPORT
+            case '2': str_arg_l+=sprintf(tmp+str_arg_l,f,ulong_long_arg);break;
+#endif
+            }
+          }
+         /* include the optional minus sign and possible "0x"
+            in the region before the zero padding insertion point */
+          if (zero_padding_insertion_ind < str_arg_l &&
+              tmp[zero_padding_insertion_ind] == '-') {
+            zero_padding_insertion_ind++;
+          }
+          if (zero_padding_insertion_ind+1 < str_arg_l &&
+              tmp[zero_padding_insertion_ind]   == '0' &&
+             (tmp[zero_padding_insertion_ind+1] == 'x' ||
+              tmp[zero_padding_insertion_ind+1] == 'X') ) {
+            zero_padding_insertion_ind += 2;
+          }
+        }
+        { size_t num_of_digits = str_arg_l - zero_padding_insertion_ind;
+          if (alternate_form && fmt_spec == 'o'
+#ifdef HPUX_COMPATIBLE                                  /* ("%#.o",0) -> ""  */
+              && (str_arg_l > 0)
+#endif
+#ifdef DIGITAL_UNIX_BUG_COMPATIBLE                      /* ("%#o",0) -> "00" */
+#else
+              /* unless zero is already the first character */
+              && !(zero_padding_insertion_ind < str_arg_l
+                   && tmp[zero_padding_insertion_ind] == '0')
+#endif
+          ) {        /* assure leading zero for alternate-form octal numbers */
+            if (!precision_specified || precision < num_of_digits+1) {
+             /* precision is increased to force the first character to be zero,
+                except if a zero value is formatted with an explicit precision
+                of zero */
+              precision = num_of_digits+1; precision_specified = 1;
+            }
+          }
+       /* zero padding to specified precision? */
+          if (num_of_digits < precision) 
+            number_of_zeros_to_pad = precision - num_of_digits;
+        }
+     /* zero padding to specified minimal field width? */
+        if (!justify_left && zero_padding) {
+          int n = min_field_width - (str_arg_l+number_of_zeros_to_pad);
+          if (n > 0) number_of_zeros_to_pad += n;
+        }
+        break;
+      }
+      default: /* unrecognized conversion specifier, keep format string as-is*/
+        zero_padding = 0;  /* turn zero padding off for non-numeric convers. */
+#ifndef DIGITAL_UNIX_COMPATIBLE
+        justify_left = 1; min_field_width = 0;                /* reset flags */
+#endif
+#if defined(PERL_COMPATIBLE) || defined(LINUX_COMPATIBLE)
+     /* keep the entire format string unchanged */
+        str_arg = starting_p; str_arg_l = p - starting_p;
+     /* well, not exactly so for Linux, which does something inbetween,
+      * and I don't feel an urge to imitate it: "%+++++hy" -> "%+y"  */
+#else
+     /* discard the unrecognized conversion, just keep *
+      * the unrecognized conversion character          */
+        str_arg = p; str_arg_l = 0;
+#endif
+        if (*p) str_arg_l++;  /* include invalid conversion specifier unchanged
+                                 if not at end-of-string */
+        break;
+      }
+      if (*p) p++;      /* step over the just processed conversion specifier */
+   /* insert padding to the left as requested by min_field_width;
+      this does not include the zero padding in case of numerical conversions*/
+      if (!justify_left) {                /* left padding with blank or zero */
+        int n = min_field_width - (str_arg_l+number_of_zeros_to_pad);
+        if (n > 0) {
+          if (str_l < str_m) {
+            size_t avail = str_m-str_l;
+            fast_memset(str+str_l, (zero_padding?'0':' '), (n>avail?avail:n));
+          }
+          str_l += n;
+        }
+      }
+   /* zero padding as requested by the precision or by the minimal field width
+    * for numeric conversions required? */
+      if (number_of_zeros_to_pad <= 0) {
+     /* will not copy first part of numeric right now, *
+      * force it to be copied later in its entirety    */
+        zero_padding_insertion_ind = 0;
+      } else {
+     /* insert first part of numerics (sign or '0x') before zero padding */
+        int n = zero_padding_insertion_ind;
+        if (n > 0) {
+          if (str_l < str_m) {
+            size_t avail = str_m-str_l;
+            fast_memcpy(str+str_l, str_arg, (n>avail?avail:n));
+          }
+          str_l += n;
+        }
+     /* insert zero padding as requested by the precision or min field width */
+        n = number_of_zeros_to_pad;
+        if (n > 0) {
+          if (str_l < str_m) {
+            size_t avail = str_m-str_l;
+            fast_memset(str+str_l, '0', (n>avail?avail:n));
+          }
+          str_l += n;
+        }
+      }
+   /* insert formatted string
+    * (or as-is conversion specifier for unknown conversions) */
+      { int n = str_arg_l - zero_padding_insertion_ind;
+        if (n > 0) {
+          if (str_l < str_m) {
+            size_t avail = str_m-str_l;
+            fast_memcpy(str+str_l, str_arg+zero_padding_insertion_ind,
+                        (n>avail?avail:n));
+          }
+          str_l += n;
+        }
+      }
+   /* insert right padding */
+      if (justify_left) {          /* right blank padding to the field width */
+        int n = min_field_width - (str_arg_l+number_of_zeros_to_pad);
+        if (n > 0) {
+          if (str_l < str_m) {
+            size_t avail = str_m-str_l;
+            fast_memset(str+str_l, ' ', (n>avail?avail:n));
+          }
+          str_l += n;
+        }
+      }
+    }
+  }
+#if defined(NEED_SNPRINTF_ONLY)
+  va_end(ap);
+#endif
+  if (str_m > 0) { /* make sure the string is null-terminated
+                      even at the expense of overwriting the last character
+                      (shouldn't happen, but just in case) */
+    str[str_l <= str_m-1 ? str_l : str_m-1] = '\0';
+  }
+  /* Return the number of characters formatted (excluding trailing null
+   * character), that is, the number of characters that would have been
+   * written to the buffer if it were large enough.
+   *
+   * The value of str_l should be returned, but str_l is of unsigned type
+   * size_t, and snprintf is int, possibly leading to an undetected
+   * integer overflow, resulting in a negative return value, which is illegal.
+   * Both XSH5 and ISO C99 (at least the draft) are silent on this issue.
+   * Should errno be set to EOVERFLOW and EOF returned in this case???
+   */
+  return (int) str_l;
+}
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/snprintf.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/snprintf.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/snprintf.h	(revision 70339)
@@ -0,0 +1,26 @@
+#ifndef _PORTABLE_SNPRINTF_H_
+#define _PORTABLE_SNPRINTF_H_
+
+#define PORTABLE_SNPRINTF_VERSION_MAJOR 2
+#define PORTABLE_SNPRINTF_VERSION_MINOR 2
+
+#ifdef HAVE_SNPRINTF
+#include <stdio.h>
+#else
+extern int snprintf(char *, size_t, const char *, /*args*/ ...);
+extern int vsnprintf(char *, size_t, const char *, va_list);
+#endif
+
+#if defined(HAVE_SNPRINTF) && defined(PREFER_PORTABLE_SNPRINTF)
+extern int portable_snprintf(char *str, size_t str_m, const char *fmt, /*args*/ ...);
+extern int portable_vsnprintf(char *str, size_t str_m, const char *fmt, va_list ap);
+#define snprintf  portable_snprintf
+#define vsnprintf portable_vsnprintf
+#endif
+
+extern int asprintf  (char **ptr, const char *fmt, /*args*/ ...);
+extern int vasprintf (char **ptr, const char *fmt, va_list ap);
+extern int asnprintf (char **ptr, size_t str_m, const char *fmt, /*args*/ ...);
+extern int vasnprintf(char **ptr, size_t str_m, const char *fmt, va_list ap);
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/libgen.c
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/libgen.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/libgen.c	(revision 70339)
@@ -0,0 +1,25 @@
+#include <string.h>
+
+#include "libgen.h"
+
+// http://www.opengroup.org/onlinepubs/007908775/xsh/basename.html
+
+char* basename(char *path) {
+	if (path != NULL) {
+		// Find the last position of the \ in the path name
+		char* pos = strrchr(path, '\\');
+
+		if (pos != NULL) { // If a \ char was found...
+			if (pos + 1 != NULL) // If it is not the last character in the string...
+				return pos + 1; // then return a pointer to the first character after \.
+			else
+				return pos; // else return a pointer to \
+
+		} else { // If a \ char was NOT found
+			return path; // return the pointer passed to basename (this is probably non-conformant)
+		}
+
+	} else { // If path == NULL, return "."
+		return ".";
+	}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/libgen.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/libgen.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/libgen.h	(revision 70339)
@@ -0,0 +1,14 @@
+#ifndef LIBGEN_H
+#define LIBGEN_H
+
+#ifdef __cplusplus
+	extern "C" {
+#endif
+
+char  *basename(char *);
+
+#ifdef __cplusplus
+	}
+#endif
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/regex.c
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/regex.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/regex.c	(revision 70339)
@@ -0,0 +1,4948 @@
+/* Extended regular expression matching and search library,
+   version 0.12.
+   (Implements POSIX draft P10003.2/D11.2, except for
+   internationalization features.)
+
+   Copyright (C) 1993 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
+
+/* AIX requires this to be the first thing in the file. */
+#if defined (_AIX) && !defined (REGEX_MALLOC)
+  #pragma alloca
+#endif
+
+#define _GNU_SOURCE
+
+/* We need this for `regex.h', and perhaps for the Emacs include files.  */
+#include <sys/types.h>
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+/* The `emacs' switch turns on certain matching commands
+   that make sense only in Emacs. */
+#ifdef emacs
+
+#include "lisp.h"
+#include "buffer.h"
+#include "syntax.h"
+
+/* Emacs uses `NULL' as a predicate.  */
+#undef NULL
+
+#else  /* not emacs */
+
+/* We used to test for `BSTRING' here, but only GCC and Emacs define
+   `BSTRING', as far as I know, and neither of them use this code.  */
+#if HAVE_STRING_H || STDC_HEADERS
+#include <string.h>
+#ifndef bcmp
+#define bcmp(s1, s2, n)	memcmp ((s1), (s2), (n))
+#endif
+#ifndef bcopy
+#define bcopy(s, d, n)	memcpy ((d), (s), (n))
+#endif
+#ifndef bzero
+#define bzero(s, n)	memset ((s), 0, (n))
+#endif
+#else
+#include <strings.h>
+#endif
+
+#ifdef STDC_HEADERS
+#include <stdlib.h>
+#else
+char *malloc ();
+char *realloc ();
+#endif
+
+
+/* Define the syntax stuff for \<, \>, etc.  */
+
+/* This must be nonzero for the wordchar and notwordchar pattern
+   commands in re_match_2.  */
+#ifndef Sword
+#define Sword 1
+#endif
+
+#ifdef SYNTAX_TABLE
+
+extern char *re_syntax_table;
+
+#else /* not SYNTAX_TABLE */
+
+/* How many characters in the character set.  */
+#define CHAR_SET_SIZE 256
+
+static char re_syntax_table[CHAR_SET_SIZE];
+
+static void
+init_syntax_once ()
+{
+   register int c;
+   static int done = 0;
+
+   if (done)
+     return;
+
+   bzero (re_syntax_table, sizeof re_syntax_table);
+
+   for (c = 'a'; c <= 'z'; c++)
+     re_syntax_table[c] = Sword;
+
+   for (c = 'A'; c <= 'Z'; c++)
+     re_syntax_table[c] = Sword;
+
+   for (c = '0'; c <= '9'; c++)
+     re_syntax_table[c] = Sword;
+
+   re_syntax_table['_'] = Sword;
+
+   done = 1;
+}
+
+#endif /* not SYNTAX_TABLE */
+
+#define SYNTAX(c) re_syntax_table[c]
+
+#endif /* not emacs */
+
+/* Get the interface, including the syntax bits.  */
+#include "regex.h"
+
+/* isalpha etc. are used for the character classes.  */
+#include <ctype.h>
+
+#ifndef isascii
+#define isascii(c) 1
+#endif
+
+#ifdef isblank
+#define ISBLANK(c) (isascii (c) && isblank (c))
+#else
+#define ISBLANK(c) ((c) == ' ' || (c) == '\t')
+#endif
+#ifdef isgraph
+#define ISGRAPH(c) (isascii (c) && isgraph (c))
+#else
+#define ISGRAPH(c) (isascii (c) && isprint (c) && !isspace (c))
+#endif
+
+#define ISPRINT(c) (isascii (c) && isprint (c))
+#define ISDIGIT(c) (isascii (c) && isdigit (c))
+#define ISALNUM(c) (isascii (c) && isalnum (c))
+#define ISALPHA(c) (isascii (c) && isalpha (c))
+#define ISCNTRL(c) (isascii (c) && iscntrl (c))
+#define ISLOWER(c) (isascii (c) && islower (c))
+#define ISPUNCT(c) (isascii (c) && ispunct (c))
+#define ISSPACE(c) (isascii (c) && isspace (c))
+#define ISUPPER(c) (isascii (c) && isupper (c))
+#define ISXDIGIT(c) (isascii (c) && isxdigit (c))
+
+#ifndef NULL
+#define NULL 0
+#endif
+
+/* We remove any previous definition of `SIGN_EXTEND_CHAR',
+   since ours (we hope) works properly with all combinations of
+   machines, compilers, `char' and `unsigned char' argument types.
+   (Per Bothner suggested the basic approach.)  */
+#undef SIGN_EXTEND_CHAR
+#if __STDC__
+#define SIGN_EXTEND_CHAR(c) ((signed char) (c))
+#else  /* not __STDC__ */
+/* As in Harbison and Steele.  */
+#define SIGN_EXTEND_CHAR(c) ((((unsigned char) (c)) ^ 128) - 128)
+#endif
+
+/* Should we use malloc or alloca?  If REGEX_MALLOC is not defined, we
+   use `alloca' instead of `malloc'.  This is because using malloc in
+   re_search* or re_match* could cause memory leaks when C-g is used in
+   Emacs; also, malloc is slower and causes storage fragmentation.  On
+   the other hand, malloc is more portable, and easier to debug.
+
+   Because we sometimes use alloca, some routines have to be macros,
+   not functions -- `alloca'-allocated space disappears at the end of the
+   function it is called in.  */
+
+#ifdef REGEX_MALLOC
+
+#define REGEX_ALLOCATE malloc
+#define REGEX_REALLOCATE(source, osize, nsize) realloc (source, nsize)
+
+#else /* not REGEX_MALLOC  */
+
+/* Emacs already defines alloca, sometimes.  */
+#ifndef alloca
+
+/* Make alloca work the best possible way.  */
+#ifdef __GNUC__
+#define alloca __builtin_alloca
+#else /* not __GNUC__ */
+#if HAVE_ALLOCA_H
+#include <alloca.h>
+#else /* not __GNUC__ or HAVE_ALLOCA_H */
+#ifndef _AIX /* Already did AIX, up at the top.  */
+char *alloca ();
+#endif /* not _AIX */
+#endif /* not HAVE_ALLOCA_H */
+#endif /* not __GNUC__ */
+
+#endif /* not alloca */
+
+#define REGEX_ALLOCATE alloca
+
+/* Assumes a `char *destination' variable.  */
+#define REGEX_REALLOCATE(source, osize, nsize)				\
+  (destination = (char *) alloca (nsize),				\
+   bcopy (source, destination, osize),					\
+   destination)
+
+#endif /* not REGEX_MALLOC */
+
+
+/* True if `size1' is non-NULL and PTR is pointing anywhere inside
+   `string1' or just past its end.  This works if PTR is NULL, which is
+   a good thing.  */
+#define FIRST_STRING_P(ptr) 					\
+  (size1 && string1 <= (ptr) && (ptr) <= string1 + size1)
+
+/* (Re)Allocate N items of type T using malloc, or fail.  */
+#define TALLOC(n, t) ((t *) malloc ((n) * sizeof (t)))
+#define RETALLOC(addr, n, t) ((addr) = (t *) realloc (addr, (n) * sizeof (t)))
+#define REGEX_TALLOC(n, t) ((t *) REGEX_ALLOCATE ((n) * sizeof (t)))
+
+#define BYTEWIDTH 8 /* In bits.  */
+
+#define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
+
+#define MAX(a, b) ((a) > (b) ? (a) : (b))
+#define MIN(a, b) ((a) < (b) ? (a) : (b))
+
+typedef char boolean;
+#define false 0
+#define true 1
+
+/* These are the command codes that appear in compiled regular
+   expressions.  Some opcodes are followed by argument bytes.  A
+   command code can specify any interpretation whatsoever for its
+   arguments.  Zero bytes may appear in the compiled regular expression.
+
+   The value of `exactn' is needed in search.c (search_buffer) in Emacs.
+   So regex.h defines a symbol `RE_EXACTN_VALUE' to be 1; the value of
+   `exactn' we use here must also be 1.  */
+
+typedef enum
+{
+  no_op = 0,
+
+        /* Followed by one byte giving n, then by n literal bytes.  */
+  exactn = 1,
+
+        /* Matches any (more or less) character.  */
+  anychar,
+
+        /* Matches any one char belonging to specified set.  First
+           following byte is number of bitmap bytes.  Then come bytes
+           for a bitmap saying which chars are in.  Bits in each byte
+           are ordered low-bit-first.  A character is in the set if its
+           bit is 1.  A character too large to have a bit in the map is
+           automatically not in the set.  */
+  charset,
+
+        /* Same parameters as charset, but match any character that is
+           not one of those specified.  */
+  charset_not,
+
+        /* Start remembering the text that is matched, for storing in a
+           register.  Followed by one byte with the register number, in
+           the range 0 to one less than the pattern buffer's re_nsub
+           field.  Then followed by one byte with the number of groups
+           inner to this one.  (This last has to be part of the
+           start_memory only because we need it in the on_failure_jump
+           of re_match_2.)  */
+  start_memory,
+
+        /* Stop remembering the text that is matched and store it in a
+           memory register.  Followed by one byte with the register
+           number, in the range 0 to one less than `re_nsub' in the
+           pattern buffer, and one byte with the number of inner groups,
+           just like `start_memory'.  (We need the number of inner
+           groups here because we don't have any easy way of finding the
+           corresponding start_memory when we're at a stop_memory.)  */
+  stop_memory,
+
+        /* Match a duplicate of something remembered. Followed by one
+           byte containing the register number.  */
+  duplicate,
+
+        /* Fail unless at beginning of line.  */
+  begline,
+
+        /* Fail unless at end of line.  */
+  endline,
+
+        /* Succeeds if at beginning of buffer (if emacs) or at beginning
+           of string to be matched (if not).  */
+  begbuf,
+
+        /* Analogously, for end of buffer/string.  */
+  endbuf,
+
+        /* Followed by two byte relative address to which to jump.  */
+  jump,
+
+    /* Same as jump, but marks the end of an alternative.  */
+  jump_past_alt,
+
+        /* Followed by two-byte relative address of place to resume at
+           in case of failure.  */
+  on_failure_jump,
+
+        /* Like on_failure_jump, but pushes a placeholder instead of the
+           current string position when executed.  */
+  on_failure_keep_string_jump,
+
+        /* Throw away latest failure point and then jump to following
+           two-byte relative address.  */
+  pop_failure_jump,
+
+        /* Change to pop_failure_jump if know won't have to backtrack to
+           match; otherwise change to jump.  This is used to jump
+           back to the beginning of a repeat.  If what follows this jump
+           clearly won't match what the repeat does, such that we can be
+           sure that there is no use backtracking out of repetitions
+           already matched, then we change it to a pop_failure_jump.
+           Followed by two-byte address.  */
+  maybe_pop_jump,
+
+        /* Jump to following two-byte address, and push a dummy failure
+           point. This failure point will be thrown away if an attempt
+           is made to use it for a failure.  A `+' construct makes this
+           before the first repeat.  Also used as an intermediary kind
+           of jump when compiling an alternative.  */
+  dummy_failure_jump,
+
+    /* Push a dummy failure point and continue.  Used at the end of
+       alternatives.  */
+  push_dummy_failure,
+
+        /* Followed by two-byte relative address and two-byte number n.
+           After matching N times, jump to the address upon failure.  */
+  succeed_n,
+
+        /* Followed by two-byte relative address, and two-byte number n.
+           Jump to the address N times, then fail.  */
+  jump_n,
+
+        /* Set the following two-byte relative address to the
+           subsequent two-byte number.  The address *includes* the two
+           bytes of number.  */
+  set_number_at,
+
+  wordchar,	/* Matches any word-constituent character.  */
+  notwordchar,	/* Matches any char that is not a word-constituent.  */
+
+  wordbeg,	/* Succeeds if at word beginning.  */
+  wordend,	/* Succeeds if at word end.  */
+
+  wordbound,	/* Succeeds if at a word boundary.  */
+  notwordbound	/* Succeeds if not at a word boundary.  */
+
+#ifdef emacs
+  ,before_dot,	/* Succeeds if before point.  */
+  at_dot,	/* Succeeds if at point.  */
+  after_dot,	/* Succeeds if after point.  */
+
+    /* Matches any character whose syntax is specified.  Followed by
+           a byte which contains a syntax code, e.g., Sword.  */
+  syntaxspec,
+
+    /* Matches any character whose syntax is not that specified.  */
+  notsyntaxspec
+#endif /* emacs */
+} re_opcode_t;
+
+/* Common operations on the compiled pattern.  */
+
+/* Store NUMBER in two contiguous bytes starting at DESTINATION.  */
+
+#define STORE_NUMBER(destination, number)				\
+  do {									\
+    (destination)[0] = (number) & 0377;					\
+    (destination)[1] = (number) >> 8;					\
+  } while (0)
+
+/* Same as STORE_NUMBER, except increment DESTINATION to
+   the byte after where the number is stored.  Therefore, DESTINATION
+   must be an lvalue.  */
+
+#define STORE_NUMBER_AND_INCR(destination, number)			\
+  do {									\
+    STORE_NUMBER (destination, number);					\
+    (destination) += 2;							\
+  } while (0)
+
+/* Put into DESTINATION a number stored in two contiguous bytes starting
+   at SOURCE.  */
+
+#define EXTRACT_NUMBER(destination, source)				\
+  do {									\
+    (destination) = *(source) & 0377;					\
+    (destination) += SIGN_EXTEND_CHAR (*((source) + 1)) << 8;		\
+  } while (0)
+
+#ifdef DEBUG
+static void
+extract_number (dest, source)
+    int *dest;
+    unsigned char *source;
+{
+  int temp = SIGN_EXTEND_CHAR (*(source + 1));
+  *dest = *source & 0377;
+  *dest += temp << 8;
+}
+
+#ifndef EXTRACT_MACROS /* To debug the macros.  */
+#undef EXTRACT_NUMBER
+#define EXTRACT_NUMBER(dest, src) extract_number (&dest, src)
+#endif /* not EXTRACT_MACROS */
+
+#endif /* DEBUG */
+
+/* Same as EXTRACT_NUMBER, except increment SOURCE to after the number.
+   SOURCE must be an lvalue.  */
+
+#define EXTRACT_NUMBER_AND_INCR(destination, source)			\
+  do {									\
+    EXTRACT_NUMBER (destination, source);				\
+    (source) += 2; 							\
+  } while (0)
+
+#ifdef DEBUG
+static void
+extract_number_and_incr (destination, source)
+    int *destination;
+    unsigned char **source;
+{
+  extract_number (destination, *source);
+  *source += 2;
+}
+
+#ifndef EXTRACT_MACROS
+#undef EXTRACT_NUMBER_AND_INCR
+#define EXTRACT_NUMBER_AND_INCR(dest, src) \
+  extract_number_and_incr (&dest, &src)
+#endif /* not EXTRACT_MACROS */
+
+#endif /* DEBUG */
+
+/* If DEBUG is defined, Regex prints many voluminous messages about what
+   it is doing (if the variable `debug' is nonzero).  If linked with the
+   main program in `iregex.c', you can enter patterns and strings
+   interactively.  And if linked with the main program in `main.c' and
+   the other test files, you can run the already-written tests.  */
+
+#ifdef DEBUG
+
+/* We use standard I/O for debugging.  */
+#include <stdio.h>
+
+/* It is useful to test things that ``must'' be true when debugging.  */
+#include <assert.h>
+
+static int debug = 0;
+
+#define DEBUG_STATEMENT(e) e
+#define DEBUG_PRINT1(x) if (debug) printf (x)
+#define DEBUG_PRINT2(x1, x2) if (debug) printf (x1, x2)
+#define DEBUG_PRINT3(x1, x2, x3) if (debug) printf (x1, x2, x3)
+#define DEBUG_PRINT4(x1, x2, x3, x4) if (debug) printf (x1, x2, x3, x4)
+#define DEBUG_PRINT_COMPILED_PATTERN(p, s, e) 				\
+  if (debug) print_partial_compiled_pattern (s, e)
+#define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)			\
+  if (debug) print_double_string (w, s1, sz1, s2, sz2)
+
+
+extern void printchar ();
+
+/* Print the fastmap in human-readable form.  */
+
+void
+print_fastmap (fastmap)
+    char *fastmap;
+{
+  unsigned was_a_range = 0;
+  unsigned i = 0;
+
+  while (i < (1 << BYTEWIDTH))
+    {
+      if (fastmap[i++])
+    {
+      was_a_range = 0;
+          printchar (i - 1);
+          while (i < (1 << BYTEWIDTH)  &&  fastmap[i])
+            {
+              was_a_range = 1;
+              i++;
+            }
+      if (was_a_range)
+            {
+              printf ("-");
+              printchar (i - 1);
+            }
+        }
+    }
+  putchar ('\n');
+}
+
+
+/* Print a compiled pattern string in human-readable form, starting at
+   the START pointer into it and ending just before the pointer END.  */
+
+void
+print_partial_compiled_pattern (start, end)
+    unsigned char *start;
+    unsigned char *end;
+{
+  int mcnt, mcnt2;
+  unsigned char *p = start;
+  unsigned char *pend = end;
+
+  if (start == NULL)
+    {
+      printf ("(null)\n");
+      return;
+    }
+
+  /* Loop over pattern commands.  */
+  while (p < pend)
+    {
+      switch ((re_opcode_t) *p++)
+    {
+        case no_op:
+          printf ("/no_op");
+          break;
+
+    case exactn:
+      mcnt = *p++;
+          printf ("/exactn/%d", mcnt);
+          do
+        {
+              putchar ('/');
+          printchar (*p++);
+            }
+          while (--mcnt);
+          break;
+
+    case start_memory:
+          mcnt = *p++;
+          printf ("/start_memory/%d/%d", mcnt, *p++);
+          break;
+
+    case stop_memory:
+          mcnt = *p++;
+      printf ("/stop_memory/%d/%d", mcnt, *p++);
+          break;
+
+    case duplicate:
+      printf ("/duplicate/%d", *p++);
+      break;
+
+    case anychar:
+      printf ("/anychar");
+      break;
+
+    case charset:
+        case charset_not:
+          {
+            register int c;
+
+            printf ("/charset%s",
+                (re_opcode_t) *(p - 1) == charset_not ? "_not" : "");
+
+            assert (p + *p < pend);
+
+            for (c = 0; c < *p; c++)
+              {
+                unsigned bit;
+                unsigned char map_byte = p[1 + c];
+
+                putchar ('/');
+
+        for (bit = 0; bit < BYTEWIDTH; bit++)
+                  if (map_byte & (1 << bit))
+                    printchar (c * BYTEWIDTH + bit);
+              }
+        p += 1 + *p;
+        break;
+      }
+
+    case begline:
+      printf ("/begline");
+          break;
+
+    case endline:
+          printf ("/endline");
+          break;
+
+    case on_failure_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/on_failure_jump/0/%d", mcnt);
+          break;
+
+    case on_failure_keep_string_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/on_failure_keep_string_jump/0/%d", mcnt);
+          break;
+
+    case dummy_failure_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/dummy_failure_jump/0/%d", mcnt);
+          break;
+
+    case push_dummy_failure:
+          printf ("/push_dummy_failure");
+          break;
+
+        case maybe_pop_jump:
+          extract_number_and_incr (&mcnt, &p);
+      printf ("/maybe_pop_jump/0/%d", mcnt);
+      break;
+
+        case pop_failure_jump:
+      extract_number_and_incr (&mcnt, &p);
+      printf ("/pop_failure_jump/0/%d", mcnt);
+      break;
+
+        case jump_past_alt:
+      extract_number_and_incr (&mcnt, &p);
+      printf ("/jump_past_alt/0/%d", mcnt);
+      break;
+
+        case jump:
+      extract_number_and_incr (&mcnt, &p);
+      printf ("/jump/0/%d", mcnt);
+      break;
+
+        case succeed_n:
+          extract_number_and_incr (&mcnt, &p);
+          extract_number_and_incr (&mcnt2, &p);
+      printf ("/succeed_n/0/%d/0/%d", mcnt, mcnt2);
+          break;
+
+        case jump_n:
+          extract_number_and_incr (&mcnt, &p);
+          extract_number_and_incr (&mcnt2, &p);
+      printf ("/jump_n/0/%d/0/%d", mcnt, mcnt2);
+          break;
+
+        case set_number_at:
+          extract_number_and_incr (&mcnt, &p);
+          extract_number_and_incr (&mcnt2, &p);
+      printf ("/set_number_at/0/%d/0/%d", mcnt, mcnt2);
+          break;
+
+        case wordbound:
+      printf ("/wordbound");
+      break;
+
+    case notwordbound:
+      printf ("/notwordbound");
+          break;
+
+    case wordbeg:
+      printf ("/wordbeg");
+      break;
+
+    case wordend:
+      printf ("/wordend");
+
+#ifdef emacs
+    case before_dot:
+      printf ("/before_dot");
+          break;
+
+    case at_dot:
+      printf ("/at_dot");
+          break;
+
+    case after_dot:
+      printf ("/after_dot");
+          break;
+
+    case syntaxspec:
+          printf ("/syntaxspec");
+      mcnt = *p++;
+      printf ("/%d", mcnt);
+          break;
+
+    case notsyntaxspec:
+          printf ("/notsyntaxspec");
+      mcnt = *p++;
+      printf ("/%d", mcnt);
+      break;
+#endif /* emacs */
+
+    case wordchar:
+      printf ("/wordchar");
+          break;
+
+    case notwordchar:
+      printf ("/notwordchar");
+          break;
+
+    case begbuf:
+      printf ("/begbuf");
+          break;
+
+    case endbuf:
+      printf ("/endbuf");
+          break;
+
+        default:
+          printf ("?%d", *(p-1));
+    }
+    }
+  printf ("/\n");
+}
+
+
+void
+print_compiled_pattern (bufp)
+    struct re_pattern_buffer *bufp;
+{
+  unsigned char *buffer = bufp->buffer;
+
+  print_partial_compiled_pattern (buffer, buffer + bufp->used);
+  printf ("%d bytes used/%d bytes allocated.\n", bufp->used, bufp->allocated);
+
+  if (bufp->fastmap_accurate && bufp->fastmap)
+    {
+      printf ("fastmap: ");
+      print_fastmap (bufp->fastmap);
+    }
+
+  printf ("re_nsub: %d\t", bufp->re_nsub);
+  printf ("regs_alloc: %d\t", bufp->regs_allocated);
+  printf ("can_be_null: %d\t", bufp->can_be_null);
+  printf ("newline_anchor: %d\n", bufp->newline_anchor);
+  printf ("no_sub: %d\t", bufp->no_sub);
+  printf ("not_bol: %d\t", bufp->not_bol);
+  printf ("not_eol: %d\t", bufp->not_eol);
+  printf ("syntax: %d\n", bufp->syntax);
+  /* Perhaps we should print the translate table?  */
+}
+
+
+void
+print_double_string (where, string1, size1, string2, size2)
+    const char *where;
+    const char *string1;
+    const char *string2;
+    int size1;
+    int size2;
+{
+  unsigned this_char;
+
+  if (where == NULL)
+    printf ("(null)");
+  else
+    {
+      if (FIRST_STRING_P (where))
+        {
+          for (this_char = where - string1; this_char < size1; this_char++)
+            printchar (string1[this_char]);
+
+          where = string2;
+        }
+
+      for (this_char = where - string2; this_char < size2; this_char++)
+        printchar (string2[this_char]);
+    }
+}
+
+#else /* not DEBUG */
+
+#undef assert
+#define assert(e)
+
+#define DEBUG_STATEMENT(e)
+#define DEBUG_PRINT1(x)
+#define DEBUG_PRINT2(x1, x2)
+#define DEBUG_PRINT3(x1, x2, x3)
+#define DEBUG_PRINT4(x1, x2, x3, x4)
+#define DEBUG_PRINT_COMPILED_PATTERN(p, s, e)
+#define DEBUG_PRINT_DOUBLE_STRING(w, s1, sz1, s2, sz2)
+
+#endif /* not DEBUG */
+
+/* Set by `re_set_syntax' to the current regexp syntax to recognize.  Can
+   also be assigned to arbitrarily: each pattern buffer stores its own
+   syntax, so it can be changed between regex compilations.  */
+reg_syntax_t re_syntax_options = RE_SYNTAX_EMACS;
+
+
+/* Specify the precise syntax of regexps for compilation.  This provides
+   for compatibility for various utilities which historically have
+   different, incompatible syntaxes.
+
+   The argument SYNTAX is a bit mask comprised of the various bits
+   defined in regex.h.  We return the old syntax.  */
+
+reg_syntax_t
+re_set_syntax (syntax)
+    reg_syntax_t syntax;
+{
+  reg_syntax_t ret = re_syntax_options;
+
+  re_syntax_options = syntax;
+  return ret;
+}
+
+/* This table gives an error message for each of the error codes listed
+   in regex.h.  Obviously the order here has to be same as there.  */
+
+static const char *re_error_msg[] =
+  { NULL,					/* REG_NOERROR */
+    "No match",					/* REG_NOMATCH */
+    "Invalid regular expression",		/* REG_BADPAT */
+    "Invalid collation character",		/* REG_ECOLLATE */
+    "Invalid character class name",		/* REG_ECTYPE */
+    "Trailing backslash",			/* REG_EESCAPE */
+    "Invalid back reference",			/* REG_ESUBREG */
+    "Unmatched [ or [^",			/* REG_EBRACK */
+    "Unmatched ( or \\(",			/* REG_EPAREN */
+    "Unmatched \\{",				/* REG_EBRACE */
+    "Invalid content of \\{\\}",		/* REG_BADBR */
+    "Invalid range end",			/* REG_ERANGE */
+    "Memory exhausted",				/* REG_ESPACE */
+    "Invalid preceding regular expression",	/* REG_BADRPT */
+    "Premature end of regular expression",	/* REG_EEND */
+    "Regular expression too big",		/* REG_ESIZE */
+    "Unmatched ) or \\)",			/* REG_ERPAREN */
+  };
+
+/* Subroutine declarations and macros for regex_compile.  */
+
+static void store_op1 (), store_op2 ();
+static void insert_op1 (), insert_op2 ();
+static boolean at_begline_loc_p (), at_endline_loc_p ();
+static boolean group_in_compile_stack ();
+static reg_errcode_t compile_range ();
+
+/* Fetch the next character in the uncompiled pattern---translating it
+   if necessary.  Also cast from a signed character in the constant
+   string passed to us by the user to an unsigned char that we can use
+   as an array index (in, e.g., `translate').  */
+#define PATFETCH(c)							\
+  do {if (p == pend) return REG_EEND;					\
+    c = (unsigned char) *p++;						\
+    if (translate) c = translate[c]; 					\
+  } while (0)
+
+/* Fetch the next character in the uncompiled pattern, with no
+   translation.  */
+#define PATFETCH_RAW(c)							\
+  do {if (p == pend) return REG_EEND;					\
+    c = (unsigned char) *p++; 						\
+  } while (0)
+
+/* Go backwards one character in the pattern.  */
+#define PATUNFETCH p--
+
+
+/* If `translate' is non-null, return translate[D], else just D.  We
+   cast the subscript to translate because some data is declared as
+   `char *', to avoid warnings when a string constant is passed.  But
+   when we use a character as a subscript we must make it unsigned.  */
+#define TRANSLATE(d) (translate ? translate[(unsigned char) (d)] : (d))
+
+
+/* Macros for outputting the compiled pattern into `buffer'.  */
+
+/* If the buffer isn't allocated when it comes in, use this.  */
+#define INIT_BUF_SIZE  32
+
+/* Make sure we have at least N more bytes of space in buffer.  */
+#define GET_BUFFER_SPACE(n)						\
+    while (b - bufp->buffer + (n) > bufp->allocated)			\
+      EXTEND_BUFFER ()
+
+/* Make sure we have one more byte of buffer space and then add C to it.  */
+#define BUF_PUSH(c)							\
+  do {									\
+    GET_BUFFER_SPACE (1);						\
+    *b++ = (unsigned char) (c);						\
+  } while (0)
+
+
+/* Ensure we have two more bytes of buffer space and then append C1 and C2.  */
+#define BUF_PUSH_2(c1, c2)						\
+  do {									\
+    GET_BUFFER_SPACE (2);						\
+    *b++ = (unsigned char) (c1);					\
+    *b++ = (unsigned char) (c2);					\
+  } while (0)
+
+
+/* As with BUF_PUSH_2, except for three bytes.  */
+#define BUF_PUSH_3(c1, c2, c3)						\
+  do {									\
+    GET_BUFFER_SPACE (3);						\
+    *b++ = (unsigned char) (c1);					\
+    *b++ = (unsigned char) (c2);					\
+    *b++ = (unsigned char) (c3);					\
+  } while (0)
+
+
+/* Store a jump with opcode OP at LOC to location TO.  We store a
+   relative address offset by the three bytes the jump itself occupies.  */
+#define STORE_JUMP(op, loc, to) \
+  store_op1 (op, loc, (to) - (loc) - 3)
+
+/* Likewise, for a two-argument jump.  */
+#define STORE_JUMP2(op, loc, to, arg) \
+  store_op2 (op, loc, (to) - (loc) - 3, arg)
+
+/* Like `STORE_JUMP', but for inserting.  Assume `b' is the buffer end.  */
+#define INSERT_JUMP(op, loc, to) \
+  insert_op1 (op, loc, (to) - (loc) - 3, b)
+
+/* Like `STORE_JUMP2', but for inserting.  Assume `b' is the buffer end.  */
+#define INSERT_JUMP2(op, loc, to, arg) \
+  insert_op2 (op, loc, (to) - (loc) - 3, arg, b)
+
+
+/* This is not an arbitrary limit: the arguments which represent offsets
+   into the pattern are two bytes long.  So if 2^16 bytes turns out to
+   be too small, many things would have to change.  */
+#define MAX_BUF_SIZE (1L << 16)
+
+
+/* Extend the buffer by twice its current size via realloc and
+   reset the pointers that pointed into the old block to point to the
+   correct places in the new one.  If extending the buffer results in it
+   being larger than MAX_BUF_SIZE, then flag memory exhausted.  */
+#define EXTEND_BUFFER()							\
+  do { 									\
+    unsigned char *old_buffer = bufp->buffer;				\
+    if (bufp->allocated == MAX_BUF_SIZE) 				\
+      return REG_ESIZE;							\
+    bufp->allocated <<= 1;						\
+    if (bufp->allocated > MAX_BUF_SIZE)					\
+      bufp->allocated = MAX_BUF_SIZE; 					\
+    bufp->buffer = (unsigned char *) realloc (bufp->buffer, bufp->allocated);\
+    if (bufp->buffer == NULL)						\
+      return REG_ESPACE;						\
+    /* If the buffer moved, move all the pointers into it.  */		\
+    if (old_buffer != bufp->buffer)					\
+      {									\
+        b = (b - old_buffer) + bufp->buffer;				\
+        begalt = (begalt - old_buffer) + bufp->buffer;			\
+        if (fixup_alt_jump)						\
+          fixup_alt_jump = (fixup_alt_jump - old_buffer) + bufp->buffer;\
+        if (laststart)							\
+          laststart = (laststart - old_buffer) + bufp->buffer;		\
+        if (pending_exact)						\
+          pending_exact = (pending_exact - old_buffer) + bufp->buffer;	\
+      }									\
+  } while (0)
+
+
+/* Since we have one byte reserved for the register number argument to
+   {start,stop}_memory, the maximum number of groups we can report
+   things about is what fits in that byte.  */
+#define MAX_REGNUM 255
+
+/* But patterns can have more than `MAX_REGNUM' registers.  We just
+   ignore the excess.  */
+typedef unsigned regnum_t;
+
+
+/* Macros for the compile stack.  */
+
+/* Since offsets can go either forwards or backwards, this type needs to
+   be able to hold values from -(MAX_BUF_SIZE - 1) to MAX_BUF_SIZE - 1.  */
+typedef int pattern_offset_t;
+
+typedef struct
+{
+  pattern_offset_t begalt_offset;
+  pattern_offset_t fixup_alt_jump;
+  pattern_offset_t inner_group_offset;
+  pattern_offset_t laststart_offset;
+  regnum_t regnum;
+} compile_stack_elt_t;
+
+
+typedef struct
+{
+  compile_stack_elt_t *stack;
+  unsigned size;
+  unsigned avail;			/* Offset of next open position.  */
+} compile_stack_type;
+
+
+#define INIT_COMPILE_STACK_SIZE 32
+
+#define COMPILE_STACK_EMPTY  (compile_stack.avail == 0)
+#define COMPILE_STACK_FULL  (compile_stack.avail == compile_stack.size)
+
+/* The next available element.  */
+#define COMPILE_STACK_TOP (compile_stack.stack[compile_stack.avail])
+
+
+/* Set the bit for character C in a list.  */
+#define SET_LIST_BIT(c)                               \
+  (b[((unsigned char) (c)) / BYTEWIDTH]               \
+   |= 1 << (((unsigned char) c) % BYTEWIDTH))
+
+
+/* Get the next unsigned number in the uncompiled pattern.  */
+#define GET_UNSIGNED_NUMBER(num) 					\
+  { if (p != pend)							\
+     {									\
+       PATFETCH (c); 							\
+       while (ISDIGIT (c)) 						\
+         { 								\
+           if (num < 0)							\
+              num = 0;							\
+           num = num * 10 + c - '0'; 					\
+           if (p == pend) 						\
+              break; 							\
+           PATFETCH (c);						\
+         } 								\
+       } 								\
+    }
+
+#define CHAR_CLASS_MAX_LENGTH  6 /* Namely, `xdigit'.  */
+
+#define IS_CHAR_CLASS(string)						\
+   (STREQ (string, "alpha") || STREQ (string, "upper")			\
+    || STREQ (string, "lower") || STREQ (string, "digit")		\
+    || STREQ (string, "alnum") || STREQ (string, "xdigit")		\
+    || STREQ (string, "space") || STREQ (string, "print")		\
+    || STREQ (string, "punct") || STREQ (string, "graph")		\
+    || STREQ (string, "cntrl") || STREQ (string, "blank"))
+
+/* `regex_compile' compiles PATTERN (of length SIZE) according to SYNTAX.
+   Returns one of error codes defined in `regex.h', or zero for success.
+
+   Assumes the `allocated' (and perhaps `buffer') and `translate'
+   fields are set in BUFP on entry.
+
+   If it succeeds, results are put in BUFP (if it returns an error, the
+   contents of BUFP are undefined):
+     `buffer' is the compiled pattern;
+     `syntax' is set to SYNTAX;
+     `used' is set to the length of the compiled pattern;
+     `fastmap_accurate' is zero;
+     `re_nsub' is the number of subexpressions in PATTERN;
+     `not_bol' and `not_eol' are zero;
+
+   The `fastmap' and `newline_anchor' fields are neither
+   examined nor set.  */
+
+static reg_errcode_t
+regex_compile (pattern, size, syntax, bufp)
+     const char *pattern;
+     int size;
+     reg_syntax_t syntax;
+     struct re_pattern_buffer *bufp;
+{
+  /* We fetch characters from PATTERN here.  Even though PATTERN is
+     `char *' (i.e., signed), we declare these variables as unsigned, so
+     they can be reliably used as array indices.  */
+  register unsigned char c, c1;
+
+  /* A random tempory spot in PATTERN.  */
+  const char *p1;
+
+  /* Points to the end of the buffer, where we should append.  */
+  register unsigned char *b;
+
+  /* Keeps track of unclosed groups.  */
+  compile_stack_type compile_stack;
+
+  /* Points to the current (ending) position in the pattern.  */
+  const char *p = pattern;
+  const char *pend = pattern + size;
+
+  /* How to translate the characters in the pattern.  */
+  char *translate = bufp->translate;
+
+  /* Address of the count-byte of the most recently inserted `exactn'
+     command.  This makes it possible to tell if a new exact-match
+     character can be added to that command or if the character requires
+     a new `exactn' command.  */
+  unsigned char *pending_exact = 0;
+
+  /* Address of start of the most recently finished expression.
+     This tells, e.g., postfix * where to find the start of its
+     operand.  Reset at the beginning of groups and alternatives.  */
+  unsigned char *laststart = 0;
+
+  /* Address of beginning of regexp, or inside of last group.  */
+  unsigned char *begalt;
+
+  /* Place in the uncompiled pattern (i.e., the {) to
+     which to go back if the interval is invalid.  */
+  const char *beg_interval;
+
+  /* Address of the place where a forward jump should go to the end of
+     the containing expression.  Each alternative of an `or' -- except the
+     last -- ends with a forward jump of this sort.  */
+  unsigned char *fixup_alt_jump = 0;
+
+  /* Counts open-groups as they are encountered.  Remembered for the
+     matching close-group on the compile stack, so the same register
+     number is put in the stop_memory as the start_memory.  */
+  regnum_t regnum = 0;
+
+#ifdef DEBUG
+  DEBUG_PRINT1 ("\nCompiling pattern: ");
+  if (debug)
+    {
+      unsigned debug_count;
+
+      for (debug_count = 0; debug_count < size; debug_count++)
+        printchar (pattern[debug_count]);
+      putchar ('\n');
+    }
+#endif /* DEBUG */
+
+  /* Initialize the compile stack.  */
+  compile_stack.stack = TALLOC (INIT_COMPILE_STACK_SIZE, compile_stack_elt_t);
+  if (compile_stack.stack == NULL)
+    return REG_ESPACE;
+
+  compile_stack.size = INIT_COMPILE_STACK_SIZE;
+  compile_stack.avail = 0;
+
+  /* Initialize the pattern buffer.  */
+  bufp->syntax = syntax;
+  bufp->fastmap_accurate = 0;
+  bufp->not_bol = bufp->not_eol = 0;
+
+  /* Set `used' to zero, so that if we return an error, the pattern
+     printer (for debugging) will think there's no pattern.  We reset it
+     at the end.  */
+  bufp->used = 0;
+
+  /* Always count groups, whether or not bufp->no_sub is set.  */
+  bufp->re_nsub = 0;
+
+#if !defined (emacs) && !defined (SYNTAX_TABLE)
+  /* Initialize the syntax table.  */
+   init_syntax_once ();
+#endif
+
+  if (bufp->allocated == 0)
+    {
+      if (bufp->buffer)
+    { /* If zero allocated, but buffer is non-null, try to realloc
+             enough space.  This loses if buffer's address is bogus, but
+             that is the user's responsibility.  */
+          RETALLOC (bufp->buffer, INIT_BUF_SIZE, unsigned char);
+        }
+      else
+        { /* Caller did not allocate a buffer.  Do it for them.  */
+          bufp->buffer = TALLOC (INIT_BUF_SIZE, unsigned char);
+        }
+      if (!bufp->buffer) return REG_ESPACE;
+
+      bufp->allocated = INIT_BUF_SIZE;
+    }
+
+  begalt = b = bufp->buffer;
+
+  /* Loop through the uncompiled pattern until we're at the end.  */
+  while (p != pend)
+    {
+      PATFETCH (c);
+
+      switch (c)
+        {
+        case '^':
+          {
+            if (   /* If at start of pattern, it's an operator.  */
+                   p == pattern + 1
+                   /* If context independent, it's an operator.  */
+                || syntax & RE_CONTEXT_INDEP_ANCHORS
+                   /* Otherwise, depends on what's come before.  */
+                || at_begline_loc_p (pattern, p, syntax))
+              BUF_PUSH (begline);
+            else
+              goto normal_char;
+          }
+          break;
+
+
+        case '$':
+          {
+            if (   /* If at end of pattern, it's an operator.  */
+                   p == pend
+                   /* If context independent, it's an operator.  */
+                || syntax & RE_CONTEXT_INDEP_ANCHORS
+                   /* Otherwise, depends on what's next.  */
+                || at_endline_loc_p (p, pend, syntax))
+               BUF_PUSH (endline);
+             else
+               goto normal_char;
+           }
+           break;
+
+
+    case '+':
+        case '?':
+          if ((syntax & RE_BK_PLUS_QM)
+              || (syntax & RE_LIMITED_OPS))
+            goto normal_char;
+        handle_plus:
+        case '*':
+          /* If there is no previous pattern... */
+          if (!laststart)
+            {
+              if (syntax & RE_CONTEXT_INVALID_OPS)
+                return REG_BADRPT;
+              else if (!(syntax & RE_CONTEXT_INDEP_OPS))
+                goto normal_char;
+            }
+
+          {
+            /* Are we optimizing this jump?  */
+            boolean keep_string_p = false;
+
+            /* 1 means zero (many) matches is allowed.  */
+            char zero_times_ok = 0, many_times_ok = 0;
+
+            /* If there is a sequence of repetition chars, collapse it
+               down to just one (the right one).  We can't combine
+               interval operators with these because of, e.g., `a{2}*',
+               which should only match an even number of `a's.  */
+
+            for (;;)
+              {
+                zero_times_ok |= c != '+';
+                many_times_ok |= c != '?';
+
+                if (p == pend)
+                  break;
+
+                PATFETCH (c);
+
+                if (c == '*'
+                    || (!(syntax & RE_BK_PLUS_QM) && (c == '+' || c == '?')))
+                  ;
+
+                else if (syntax & RE_BK_PLUS_QM  &&  c == '\\')
+                  {
+                    if (p == pend) return REG_EESCAPE;
+
+                    PATFETCH (c1);
+                    if (!(c1 == '+' || c1 == '?'))
+                      {
+                        PATUNFETCH;
+                        PATUNFETCH;
+                        break;
+                      }
+
+                    c = c1;
+                  }
+                else
+                  {
+                    PATUNFETCH;
+                    break;
+                  }
+
+                /* If we get here, we found another repeat character.  */
+               }
+
+            /* Star, etc. applied to an empty pattern is equivalent
+               to an empty pattern.  */
+            if (!laststart)
+              break;
+
+            /* Now we know whether or not zero matches is allowed
+               and also whether or not two or more matches is allowed.  */
+            if (many_times_ok)
+              { /* More than one repetition is allowed, so put in at the
+                   end a backward relative jump from `b' to before the next
+                   jump we're going to put in below (which jumps from
+                   laststart to after this jump).
+
+                   But if we are at the `*' in the exact sequence `.*\n',
+                   insert an unconditional jump backwards to the .,
+                   instead of the beginning of the loop.  This way we only
+                   push a failure point once, instead of every time
+                   through the loop.  */
+                assert (p - 1 > pattern);
+
+                /* Allocate the space for the jump.  */
+                GET_BUFFER_SPACE (3);
+
+                /* We know we are not at the first character of the pattern,
+                   because laststart was nonzero.  And we've already
+                   incremented `p', by the way, to be the character after
+                   the `*'.  Do we have to do something analogous here
+                   for null bytes, because of RE_DOT_NOT_NULL?  */
+                if (TRANSLATE (*(p - 2)) == TRANSLATE ('.')
+            && zero_times_ok
+                    && p < pend && TRANSLATE (*p) == TRANSLATE ('\n')
+                    && !(syntax & RE_DOT_NEWLINE))
+                  { /* We have .*\n.  */
+                    STORE_JUMP (jump, b, laststart);
+                    keep_string_p = true;
+                  }
+                else
+                  /* Anything else.  */
+                  STORE_JUMP (maybe_pop_jump, b, laststart - 3);
+
+                /* We've added more stuff to the buffer.  */
+                b += 3;
+              }
+
+            /* On failure, jump from laststart to b + 3, which will be the
+               end of the buffer after this jump is inserted.  */
+            GET_BUFFER_SPACE (3);
+            INSERT_JUMP (keep_string_p ? on_failure_keep_string_jump
+                                       : on_failure_jump,
+                         laststart, b + 3);
+            pending_exact = 0;
+            b += 3;
+
+            if (!zero_times_ok)
+              {
+                /* At least one repetition is required, so insert a
+                   `dummy_failure_jump' before the initial
+                   `on_failure_jump' instruction of the loop. This
+                   effects a skip over that instruction the first time
+                   we hit that loop.  */
+                GET_BUFFER_SPACE (3);
+                INSERT_JUMP (dummy_failure_jump, laststart, laststart + 6);
+                b += 3;
+              }
+            }
+      break;
+
+
+    case '.':
+          laststart = b;
+          BUF_PUSH (anychar);
+          break;
+
+
+        case '[':
+          {
+            boolean had_char_class = false;
+
+            if (p == pend) return REG_EBRACK;
+
+            /* Ensure that we have enough space to push a charset: the
+               opcode, the length count, and the bitset; 34 bytes in all.  */
+        GET_BUFFER_SPACE (34);
+
+            laststart = b;
+
+            /* We test `*p == '^' twice, instead of using an if
+               statement, so we only need one BUF_PUSH.  */
+            BUF_PUSH (*p == '^' ? charset_not : charset);
+            if (*p == '^')
+              p++;
+
+            /* Remember the first position in the bracket expression.  */
+            p1 = p;
+
+            /* Push the number of bytes in the bitmap.  */
+            BUF_PUSH ((1 << BYTEWIDTH) / BYTEWIDTH);
+
+            /* Clear the whole map.  */
+            bzero (b, (1 << BYTEWIDTH) / BYTEWIDTH);
+
+            /* charset_not matches newline according to a syntax bit.  */
+            if ((re_opcode_t) b[-2] == charset_not
+                && (syntax & RE_HAT_LISTS_NOT_NEWLINE))
+              SET_LIST_BIT ('\n');
+
+            /* Read in characters and ranges, setting map bits.  */
+            for (;;)
+              {
+                if (p == pend) return REG_EBRACK;
+
+                PATFETCH (c);
+
+                /* \ might escape characters inside [...] and [^...].  */
+                if ((syntax & RE_BACKSLASH_ESCAPE_IN_LISTS) && c == '\\')
+                  {
+                    if (p == pend) return REG_EESCAPE;
+
+                    PATFETCH (c1);
+                    SET_LIST_BIT (c1);
+                    continue;
+                  }
+
+                /* Could be the end of the bracket expression.  If it's
+                   not (i.e., when the bracket expression is `[]' so
+                   far), the ']' character bit gets set way below.  */
+                if (c == ']' && p != p1 + 1)
+                  break;
+
+                /* Look ahead to see if it's a range when the last thing
+                   was a character class.  */
+                if (had_char_class && c == '-' && *p != ']')
+                  return REG_ERANGE;
+
+                /* Look ahead to see if it's a range when the last thing
+                   was a character: if this is a hyphen not at the
+                   beginning or the end of a list, then it's the range
+                   operator.  */
+                if (c == '-'
+                    && !(p - 2 >= pattern && p[-2] == '[')
+                    && !(p - 3 >= pattern && p[-3] == '[' && p[-2] == '^')
+                    && *p != ']')
+                  {
+                    reg_errcode_t ret
+                      = compile_range (&p, pend, translate, syntax, b);
+                    if (ret != REG_NOERROR) return ret;
+                  }
+
+                else if (p[0] == '-' && p[1] != ']')
+                  { /* This handles ranges made up of characters only.  */
+                    reg_errcode_t ret;
+
+            /* Move past the `-'.  */
+                    PATFETCH (c1);
+
+                    ret = compile_range (&p, pend, translate, syntax, b);
+                    if (ret != REG_NOERROR) return ret;
+                  }
+
+                /* See if we're at the beginning of a possible character
+                   class.  */
+
+                else if (syntax & RE_CHAR_CLASSES && c == '[' && *p == ':')
+                  { /* Leave room for the null.  */
+                    char str[CHAR_CLASS_MAX_LENGTH + 1];
+
+                    PATFETCH (c);
+                    c1 = 0;
+
+                    /* If pattern is `[[:'.  */
+                    if (p == pend) return REG_EBRACK;
+
+                    for (;;)
+                      {
+                        PATFETCH (c);
+                        if (c == ':' || c == ']' || p == pend
+                            || c1 == CHAR_CLASS_MAX_LENGTH)
+                          break;
+                        str[c1++] = c;
+                      }
+                    str[c1] = '\0';
+
+                    /* If isn't a word bracketed by `[:' and:`]':
+                       undo the ending character, the letters, and leave
+                       the leading `:' and `[' (but set bits for them).  */
+                    if (c == ':' && *p == ']')
+                      {
+                        int ch;
+                        boolean is_alnum = STREQ (str, "alnum");
+                        boolean is_alpha = STREQ (str, "alpha");
+                        boolean is_blank = STREQ (str, "blank");
+                        boolean is_cntrl = STREQ (str, "cntrl");
+                        boolean is_digit = STREQ (str, "digit");
+                        boolean is_graph = STREQ (str, "graph");
+                        boolean is_lower = STREQ (str, "lower");
+                        boolean is_print = STREQ (str, "print");
+                        boolean is_punct = STREQ (str, "punct");
+                        boolean is_space = STREQ (str, "space");
+                        boolean is_upper = STREQ (str, "upper");
+                        boolean is_xdigit = STREQ (str, "xdigit");
+
+                        if (!IS_CHAR_CLASS (str)) return REG_ECTYPE;
+
+                        /* Throw away the ] at the end of the character
+                           class.  */
+                        PATFETCH (c);
+
+                        if (p == pend) return REG_EBRACK;
+
+                        for (ch = 0; ch < 1 << BYTEWIDTH; ch++)
+                          {
+                            if (   (is_alnum  && ISALNUM (ch))
+                                || (is_alpha  && ISALPHA (ch))
+                                || (is_blank  && ISBLANK (ch))
+                                || (is_cntrl  && ISCNTRL (ch))
+                                || (is_digit  && ISDIGIT (ch))
+                                || (is_graph  && ISGRAPH (ch))
+                                || (is_lower  && ISLOWER (ch))
+                                || (is_print  && ISPRINT (ch))
+                                || (is_punct  && ISPUNCT (ch))
+                                || (is_space  && ISSPACE (ch))
+                                || (is_upper  && ISUPPER (ch))
+                                || (is_xdigit && ISXDIGIT (ch)))
+                            SET_LIST_BIT (ch);
+                          }
+                        had_char_class = true;
+                      }
+                    else
+                      {
+                        c1++;
+                        while (c1--)
+                          PATUNFETCH;
+                        SET_LIST_BIT ('[');
+                        SET_LIST_BIT (':');
+                        had_char_class = false;
+                      }
+                  }
+                else
+                  {
+                    had_char_class = false;
+                    SET_LIST_BIT (c);
+                  }
+              }
+
+            /* Discard any (non)matching list bytes that are all 0 at the
+               end of the map.  Decrease the map-length byte too.  */
+            while ((int) b[-1] > 0 && b[b[-1] - 1] == 0)
+              b[-1]--;
+            b += b[-1];
+          }
+          break;
+
+
+    case '(':
+          if (syntax & RE_NO_BK_PARENS)
+            goto handle_open;
+          else
+            goto normal_char;
+
+
+        case ')':
+          if (syntax & RE_NO_BK_PARENS)
+            goto handle_close;
+          else
+            goto normal_char;
+
+
+        case '\n':
+          if (syntax & RE_NEWLINE_ALT)
+            goto handle_alt;
+          else
+            goto normal_char;
+
+
+    case '|':
+          if (syntax & RE_NO_BK_VBAR)
+            goto handle_alt;
+          else
+            goto normal_char;
+
+
+        case '{':
+           if (syntax & RE_INTERVALS && syntax & RE_NO_BK_BRACES)
+             goto handle_interval;
+           else
+             goto normal_char;
+
+
+        case '\\':
+          if (p == pend) return REG_EESCAPE;
+
+          /* Do not translate the character after the \, so that we can
+             distinguish, e.g., \B from \b, even if we normally would
+             translate, e.g., B to b.  */
+          PATFETCH_RAW (c);
+
+          switch (c)
+            {
+            case '(':
+              if (syntax & RE_NO_BK_PARENS)
+                goto normal_backslash;
+
+            handle_open:
+              bufp->re_nsub++;
+              regnum++;
+
+              if (COMPILE_STACK_FULL)
+                {
+                  RETALLOC (compile_stack.stack, compile_stack.size << 1,
+                            compile_stack_elt_t);
+                  if (compile_stack.stack == NULL) return REG_ESPACE;
+
+                  compile_stack.size <<= 1;
+                }
+
+              /* These are the values to restore when we hit end of this
+                 group.  They are all relative offsets, so that if the
+                 whole pattern moves because of realloc, they will still
+                 be valid.  */
+              COMPILE_STACK_TOP.begalt_offset = begalt - bufp->buffer;
+              COMPILE_STACK_TOP.fixup_alt_jump
+                = fixup_alt_jump ? fixup_alt_jump - bufp->buffer + 1 : 0;
+              COMPILE_STACK_TOP.laststart_offset = b - bufp->buffer;
+              COMPILE_STACK_TOP.regnum = regnum;
+
+              /* We will eventually replace the 0 with the number of
+                 groups inner to this one.  But do not push a
+                 start_memory for groups beyond the last one we can
+                 represent in the compiled pattern.  */
+              if (regnum <= MAX_REGNUM)
+                {
+                  COMPILE_STACK_TOP.inner_group_offset = b - bufp->buffer + 2;
+                  BUF_PUSH_3 (start_memory, regnum, 0);
+                }
+
+              compile_stack.avail++;
+
+              fixup_alt_jump = 0;
+              laststart = 0;
+              begalt = b;
+          /* If we've reached MAX_REGNUM groups, then this open
+         won't actually generate any code, so we'll have to
+         clear pending_exact explicitly.  */
+          pending_exact = 0;
+              break;
+
+
+            case ')':
+              if (syntax & RE_NO_BK_PARENS) goto normal_backslash;
+
+              if (COMPILE_STACK_EMPTY)
+                if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD)
+                  goto normal_backslash;
+                else
+                  return REG_ERPAREN;
+
+            handle_close:
+              if (fixup_alt_jump)
+                { /* Push a dummy failure point at the end of the
+                     alternative for a possible future
+                     `pop_failure_jump' to pop.  See comments at
+                     `push_dummy_failure' in `re_match_2'.  */
+                  BUF_PUSH (push_dummy_failure);
+
+                  /* We allocated space for this jump when we assigned
+                     to `fixup_alt_jump', in the `handle_alt' case below.  */
+                  STORE_JUMP (jump_past_alt, fixup_alt_jump, b - 1);
+                }
+
+              /* See similar code for backslashed left paren above.  */
+              if (COMPILE_STACK_EMPTY)
+                if (syntax & RE_UNMATCHED_RIGHT_PAREN_ORD)
+                  goto normal_char;
+                else
+                  return REG_ERPAREN;
+
+              /* Since we just checked for an empty stack above, this
+                 ``can't happen''.  */
+              assert (compile_stack.avail != 0);
+              {
+                /* We don't just want to restore into `regnum', because
+                   later groups should continue to be numbered higher,
+                   as in `(ab)c(de)' -- the second group is #2.  */
+                regnum_t this_group_regnum;
+
+                compile_stack.avail--;
+                begalt = bufp->buffer + COMPILE_STACK_TOP.begalt_offset;
+                fixup_alt_jump
+                  = COMPILE_STACK_TOP.fixup_alt_jump
+                    ? bufp->buffer + COMPILE_STACK_TOP.fixup_alt_jump - 1
+                    : 0;
+                laststart = bufp->buffer + COMPILE_STACK_TOP.laststart_offset;
+                this_group_regnum = COMPILE_STACK_TOP.regnum;
+        /* If we've reached MAX_REGNUM groups, then this open
+           won't actually generate any code, so we'll have to
+           clear pending_exact explicitly.  */
+        pending_exact = 0;
+
+                /* We're at the end of the group, so now we know how many
+                   groups were inside this one.  */
+                if (this_group_regnum <= MAX_REGNUM)
+                  {
+                    unsigned char *inner_group_loc
+                      = bufp->buffer + COMPILE_STACK_TOP.inner_group_offset;
+
+                    *inner_group_loc = regnum - this_group_regnum;
+                    BUF_PUSH_3 (stop_memory, this_group_regnum,
+                                regnum - this_group_regnum);
+                  }
+              }
+              break;
+
+
+            case '|':					/* `\|'.  */
+              if (syntax & RE_LIMITED_OPS || syntax & RE_NO_BK_VBAR)
+                goto normal_backslash;
+            handle_alt:
+              if (syntax & RE_LIMITED_OPS)
+                goto normal_char;
+
+              /* Insert before the previous alternative a jump which
+                 jumps to this alternative if the former fails.  */
+              GET_BUFFER_SPACE (3);
+              INSERT_JUMP (on_failure_jump, begalt, b + 6);
+              pending_exact = 0;
+              b += 3;
+
+              /* The alternative before this one has a jump after it
+                 which gets executed if it gets matched.  Adjust that
+                 jump so it will jump to this alternative's analogous
+                 jump (put in below, which in turn will jump to the next
+                 (if any) alternative's such jump, etc.).  The last such
+                 jump jumps to the correct final destination.  A picture:
+                          _____ _____
+                          |   | |   |
+                          |   v |   v
+                         a | b   | c
+
+                 If we are at `b', then fixup_alt_jump right now points to a
+                 three-byte space after `a'.  We'll put in the jump, set
+                 fixup_alt_jump to right after `b', and leave behind three
+                 bytes which we'll fill in when we get to after `c'.  */
+
+              if (fixup_alt_jump)
+                STORE_JUMP (jump_past_alt, fixup_alt_jump, b);
+
+              /* Mark and leave space for a jump after this alternative,
+                 to be filled in later either by next alternative or
+                 when know we're at the end of a series of alternatives.  */
+              fixup_alt_jump = b;
+              GET_BUFFER_SPACE (3);
+              b += 3;
+
+              laststart = 0;
+              begalt = b;
+              break;
+
+
+            case '{':
+              /* If \{ is a literal.  */
+              if (!(syntax & RE_INTERVALS)
+                     /* If we're at `\{' and it's not the open-interval
+                        operator.  */
+                  || ((syntax & RE_INTERVALS) && (syntax & RE_NO_BK_BRACES))
+                  || (p - 2 == pattern  &&  p == pend))
+                goto normal_backslash;
+
+            handle_interval:
+              {
+                /* If got here, then the syntax allows intervals.  */
+
+                /* At least (most) this many matches must be made.  */
+                int lower_bound = -1, upper_bound = -1;
+
+                beg_interval = p - 1;
+
+                if (p == pend)
+                  {
+                    if (syntax & RE_NO_BK_BRACES)
+                      goto unfetch_interval;
+                    else
+                      return REG_EBRACE;
+                  }
+
+                GET_UNSIGNED_NUMBER (lower_bound);
+
+                if (c == ',')
+                  {
+                    GET_UNSIGNED_NUMBER (upper_bound);
+                    if (upper_bound < 0) upper_bound = RE_DUP_MAX;
+                  }
+                else
+                  /* Interval such as `{1}' => match exactly once. */
+                  upper_bound = lower_bound;
+
+                if (lower_bound < 0 || upper_bound > RE_DUP_MAX
+                    || lower_bound > upper_bound)
+                  {
+                    if (syntax & RE_NO_BK_BRACES)
+                      goto unfetch_interval;
+                    else
+                      return REG_BADBR;
+                  }
+
+                if (!(syntax & RE_NO_BK_BRACES))
+                  {
+                    if (c != '\\') return REG_EBRACE;
+
+                    PATFETCH (c);
+                  }
+
+                if (c != '}')
+                  {
+                    if (syntax & RE_NO_BK_BRACES)
+                      goto unfetch_interval;
+                    else
+                      return REG_BADBR;
+                  }
+
+                /* We just parsed a valid interval.  */
+
+                /* If it's invalid to have no preceding re.  */
+                if (!laststart)
+                  {
+                    if (syntax & RE_CONTEXT_INVALID_OPS)
+                      return REG_BADRPT;
+                    else if (syntax & RE_CONTEXT_INDEP_OPS)
+                      laststart = b;
+                    else
+                      goto unfetch_interval;
+                  }
+
+                /* If the upper bound is zero, don't want to succeed at
+                   all; jump from `laststart' to `b + 3', which will be
+                   the end of the buffer after we insert the jump.  */
+                 if (upper_bound == 0)
+                   {
+                     GET_BUFFER_SPACE (3);
+                     INSERT_JUMP (jump, laststart, b + 3);
+                     b += 3;
+                   }
+
+                 /* Otherwise, we have a nontrivial interval.  When
+                    we're all done, the pattern will look like:
+                      set_number_at <jump count> <upper bound>
+                      set_number_at <succeed_n count> <lower bound>
+                      succeed_n <after jump addr> <succed_n count>
+                      <body of loop>
+                      jump_n <succeed_n addr> <jump count>
+                    (The upper bound and `jump_n' are omitted if
+                    `upper_bound' is 1, though.)  */
+                 else
+                   { /* If the upper bound is > 1, we need to insert
+                        more at the end of the loop.  */
+                     unsigned nbytes = 10 + (upper_bound > 1) * 10;
+
+                     GET_BUFFER_SPACE (nbytes);
+
+                     /* Initialize lower bound of the `succeed_n', even
+                        though it will be set during matching by its
+                        attendant `set_number_at' (inserted next),
+                        because `re_compile_fastmap' needs to know.
+                        Jump to the `jump_n' we might insert below.  */
+                     INSERT_JUMP2 (succeed_n, laststart,
+                                   b + 5 + (upper_bound > 1) * 5,
+                                   lower_bound);
+                     b += 5;
+
+                     /* Code to initialize the lower bound.  Insert
+                        before the `succeed_n'.  The `5' is the last two
+                        bytes of this `set_number_at', plus 3 bytes of
+                        the following `succeed_n'.  */
+                     insert_op2 (set_number_at, laststart, 5, lower_bound, b);
+                     b += 5;
+
+                     if (upper_bound > 1)
+                       { /* More than one repetition is allowed, so
+                            append a backward jump to the `succeed_n'
+                            that starts this interval.
+
+                            When we've reached this during matching,
+                            we'll have matched the interval once, so
+                            jump back only `upper_bound - 1' times.  */
+                         STORE_JUMP2 (jump_n, b, laststart + 5,
+                                      upper_bound - 1);
+                         b += 5;
+
+                         /* The location we want to set is the second
+                            parameter of the `jump_n'; that is `b-2' as
+                            an absolute address.  `laststart' will be
+                            the `set_number_at' we're about to insert;
+                            `laststart+3' the number to set, the source
+                            for the relative address.  But we are
+                            inserting into the middle of the pattern --
+                            so everything is getting moved up by 5.
+                            Conclusion: (b - 2) - (laststart + 3) + 5,
+                            i.e., b - laststart.
+
+                            We insert this at the beginning of the loop
+                            so that if we fail during matching, we'll
+                            reinitialize the bounds.  */
+                         insert_op2 (set_number_at, laststart, b - laststart,
+                                     upper_bound - 1, b);
+                         b += 5;
+                       }
+                   }
+                pending_exact = 0;
+                beg_interval = NULL;
+              }
+              break;
+
+            unfetch_interval:
+              /* If an invalid interval, match the characters as literals.  */
+               assert (beg_interval);
+               p = beg_interval;
+               beg_interval = NULL;
+
+               /* normal_char and normal_backslash need `c'.  */
+               PATFETCH (c);
+
+               if (!(syntax & RE_NO_BK_BRACES))
+                 {
+                   if (p > pattern  &&  p[-1] == '\\')
+                     goto normal_backslash;
+                 }
+               goto normal_char;
+
+#ifdef emacs
+            /* There is no way to specify the before_dot and after_dot
+               operators.  rms says this is ok.  --karl  */
+            case '=':
+              BUF_PUSH (at_dot);
+              break;
+
+            case 's':
+              laststart = b;
+              PATFETCH (c);
+              BUF_PUSH_2 (syntaxspec, syntax_spec_code[c]);
+              break;
+
+            case 'S':
+              laststart = b;
+              PATFETCH (c);
+              BUF_PUSH_2 (notsyntaxspec, syntax_spec_code[c]);
+              break;
+#endif /* emacs */
+
+
+            case 'w':
+              laststart = b;
+              BUF_PUSH (wordchar);
+              break;
+
+
+            case 'W':
+              laststart = b;
+              BUF_PUSH (notwordchar);
+              break;
+
+
+            case '<':
+              BUF_PUSH (wordbeg);
+              break;
+
+            case '>':
+              BUF_PUSH (wordend);
+              break;
+
+            case 'b':
+              BUF_PUSH (wordbound);
+              break;
+
+            case 'B':
+              BUF_PUSH (notwordbound);
+              break;
+
+            case '`':
+              BUF_PUSH (begbuf);
+              break;
+
+            case '\'':
+              BUF_PUSH (endbuf);
+              break;
+
+            case '1': case '2': case '3': case '4': case '5':
+            case '6': case '7': case '8': case '9':
+              if (syntax & RE_NO_BK_REFS)
+                goto normal_char;
+
+              c1 = c - '0';
+
+              if (c1 > regnum)
+                return REG_ESUBREG;
+
+              /* Can't back reference to a subexpression if inside of it.  */
+              if (group_in_compile_stack (compile_stack, c1))
+                goto normal_char;
+
+              laststart = b;
+              BUF_PUSH_2 (duplicate, c1);
+              break;
+
+
+            case '+':
+            case '?':
+              if (syntax & RE_BK_PLUS_QM)
+                goto handle_plus;
+              else
+                goto normal_backslash;
+
+            default:
+            normal_backslash:
+              /* You might think it would be useful for \ to mean
+                 not to translate; but if we don't translate it
+                 it will never match anything.  */
+              c = TRANSLATE (c);
+              goto normal_char;
+            }
+          break;
+
+
+    default:
+        /* Expects the character in `c'.  */
+    normal_char:
+          /* If no exactn currently being built.  */
+          if (!pending_exact
+
+              /* If last exactn not at current position.  */
+              || pending_exact + *pending_exact + 1 != b
+
+              /* We have only one byte following the exactn for the count.  */
+          || *pending_exact == (1 << BYTEWIDTH) - 1
+
+              /* If followed by a repetition operator.  */
+              || *p == '*' || *p == '^'
+          || ((syntax & RE_BK_PLUS_QM)
+          ? *p == '\\' && (p[1] == '+' || p[1] == '?')
+          : (*p == '+' || *p == '?'))
+          || ((syntax & RE_INTERVALS)
+                  && ((syntax & RE_NO_BK_BRACES)
+              ? *p == '{'
+                      : (p[0] == '\\' && p[1] == '{'))))
+        {
+          /* Start building a new exactn.  */
+
+              laststart = b;
+
+          BUF_PUSH_2 (exactn, 0);
+          pending_exact = b - 1;
+            }
+
+      BUF_PUSH (c);
+          (*pending_exact)++;
+      break;
+        } /* switch (c) */
+    } /* while p != pend */
+
+
+  /* Through the pattern now.  */
+
+  if (fixup_alt_jump)
+    STORE_JUMP (jump_past_alt, fixup_alt_jump, b);
+
+  if (!COMPILE_STACK_EMPTY)
+    return REG_EPAREN;
+
+  free (compile_stack.stack);
+
+  /* We have succeeded; set the length of the buffer.  */
+  bufp->used = b - bufp->buffer;
+
+#ifdef DEBUG
+  if (debug)
+    {
+      DEBUG_PRINT1 ("\nCompiled pattern: ");
+      print_compiled_pattern (bufp);
+    }
+#endif /* DEBUG */
+
+  return REG_NOERROR;
+} /* regex_compile */
+
+/* Subroutines for `regex_compile'.  */
+
+/* Store OP at LOC followed by two-byte integer parameter ARG.  */
+
+static void
+store_op1 (op, loc, arg)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg;
+{
+  *loc = (unsigned char) op;
+  STORE_NUMBER (loc + 1, arg);
+}
+
+
+/* Like `store_op1', but for two two-byte parameters ARG1 and ARG2.  */
+
+static void
+store_op2 (op, loc, arg1, arg2)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg1, arg2;
+{
+  *loc = (unsigned char) op;
+  STORE_NUMBER (loc + 1, arg1);
+  STORE_NUMBER (loc + 3, arg2);
+}
+
+
+/* Copy the bytes from LOC to END to open up three bytes of space at LOC
+   for OP followed by two-byte integer parameter ARG.  */
+
+static void
+insert_op1 (op, loc, arg, end)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg;
+    unsigned char *end;
+{
+  register unsigned char *pfrom = end;
+  register unsigned char *pto = end + 3;
+
+  while (pfrom != loc)
+    *--pto = *--pfrom;
+
+  store_op1 (op, loc, arg);
+}
+
+
+/* Like `insert_op1', but for two two-byte parameters ARG1 and ARG2.  */
+
+static void
+insert_op2 (op, loc, arg1, arg2, end)
+    re_opcode_t op;
+    unsigned char *loc;
+    int arg1, arg2;
+    unsigned char *end;
+{
+  register unsigned char *pfrom = end;
+  register unsigned char *pto = end + 5;
+
+  while (pfrom != loc)
+    *--pto = *--pfrom;
+
+  store_op2 (op, loc, arg1, arg2);
+}
+
+
+/* P points to just after a ^ in PATTERN.  Return true if that ^ comes
+   after an alternative or a begin-subexpression.  We assume there is at
+   least one character before the ^.  */
+
+static boolean
+at_begline_loc_p (pattern, p, syntax)
+    const char *pattern, *p;
+    reg_syntax_t syntax;
+{
+  const char *prev = p - 2;
+  boolean prev_prev_backslash = prev > pattern && prev[-1] == '\\';
+
+  return
+       /* After a subexpression?  */
+       (*prev == '(' && (syntax & RE_NO_BK_PARENS || prev_prev_backslash))
+       /* After an alternative?  */
+    || (*prev == '|' && (syntax & RE_NO_BK_VBAR || prev_prev_backslash));
+}
+
+
+/* The dual of at_begline_loc_p.  This one is for $.  We assume there is
+   at least one character after the $, i.e., `P < PEND'.  */
+
+static boolean
+at_endline_loc_p (p, pend, syntax)
+    const char *p, *pend;
+    int syntax;
+{
+  const char *next = p;
+  boolean next_backslash = *next == '\\';
+  const char *next_next = p + 1 < pend ? p + 1 : NULL;
+
+  return
+       /* Before a subexpression?  */
+       (syntax & RE_NO_BK_PARENS ? *next == ')'
+        : next_backslash && next_next && *next_next == ')')
+       /* Before an alternative?  */
+    || (syntax & RE_NO_BK_VBAR ? *next == '|'
+        : next_backslash && next_next && *next_next == '|');
+}
+
+
+/* Returns true if REGNUM is in one of COMPILE_STACK's elements and
+   false if it's not.  */
+
+static boolean
+group_in_compile_stack (compile_stack, regnum)
+    compile_stack_type compile_stack;
+    regnum_t regnum;
+{
+  int this_element;
+
+  for (this_element = compile_stack.avail - 1;
+       this_element >= 0;
+       this_element--)
+    if (compile_stack.stack[this_element].regnum == regnum)
+      return true;
+
+  return false;
+}
+
+
+/* Read the ending character of a range (in a bracket expression) from the
+   uncompiled pattern *P_PTR (which ends at PEND).  We assume the
+   starting character is in `P[-2]'.  (`P[-1]' is the character `-'.)
+   Then we set the translation of all bits between the starting and
+   ending characters (inclusive) in the compiled pattern B.
+
+   Return an error code.
+
+   We use these short variable names so we can use the same macros as
+   `regex_compile' itself.  */
+
+static reg_errcode_t
+compile_range (p_ptr, pend, translate, syntax, b)
+    const char **p_ptr, *pend;
+    char *translate;
+    reg_syntax_t syntax;
+    unsigned char *b;
+{
+  unsigned this_char;
+
+  const char *p = *p_ptr;
+  int range_start, range_end;
+
+  if (p == pend)
+    return REG_ERANGE;
+
+  /* Even though the pattern is a signed `char *', we need to fetch
+     with unsigned char *'s; if the high bit of the pattern character
+     is set, the range endpoints will be negative if we fetch using a
+     signed char *.
+
+     We also want to fetch the endpoints without translating them; the
+     appropriate translation is done in the bit-setting loop below.  */
+  range_start = ((unsigned char *) p)[-2];
+  range_end   = ((unsigned char *) p)[0];
+
+  /* Have to increment the pointer into the pattern string, so the
+     caller isn't still at the ending character.  */
+  (*p_ptr)++;
+
+  /* If the start is after the end, the range is empty.  */
+  if (range_start > range_end)
+    return syntax & RE_NO_EMPTY_RANGES ? REG_ERANGE : REG_NOERROR;
+
+  /* Here we see why `this_char' has to be larger than an `unsigned
+     char' -- the range is inclusive, so if `range_end' == 0xff
+     (assuming 8-bit characters), we would otherwise go into an infinite
+     loop, since all characters <= 0xff.  */
+  for (this_char = range_start; this_char <= range_end; this_char++)
+    {
+      SET_LIST_BIT (TRANSLATE (this_char));
+    }
+
+  return REG_NOERROR;
+}
+
+/* Failure stack declarations and macros; both re_compile_fastmap and
+   re_match_2 use a failure stack.  These have to be macros because of
+   REGEX_ALLOCATE.  */
+
+
+/* Number of failure points for which to initially allocate space
+   when matching.  If this number is exceeded, we allocate more
+   space, so it is not a hard limit.  */
+#ifndef INIT_FAILURE_ALLOC
+#define INIT_FAILURE_ALLOC 5
+#endif
+
+/* Roughly the maximum number of failure points on the stack.  Would be
+   exactly that if always used MAX_FAILURE_SPACE each time we failed.
+   This is a variable only so users of regex can assign to it; we never
+   change it ourselves.  */
+int re_max_failures = 2000;
+
+typedef const unsigned char *fail_stack_elt_t;
+
+typedef struct
+{
+  fail_stack_elt_t *stack;
+  unsigned size;
+  unsigned avail;			/* Offset of next open position.  */
+} fail_stack_type;
+
+#define FAIL_STACK_EMPTY()     (fail_stack.avail == 0)
+#define FAIL_STACK_PTR_EMPTY() (fail_stack_ptr->avail == 0)
+#define FAIL_STACK_FULL()      (fail_stack.avail == fail_stack.size)
+#define FAIL_STACK_TOP()       (fail_stack.stack[fail_stack.avail])
+
+
+/* Initialize `fail_stack'.  Do `return -2' if the alloc fails.  */
+
+#define INIT_FAIL_STACK()						\
+  do {									\
+    fail_stack.stack = (fail_stack_elt_t *)				\
+      REGEX_ALLOCATE (INIT_FAILURE_ALLOC * sizeof (fail_stack_elt_t));	\
+                                    \
+    if (fail_stack.stack == NULL)					\
+      return -2;							\
+                                    \
+    fail_stack.size = INIT_FAILURE_ALLOC;				\
+    fail_stack.avail = 0;						\
+  } while (0)
+
+
+/* Double the size of FAIL_STACK, up to approximately `re_max_failures' items.
+
+   Return 1 if succeeds, and 0 if either ran out of memory
+   allocating space for it or it was already too large.
+
+   REGEX_REALLOCATE requires `destination' be declared.   */
+
+#define DOUBLE_FAIL_STACK(fail_stack)					\
+  ((fail_stack).size > re_max_failures * MAX_FAILURE_ITEMS		\
+   ? 0									\
+   : ((fail_stack).stack = (fail_stack_elt_t *)				\
+        REGEX_REALLOCATE ((fail_stack).stack, 				\
+          (fail_stack).size * sizeof (fail_stack_elt_t),		\
+          ((fail_stack).size << 1) * sizeof (fail_stack_elt_t)),	\
+                                    \
+      (fail_stack).stack == NULL					\
+      ? 0								\
+      : ((fail_stack).size <<= 1, 					\
+         1)))
+
+
+/* Push PATTERN_OP on FAIL_STACK.
+
+   Return 1 if was able to do so and 0 if ran out of memory allocating
+   space to do so.  */
+#define PUSH_PATTERN_OP(pattern_op, fail_stack)				\
+  ((FAIL_STACK_FULL ()							\
+    && !DOUBLE_FAIL_STACK (fail_stack))					\
+    ? 0									\
+    : ((fail_stack).stack[(fail_stack).avail++] = pattern_op,		\
+       1))
+
+/* This pushes an item onto the failure stack.  Must be a four-byte
+   value.  Assumes the variable `fail_stack'.  Probably should only
+   be called from within `PUSH_FAILURE_POINT'.  */
+#define PUSH_FAILURE_ITEM(item)						\
+  fail_stack.stack[fail_stack.avail++] = (fail_stack_elt_t) item
+
+/* The complement operation.  Assumes `fail_stack' is nonempty.  */
+#define POP_FAILURE_ITEM() fail_stack.stack[--fail_stack.avail]
+
+/* Used to omit pushing failure point id's when we're not debugging.  */
+#ifdef DEBUG
+#define DEBUG_PUSH PUSH_FAILURE_ITEM
+#define DEBUG_POP(item_addr) *(item_addr) = POP_FAILURE_ITEM ()
+#else
+#define DEBUG_PUSH(item)
+#define DEBUG_POP(item_addr)
+#endif
+
+
+/* Push the information about the state we will need
+   if we ever fail back to it.
+
+   Requires variables fail_stack, regstart, regend, reg_info, and
+   num_regs be declared.  DOUBLE_FAIL_STACK requires `destination' be
+   declared.
+
+   Does `return FAILURE_CODE' if runs out of memory.  */
+
+#define PUSH_FAILURE_POINT(pattern_place, string_place, failure_code)	\
+  do {									\
+    char *destination;							\
+    /* Must be int, so when we don't save any registers, the arithmetic	\
+       of 0 + -1 isn't done as unsigned.  */				\
+    int this_reg;							\
+                                        \
+    DEBUG_STATEMENT (failure_id++);					\
+    DEBUG_STATEMENT (nfailure_points_pushed++);				\
+    DEBUG_PRINT2 ("\nPUSH_FAILURE_POINT #%u:\n", failure_id);		\
+    DEBUG_PRINT2 ("  Before push, next avail: %d\n", (fail_stack).avail);\
+    DEBUG_PRINT2 ("                     size: %d\n", (fail_stack).size);\
+                                    \
+    DEBUG_PRINT2 ("  slots needed: %d\n", NUM_FAILURE_ITEMS);		\
+    DEBUG_PRINT2 ("     available: %d\n", REMAINING_AVAIL_SLOTS);	\
+                                    \
+    /* Ensure we have enough space allocated for what we will push.  */	\
+    while (REMAINING_AVAIL_SLOTS < NUM_FAILURE_ITEMS)			\
+      {									\
+        if (!DOUBLE_FAIL_STACK (fail_stack))			\
+          return failure_code;						\
+                                    \
+        DEBUG_PRINT2 ("\n  Doubled stack; size now: %d\n",		\
+               (fail_stack).size);				\
+        DEBUG_PRINT2 ("  slots available: %d\n", REMAINING_AVAIL_SLOTS);\
+      }									\
+                                    \
+    /* Push the info, starting with the registers.  */			\
+    DEBUG_PRINT1 ("\n");						\
+                                    \
+    for (this_reg = lowest_active_reg; this_reg <= highest_active_reg;	\
+         this_reg++)							\
+      {									\
+    DEBUG_PRINT2 ("  Pushing reg: %d\n", this_reg);			\
+        DEBUG_STATEMENT (num_regs_pushed++);				\
+                                    \
+    DEBUG_PRINT2 ("    start: 0x%x\n", regstart[this_reg]);		\
+        PUSH_FAILURE_ITEM (regstart[this_reg]);				\
+                                                                        \
+    DEBUG_PRINT2 ("    end: 0x%x\n", regend[this_reg]);		\
+        PUSH_FAILURE_ITEM (regend[this_reg]);				\
+                                    \
+    DEBUG_PRINT2 ("    info: 0x%x\n      ", reg_info[this_reg]);	\
+        DEBUG_PRINT2 (" match_null=%d",					\
+                      REG_MATCH_NULL_STRING_P (reg_info[this_reg]));	\
+        DEBUG_PRINT2 (" active=%d", IS_ACTIVE (reg_info[this_reg]));	\
+        DEBUG_PRINT2 (" matched_something=%d",				\
+                      MATCHED_SOMETHING (reg_info[this_reg]));		\
+        DEBUG_PRINT2 (" ever_matched=%d",				\
+                      EVER_MATCHED_SOMETHING (reg_info[this_reg]));	\
+    DEBUG_PRINT1 ("\n");						\
+        PUSH_FAILURE_ITEM (reg_info[this_reg].word);			\
+      }									\
+                                    \
+    DEBUG_PRINT2 ("  Pushing  low active reg: %d\n", lowest_active_reg);\
+    PUSH_FAILURE_ITEM (lowest_active_reg);				\
+                                    \
+    DEBUG_PRINT2 ("  Pushing high active reg: %d\n", highest_active_reg);\
+    PUSH_FAILURE_ITEM (highest_active_reg);				\
+                                    \
+    DEBUG_PRINT2 ("  Pushing pattern 0x%x: ", pattern_place);		\
+    DEBUG_PRINT_COMPILED_PATTERN (bufp, pattern_place, pend);		\
+    PUSH_FAILURE_ITEM (pattern_place);					\
+                                    \
+    DEBUG_PRINT2 ("  Pushing string 0x%x: `", string_place);		\
+    DEBUG_PRINT_DOUBLE_STRING (string_place, string1, size1, string2,   \
+                 size2);				\
+    DEBUG_PRINT1 ("'\n");						\
+    PUSH_FAILURE_ITEM (string_place);					\
+                                    \
+    DEBUG_PRINT2 ("  Pushing failure id: %u\n", failure_id);		\
+    DEBUG_PUSH (failure_id);						\
+  } while (0)
+
+/* This is the number of items that are pushed and popped on the stack
+   for each register.  */
+#define NUM_REG_ITEMS  3
+
+/* Individual items aside from the registers.  */
+#ifdef DEBUG
+#define NUM_NONREG_ITEMS 5 /* Includes failure point id.  */
+#else
+#define NUM_NONREG_ITEMS 4
+#endif
+
+/* We push at most this many items on the stack.  */
+#define MAX_FAILURE_ITEMS ((num_regs - 1) * NUM_REG_ITEMS + NUM_NONREG_ITEMS)
+
+/* We actually push this many items.  */
+#define NUM_FAILURE_ITEMS						\
+  ((highest_active_reg - lowest_active_reg + 1) * NUM_REG_ITEMS 	\
+    + NUM_NONREG_ITEMS)
+
+/* How many items can still be added to the stack without overflowing it.  */
+#define REMAINING_AVAIL_SLOTS ((fail_stack).size - (fail_stack).avail)
+
+
+/* Pops what PUSH_FAIL_STACK pushes.
+
+   We restore into the parameters, all of which should be lvalues:
+     STR -- the saved data position.
+     PAT -- the saved pattern position.
+     LOW_REG, HIGH_REG -- the highest and lowest active registers.
+     REGSTART, REGEND -- arrays of string positions.
+     REG_INFO -- array of information about each subexpression.
+
+   Also assumes the variables `fail_stack' and (if debugging), `bufp',
+   `pend', `string1', `size1', `string2', and `size2'.  */
+
+#define POP_FAILURE_POINT(str, pat, low_reg, high_reg, regstart, regend, reg_info)\
+{									\
+  DEBUG_STATEMENT (fail_stack_elt_t failure_id;)			\
+  int this_reg;								\
+  const unsigned char *string_temp;					\
+                                    \
+  assert (!FAIL_STACK_EMPTY ());					\
+                                    \
+  /* Remove failure points and point to how many regs pushed.  */	\
+  DEBUG_PRINT1 ("POP_FAILURE_POINT:\n");				\
+  DEBUG_PRINT2 ("  Before pop, next avail: %d\n", fail_stack.avail);	\
+  DEBUG_PRINT2 ("                    size: %d\n", fail_stack.size);	\
+                                    \
+  assert (fail_stack.avail >= NUM_NONREG_ITEMS);			\
+                                    \
+  DEBUG_POP (&failure_id);						\
+  DEBUG_PRINT2 ("  Popping failure id: %u\n", failure_id);		\
+                                    \
+  /* If the saved string location is NULL, it came from an		\
+     on_failure_keep_string_jump opcode, and we want to throw away the	\
+     saved NULL, thus retaining our current position in the string.  */	\
+  string_temp = POP_FAILURE_ITEM ();					\
+  if (string_temp != NULL)						\
+    str = (const char *) string_temp;					\
+                                    \
+  DEBUG_PRINT2 ("  Popping string 0x%x: `", str);			\
+  DEBUG_PRINT_DOUBLE_STRING (str, string1, size1, string2, size2);	\
+  DEBUG_PRINT1 ("'\n");							\
+                                    \
+  pat = (unsigned char *) POP_FAILURE_ITEM ();				\
+  DEBUG_PRINT2 ("  Popping pattern 0x%x: ", pat);			\
+  DEBUG_PRINT_COMPILED_PATTERN (bufp, pat, pend);			\
+                                    \
+  /* Restore register info.  */						\
+  high_reg = (unsigned) POP_FAILURE_ITEM ();				\
+  DEBUG_PRINT2 ("  Popping high active reg: %d\n", high_reg);		\
+                                    \
+  low_reg = (unsigned) POP_FAILURE_ITEM ();				\
+  DEBUG_PRINT2 ("  Popping  low active reg: %d\n", low_reg);		\
+                                    \
+  for (this_reg = high_reg; this_reg >= low_reg; this_reg--)		\
+    {									\
+      DEBUG_PRINT2 ("    Popping reg: %d\n", this_reg);			\
+                                    \
+      reg_info[this_reg].word = POP_FAILURE_ITEM ();			\
+      DEBUG_PRINT2 ("      info: 0x%x\n", reg_info[this_reg]);		\
+                                    \
+      regend[this_reg] = (const char *) POP_FAILURE_ITEM ();		\
+      DEBUG_PRINT2 ("      end: 0x%x\n", regend[this_reg]);		\
+                                    \
+      regstart[this_reg] = (const char *) POP_FAILURE_ITEM ();		\
+      DEBUG_PRINT2 ("      start: 0x%x\n", regstart[this_reg]);		\
+    }									\
+                                    \
+  DEBUG_STATEMENT (nfailure_points_popped++);				\
+} /* POP_FAILURE_POINT */
+
+/* re_compile_fastmap computes a ``fastmap'' for the compiled pattern in
+   BUFP.  A fastmap records which of the (1 << BYTEWIDTH) possible
+   characters can start a string that matches the pattern.  This fastmap
+   is used by re_search to skip quickly over impossible starting points.
+
+   The caller must supply the address of a (1 << BYTEWIDTH)-byte data
+   area as BUFP->fastmap.
+
+   We set the `fastmap', `fastmap_accurate', and `can_be_null' fields in
+   the pattern buffer.
+
+   Returns 0 if we succeed, -2 if an internal error.   */
+
+int
+re_compile_fastmap (bufp)
+     struct re_pattern_buffer *bufp;
+{
+  int j, k;
+  fail_stack_type fail_stack;
+#ifndef REGEX_MALLOC
+  char *destination;
+#endif
+  /* We don't push any register information onto the failure stack.  */
+  unsigned num_regs = 0;
+
+  register char *fastmap = bufp->fastmap;
+  unsigned char *pattern = bufp->buffer;
+  unsigned long size = bufp->used;
+  const unsigned char *p = pattern;
+  register unsigned char *pend = pattern + size;
+
+  /* Assume that each path through the pattern can be null until
+     proven otherwise.  We set this false at the bottom of switch
+     statement, to which we get only if a particular path doesn't
+     match the empty string.  */
+  boolean path_can_be_null = true;
+
+  /* We aren't doing a `succeed_n' to begin with.  */
+  boolean succeed_n_p = false;
+
+  assert (fastmap != NULL && p != NULL);
+
+  INIT_FAIL_STACK ();
+  bzero (fastmap, 1 << BYTEWIDTH);  /* Assume nothing's valid.  */
+  bufp->fastmap_accurate = 1;	    /* It will be when we're done.  */
+  bufp->can_be_null = 0;
+
+  while (p != pend || !FAIL_STACK_EMPTY ())
+    {
+      if (p == pend)
+        {
+          bufp->can_be_null |= path_can_be_null;
+
+          /* Reset for next path.  */
+          path_can_be_null = true;
+
+          p = fail_stack.stack[--fail_stack.avail];
+    }
+
+      /* We should never be about to go beyond the end of the pattern.  */
+      assert (p < pend);
+
+#ifdef SWITCH_ENUM_BUG
+      switch ((int) ((re_opcode_t) *p++))
+#else
+      switch ((re_opcode_t) *p++)
+#endif
+    {
+
+        /* I guess the idea here is to simply not bother with a fastmap
+           if a backreference is used, since it's too hard to figure out
+           the fastmap for the corresponding group.  Setting
+           `can_be_null' stops `re_search_2' from using the fastmap, so
+           that is all we do.  */
+    case duplicate:
+      bufp->can_be_null = 1;
+          return 0;
+
+
+      /* Following are the cases which match a character.  These end
+         with `break'.  */
+
+    case exactn:
+          fastmap[p[1]] = 1;
+      break;
+
+
+        case charset:
+          for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
+        if (p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH)))
+              fastmap[j] = 1;
+      break;
+
+
+    case charset_not:
+      /* Chars beyond end of map must be allowed.  */
+      for (j = *p * BYTEWIDTH; j < (1 << BYTEWIDTH); j++)
+            fastmap[j] = 1;
+
+      for (j = *p++ * BYTEWIDTH - 1; j >= 0; j--)
+        if (!(p[j / BYTEWIDTH] & (1 << (j % BYTEWIDTH))))
+              fastmap[j] = 1;
+          break;
+
+
+    case wordchar:
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) == Sword)
+          fastmap[j] = 1;
+      break;
+
+
+    case notwordchar:
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) != Sword)
+          fastmap[j] = 1;
+      break;
+
+
+        case anychar:
+          /* `.' matches anything ...  */
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+            fastmap[j] = 1;
+
+          /* ... except perhaps newline.  */
+          if (!(bufp->syntax & RE_DOT_NEWLINE))
+            fastmap['\n'] = 0;
+
+          /* Return if we have already set `can_be_null'; if we have,
+             then the fastmap is irrelevant.  Something's wrong here.  */
+      else if (bufp->can_be_null)
+        return 0;
+
+          /* Otherwise, have to check alternative paths.  */
+      break;
+
+
+#ifdef emacs
+        case syntaxspec:
+      k = *p++;
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) == (enum syntaxcode) k)
+          fastmap[j] = 1;
+      break;
+
+
+    case notsyntaxspec:
+      k = *p++;
+      for (j = 0; j < (1 << BYTEWIDTH); j++)
+        if (SYNTAX (j) != (enum syntaxcode) k)
+          fastmap[j] = 1;
+      break;
+
+
+      /* All cases after this match the empty string.  These end with
+         `continue'.  */
+
+
+    case before_dot:
+    case at_dot:
+    case after_dot:
+          continue;
+#endif /* not emacs */
+
+
+        case no_op:
+        case begline:
+        case endline:
+    case begbuf:
+    case endbuf:
+    case wordbound:
+    case notwordbound:
+    case wordbeg:
+    case wordend:
+        case push_dummy_failure:
+          continue;
+
+
+    case jump_n:
+        case pop_failure_jump:
+    case maybe_pop_jump:
+    case jump:
+        case jump_past_alt:
+    case dummy_failure_jump:
+          EXTRACT_NUMBER_AND_INCR (j, p);
+      p += j;
+      if (j > 0)
+        continue;
+
+          /* Jump backward implies we just went through the body of a
+             loop and matched nothing.  Opcode jumped to should be
+             `on_failure_jump' or `succeed_n'.  Just treat it like an
+             ordinary jump.  For a * loop, it has pushed its failure
+             point already; if so, discard that as redundant.  */
+          if ((re_opcode_t) *p != on_failure_jump
+          && (re_opcode_t) *p != succeed_n)
+        continue;
+
+          p++;
+          EXTRACT_NUMBER_AND_INCR (j, p);
+          p += j;
+
+          /* If what's on the stack is where we are now, pop it.  */
+          if (!FAIL_STACK_EMPTY ()
+          && fail_stack.stack[fail_stack.avail - 1] == p)
+            fail_stack.avail--;
+
+          continue;
+
+
+        case on_failure_jump:
+        case on_failure_keep_string_jump:
+    handle_on_failure_jump:
+          EXTRACT_NUMBER_AND_INCR (j, p);
+
+          /* For some patterns, e.g., `(a?)?', `p+j' here points to the
+             end of the pattern.  We don't want to push such a point,
+             since when we restore it above, entering the switch will
+             increment `p' past the end of the pattern.  We don't need
+             to push such a point since we obviously won't find any more
+             fastmap entries beyond `pend'.  Such a pattern can match
+             the null string, though.  */
+          if (p + j < pend)
+            {
+              if (!PUSH_PATTERN_OP (p + j, fail_stack))
+                return -2;
+            }
+          else
+            bufp->can_be_null = 1;
+
+          if (succeed_n_p)
+            {
+              EXTRACT_NUMBER_AND_INCR (k, p);	/* Skip the n.  */
+              succeed_n_p = false;
+        }
+
+          continue;
+
+
+    case succeed_n:
+          /* Get to the number of times to succeed.  */
+          p += 2;
+
+          /* Increment p past the n for when k != 0.  */
+          EXTRACT_NUMBER_AND_INCR (k, p);
+          if (k == 0)
+        {
+              p -= 4;
+          succeed_n_p = true;  /* Spaghetti code alert.  */
+              goto handle_on_failure_jump;
+            }
+          continue;
+
+
+    case set_number_at:
+          p += 4;
+          continue;
+
+
+    case start_memory:
+        case stop_memory:
+      p += 2;
+      continue;
+
+
+    default:
+          abort (); /* We have listed all the cases.  */
+        } /* switch *p++ */
+
+      /* Getting here means we have found the possible starting
+         characters for one path of the pattern -- and that the empty
+         string does not match.  We need not follow this path further.
+         Instead, look at the next alternative (remembered on the
+         stack), or quit if no more.  The test at the top of the loop
+         does these things.  */
+      path_can_be_null = false;
+      p = pend;
+    } /* while p */
+
+  /* Set `can_be_null' for the last path (also the first path, if the
+     pattern is empty).  */
+  bufp->can_be_null |= path_can_be_null;
+  return 0;
+} /* re_compile_fastmap */
+
+/* Set REGS to hold NUM_REGS registers, storing them in STARTS and
+   ENDS.  Subsequent matches using PATTERN_BUFFER and REGS will use
+   this memory for recording register information.  STARTS and ENDS
+   must be allocated using the malloc library routine, and must each
+   be at least NUM_REGS * sizeof (regoff_t) bytes long.
+
+   If NUM_REGS == 0, then subsequent matches should allocate their own
+   register data.
+
+   Unless this function is called, the first search or match using
+   PATTERN_BUFFER will allocate its own register data, without
+   freeing the old data.  */
+
+void
+re_set_registers (bufp, regs, num_regs, starts, ends)
+    struct re_pattern_buffer *bufp;
+    struct re_registers *regs;
+    unsigned num_regs;
+    regoff_t *starts, *ends;
+{
+  if (num_regs)
+    {
+      bufp->regs_allocated = REGS_REALLOCATE;
+      regs->num_regs = num_regs;
+      regs->start = starts;
+      regs->end = ends;
+    }
+  else
+    {
+      bufp->regs_allocated = REGS_UNALLOCATED;
+      regs->num_regs = 0;
+      regs->start = regs->end = (regoff_t) 0;
+    }
+}
+
+/* Searching routines.  */
+
+/* Like re_search_2, below, but only one string is specified, and
+   doesn't let you say where to stop matching. */
+
+int
+re_search (bufp, string, size, startpos, range, regs)
+     struct re_pattern_buffer *bufp;
+     const char *string;
+     int size, startpos, range;
+     struct re_registers *regs;
+{
+  return re_search_2 (bufp, NULL, 0, string, size, startpos, range,
+              regs, size);
+}
+
+
+/* Using the compiled pattern in BUFP->buffer, first tries to match the
+   virtual concatenation of STRING1 and STRING2, starting first at index
+   STARTPOS, then at STARTPOS + 1, and so on.
+
+   STRING1 and STRING2 have length SIZE1 and SIZE2, respectively.
+
+   RANGE is how far to scan while trying to match.  RANGE = 0 means try
+   only at STARTPOS; in general, the last start tried is STARTPOS +
+   RANGE.
+
+   In REGS, return the indices of the virtual concatenation of STRING1
+   and STRING2 that matched the entire BUFP->buffer and its contained
+   subexpressions.
+
+   Do not consider matching one past the index STOP in the virtual
+   concatenation of STRING1 and STRING2.
+
+   We return either the position in the strings at which the match was
+   found, -1 if no match, or -2 if error (such as failure
+   stack overflow).  */
+
+int
+re_search_2 (bufp, string1, size1, string2, size2, startpos, range, regs, stop)
+     struct re_pattern_buffer *bufp;
+     const char *string1, *string2;
+     int size1, size2;
+     int startpos;
+     int range;
+     struct re_registers *regs;
+     int stop;
+{
+  int val;
+  register char *fastmap = bufp->fastmap;
+  register char *translate = bufp->translate;
+  int total_size = size1 + size2;
+  int endpos = startpos + range;
+
+  /* Check for out-of-range STARTPOS.  */
+  if (startpos < 0 || startpos > total_size)
+    return -1;
+
+  /* Fix up RANGE if it might eventually take us outside
+     the virtual concatenation of STRING1 and STRING2.  */
+  if (endpos < -1)
+    range = -1 - startpos;
+  else if (endpos > total_size)
+    range = total_size - startpos;
+
+  /* If the search isn't to be a backwards one, don't waste time in a
+     search for a pattern that must be anchored.  */
+  if (bufp->used > 0 && (re_opcode_t) bufp->buffer[0] == begbuf && range > 0)
+    {
+      if (startpos > 0)
+    return -1;
+      else
+    range = 1;
+    }
+
+  /* Update the fastmap now if not correct already.  */
+  if (fastmap && !bufp->fastmap_accurate)
+    if (re_compile_fastmap (bufp) == -2)
+      return -2;
+
+  /* Loop through the string, looking for a place to start matching.  */
+  for (;;)
+    {
+      /* If a fastmap is supplied, skip quickly over characters that
+         cannot be the start of a match.  If the pattern can match the
+         null string, however, we don't need to skip characters; we want
+         the first null string.  */
+      if (fastmap && startpos < total_size && !bufp->can_be_null)
+    {
+      if (range > 0)	/* Searching forwards.  */
+        {
+          register const char *d;
+          register int lim = 0;
+          int irange = range;
+
+              if (startpos < size1 && startpos + range >= size1)
+                lim = range - (size1 - startpos);
+
+          d = (startpos >= size1 ? string2 - size1 : string1) + startpos;
+
+              /* Written out as an if-else to avoid testing `translate'
+                 inside the loop.  */
+          if (translate)
+                while (range > lim
+                       && !fastmap[(unsigned char)
+                   translate[(unsigned char) *d++]])
+                  range--;
+          else
+                while (range > lim && !fastmap[(unsigned char) *d++])
+                  range--;
+
+          startpos += irange - range;
+        }
+      else				/* Searching backwards.  */
+        {
+          register char c = (size1 == 0 || startpos >= size1
+                                 ? string2[startpos - size1]
+                                 : string1[startpos]);
+
+          if (!fastmap[(unsigned char) TRANSLATE (c)])
+        goto advance;
+        }
+    }
+
+      /* If can't match the null string, and that's all we have left, fail.  */
+      if (range >= 0 && startpos == total_size && fastmap
+          && !bufp->can_be_null)
+    return -1;
+
+      val = re_match_2 (bufp, string1, size1, string2, size2,
+                    startpos, regs, stop);
+      if (val >= 0)
+    return startpos;
+
+      if (val == -2)
+    return -2;
+
+    advance:
+      if (!range)
+        break;
+      else if (range > 0)
+        {
+          range--;
+          startpos++;
+        }
+      else
+        {
+          range++;
+          startpos--;
+        }
+    }
+  return -1;
+} /* re_search_2 */
+
+/* Declarations and macros for re_match_2.  */
+
+static int bcmp_translate ();
+static boolean alt_match_null_string_p (),
+               common_op_match_null_string_p (),
+               group_match_null_string_p ();
+
+/* Structure for per-register (a.k.a. per-group) information.
+   This must not be longer than one word, because we push this value
+   onto the failure stack.  Other register information, such as the
+   starting and ending positions (which are addresses), and the list of
+   inner groups (which is a bits list) are maintained in separate
+   variables.
+
+   We are making a (strictly speaking) nonportable assumption here: that
+   the compiler will pack our bit fields into something that fits into
+   the type of `word', i.e., is something that fits into one item on the
+   failure stack.  */
+typedef union
+{
+  fail_stack_elt_t word;
+  struct
+  {
+      /* This field is one if this group can match the empty string,
+         zero if not.  If not yet determined,  `MATCH_NULL_UNSET_VALUE'.  */
+#define MATCH_NULL_UNSET_VALUE 3
+    unsigned match_null_string_p : 2;
+    unsigned is_active : 1;
+    unsigned matched_something : 1;
+    unsigned ever_matched_something : 1;
+  } bits;
+} register_info_type;
+
+#define REG_MATCH_NULL_STRING_P(R)  ((R).bits.match_null_string_p)
+#define IS_ACTIVE(R)  ((R).bits.is_active)
+#define MATCHED_SOMETHING(R)  ((R).bits.matched_something)
+#define EVER_MATCHED_SOMETHING(R)  ((R).bits.ever_matched_something)
+
+
+/* Call this when have matched a real character; it sets `matched' flags
+   for the subexpressions which we are currently inside.  Also records
+   that those subexprs have matched.  */
+#define SET_REGS_MATCHED()						\
+  do									\
+    {									\
+      unsigned r;							\
+      for (r = lowest_active_reg; r <= highest_active_reg; r++)		\
+        {								\
+          MATCHED_SOMETHING (reg_info[r])				\
+            = EVER_MATCHED_SOMETHING (reg_info[r])			\
+            = 1;							\
+        }								\
+    }									\
+  while (0)
+
+
+/* This converts PTR, a pointer into one of the search strings `string1'
+   and `string2' into an offset from the beginning of that string.  */
+#define POINTER_TO_OFFSET(ptr)						\
+  (FIRST_STRING_P (ptr) ? (ptr) - string1 : (ptr) - string2 + size1)
+
+/* Registers are set to a sentinel when they haven't yet matched.  */
+#define REG_UNSET_VALUE ((char *) -1)
+#define REG_UNSET(e) ((e) == REG_UNSET_VALUE)
+
+
+/* Macros for dealing with the split strings in re_match_2.  */
+
+#define MATCHING_IN_FIRST_STRING  (dend == end_match_1)
+
+/* Call before fetching a character with *d.  This switches over to
+   string2 if necessary.  */
+#define PREFETCH()							\
+  while (d == dend)						    	\
+    {									\
+      /* End of string2 => fail.  */					\
+      if (dend == end_match_2) 						\
+        goto fail;							\
+      /* End of string1 => advance to string2.  */ 			\
+      d = string2;						        \
+      dend = end_match_2;						\
+    }
+
+
+/* Test if at very beginning or at very end of the virtual concatenation
+   of `string1' and `string2'.  If only one string, it's `string2'.  */
+#define AT_STRINGS_BEG(d) ((d) == (size1 ? string1 : string2) || !size2)
+#define AT_STRINGS_END(d) ((d) == end2)
+
+
+/* Test if D points to a character which is word-constituent.  We have
+   two special cases to check for: if past the end of string1, look at
+   the first character in string2; and if before the beginning of
+   string2, look at the last character in string1.  */
+#define WORDCHAR_P(d)							\
+  (SYNTAX ((d) == end1 ? *string2					\
+           : (d) == string2 - 1 ? *(end1 - 1) : *(d))			\
+   == Sword)
+
+/* Test if the character before D and the one at D differ with respect
+   to being word-constituent.  */
+#define AT_WORD_BOUNDARY(d)						\
+  (AT_STRINGS_BEG (d) || AT_STRINGS_END (d)				\
+   || WORDCHAR_P (d - 1) != WORDCHAR_P (d))
+
+
+/* Free everything we malloc.  */
+#ifdef REGEX_MALLOC
+#define FREE_VAR(var) if (var) free (var); var = NULL
+#define FREE_VARIABLES()						\
+  do {									\
+    FREE_VAR (fail_stack.stack);					\
+    FREE_VAR (regstart);						\
+    FREE_VAR (regend);							\
+    FREE_VAR (old_regstart);						\
+    FREE_VAR (old_regend);						\
+    FREE_VAR (best_regstart);						\
+    FREE_VAR (best_regend);						\
+    FREE_VAR (reg_info);						\
+    FREE_VAR (reg_dummy);						\
+    FREE_VAR (reg_info_dummy);						\
+  } while (0)
+#else /* not REGEX_MALLOC */
+/* Some MIPS systems (at least) want this to free alloca'd storage.  */
+#define FREE_VARIABLES() alloca (0)
+#endif /* not REGEX_MALLOC */
+
+
+/* These values must meet several constraints.  They must not be valid
+   register values; since we have a limit of 255 registers (because
+   we use only one byte in the pattern for the register number), we can
+   use numbers larger than 255.  They must differ by 1, because of
+   NUM_FAILURE_ITEMS above.  And the value for the lowest register must
+   be larger than the value for the highest register, so we do not try
+   to actually save any registers when none are active.  */
+#define NO_HIGHEST_ACTIVE_REG (1 << BYTEWIDTH)
+#define NO_LOWEST_ACTIVE_REG (NO_HIGHEST_ACTIVE_REG + 1)
+
+/* Matching routines.  */
+
+#ifndef emacs   /* Emacs never uses this.  */
+/* re_match is like re_match_2 except it takes only a single string.  */
+
+int
+re_match (bufp, string, size, pos, regs)
+     struct re_pattern_buffer *bufp;
+     const char *string;
+     int size, pos;
+     struct re_registers *regs;
+ {
+  return re_match_2 (bufp, NULL, 0, string, size, pos, regs, size);
+}
+#endif /* not emacs */
+
+
+/* re_match_2 matches the compiled pattern in BUFP against the
+   the (virtual) concatenation of STRING1 and STRING2 (of length SIZE1
+   and SIZE2, respectively).  We start matching at POS, and stop
+   matching at STOP.
+
+   If REGS is non-null and the `no_sub' field of BUFP is nonzero, we
+   store offsets for the substring each group matched in REGS.  See the
+   documentation for exactly how many groups we fill.
+
+   We return -1 if no match, -2 if an internal error (such as the
+   failure stack overflowing).  Otherwise, we return the length of the
+   matched substring.  */
+
+int
+re_match_2 (bufp, string1, size1, string2, size2, pos, regs, stop)
+     struct re_pattern_buffer *bufp;
+     const char *string1, *string2;
+     int size1, size2;
+     int pos;
+     struct re_registers *regs;
+     int stop;
+{
+  /* General temporaries.  */
+  int mcnt;
+  unsigned char *p1;
+
+  /* Just past the end of the corresponding string.  */
+  const char *end1, *end2;
+
+  /* Pointers into string1 and string2, just past the last characters in
+     each to consider matching.  */
+  const char *end_match_1, *end_match_2;
+
+  /* Where we are in the data, and the end of the current string.  */
+  const char *d, *dend;
+
+  /* Where we are in the pattern, and the end of the pattern.  */
+  unsigned char *p = bufp->buffer;
+  register unsigned char *pend = p + bufp->used;
+
+  /* We use this to map every character in the string.  */
+  char *translate = bufp->translate;
+
+  /* Failure point stack.  Each place that can handle a failure further
+     down the line pushes a failure point on this stack.  It consists of
+     restart, regend, and reg_info for all registers corresponding to
+     the subexpressions we're currently inside, plus the number of such
+     registers, and, finally, two char *'s.  The first char * is where
+     to resume scanning the pattern; the second one is where to resume
+     scanning the strings.  If the latter is zero, the failure point is
+     a ``dummy''; if a failure happens and the failure point is a dummy,
+     it gets discarded and the next next one is tried.  */
+  fail_stack_type fail_stack;
+#ifdef DEBUG
+  static unsigned failure_id = 0;
+  unsigned nfailure_points_pushed = 0, nfailure_points_popped = 0;
+#endif
+
+  /* We fill all the registers internally, independent of what we
+     return, for use in backreferences.  The number here includes
+     an element for register zero.  */
+  unsigned num_regs = bufp->re_nsub + 1;
+
+  /* The currently active registers.  */
+  unsigned lowest_active_reg = NO_LOWEST_ACTIVE_REG;
+  unsigned highest_active_reg = NO_HIGHEST_ACTIVE_REG;
+
+  /* Information on the contents of registers. These are pointers into
+     the input strings; they record just what was matched (on this
+     attempt) by a subexpression part of the pattern, that is, the
+     regnum-th regstart pointer points to where in the pattern we began
+     matching and the regnum-th regend points to right after where we
+     stopped matching the regnum-th subexpression.  (The zeroth register
+     keeps track of what the whole pattern matches.)  */
+  const char **regstart, **regend;
+
+  /* If a group that's operated upon by a repetition operator fails to
+     match anything, then the register for its start will need to be
+     restored because it will have been set to wherever in the string we
+     are when we last see its open-group operator.  Similarly for a
+     register's end.  */
+  const char **old_regstart, **old_regend;
+
+  /* The is_active field of reg_info helps us keep track of which (possibly
+     nested) subexpressions we are currently in. The matched_something
+     field of reg_info[reg_num] helps us tell whether or not we have
+     matched any of the pattern so far this time through the reg_num-th
+     subexpression.  These two fields get reset each time through any
+     loop their register is in.  */
+  register_info_type *reg_info;
+
+  /* The following record the register info as found in the above
+     variables when we find a match better than any we've seen before.
+     This happens as we backtrack through the failure points, which in
+     turn happens only if we have not yet matched the entire string. */
+  unsigned best_regs_set = false;
+  const char **best_regstart, **best_regend;
+
+  /* Logically, this is `best_regend[0]'.  But we don't want to have to
+     allocate space for that if we're not allocating space for anything
+     else (see below).  Also, we never need info about register 0 for
+     any of the other register vectors, and it seems rather a kludge to
+     treat `best_regend' differently than the rest.  So we keep track of
+     the end of the best match so far in a separate variable.  We
+     initialize this to NULL so that when we backtrack the first time
+     and need to test it, it's not garbage.  */
+  const char *match_end = NULL;
+
+  /* Used when we pop values we don't care about.  */
+  const char **reg_dummy;
+  register_info_type *reg_info_dummy;
+
+#ifdef DEBUG
+  /* Counts the total number of registers pushed.  */
+  unsigned num_regs_pushed = 0;
+#endif
+
+  DEBUG_PRINT1 ("\n\nEntering re_match_2.\n");
+
+  INIT_FAIL_STACK ();
+
+  /* Do not bother to initialize all the register variables if there are
+     no groups in the pattern, as it takes a fair amount of time.  If
+     there are groups, we include space for register 0 (the whole
+     pattern), even though we never use it, since it simplifies the
+     array indexing.  We should fix this.  */
+  if (bufp->re_nsub)
+    {
+      regstart = REGEX_TALLOC (num_regs, const char *);
+      regend = REGEX_TALLOC (num_regs, const char *);
+      old_regstart = REGEX_TALLOC (num_regs, const char *);
+      old_regend = REGEX_TALLOC (num_regs, const char *);
+      best_regstart = REGEX_TALLOC (num_regs, const char *);
+      best_regend = REGEX_TALLOC (num_regs, const char *);
+      reg_info = REGEX_TALLOC (num_regs, register_info_type);
+      reg_dummy = REGEX_TALLOC (num_regs, const char *);
+      reg_info_dummy = REGEX_TALLOC (num_regs, register_info_type);
+
+      if (!(regstart && regend && old_regstart && old_regend && reg_info
+            && best_regstart && best_regend && reg_dummy && reg_info_dummy))
+        {
+          FREE_VARIABLES ();
+          return -2;
+        }
+    }
+#ifdef REGEX_MALLOC
+  else
+    {
+      /* We must initialize all our variables to NULL, so that
+         `FREE_VARIABLES' doesn't try to free them.  */
+      regstart = regend = old_regstart = old_regend = best_regstart
+        = best_regend = reg_dummy = NULL;
+      reg_info = reg_info_dummy = (register_info_type *) NULL;
+    }
+#endif /* REGEX_MALLOC */
+
+  /* The starting position is bogus.  */
+  if (pos < 0 || pos > size1 + size2)
+    {
+      FREE_VARIABLES ();
+      return -1;
+    }
+
+  /* Initialize subexpression text positions to -1 to mark ones that no
+     start_memory/stop_memory has been seen for. Also initialize the
+     register information struct.  */
+  for (mcnt = 1; mcnt < num_regs; mcnt++)
+    {
+      regstart[mcnt] = regend[mcnt]
+        = old_regstart[mcnt] = old_regend[mcnt] = REG_UNSET_VALUE;
+
+      REG_MATCH_NULL_STRING_P (reg_info[mcnt]) = MATCH_NULL_UNSET_VALUE;
+      IS_ACTIVE (reg_info[mcnt]) = 0;
+      MATCHED_SOMETHING (reg_info[mcnt]) = 0;
+      EVER_MATCHED_SOMETHING (reg_info[mcnt]) = 0;
+    }
+
+  /* We move `string1' into `string2' if the latter's empty -- but not if
+     `string1' is null.  */
+  if (size2 == 0 && string1 != NULL)
+    {
+      string2 = string1;
+      size2 = size1;
+      string1 = 0;
+      size1 = 0;
+    }
+  end1 = string1 + size1;
+  end2 = string2 + size2;
+
+  /* Compute where to stop matching, within the two strings.  */
+  if (stop <= size1)
+    {
+      end_match_1 = string1 + stop;
+      end_match_2 = string2;
+    }
+  else
+    {
+      end_match_1 = end1;
+      end_match_2 = string2 + stop - size1;
+    }
+
+  /* `p' scans through the pattern as `d' scans through the data.
+     `dend' is the end of the input string that `d' points within.  `d'
+     is advanced into the following input string whenever necessary, but
+     this happens before fetching; therefore, at the beginning of the
+     loop, `d' can be pointing at the end of a string, but it cannot
+     equal `string2'.  */
+  if (size1 > 0 && pos <= size1)
+    {
+      d = string1 + pos;
+      dend = end_match_1;
+    }
+  else
+    {
+      d = string2 + pos - size1;
+      dend = end_match_2;
+    }
+
+  DEBUG_PRINT1 ("The compiled pattern is: ");
+  DEBUG_PRINT_COMPILED_PATTERN (bufp, p, pend);
+  DEBUG_PRINT1 ("The string to match is: `");
+  DEBUG_PRINT_DOUBLE_STRING (d, string1, size1, string2, size2);
+  DEBUG_PRINT1 ("'\n");
+
+  /* This loops over pattern commands.  It exits by returning from the
+     function if the match is complete, or it drops through if the match
+     fails at this starting point in the input data.  */
+  for (;;)
+    {
+      DEBUG_PRINT2 ("\n0x%x: ", p);
+
+      if (p == pend)
+    { /* End of pattern means we might have succeeded.  */
+          DEBUG_PRINT1 ("end of pattern ... ");
+
+      /* If we haven't matched the entire string, and we want the
+             longest match, try backtracking.  */
+          if (d != end_match_2)
+        {
+              DEBUG_PRINT1 ("backtracking.\n");
+
+              if (!FAIL_STACK_EMPTY ())
+                { /* More failure points to try.  */
+                  boolean same_str_p = (FIRST_STRING_P (match_end)
+                                == MATCHING_IN_FIRST_STRING);
+
+                  /* If exceeds best match so far, save it.  */
+                  if (!best_regs_set
+                      || (same_str_p && d > match_end)
+                      || (!same_str_p && !MATCHING_IN_FIRST_STRING))
+                    {
+                      best_regs_set = true;
+                      match_end = d;
+
+                      DEBUG_PRINT1 ("\nSAVING match as best so far.\n");
+
+                      for (mcnt = 1; mcnt < num_regs; mcnt++)
+                        {
+                          best_regstart[mcnt] = regstart[mcnt];
+                          best_regend[mcnt] = regend[mcnt];
+                        }
+                    }
+                  goto fail;
+                }
+
+              /* If no failure points, don't restore garbage.  */
+              else if (best_regs_set)
+                {
+            restore_best_regs:
+                  /* Restore best match.  It may happen that `dend ==
+                     end_match_1' while the restored d is in string2.
+                     For example, the pattern `x.*y.*z' against the
+                     strings `x-' and `y-z-', if the two strings are
+                     not consecutive in memory.  */
+                  DEBUG_PRINT1 ("Restoring best registers.\n");
+
+                  d = match_end;
+                  dend = ((d >= string1 && d <= end1)
+                   ? end_match_1 : end_match_2);
+
+          for (mcnt = 1; mcnt < num_regs; mcnt++)
+            {
+              regstart[mcnt] = best_regstart[mcnt];
+              regend[mcnt] = best_regend[mcnt];
+            }
+                }
+            } /* d != end_match_2 */
+
+          DEBUG_PRINT1 ("Accepting match.\n");
+
+          /* If caller wants register contents data back, do it.  */
+          if (regs && !bufp->no_sub)
+        {
+              /* Have the register data arrays been allocated?  */
+              if (bufp->regs_allocated == REGS_UNALLOCATED)
+                { /* No.  So allocate them with malloc.  We need one
+                     extra element beyond `num_regs' for the `-1' marker
+                     GNU code uses.  */
+                  regs->num_regs = MAX (RE_NREGS, num_regs + 1);
+                  regs->start = TALLOC (regs->num_regs, regoff_t);
+                  regs->end = TALLOC (regs->num_regs, regoff_t);
+                  if (regs->start == NULL || regs->end == NULL)
+                    return -2;
+                  bufp->regs_allocated = REGS_REALLOCATE;
+                }
+              else if (bufp->regs_allocated == REGS_REALLOCATE)
+                { /* Yes.  If we need more elements than were already
+                     allocated, reallocate them.  If we need fewer, just
+                     leave it alone.  */
+                  if (regs->num_regs < num_regs + 1)
+                    {
+                      regs->num_regs = num_regs + 1;
+                      RETALLOC (regs->start, regs->num_regs, regoff_t);
+                      RETALLOC (regs->end, regs->num_regs, regoff_t);
+                      if (regs->start == NULL || regs->end == NULL)
+                        return -2;
+                    }
+                }
+              else
+                assert (bufp->regs_allocated == REGS_FIXED);
+
+              /* Convert the pointer data in `regstart' and `regend' to
+                 indices.  Register zero has to be set differently,
+                 since we haven't kept track of any info for it.  */
+              if (regs->num_regs > 0)
+                {
+                  regs->start[0] = pos;
+                  regs->end[0] = (MATCHING_IN_FIRST_STRING ? d - string1
+                      : d - string2 + size1);
+                }
+
+              /* Go through the first `min (num_regs, regs->num_regs)'
+                 registers, since that is all we initialized.  */
+          for (mcnt = 1; mcnt < MIN (num_regs, regs->num_regs); mcnt++)
+        {
+                  if (REG_UNSET (regstart[mcnt]) || REG_UNSET (regend[mcnt]))
+                    regs->start[mcnt] = regs->end[mcnt] = -1;
+                  else
+                    {
+              regs->start[mcnt] = POINTER_TO_OFFSET (regstart[mcnt]);
+                      regs->end[mcnt] = POINTER_TO_OFFSET (regend[mcnt]);
+                    }
+        }
+
+              /* If the regs structure we return has more elements than
+                 were in the pattern, set the extra elements to -1.  If
+                 we (re)allocated the registers, this is the case,
+                 because we always allocate enough to have at least one
+                 -1 at the end.  */
+              for (mcnt = num_regs; mcnt < regs->num_regs; mcnt++)
+                regs->start[mcnt] = regs->end[mcnt] = -1;
+        } /* regs && !bufp->no_sub */
+
+          FREE_VARIABLES ();
+          DEBUG_PRINT4 ("%u failure points pushed, %u popped (%u remain).\n",
+                        nfailure_points_pushed, nfailure_points_popped,
+                        nfailure_points_pushed - nfailure_points_popped);
+          DEBUG_PRINT2 ("%u registers pushed.\n", num_regs_pushed);
+
+          mcnt = d - pos - (MATCHING_IN_FIRST_STRING
+                ? string1
+                : string2 - size1);
+
+          DEBUG_PRINT2 ("Returning %d from re_match_2.\n", mcnt);
+
+          return mcnt;
+        }
+
+      /* Otherwise match next pattern command.  */
+#ifdef SWITCH_ENUM_BUG
+      switch ((int) ((re_opcode_t) *p++))
+#else
+      switch ((re_opcode_t) *p++)
+#endif
+    {
+        /* Ignore these.  Used to ignore the n of succeed_n's which
+           currently have n == 0.  */
+        case no_op:
+          DEBUG_PRINT1 ("EXECUTING no_op.\n");
+          break;
+
+
+        /* Match the next n pattern characters exactly.  The following
+           byte in the pattern defines n, and the n bytes after that
+           are the characters to match.  */
+    case exactn:
+      mcnt = *p++;
+          DEBUG_PRINT2 ("EXECUTING exactn %d.\n", mcnt);
+
+          /* This is written out as an if-else so we don't waste time
+             testing `translate' inside the loop.  */
+          if (translate)
+        {
+          do
+        {
+          PREFETCH ();
+          if (translate[(unsigned char) *d++] != (char) *p++)
+                    goto fail;
+        }
+          while (--mcnt);
+        }
+      else
+        {
+          do
+        {
+          PREFETCH ();
+          if (*d++ != (char) *p++) goto fail;
+        }
+          while (--mcnt);
+        }
+      SET_REGS_MATCHED ();
+          break;
+
+
+        /* Match any character except possibly a newline or a null.  */
+    case anychar:
+          DEBUG_PRINT1 ("EXECUTING anychar.\n");
+
+          PREFETCH ();
+
+          if ((!(bufp->syntax & RE_DOT_NEWLINE) && TRANSLATE (*d) == '\n')
+              || (bufp->syntax & RE_DOT_NOT_NULL && TRANSLATE (*d) == '\000'))
+        goto fail;
+
+          SET_REGS_MATCHED ();
+          DEBUG_PRINT2 ("  Matched `%d'.\n", *d);
+          d++;
+      break;
+
+
+    case charset:
+    case charset_not:
+      {
+        register unsigned char c;
+        boolean not = (re_opcode_t) *(p - 1) == charset_not;
+
+            DEBUG_PRINT2 ("EXECUTING charset%s.\n", not ? "_not" : "");
+
+        PREFETCH ();
+        c = TRANSLATE (*d); /* The character to match.  */
+
+            /* Cast to `unsigned' instead of `unsigned char' in case the
+               bit list is a full 32 bytes long.  */
+        if (c < (unsigned) (*p * BYTEWIDTH)
+        && p[1 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
+          not = !not;
+
+        p += 1 + *p;
+
+        if (!not) goto fail;
+
+        SET_REGS_MATCHED ();
+            d++;
+        break;
+      }
+
+
+        /* The beginning of a group is represented by start_memory.
+           The arguments are the register number in the next byte, and the
+           number of groups inner to this one in the next.  The text
+           matched within the group is recorded (in the internal
+           registers data structure) under the register number.  */
+        case start_memory:
+      DEBUG_PRINT3 ("EXECUTING start_memory %d (%d):\n", *p, p[1]);
+
+          /* Find out if this group can match the empty string.  */
+      p1 = p;		/* To send to group_match_null_string_p.  */
+
+          if (REG_MATCH_NULL_STRING_P (reg_info[*p]) == MATCH_NULL_UNSET_VALUE)
+            REG_MATCH_NULL_STRING_P (reg_info[*p])
+              = group_match_null_string_p (&p1, pend, reg_info);
+
+          /* Save the position in the string where we were the last time
+             we were at this open-group operator in case the group is
+             operated upon by a repetition operator, e.g., with `(a*)*b'
+             against `ab'; then we want to ignore where we are now in
+             the string in case this attempt to match fails.  */
+          old_regstart[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p])
+                             ? REG_UNSET (regstart[*p]) ? d : regstart[*p]
+                             : regstart[*p];
+      DEBUG_PRINT2 ("  old_regstart: %d\n",
+             POINTER_TO_OFFSET (old_regstart[*p]));
+
+          regstart[*p] = d;
+      DEBUG_PRINT2 ("  regstart: %d\n", POINTER_TO_OFFSET (regstart[*p]));
+
+          IS_ACTIVE (reg_info[*p]) = 1;
+          MATCHED_SOMETHING (reg_info[*p]) = 0;
+
+          /* This is the new highest active register.  */
+          highest_active_reg = *p;
+
+          /* If nothing was active before, this is the new lowest active
+             register.  */
+          if (lowest_active_reg == NO_LOWEST_ACTIVE_REG)
+            lowest_active_reg = *p;
+
+          /* Move past the register number and inner group count.  */
+          p += 2;
+          break;
+
+
+        /* The stop_memory opcode represents the end of a group.  Its
+           arguments are the same as start_memory's: the register
+           number, and the number of inner groups.  */
+    case stop_memory:
+      DEBUG_PRINT3 ("EXECUTING stop_memory %d (%d):\n", *p, p[1]);
+
+          /* We need to save the string position the last time we were at
+             this close-group operator in case the group is operated
+             upon by a repetition operator, e.g., with `((a*)*(b*)*)*'
+             against `aba'; then we want to ignore where we are now in
+             the string in case this attempt to match fails.  */
+          old_regend[*p] = REG_MATCH_NULL_STRING_P (reg_info[*p])
+                           ? REG_UNSET (regend[*p]) ? d : regend[*p]
+               : regend[*p];
+      DEBUG_PRINT2 ("      old_regend: %d\n",
+             POINTER_TO_OFFSET (old_regend[*p]));
+
+          regend[*p] = d;
+      DEBUG_PRINT2 ("      regend: %d\n", POINTER_TO_OFFSET (regend[*p]));
+
+          /* This register isn't active anymore.  */
+          IS_ACTIVE (reg_info[*p]) = 0;
+
+          /* If this was the only register active, nothing is active
+             anymore.  */
+          if (lowest_active_reg == highest_active_reg)
+            {
+              lowest_active_reg = NO_LOWEST_ACTIVE_REG;
+              highest_active_reg = NO_HIGHEST_ACTIVE_REG;
+            }
+          else
+            { /* We must scan for the new highest active register, since
+                 it isn't necessarily one less than now: consider
+                 (a(b)c(d(e)f)g).  When group 3 ends, after the f), the
+                 new highest active register is 1.  */
+              unsigned char r = *p - 1;
+              while (r > 0 && !IS_ACTIVE (reg_info[r]))
+                r--;
+
+              /* If we end up at register zero, that means that we saved
+                 the registers as the result of an `on_failure_jump', not
+                 a `start_memory', and we jumped to past the innermost
+                 `stop_memory'.  For example, in ((.)*) we save
+                 registers 1 and 2 as a result of the *, but when we pop
+                 back to the second ), we are at the stop_memory 1.
+                 Thus, nothing is active.  */
+          if (r == 0)
+                {
+                  lowest_active_reg = NO_LOWEST_ACTIVE_REG;
+                  highest_active_reg = NO_HIGHEST_ACTIVE_REG;
+                }
+              else
+                highest_active_reg = r;
+            }
+
+          /* If just failed to match something this time around with a
+             group that's operated on by a repetition operator, try to
+             force exit from the ``loop'', and restore the register
+             information for this group that we had before trying this
+             last match.  */
+          if ((!MATCHED_SOMETHING (reg_info[*p])
+               || (re_opcode_t) p[-3] == start_memory)
+          && (p + 2) < pend)
+            {
+              boolean is_a_jump_n = false;
+
+              p1 = p + 2;
+              mcnt = 0;
+              switch ((re_opcode_t) *p1++)
+                {
+                  case jump_n:
+            is_a_jump_n = true;
+                  case pop_failure_jump:
+          case maybe_pop_jump:
+          case jump:
+          case dummy_failure_jump:
+                    EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+            if (is_a_jump_n)
+              p1 += 2;
+                    break;
+
+                  default:
+                    /* do nothing */ ;
+                }
+          p1 += mcnt;
+
+              /* If the next operation is a jump backwards in the pattern
+             to an on_failure_jump right before the start_memory
+                 corresponding to this stop_memory, exit from the loop
+                 by forcing a failure after pushing on the stack the
+                 on_failure_jump's jump in the pattern, and d.  */
+              if (mcnt < 0 && (re_opcode_t) *p1 == on_failure_jump
+                  && (re_opcode_t) p1[3] == start_memory && p1[4] == *p)
+        {
+                  /* If this group ever matched anything, then restore
+                     what its registers were before trying this last
+                     failed match, e.g., with `(a*)*b' against `ab' for
+                     regstart[1], and, e.g., with `((a*)*(b*)*)*'
+                     against `aba' for regend[3].
+
+                     Also restore the registers for inner groups for,
+                     e.g., `((a*)(b*))*' against `aba' (register 3 would
+                     otherwise get trashed).  */
+
+                  if (EVER_MATCHED_SOMETHING (reg_info[*p]))
+            {
+              unsigned r;
+
+                      EVER_MATCHED_SOMETHING (reg_info[*p]) = 0;
+
+              /* Restore this and inner groups' (if any) registers.  */
+                      for (r = *p; r < *p + *(p + 1); r++)
+                        {
+                          regstart[r] = old_regstart[r];
+
+                          /* xx why this test?  */
+                          if ((int) old_regend[r] >= (int) regstart[r])
+                            regend[r] = old_regend[r];
+                        }
+                    }
+          p1++;
+                  EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+                  PUSH_FAILURE_POINT (p1 + mcnt, d, -2);
+
+                  goto fail;
+                }
+            }
+
+          /* Move past the register number and the inner group count.  */
+          p += 2;
+          break;
+
+
+    /* \<digit> has been turned into a `duplicate' command which is
+           followed by the numeric value of <digit> as the register number.  */
+        case duplicate:
+      {
+        register const char *d2, *dend2;
+        int regno = *p++;   /* Get which register to match against.  */
+        DEBUG_PRINT2 ("EXECUTING duplicate %d.\n", regno);
+
+        /* Can't back reference a group which we've never matched.  */
+            if (REG_UNSET (regstart[regno]) || REG_UNSET (regend[regno]))
+              goto fail;
+
+            /* Where in input to try to start matching.  */
+            d2 = regstart[regno];
+
+            /* Where to stop matching; if both the place to start and
+               the place to stop matching are in the same string, then
+               set to the place to stop, otherwise, for now have to use
+               the end of the first string.  */
+
+            dend2 = ((FIRST_STRING_P (regstart[regno])
+              == FIRST_STRING_P (regend[regno]))
+             ? regend[regno] : end_match_1);
+        for (;;)
+          {
+        /* If necessary, advance to next segment in register
+                   contents.  */
+        while (d2 == dend2)
+          {
+            if (dend2 == end_match_2) break;
+            if (dend2 == regend[regno]) break;
+
+                    /* End of string1 => advance to string2. */
+                    d2 = string2;
+                    dend2 = regend[regno];
+          }
+        /* At end of register contents => success */
+        if (d2 == dend2) break;
+
+        /* If necessary, advance to next segment in data.  */
+        PREFETCH ();
+
+        /* How many characters left in this segment to match.  */
+        mcnt = dend - d;
+
+        /* Want how many consecutive characters we can match in
+                   one shot, so, if necessary, adjust the count.  */
+                if (mcnt > dend2 - d2)
+          mcnt = dend2 - d2;
+
+        /* Compare that many; failure if mismatch, else move
+                   past them.  */
+        if (translate
+                    ? bcmp_translate (d, d2, mcnt, translate)
+                    : bcmp (d, d2, mcnt))
+          goto fail;
+        d += mcnt, d2 += mcnt;
+          }
+      }
+      break;
+
+
+        /* begline matches the empty string at the beginning of the string
+           (unless `not_bol' is set in `bufp'), and, if
+           `newline_anchor' is set, after newlines.  */
+    case begline:
+          DEBUG_PRINT1 ("EXECUTING begline.\n");
+
+          if (AT_STRINGS_BEG (d))
+            {
+              if (!bufp->not_bol) break;
+            }
+          else if (d[-1] == '\n' && bufp->newline_anchor)
+            {
+              break;
+            }
+          /* In all other cases, we fail.  */
+          goto fail;
+
+
+        /* endline is the dual of begline.  */
+    case endline:
+          DEBUG_PRINT1 ("EXECUTING endline.\n");
+
+          if (AT_STRINGS_END (d))
+            {
+              if (!bufp->not_eol) break;
+            }
+
+          /* We have to ``prefetch'' the next character.  */
+          else if ((d == end1 ? *string2 : *d) == '\n'
+                   && bufp->newline_anchor)
+            {
+              break;
+            }
+          goto fail;
+
+
+    /* Match at the very beginning of the data.  */
+        case begbuf:
+          DEBUG_PRINT1 ("EXECUTING begbuf.\n");
+          if (AT_STRINGS_BEG (d))
+            break;
+          goto fail;
+
+
+    /* Match at the very end of the data.  */
+        case endbuf:
+          DEBUG_PRINT1 ("EXECUTING endbuf.\n");
+      if (AT_STRINGS_END (d))
+        break;
+          goto fail;
+
+
+        /* on_failure_keep_string_jump is used to optimize `.*\n'.  It
+           pushes NULL as the value for the string on the stack.  Then
+           `pop_failure_point' will keep the current value for the
+           string, instead of restoring it.  To see why, consider
+           matching `foo\nbar' against `.*\n'.  The .* matches the foo;
+           then the . fails against the \n.  But the next thing we want
+           to do is match the \n against the \n; if we restored the
+           string value, we would be back at the foo.
+
+           Because this is used only in specific cases, we don't need to
+           check all the things that `on_failure_jump' does, to make
+           sure the right things get saved on the stack.  Hence we don't
+           share its code.  The only reason to push anything on the
+           stack at all is that otherwise we would have to change
+           `anychar's code to do something besides goto fail in this
+           case; that seems worse than this.  */
+        case on_failure_keep_string_jump:
+          DEBUG_PRINT1 ("EXECUTING on_failure_keep_string_jump");
+
+          EXTRACT_NUMBER_AND_INCR (mcnt, p);
+          DEBUG_PRINT3 (" %d (to 0x%x):\n", mcnt, p + mcnt);
+
+          PUSH_FAILURE_POINT (p + mcnt, NULL, -2);
+          break;
+
+
+    /* Uses of on_failure_jump:
+
+           Each alternative starts with an on_failure_jump that points
+           to the beginning of the next alternative.  Each alternative
+           except the last ends with a jump that in effect jumps past
+           the rest of the alternatives.  (They really jump to the
+           ending jump of the following alternative, because tensioning
+           these jumps is a hassle.)
+
+           Repeats start with an on_failure_jump that points past both
+           the repetition text and either the following jump or
+           pop_failure_jump back to this on_failure_jump.  */
+    case on_failure_jump:
+        on_failure:
+          DEBUG_PRINT1 ("EXECUTING on_failure_jump");
+
+          EXTRACT_NUMBER_AND_INCR (mcnt, p);
+          DEBUG_PRINT3 (" %d (to 0x%x)", mcnt, p + mcnt);
+
+          /* If this on_failure_jump comes right before a group (i.e.,
+             the original * applied to a group), save the information
+             for that group and all inner ones, so that if we fail back
+             to this point, the group's information will be correct.
+             For example, in \(a*\)*\1, we need the preceding group,
+             and in \(\(a*\)b*\)\2, we need the inner group.  */
+
+          /* We can't use `p' to check ahead because we push
+             a failure point to `p + mcnt' after we do this.  */
+          p1 = p;
+
+          /* We need to skip no_op's before we look for the
+             start_memory in case this on_failure_jump is happening as
+             the result of a completed succeed_n, as in \(a\)\{1,3\}b\1
+             against aba.  */
+          while (p1 < pend && (re_opcode_t) *p1 == no_op)
+            p1++;
+
+          if (p1 < pend && (re_opcode_t) *p1 == start_memory)
+            {
+              /* We have a new highest active register now.  This will
+                 get reset at the start_memory we are about to get to,
+                 but we will have saved all the registers relevant to
+                 this repetition op, as described above.  */
+              highest_active_reg = *(p1 + 1) + *(p1 + 2);
+              if (lowest_active_reg == NO_LOWEST_ACTIVE_REG)
+                lowest_active_reg = *(p1 + 1);
+            }
+
+          DEBUG_PRINT1 (":\n");
+          PUSH_FAILURE_POINT (p + mcnt, d, -2);
+          break;
+
+
+        /* A smart repeat ends with `maybe_pop_jump'.
+       We change it to either `pop_failure_jump' or `jump'.  */
+        case maybe_pop_jump:
+          EXTRACT_NUMBER_AND_INCR (mcnt, p);
+          DEBUG_PRINT2 ("EXECUTING maybe_pop_jump %d.\n", mcnt);
+          {
+        register unsigned char *p2 = p;
+
+            /* Compare the beginning of the repeat with what in the
+               pattern follows its end. If we can establish that there
+               is nothing that they would both match, i.e., that we
+               would have to backtrack because of (as in, e.g., `a*a')
+               then we can change to pop_failure_jump, because we'll
+               never have to backtrack.
+
+               This is not true in the case of alternatives: in
+               `(a|ab)*' we do need to backtrack to the `ab' alternative
+               (e.g., if the string was `ab').  But instead of trying to
+               detect that here, the alternative has put on a dummy
+               failure point which is what we will end up popping.  */
+
+        /* Skip over open/close-group commands.  */
+        while (p2 + 2 < pend
+           && ((re_opcode_t) *p2 == stop_memory
+               || (re_opcode_t) *p2 == start_memory))
+          p2 += 3;			/* Skip over args, too.  */
+
+            /* If we're at the end of the pattern, we can change.  */
+            if (p2 == pend)
+          {
+        /* Consider what happens when matching ":\(.*\)"
+           against ":/".  I don't really understand this code
+           yet.  */
+            p[-3] = (unsigned char) pop_failure_jump;
+                DEBUG_PRINT1
+                  ("  End of pattern: change to `pop_failure_jump'.\n");
+              }
+
+            else if ((re_opcode_t) *p2 == exactn
+             || (bufp->newline_anchor && (re_opcode_t) *p2 == endline))
+          {
+        register unsigned char c
+                  = *p2 == (unsigned char) endline ? '\n' : p2[2];
+        p1 = p + mcnt;
+
+                /* p1[0] ... p1[2] are the `on_failure_jump' corresponding
+                   to the `maybe_finalize_jump' of this case.  Examine what
+                   follows.  */
+                if ((re_opcode_t) p1[3] == exactn && p1[5] != c)
+                  {
+            p[-3] = (unsigned char) pop_failure_jump;
+                    DEBUG_PRINT3 ("  %c != %c => pop_failure_jump.\n",
+                                  c, p1[5]);
+                  }
+
+        else if ((re_opcode_t) p1[3] == charset
+             || (re_opcode_t) p1[3] == charset_not)
+          {
+            int not = (re_opcode_t) p1[3] == charset_not;
+
+            if (c < (unsigned char) (p1[4] * BYTEWIDTH)
+            && p1[5 + c / BYTEWIDTH] & (1 << (c % BYTEWIDTH)))
+              not = !not;
+
+                    /* `not' is equal to 1 if c would match, which means
+                        that we can't change to pop_failure_jump.  */
+            if (!not)
+                      {
+                p[-3] = (unsigned char) pop_failure_jump;
+                        DEBUG_PRINT1 ("  No match => pop_failure_jump.\n");
+                      }
+          }
+          }
+      }
+      p -= 2;		/* Point at relative address again.  */
+      if ((re_opcode_t) p[-1] != pop_failure_jump)
+        {
+          p[-1] = (unsigned char) jump;
+              DEBUG_PRINT1 ("  Match => jump.\n");
+          goto unconditional_jump;
+        }
+        /* Note fall through.  */
+
+
+    /* The end of a simple repeat has a pop_failure_jump back to
+           its matching on_failure_jump, where the latter will push a
+           failure point.  The pop_failure_jump takes off failure
+           points put on by this pop_failure_jump's matching
+           on_failure_jump; we got through the pattern to here from the
+           matching on_failure_jump, so didn't fail.  */
+        case pop_failure_jump:
+          {
+            /* We need to pass separate storage for the lowest and
+               highest registers, even though we don't care about the
+               actual values.  Otherwise, we will restore only one
+               register from the stack, since lowest will == highest in
+               `pop_failure_point'.  */
+            unsigned dummy_low_reg, dummy_high_reg;
+            unsigned char *pdummy;
+            const char *sdummy;
+
+            DEBUG_PRINT1 ("EXECUTING pop_failure_jump.\n");
+            POP_FAILURE_POINT (sdummy, pdummy,
+                               dummy_low_reg, dummy_high_reg,
+                               reg_dummy, reg_dummy, reg_info_dummy);
+          }
+          /* Note fall through.  */
+
+
+        /* Unconditionally jump (without popping any failure points).  */
+        case jump:
+    unconditional_jump:
+      EXTRACT_NUMBER_AND_INCR (mcnt, p);	/* Get the amount to jump.  */
+          DEBUG_PRINT2 ("EXECUTING jump %d ", mcnt);
+      p += mcnt;				/* Do the jump.  */
+          DEBUG_PRINT2 ("(to 0x%x).\n", p);
+      break;
+
+
+        /* We need this opcode so we can detect where alternatives end
+           in `group_match_null_string_p' et al.  */
+        case jump_past_alt:
+          DEBUG_PRINT1 ("EXECUTING jump_past_alt.\n");
+          goto unconditional_jump;
+
+
+        /* Normally, the on_failure_jump pushes a failure point, which
+           then gets popped at pop_failure_jump.  We will end up at
+           pop_failure_jump, also, and with a pattern of, say, `a+', we
+           are skipping over the on_failure_jump, so we have to push
+           something meaningless for pop_failure_jump to pop.  */
+        case dummy_failure_jump:
+          DEBUG_PRINT1 ("EXECUTING dummy_failure_jump.\n");
+          /* It doesn't matter what we push for the string here.  What
+             the code at `fail' tests is the value for the pattern.  */
+          PUSH_FAILURE_POINT (0, 0, -2);
+          goto unconditional_jump;
+
+
+        /* At the end of an alternative, we need to push a dummy failure
+           point in case we are followed by a `pop_failure_jump', because
+           we don't want the failure point for the alternative to be
+           popped.  For example, matching `(a|ab)*' against `aab'
+           requires that we match the `ab' alternative.  */
+        case push_dummy_failure:
+          DEBUG_PRINT1 ("EXECUTING push_dummy_failure.\n");
+          /* See comments just above at `dummy_failure_jump' about the
+             two zeroes.  */
+          PUSH_FAILURE_POINT (0, 0, -2);
+          break;
+
+        /* Have to succeed matching what follows at least n times.
+           After that, handle like `on_failure_jump'.  */
+        case succeed_n:
+          EXTRACT_NUMBER (mcnt, p + 2);
+          DEBUG_PRINT2 ("EXECUTING succeed_n %d.\n", mcnt);
+
+          assert (mcnt >= 0);
+          /* Originally, this is how many times we HAVE to succeed.  */
+          if (mcnt > 0)
+            {
+               mcnt--;
+           p += 2;
+               STORE_NUMBER_AND_INCR (p, mcnt);
+               DEBUG_PRINT3 ("  Setting 0x%x to %d.\n", p, mcnt);
+            }
+      else if (mcnt == 0)
+            {
+              DEBUG_PRINT2 ("  Setting two bytes from 0x%x to no_op.\n", p+2);
+          p[2] = (unsigned char) no_op;
+              p[3] = (unsigned char) no_op;
+              goto on_failure;
+            }
+          break;
+
+        case jump_n:
+          EXTRACT_NUMBER (mcnt, p + 2);
+          DEBUG_PRINT2 ("EXECUTING jump_n %d.\n", mcnt);
+
+          /* Originally, this is how many times we CAN jump.  */
+          if (mcnt)
+            {
+               mcnt--;
+               STORE_NUMBER (p + 2, mcnt);
+           goto unconditional_jump;
+            }
+          /* If don't have to jump any more, skip over the rest of command.  */
+      else
+        p += 4;
+          break;
+
+    case set_number_at:
+      {
+            DEBUG_PRINT1 ("EXECUTING set_number_at.\n");
+
+            EXTRACT_NUMBER_AND_INCR (mcnt, p);
+            p1 = p + mcnt;
+            EXTRACT_NUMBER_AND_INCR (mcnt, p);
+            DEBUG_PRINT3 ("  Setting 0x%x to %d.\n", p1, mcnt);
+        STORE_NUMBER (p1, mcnt);
+            break;
+          }
+
+        case wordbound:
+          DEBUG_PRINT1 ("EXECUTING wordbound.\n");
+          if (AT_WORD_BOUNDARY (d))
+        break;
+          goto fail;
+
+    case notwordbound:
+          DEBUG_PRINT1 ("EXECUTING notwordbound.\n");
+      if (AT_WORD_BOUNDARY (d))
+        goto fail;
+          break;
+
+    case wordbeg:
+          DEBUG_PRINT1 ("EXECUTING wordbeg.\n");
+      if (WORDCHAR_P (d) && (AT_STRINGS_BEG (d) || !WORDCHAR_P (d - 1)))
+        break;
+          goto fail;
+
+    case wordend:
+          DEBUG_PRINT1 ("EXECUTING wordend.\n");
+      if (!AT_STRINGS_BEG (d) && WORDCHAR_P (d - 1)
+              && (!WORDCHAR_P (d) || AT_STRINGS_END (d)))
+        break;
+          goto fail;
+
+#ifdef emacs
+#ifdef emacs19
+    case before_dot:
+          DEBUG_PRINT1 ("EXECUTING before_dot.\n");
+      if (PTR_CHAR_POS ((unsigned char *) d) >= point)
+        goto fail;
+      break;
+
+    case at_dot:
+          DEBUG_PRINT1 ("EXECUTING at_dot.\n");
+      if (PTR_CHAR_POS ((unsigned char *) d) != point)
+        goto fail;
+      break;
+
+    case after_dot:
+          DEBUG_PRINT1 ("EXECUTING after_dot.\n");
+          if (PTR_CHAR_POS ((unsigned char *) d) <= point)
+        goto fail;
+      break;
+#else /* not emacs19 */
+    case at_dot:
+          DEBUG_PRINT1 ("EXECUTING at_dot.\n");
+      if (PTR_CHAR_POS ((unsigned char *) d) + 1 != point)
+        goto fail;
+      break;
+#endif /* not emacs19 */
+
+    case syntaxspec:
+          DEBUG_PRINT2 ("EXECUTING syntaxspec %d.\n", mcnt);
+      mcnt = *p++;
+      goto matchsyntax;
+
+        case wordchar:
+          DEBUG_PRINT1 ("EXECUTING Emacs wordchar.\n");
+      mcnt = (int) Sword;
+        matchsyntax:
+      PREFETCH ();
+      if (SYNTAX (*d++) != (enum syntaxcode) mcnt)
+            goto fail;
+          SET_REGS_MATCHED ();
+      break;
+
+    case notsyntaxspec:
+          DEBUG_PRINT2 ("EXECUTING notsyntaxspec %d.\n", mcnt);
+      mcnt = *p++;
+      goto matchnotsyntax;
+
+        case notwordchar:
+          DEBUG_PRINT1 ("EXECUTING Emacs notwordchar.\n");
+      mcnt = (int) Sword;
+        matchnotsyntax:
+      PREFETCH ();
+      if (SYNTAX (*d++) == (enum syntaxcode) mcnt)
+            goto fail;
+      SET_REGS_MATCHED ();
+          break;
+
+#else /* not emacs */
+    case wordchar:
+          DEBUG_PRINT1 ("EXECUTING non-Emacs wordchar.\n");
+      PREFETCH ();
+          if (!WORDCHAR_P (d))
+            goto fail;
+      SET_REGS_MATCHED ();
+          d++;
+      break;
+
+    case notwordchar:
+          DEBUG_PRINT1 ("EXECUTING non-Emacs notwordchar.\n");
+      PREFETCH ();
+      if (WORDCHAR_P (d))
+            goto fail;
+          SET_REGS_MATCHED ();
+          d++;
+      break;
+#endif /* not emacs */
+
+        default:
+          abort ();
+    }
+      continue;  /* Successfully executed one pattern command; keep going.  */
+
+
+    /* We goto here if a matching operation fails. */
+    fail:
+      if (!FAIL_STACK_EMPTY ())
+    { /* A restart point is known.  Restore to that state.  */
+          DEBUG_PRINT1 ("\nFAIL:\n");
+          POP_FAILURE_POINT (d, p,
+                             lowest_active_reg, highest_active_reg,
+                             regstart, regend, reg_info);
+
+          /* If this failure point is a dummy, try the next one.  */
+          if (!p)
+        goto fail;
+
+          /* If we failed to the end of the pattern, don't examine *p.  */
+      assert (p <= pend);
+          if (p < pend)
+            {
+              boolean is_a_jump_n = false;
+
+              /* If failed to a backwards jump that's part of a repetition
+                 loop, need to pop this failure point and use the next one.  */
+              switch ((re_opcode_t) *p)
+                {
+                case jump_n:
+                  is_a_jump_n = true;
+                case maybe_pop_jump:
+                case pop_failure_jump:
+                case jump:
+                  p1 = p + 1;
+                  EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+                  p1 += mcnt;
+
+                  if ((is_a_jump_n && (re_opcode_t) *p1 == succeed_n)
+                      || (!is_a_jump_n
+                          && (re_opcode_t) *p1 == on_failure_jump))
+                    goto fail;
+                  break;
+                default:
+                  /* do nothing */ ;
+                }
+            }
+
+          if (d >= string1 && d <= end1)
+        dend = end_match_1;
+        }
+      else
+        break;   /* Matching at this starting point really fails.  */
+    } /* for (;;) */
+
+  if (best_regs_set)
+    goto restore_best_regs;
+
+  FREE_VARIABLES ();
+
+  return -1;         			/* Failure to match.  */
+} /* re_match_2 */
+
+/* Subroutine definitions for re_match_2.  */
+
+
+/* We are passed P pointing to a register number after a start_memory.
+
+   Return true if the pattern up to the corresponding stop_memory can
+   match the empty string, and false otherwise.
+
+   If we find the matching stop_memory, sets P to point to one past its number.
+   Otherwise, sets P to an undefined byte less than or equal to END.
+
+   We don't handle duplicates properly (yet).  */
+
+static boolean
+group_match_null_string_p (p, end, reg_info)
+    unsigned char **p, *end;
+    register_info_type *reg_info;
+{
+  int mcnt;
+  /* Point to after the args to the start_memory.  */
+  unsigned char *p1 = *p + 2;
+
+  while (p1 < end)
+    {
+      /* Skip over opcodes that can match nothing, and return true or
+     false, as appropriate, when we get to one that can't, or to the
+         matching stop_memory.  */
+
+      switch ((re_opcode_t) *p1)
+        {
+        /* Could be either a loop or a series of alternatives.  */
+        case on_failure_jump:
+          p1++;
+          EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+
+          /* If the next operation is not a jump backwards in the
+         pattern.  */
+
+      if (mcnt >= 0)
+        {
+              /* Go through the on_failure_jumps of the alternatives,
+                 seeing if any of the alternatives cannot match nothing.
+                 The last alternative starts with only a jump,
+                 whereas the rest start with on_failure_jump and end
+                 with a jump, e.g., here is the pattern for `a|b|c':
+
+                 /on_failure_jump/0/6/exactn/1/a/jump_past_alt/0/6
+                 /on_failure_jump/0/6/exactn/1/b/jump_past_alt/0/3
+                 /exactn/1/c
+
+                 So, we have to first go through the first (n-1)
+                 alternatives and then deal with the last one separately.  */
+
+
+              /* Deal with the first (n-1) alternatives, which start
+                 with an on_failure_jump (see above) that jumps to right
+                 past a jump_past_alt.  */
+
+              while ((re_opcode_t) p1[mcnt-3] == jump_past_alt)
+                {
+                  /* `mcnt' holds how many bytes long the alternative
+                     is, including the ending `jump_past_alt' and
+                     its number.  */
+
+                  if (!alt_match_null_string_p (p1, p1 + mcnt - 3,
+                                      reg_info))
+                    return false;
+
+                  /* Move to right after this alternative, including the
+             jump_past_alt.  */
+                  p1 += mcnt;
+
+                  /* Break if it's the beginning of an n-th alternative
+                     that doesn't begin with an on_failure_jump.  */
+                  if ((re_opcode_t) *p1 != on_failure_jump)
+                    break;
+
+          /* Still have to check that it's not an n-th
+             alternative that starts with an on_failure_jump.  */
+          p1++;
+                  EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+                  if ((re_opcode_t) p1[mcnt-3] != jump_past_alt)
+                    {
+              /* Get to the beginning of the n-th alternative.  */
+                      p1 -= 3;
+                      break;
+                    }
+                }
+
+              /* Deal with the last alternative: go back and get number
+                 of the `jump_past_alt' just before it.  `mcnt' contains
+                 the length of the alternative.  */
+              EXTRACT_NUMBER (mcnt, p1 - 2);
+
+              if (!alt_match_null_string_p (p1, p1 + mcnt, reg_info))
+                return false;
+
+              p1 += mcnt;	/* Get past the n-th alternative.  */
+            } /* if mcnt > 0 */
+          break;
+
+
+        case stop_memory:
+      assert (p1[1] == **p);
+          *p = p1 + 2;
+          return true;
+
+
+        default:
+          if (!common_op_match_null_string_p (&p1, end, reg_info))
+            return false;
+        }
+    } /* while p1 < end */
+
+  return false;
+} /* group_match_null_string_p */
+
+
+/* Similar to group_match_null_string_p, but doesn't deal with alternatives:
+   It expects P to be the first byte of a single alternative and END one
+   byte past the last. The alternative can contain groups.  */
+
+static boolean
+alt_match_null_string_p (p, end, reg_info)
+    unsigned char *p, *end;
+    register_info_type *reg_info;
+{
+  int mcnt;
+  unsigned char *p1 = p;
+
+  while (p1 < end)
+    {
+      /* Skip over opcodes that can match nothing, and break when we get
+         to one that can't.  */
+
+      switch ((re_opcode_t) *p1)
+        {
+    /* It's a loop.  */
+        case on_failure_jump:
+          p1++;
+          EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+          p1 += mcnt;
+          break;
+
+    default:
+          if (!common_op_match_null_string_p (&p1, end, reg_info))
+            return false;
+        }
+    }  /* while p1 < end */
+
+  return true;
+} /* alt_match_null_string_p */
+
+
+/* Deals with the ops common to group_match_null_string_p and
+   alt_match_null_string_p.
+
+   Sets P to one after the op and its arguments, if any.  */
+
+static boolean
+common_op_match_null_string_p (p, end, reg_info)
+    unsigned char **p, *end;
+    register_info_type *reg_info;
+{
+  int mcnt;
+  boolean ret;
+  int reg_no;
+  unsigned char *p1 = *p;
+
+  switch ((re_opcode_t) *p1++)
+    {
+    case no_op:
+    case begline:
+    case endline:
+    case begbuf:
+    case endbuf:
+    case wordbeg:
+    case wordend:
+    case wordbound:
+    case notwordbound:
+#ifdef emacs
+    case before_dot:
+    case at_dot:
+    case after_dot:
+#endif
+      break;
+
+    case start_memory:
+      reg_no = *p1;
+      assert (reg_no > 0 && reg_no <= MAX_REGNUM);
+      ret = group_match_null_string_p (&p1, end, reg_info);
+
+      /* Have to set this here in case we're checking a group which
+         contains a group and a back reference to it.  */
+
+      if (REG_MATCH_NULL_STRING_P (reg_info[reg_no]) == MATCH_NULL_UNSET_VALUE)
+        REG_MATCH_NULL_STRING_P (reg_info[reg_no]) = ret;
+
+      if (!ret)
+        return false;
+      break;
+
+    /* If this is an optimized succeed_n for zero times, make the jump.  */
+    case jump:
+      EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+      if (mcnt >= 0)
+        p1 += mcnt;
+      else
+        return false;
+      break;
+
+    case succeed_n:
+      /* Get to the number of times to succeed.  */
+      p1 += 2;
+      EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+
+      if (mcnt == 0)
+        {
+          p1 -= 4;
+          EXTRACT_NUMBER_AND_INCR (mcnt, p1);
+          p1 += mcnt;
+        }
+      else
+        return false;
+      break;
+
+    case duplicate:
+      if (!REG_MATCH_NULL_STRING_P (reg_info[*p1]))
+        return false;
+      break;
+
+    case set_number_at:
+      p1 += 4;
+
+    default:
+      /* All other opcodes mean we cannot match the empty string.  */
+      return false;
+  }
+
+  *p = p1;
+  return true;
+} /* common_op_match_null_string_p */
+
+
+/* Return zero if TRANSLATE[S1] and TRANSLATE[S2] are identical for LEN
+   bytes; nonzero otherwise.  */
+
+static int
+bcmp_translate (s1, s2, len, translate)
+     unsigned char *s1, *s2;
+     register int len;
+     char *translate;
+{
+  register unsigned char *p1 = s1, *p2 = s2;
+  while (len)
+    {
+      if (translate[*p1++] != translate[*p2++]) return 1;
+      len--;
+    }
+  return 0;
+}
+
+/* Entry points for GNU code.  */
+
+/* re_compile_pattern is the GNU regular expression compiler: it
+   compiles PATTERN (of length SIZE) and puts the result in BUFP.
+   Returns 0 if the pattern was valid, otherwise an error string.
+
+   Assumes the `allocated' (and perhaps `buffer') and `translate' fields
+   are set in BUFP on entry.
+
+   We call regex_compile to do the actual compilation.  */
+
+const char *
+re_compile_pattern (pattern, length, bufp)
+     const char *pattern;
+     int length;
+     struct re_pattern_buffer *bufp;
+{
+  reg_errcode_t ret;
+
+  /* GNU code is written to assume at least RE_NREGS registers will be set
+     (and at least one extra will be -1).  */
+  bufp->regs_allocated = REGS_UNALLOCATED;
+
+  /* And GNU code determines whether or not to get register information
+     by passing null for the REGS argument to re_match, etc., not by
+     setting no_sub.  */
+  bufp->no_sub = 0;
+
+  /* Match anchors at newline.  */
+  bufp->newline_anchor = 1;
+
+  ret = regex_compile (pattern, length, re_syntax_options, bufp);
+
+  return re_error_msg[(int) ret];
+}
+
+/* Entry points compatible with 4.2 BSD regex library.  We don't define
+   them if this is an Emacs or POSIX compilation.  */
+
+#if !defined (emacs) && !defined (_POSIX_SOURCE)
+
+/* BSD has one and only one pattern buffer.  */
+static struct re_pattern_buffer re_comp_buf;
+
+char *
+re_comp (s)
+    const char *s;
+{
+  reg_errcode_t ret;
+
+  if (!s)
+    {
+      if (!re_comp_buf.buffer)
+    return "No previous regular expression";
+      return 0;
+    }
+
+  if (!re_comp_buf.buffer)
+    {
+      re_comp_buf.buffer = (unsigned char *) malloc (200);
+      if (re_comp_buf.buffer == NULL)
+        return "Memory exhausted";
+      re_comp_buf.allocated = 200;
+
+      re_comp_buf.fastmap = (char *) malloc (1 << BYTEWIDTH);
+      if (re_comp_buf.fastmap == NULL)
+    return "Memory exhausted";
+    }
+
+  /* Since `re_exec' always passes NULL for the `regs' argument, we
+     don't need to initialize the pattern buffer fields which affect it.  */
+
+  /* Match anchors at newlines.  */
+  re_comp_buf.newline_anchor = 1;
+
+  ret = regex_compile (s, strlen (s), re_syntax_options, &re_comp_buf);
+
+  /* Yes, we're discarding `const' here.  */
+  return (char *) re_error_msg[(int) ret];
+}
+
+
+int
+re_exec (s)
+    const char *s;
+{
+  const int len = strlen (s);
+  return
+    0 <= re_search (&re_comp_buf, s, len, 0, len, (struct re_registers *) 0);
+}
+#endif /* not emacs and not _POSIX_SOURCE */
+
+/* POSIX.2 functions.  Don't define these for Emacs.  */
+
+#ifndef emacs
+
+/* regcomp takes a regular expression as a string and compiles it.
+
+   PREG is a regex_t *.  We do not expect any fields to be initialized,
+   since POSIX says we shouldn't.  Thus, we set
+
+     `buffer' to the compiled pattern;
+     `used' to the length of the compiled pattern;
+     `syntax' to RE_SYNTAX_POSIX_EXTENDED if the
+       REG_EXTENDED bit in CFLAGS is set; otherwise, to
+       RE_SYNTAX_POSIX_BASIC;
+     `newline_anchor' to REG_NEWLINE being set in CFLAGS;
+     `fastmap' and `fastmap_accurate' to zero;
+     `re_nsub' to the number of subexpressions in PATTERN.
+
+   PATTERN is the address of the pattern string.
+
+   CFLAGS is a series of bits which affect compilation.
+
+     If REG_EXTENDED is set, we use POSIX extended syntax; otherwise, we
+     use POSIX basic syntax.
+
+     If REG_NEWLINE is set, then . and [^...] don't match newline.
+     Also, regexec will try a match beginning after every newline.
+
+     If REG_ICASE is set, then we considers upper- and lowercase
+     versions of letters to be equivalent when matching.
+
+     If REG_NOSUB is set, then when PREG is passed to regexec, that
+     routine will report only success or failure, and nothing about the
+     registers.
+
+   It returns 0 if it succeeds, nonzero if it doesn't.  (See regex.h for
+   the return codes and their meanings.)  */
+
+int
+regcomp (preg, pattern, cflags)
+    regex_t *preg;
+    const char *pattern;
+    int cflags;
+{
+  reg_errcode_t ret;
+  unsigned syntax
+    = (cflags & REG_EXTENDED) ?
+      RE_SYNTAX_POSIX_EXTENDED : RE_SYNTAX_POSIX_BASIC;
+
+  /* regex_compile will allocate the space for the compiled pattern.  */
+  preg->buffer = 0;
+  preg->allocated = 0;
+
+  /* Don't bother to use a fastmap when searching.  This simplifies the
+     REG_NEWLINE case: if we used a fastmap, we'd have to put all the
+     characters after newlines into the fastmap.  This way, we just try
+     every character.  */
+  preg->fastmap = 0;
+
+  if (cflags & REG_ICASE)
+    {
+      unsigned i;
+
+      preg->translate = (char *) malloc (CHAR_SET_SIZE);
+      if (preg->translate == NULL)
+        return (int) REG_ESPACE;
+
+      /* Map uppercase characters to corresponding lowercase ones.  */
+      for (i = 0; i < CHAR_SET_SIZE; i++)
+        preg->translate[i] = ISUPPER (i) ? tolower (i) : i;
+    }
+  else
+    preg->translate = NULL;
+
+  /* If REG_NEWLINE is set, newlines are treated differently.  */
+  if (cflags & REG_NEWLINE)
+    { /* REG_NEWLINE implies neither . nor [^...] match newline.  */
+      syntax &= ~RE_DOT_NEWLINE;
+      syntax |= RE_HAT_LISTS_NOT_NEWLINE;
+      /* It also changes the matching behavior.  */
+      preg->newline_anchor = 1;
+    }
+  else
+    preg->newline_anchor = 0;
+
+  preg->no_sub = !!(cflags & REG_NOSUB);
+
+  /* POSIX says a null character in the pattern terminates it, so we
+     can use strlen here in compiling the pattern.  */
+  ret = regex_compile (pattern, strlen (pattern), syntax, preg);
+
+  /* POSIX doesn't distinguish between an unmatched open-group and an
+     unmatched close-group: both are REG_EPAREN.  */
+  if (ret == REG_ERPAREN) ret = REG_EPAREN;
+
+  return (int) ret;
+}
+
+
+/* regexec searches for a given pattern, specified by PREG, in the
+   string STRING.
+
+   If NMATCH is zero or REG_NOSUB was set in the cflags argument to
+   `regcomp', we ignore PMATCH.  Otherwise, we assume PMATCH has at
+   least NMATCH elements, and we set them to the offsets of the
+   corresponding matched substrings.
+
+   EFLAGS specifies `execution flags' which affect matching: if
+   REG_NOTBOL is set, then ^ does not match at the beginning of the
+   string; if REG_NOTEOL is set, then $ does not match at the end.
+
+   We return 0 if we find a match and REG_NOMATCH if not.  */
+
+int
+regexec (preg, string, nmatch, pmatch, eflags)
+    const regex_t *preg;
+    const char *string;
+    size_t nmatch;
+    regmatch_t pmatch[];
+    int eflags;
+{
+  int ret;
+  struct re_registers regs;
+  regex_t private_preg;
+  int len = strlen (string);
+  boolean want_reg_info = !preg->no_sub && nmatch > 0;
+
+  private_preg = *preg;
+
+  private_preg.not_bol = !!(eflags & REG_NOTBOL);
+  private_preg.not_eol = !!(eflags & REG_NOTEOL);
+
+  /* The user has told us exactly how many registers to return
+     information about, via `nmatch'.  We have to pass that on to the
+     matching routines.  */
+  private_preg.regs_allocated = REGS_FIXED;
+
+  if (want_reg_info)
+    {
+      regs.num_regs = nmatch;
+      regs.start = TALLOC (nmatch, regoff_t);
+      regs.end = TALLOC (nmatch, regoff_t);
+      if (regs.start == NULL || regs.end == NULL)
+        return (int) REG_NOMATCH;
+    }
+
+  /* Perform the searching operation.  */
+  ret = re_search (&private_preg, string, len,
+                   /* start: */ 0, /* range: */ len,
+                   want_reg_info ? &regs : (struct re_registers *) 0);
+
+  /* Copy the register information to the POSIX structure.  */
+  if (want_reg_info)
+    {
+      if (ret >= 0)
+        {
+          unsigned r;
+
+          for (r = 0; r < nmatch; r++)
+            {
+              pmatch[r].rm_so = regs.start[r];
+              pmatch[r].rm_eo = regs.end[r];
+            }
+        }
+
+      /* If we needed the temporary register info, free the space now.  */
+      free (regs.start);
+      free (regs.end);
+    }
+
+  /* We want zero return to mean success, unlike `re_search'.  */
+  return ret >= 0 ? (int) REG_NOERROR : (int) REG_NOMATCH;
+}
+
+
+/* Returns a message corresponding to an error code, ERRCODE, returned
+   from either regcomp or regexec.   We don't use PREG here.  */
+
+size_t
+regerror (errcode_v, preg, errbuf, errbuf_size)
+    int errcode_v;
+    const regex_t *preg;
+    char *errbuf;
+    size_t errbuf_size;
+{
+  const char *msg;
+  size_t msg_size;
+
+  if (errcode_v < 0
+      || errcode_v >= (sizeof (re_error_msg) / sizeof (re_error_msg[0])))
+    /* Only error codes returned by the rest of the code should be passed
+       to this routine.  If we are given anything else, or if other regex
+       code generates an invalid error code, then the program has a bug.
+       Dump core so we can fix it.  */
+    abort ();
+
+  msg = re_error_msg[errcode_v];
+
+  /* POSIX doesn't require that we do anything in this case, but why
+     not be nice.  */
+  if (! msg)
+    msg = "Success";
+
+  msg_size = strlen (msg) + 1; /* Includes the null.  */
+
+  if (errbuf_size != 0)
+    {
+      if (msg_size > errbuf_size)
+        {
+          strncpy (errbuf, msg, errbuf_size - 1);
+          errbuf[errbuf_size - 1] = 0;
+        }
+      else
+        strcpy (errbuf, msg);
+    }
+
+  return msg_size;
+}
+
+
+/* Free dynamically allocated space used by PREG.  */
+
+void
+regfree (preg)
+    regex_t *preg;
+{
+  if (preg->buffer != NULL)
+    free (preg->buffer);
+  preg->buffer = NULL;
+
+  preg->allocated = 0;
+  preg->used = 0;
+
+  if (preg->fastmap != NULL)
+    free (preg->fastmap);
+  preg->fastmap = NULL;
+  preg->fastmap_accurate = 0;
+
+  if (preg->translate != NULL)
+    free (preg->translate);
+  preg->translate = NULL;
+}
+
+#endif /* not emacs  */
+
+/*
+Local variables:
+make-backup-files: t
+version-control: t
+trim-versions-without-asking: nil
+End:
+*/
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/regex.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/regex.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/regex.h	(revision 70339)
@@ -0,0 +1,498 @@
+/* Definitions for data structures and routines for the regular
+   expression library, version 0.12.
+
+   Copyright (C) 1985, 1989, 1990, 1991, 1992, 1993 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
+
+#ifndef __REGEXP_LIBRARY_H__
+#define __REGEXP_LIBRARY_H__
+
+#ifdef __cplusplus
+  extern "C" {
+#endif
+
+/* POSIX says that <sys/types.h> must be included (by the caller) before
+   <regex.h>.  */
+
+#ifdef VMS
+/* VMS doesn't have `size_t' in <sys/types.h>, even though POSIX says it
+   should be there.  */
+#include <stddef.h>
+#endif
+
+
+/* The following bits are used to determine the regexp syntax we
+   recognize.  The set/not-set meanings are chosen so that Emacs syntax
+   remains the value 0.  The bits are given in alphabetical order, and
+   the definitions shifted by one from the previous bit; thus, when we
+   add or remove a bit, only one other definition need change.  */
+typedef unsigned reg_syntax_t;
+
+/* If this bit is not set, then \ inside a bracket expression is literal.
+   If set, then such a \ quotes the following character.  */
+#define RE_BACKSLASH_ESCAPE_IN_LISTS (1)
+
+/* If this bit is not set, then + and ? are operators, and \+ and \? are
+	 literals.
+   If set, then \+ and \? are operators and + and ? are literals.  */
+#define RE_BK_PLUS_QM (RE_BACKSLASH_ESCAPE_IN_LISTS << 1)
+
+/* If this bit is set, then character classes are supported.  They are:
+	 [:alpha:], [:upper:], [:lower:],  [:digit:], [:alnum:], [:xdigit:],
+	 [:space:], [:print:], [:punct:], [:graph:], and [:cntrl:].
+   If not set, then character classes are not supported.  */
+#define RE_CHAR_CLASSES (RE_BK_PLUS_QM << 1)
+
+/* If this bit is set, then ^ and $ are always anchors (outside bracket
+	 expressions, of course).
+   If this bit is not set, then it depends:
+		^  is an anchor if it is at the beginning of a regular
+		   expression or after an open-group or an alternation operator;
+		$  is an anchor if it is at the end of a regular expression, or
+		   before a close-group or an alternation operator.
+
+   This bit could be (re)combined with RE_CONTEXT_INDEP_OPS, because
+   POSIX draft 11.2 says that * etc. in leading positions is undefined.
+   We already implemented a previous draft which made those constructs
+   invalid, though, so we haven't changed the code back.  */
+#define RE_CONTEXT_INDEP_ANCHORS (RE_CHAR_CLASSES << 1)
+
+/* If this bit is set, then special characters are always special
+	 regardless of where they are in the pattern.
+   If this bit is not set, then special characters are special only in
+	 some contexts; otherwise they are ordinary.  Specifically,
+	 * + ? and intervals are only special when not after the beginning,
+	 open-group, or alternation operator.  */
+#define RE_CONTEXT_INDEP_OPS (RE_CONTEXT_INDEP_ANCHORS << 1)
+
+/* If this bit is set, then *, +, ?, and { cannot be first in an re or
+	 immediately after an alternation or begin-group operator.  */
+#define RE_CONTEXT_INVALID_OPS (RE_CONTEXT_INDEP_OPS << 1)
+
+/* If this bit is set, then . matches newline.
+   If not set, then it doesn't.  */
+#define RE_DOT_NEWLINE (RE_CONTEXT_INVALID_OPS << 1)
+
+/* If this bit is set, then . doesn't match NUL.
+   If not set, then it does.  */
+#define RE_DOT_NOT_NULL (RE_DOT_NEWLINE << 1)
+
+/* If this bit is set, nonmatching lists [^...] do not match newline.
+   If not set, they do.  */
+#define RE_HAT_LISTS_NOT_NEWLINE (RE_DOT_NOT_NULL << 1)
+
+/* If this bit is set, either \{...\} or {...} defines an
+	 interval, depending on RE_NO_BK_BRACES.
+   If not set, \{, \}, {, and } are literals.  */
+#define RE_INTERVALS (RE_HAT_LISTS_NOT_NEWLINE << 1)
+
+/* If this bit is set, +, ? and | aren't recognized as operators.
+   If not set, they are.  */
+#define RE_LIMITED_OPS (RE_INTERVALS << 1)
+
+/* If this bit is set, newline is an alternation operator.
+   If not set, newline is literal.  */
+#define RE_NEWLINE_ALT (RE_LIMITED_OPS << 1)
+
+/* If this bit is set, then `{...}' defines an interval, and \{ and \}
+	 are literals.
+  If not set, then `\{...\}' defines an interval.  */
+#define RE_NO_BK_BRACES (RE_NEWLINE_ALT << 1)
+
+/* If this bit is set, (...) defines a group, and \( and \) are literals.
+   If not set, \(...\) defines a group, and ( and ) are literals.  */
+#define RE_NO_BK_PARENS (RE_NO_BK_BRACES << 1)
+
+/* If this bit is set, then \<digit> matches <digit>.
+   If not set, then \<digit> is a back-reference.  */
+#define RE_NO_BK_REFS (RE_NO_BK_PARENS << 1)
+
+/* If this bit is set, then | is an alternation operator, and \| is literal.
+   If not set, then \| is an alternation operator, and | is literal.  */
+#define RE_NO_BK_VBAR (RE_NO_BK_REFS << 1)
+
+/* If this bit is set, then an ending range point collating higher
+	 than the starting range point, as in [z-a], is invalid.
+   If not set, then when ending range point collates higher than the
+	 starting range point, the range is ignored.  */
+#define RE_NO_EMPTY_RANGES (RE_NO_BK_VBAR << 1)
+
+/* If this bit is set, then an unmatched ) is ordinary.
+   If not set, then an unmatched ) is invalid.  */
+#define RE_UNMATCHED_RIGHT_PAREN_ORD (RE_NO_EMPTY_RANGES << 1)
+
+/* This global variable defines the particular regexp syntax to use (for
+   some interfaces).  When a regexp is compiled, the syntax used is
+   stored in the pattern buffer, so changing this does not affect
+   already-compiled regexps.  */
+extern reg_syntax_t re_syntax_options;
+
+/* Define combinations of the above bits for the standard possibilities.
+   (The [[[ comments delimit what gets put into the Texinfo file, so
+   don't delete them!)  */
+/* [[[begin syntaxes]]] */
+#define RE_SYNTAX_EMACS 0
+
+#define RE_SYNTAX_AWK							\
+  (RE_BACKSLASH_ESCAPE_IN_LISTS | RE_DOT_NOT_NULL			\
+   | RE_NO_BK_PARENS            | RE_NO_BK_REFS				\
+   | RE_NO_BK_VBAR               | RE_NO_EMPTY_RANGES			\
+   | RE_UNMATCHED_RIGHT_PAREN_ORD)
+
+#define RE_SYNTAX_POSIX_AWK 						\
+  (RE_SYNTAX_POSIX_EXTENDED | RE_BACKSLASH_ESCAPE_IN_LISTS)
+
+#define RE_SYNTAX_GREP							\
+  (RE_BK_PLUS_QM              | RE_CHAR_CLASSES				\
+   | RE_HAT_LISTS_NOT_NEWLINE | RE_INTERVALS				\
+   | RE_NEWLINE_ALT)
+
+#define RE_SYNTAX_EGREP							\
+  (RE_CHAR_CLASSES        | RE_CONTEXT_INDEP_ANCHORS			\
+   | RE_CONTEXT_INDEP_OPS | RE_HAT_LISTS_NOT_NEWLINE			\
+   | RE_NEWLINE_ALT       | RE_NO_BK_PARENS				\
+   | RE_NO_BK_VBAR)
+
+#define RE_SYNTAX_POSIX_EGREP						\
+  (RE_SYNTAX_EGREP | RE_INTERVALS | RE_NO_BK_BRACES)
+
+/* P1003.2/D11.2, section 4.20.7.1, lines 5078ff.  */
+#define RE_SYNTAX_ED RE_SYNTAX_POSIX_BASIC
+
+#define RE_SYNTAX_SED RE_SYNTAX_POSIX_BASIC
+
+/* Syntax bits common to both basic and extended POSIX regex syntax.  */
+#define _RE_SYNTAX_POSIX_COMMON						\
+  (RE_CHAR_CLASSES | RE_DOT_NEWLINE      | RE_DOT_NOT_NULL		\
+   | RE_INTERVALS  | RE_NO_EMPTY_RANGES)
+
+#define RE_SYNTAX_POSIX_BASIC						\
+  (_RE_SYNTAX_POSIX_COMMON | RE_BK_PLUS_QM)
+
+/* Differs from ..._POSIX_BASIC only in that RE_BK_PLUS_QM becomes
+   RE_LIMITED_OPS, i.e., \? \+ \| are not recognized.  Actually, this
+   isn't minimal, since other operators, such as \`, aren't disabled.  */
+#define RE_SYNTAX_POSIX_MINIMAL_BASIC					\
+  (_RE_SYNTAX_POSIX_COMMON | RE_LIMITED_OPS)
+
+#define RE_SYNTAX_POSIX_EXTENDED					\
+  (_RE_SYNTAX_POSIX_COMMON | RE_CONTEXT_INDEP_ANCHORS			\
+   | RE_CONTEXT_INDEP_OPS  | RE_NO_BK_BRACES				\
+   | RE_NO_BK_PARENS       | RE_NO_BK_VBAR				\
+   | RE_UNMATCHED_RIGHT_PAREN_ORD)
+
+/* Differs from ..._POSIX_EXTENDED in that RE_CONTEXT_INVALID_OPS
+   replaces RE_CONTEXT_INDEP_OPS and RE_NO_BK_REFS is added.  */
+#define RE_SYNTAX_POSIX_MINIMAL_EXTENDED				\
+  (_RE_SYNTAX_POSIX_COMMON  | RE_CONTEXT_INDEP_ANCHORS			\
+   | RE_CONTEXT_INVALID_OPS | RE_NO_BK_BRACES				\
+   | RE_NO_BK_PARENS        | RE_NO_BK_REFS				\
+   | RE_NO_BK_VBAR	    | RE_UNMATCHED_RIGHT_PAREN_ORD)
+/* [[[end syntaxes]]] */
+
+/* Maximum number of duplicates an interval can allow.  Some systems
+   (erroneously) define this in other header files, but we want our
+   value, so remove any previous define.  */
+#ifdef RE_DUP_MAX
+#undef RE_DUP_MAX
+#endif
+#define RE_DUP_MAX ((1 << 15) - 1)
+
+
+/* POSIX `cflags' bits (i.e., information for `regcomp').  */
+
+/* If this bit is set, then use extended regular expression syntax.
+   If not set, then use basic regular expression syntax.  */
+#define REG_EXTENDED 1
+
+/* If this bit is set, then ignore case when matching.
+   If not set, then case is significant.  */
+#define REG_ICASE (REG_EXTENDED << 1)
+
+/* If this bit is set, then anchors do not match at newline
+	 characters in the string.
+   If not set, then anchors do match at newlines.  */
+#define REG_NEWLINE (REG_ICASE << 1)
+
+/* If this bit is set, then report only success or fail in regexec.
+   If not set, then returns differ between not matching and errors.  */
+#define REG_NOSUB (REG_NEWLINE << 1)
+
+
+/* POSIX `eflags' bits (i.e., information for regexec).  */
+
+/* If this bit is set, then the beginning-of-line operator doesn't match
+	 the beginning of the string (presumably because it's not the
+	 beginning of a line).
+   If not set, then the beginning-of-line operator does match the
+	 beginning of the string.  */
+#define REG_NOTBOL 1
+
+/* Like REG_NOTBOL, except for the end-of-line.  */
+#define REG_NOTEOL (1 << 1)
+
+
+/* If any error codes are removed, changed, or added, update the
+   `re_error_msg' table in regex.c.  */
+typedef enum
+{
+  REG_NOERROR = 0,	/* Success.  */
+  REG_NOMATCH,		/* Didn't find a match (for regexec).  */
+
+  /* POSIX regcomp return error codes.  (In the order listed in the
+	 standard.)  */
+  REG_BADPAT,		/* Invalid pattern.  */
+  REG_ECOLLATE,		/* Not implemented.  */
+  REG_ECTYPE,		/* Invalid character class name.  */
+  REG_EESCAPE,		/* Trailing backslash.  */
+  REG_ESUBREG,		/* Invalid back reference.  */
+  REG_EBRACK,		/* Unmatched left bracket.  */
+  REG_EPAREN,		/* Parenthesis imbalance.  */
+  REG_EBRACE,		/* Unmatched \{.  */
+  REG_BADBR,		/* Invalid contents of \{\}.  */
+  REG_ERANGE,		/* Invalid range end.  */
+  REG_ESPACE,		/* Ran out of memory.  */
+  REG_BADRPT,		/* No preceding re for repetition op.  */
+
+  /* Error codes we've added.  */
+  REG_EEND,		/* Premature end.  */
+  REG_ESIZE,		/* Compiled pattern bigger than 2^16 bytes.  */
+  REG_ERPAREN		/* Unmatched ) or \); not returned from regcomp.  */
+} reg_errcode_t;
+
+/* This data structure represents a compiled pattern.  Before calling
+   the pattern compiler, the fields `buffer', `allocated', `fastmap',
+   `translate', and `no_sub' can be set.  After the pattern has been
+   compiled, the `re_nsub' field is available.  All other fields are
+   private to the regex routines.  */
+
+struct re_pattern_buffer
+{
+/* [[[begin pattern_buffer]]] */
+	/* Space that holds the compiled pattern.  It is declared as
+		  `unsigned char *' because its elements are
+		   sometimes used as array indexes.  */
+  unsigned char *buffer;
+
+	/* Number of bytes to which `buffer' points.  */
+  unsigned long allocated;
+
+	/* Number of bytes actually used in `buffer'.  */
+  unsigned long used;
+
+		/* Syntax setting with which the pattern was compiled.  */
+  reg_syntax_t syntax;
+
+		/* Pointer to a fastmap, if any, otherwise zero.  re_search uses
+		   the fastmap, if there is one, to skip over impossible
+		   starting points for matches.  */
+  char *fastmap;
+
+		/* Either a translate table to apply to all characters before
+		   comparing them, or zero for no translation.  The translation
+		   is applied to a pattern when it is compiled and to a string
+		   when it is matched.  */
+  char *translate;
+
+	/* Number of subexpressions found by the compiler.  */
+  size_t re_nsub;
+
+		/* Zero if this pattern cannot match the empty string, one else.
+		   Well, in truth it's used only in `re_search_2', to see
+		   whether or not we should use the fastmap, so we don't set
+		   this absolutely perfectly; see `re_compile_fastmap' (the
+		   `duplicate' case).  */
+  unsigned can_be_null : 1;
+
+		/* If REGS_UNALLOCATED, allocate space in the `regs' structure
+			 for `max (RE_NREGS, re_nsub + 1)' groups.
+		   If REGS_REALLOCATE, reallocate space if necessary.
+		   If REGS_FIXED, use what's there.  */
+#define REGS_UNALLOCATED 0
+#define REGS_REALLOCATE 1
+#define REGS_FIXED 2
+  unsigned regs_allocated : 2;
+
+		/* Set to zero when `regex_compile' compiles a pattern; set to one
+		   by `re_compile_fastmap' if it updates the fastmap.  */
+  unsigned fastmap_accurate : 1;
+
+		/* If set, `re_match_2' does not return information about
+		   subexpressions.  */
+  unsigned no_sub : 1;
+
+		/* If set, a beginning-of-line anchor doesn't match at the
+		   beginning of the string.  */
+  unsigned not_bol : 1;
+
+		/* Similarly for an end-of-line anchor.  */
+  unsigned not_eol : 1;
+
+		/* If true, an anchor at a newline matches.  */
+  unsigned newline_anchor : 1;
+
+/* [[[end pattern_buffer]]] */
+};
+
+typedef struct re_pattern_buffer regex_t;
+
+
+/* search.c (search_buffer) in Emacs needs this one opcode value.  It is
+   defined both in `regex.c' and here.  */
+#define RE_EXACTN_VALUE 1
+
+/* Type for byte offsets within the string.  POSIX mandates this.  */
+typedef int regoff_t;
+
+
+/* This is the structure we store register match data in.  See
+   regex.texinfo for a full description of what registers match.  */
+struct re_registers
+{
+  unsigned num_regs;
+  regoff_t *start;
+  regoff_t *end;
+};
+
+
+/* If `regs_allocated' is REGS_UNALLOCATED in the pattern buffer,
+   `re_match_2' returns information about at least this many registers
+   the first time a `regs' structure is passed.  */
+#ifndef RE_NREGS
+#define RE_NREGS 30
+#endif
+
+
+/* POSIX specification for registers.  Aside from the different names than
+   `re_registers', POSIX uses an array of structures, instead of a
+   structure of arrays.  */
+typedef struct
+{
+  regoff_t rm_so;  /* Byte offset from string's start to substring's start.  */
+  regoff_t rm_eo;  /* Byte offset from string's start to substring's end.  */
+} regmatch_t;
+
+/* Declarations for routines.  */
+
+/* To avoid duplicating every routine declaration -- once with a
+   prototype (if we are ANSI), and once without (if we aren't) -- we
+   use the following macro to declare argument types.  This
+   unfortunately clutters up the declarations a bit, but I think it's
+   worth it.  */
+
+#if __STDC__
+
+#define _RE_ARGS(args) args
+
+#else /* not __STDC__ */
+
+#define _RE_ARGS(args) ()
+
+#endif /* not __STDC__ */
+
+/* Sets the current default syntax to SYNTAX, and return the old syntax.
+   You can also simply assign to the `re_syntax_options' variable.  */
+extern reg_syntax_t re_set_syntax _RE_ARGS ((reg_syntax_t syntax));
+
+/* Compile the regular expression PATTERN, with length LENGTH
+   and syntax given by the global `re_syntax_options', into the buffer
+   BUFFER.  Return NULL if successful, and an error string if not.  */
+extern const char *re_compile_pattern
+  _RE_ARGS ((const char *pattern, int length,
+			 struct re_pattern_buffer *buffer));
+
+
+/* Compile a fastmap for the compiled pattern in BUFFER; used to
+   accelerate searches.  Return 0 if successful and -2 if was an
+   internal error.  */
+extern int re_compile_fastmap _RE_ARGS ((struct re_pattern_buffer *buffer));
+
+
+/* Search in the string STRING (with length LENGTH) for the pattern
+   compiled into BUFFER.  Start searching at position START, for RANGE
+   characters.  Return the starting position of the match, -1 for no
+   match, or -2 for an internal error.  Also return register
+   information in REGS (if REGS and BUFFER->no_sub are nonzero).  */
+extern int re_search
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string,
+			int length, int start, int range, struct re_registers *regs));
+
+
+/* Like `re_search', but search in the concatenation of STRING1 and
+   STRING2.  Also, stop searching at index START + STOP.  */
+extern int re_search_2
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1,
+			 int length1, const char *string2, int length2,
+			 int start, int range, struct re_registers *regs, int stop));
+
+
+/* Like `re_search', but return how many characters in STRING the regexp
+   in BUFFER matched, starting at position START.  */
+extern int re_match
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string,
+			 int length, int start, struct re_registers *regs));
+
+
+/* Relates to `re_match' as `re_search_2' relates to `re_search'.  */
+extern int re_match_2
+  _RE_ARGS ((struct re_pattern_buffer *buffer, const char *string1,
+			 int length1, const char *string2, int length2,
+			 int start, struct re_registers *regs, int stop));
+
+
+/* Set REGS to hold NUM_REGS registers, storing them in STARTS and
+   ENDS.  Subsequent matches using BUFFER and REGS will use this memory
+   for recording register information.  STARTS and ENDS must be
+   allocated with malloc, and must each be at least `NUM_REGS * sizeof
+   (regoff_t)' bytes long.
+
+   If NUM_REGS == 0, then subsequent matches should allocate their own
+   register data.
+
+   Unless this function is called, the first search or match using
+   PATTERN_BUFFER will allocate its own register data, without
+   freeing the old data.  */
+extern void re_set_registers
+  _RE_ARGS ((struct re_pattern_buffer *buffer, struct re_registers *regs,
+			 unsigned num_regs, regoff_t *starts, regoff_t *ends));
+
+/* 4.2 bsd compatibility.  */
+extern char *re_comp _RE_ARGS ((const char *));
+extern int re_exec _RE_ARGS ((const char *));
+
+/* POSIX compatibility.  */
+extern int regcomp _RE_ARGS ((regex_t *preg, const char *pattern, int cflags));
+extern int regexec
+  _RE_ARGS ((const regex_t *preg, const char *string, size_t nmatch,
+			 regmatch_t pmatch[], int eflags));
+extern size_t regerror
+  _RE_ARGS ((int errcode, const regex_t *preg, char *errbuf,
+			 size_t errbuf_size));
+extern void regfree _RE_ARGS ((regex_t *preg));
+
+#ifdef __cplusplus
+  }
+#endif
+
+#endif /* not __REGEXP_LIBRARY_H__ */
+
+/*
+Local variables:
+make-backup-files: t
+version-control: t
+trim-versions-without-asking: nil
+End:
+*/
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/win32/runner_skeleton.c
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/win32/runner_skeleton.c	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/win32/runner_skeleton.c	(revision 70339)
@@ -0,0 +1,77 @@
+#include <stdio.h>
+#include <conio.h>
+#include <process.h>
+#include <direct.h>
+#include <stdlib.h>
+#include <string.h>
+#include <wchar.h>
+
+#define PATH_BUF_SIZE 8191
+#define NUM_EXEC_ARGS 3
+#define ARG_BUF_SIZE (8191 - NUM_EXEC_ARGS)
+#define ENV_VAR_SIZE 32768
+
+/* Strip the last component off a pathname.
+   Thus, parent("a\b\c") -> "a\b" */
+char* parent(char* parent_buf) {
+        char* pos = strrchr(parent_buf, '\\');
+        pos[0] = '\0';
+
+        return parent_buf;
+}
+
+/* Remove the .exe if the user invoked this executable with its extension.
+   That is, if the user typed something like apertium.exe instead of apertium. */
+char* remove_extension(char* buf) {
+        char* pos = strrchr(buf, '.');
+
+        if (pos != NULL && strcmp(pos, ".exe") == 0) {
+                pos[0] = '\0';
+        }
+
+        return buf;
+}
+
+#define MIN(x, y) ((x) < (y) ? x : y)
+
+int main(int argc, char* argv[]) {
+        char *args[ARG_BUF_SIZE];
+        char base_path[PATH_BUF_SIZE + 1];
+        char script_path[PATH_BUF_SIZE + 1];
+        char shell_path[PATH_BUF_SIZE + 1];
+        char env_path[ENV_VAR_SIZE];
+        int argi;
+
+        _fullpath(shell_path, argv[0], PATH_BUF_SIZE);
+        strcpy(script_path, shell_path);
+        strcpy(base_path, shell_path);
+
+        parent(shell_path);
+        strcat(shell_path, "\\sh.exe");
+
+        remove_extension(script_path);
+        parent(base_path);
+
+        args[0] = shell_path;
+        args[1] = "--norc";
+        args[2] = script_path;
+
+        /* Any parameters passed on the command line will be passed through to the shell script */
+        for (argi = 0; argi < MIN(argc - 1, ARG_BUF_SIZE); argi++) {
+                printf("%s\n", argv[argi + 1]);
+                args[argi + NUM_EXEC_ARGS] = argv[argi + 1];
+        }
+        /* Signal the end of the argument list */
+        args[argi + NUM_EXEC_ARGS] = NULL;
+
+        /* Add this executable's directory to the path */
+        strcpy(env_path, "PATH=");
+        strcat(env_path, getenv("PATH"));
+        strcat(env_path, ";");
+        strcat(env_path, base_path);
+        _putenv(env_path);
+
+        _spawnv(_P_WAIT, args[0], &args[1]);
+
+        _flushall();
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/serialiser.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/serialiser.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/serialiser.h	(revision 70339)
@@ -0,0 +1,288 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef SERIALISER_H
+#define SERIALISER_H
+
+#include "a.h"
+#include "basic_exception_type.h"
+#include "analysis.h"
+#include "exception.h"
+#include "i.h"
+#include "lemma.h"
+#include "morpheme.h"
+#include "tag.h"
+
+#include <cstddef>
+#include <ios>
+#include <limits>
+#include <map>
+#include <ostream>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+
+namespace Apertium {
+namespace {
+template <typename SerialisedType>
+static unsigned char compressedSize(const SerialisedType &SerialisedType_) {
+  unsigned char compressedSize_ = 0;
+
+  for (; (SerialisedType_ >>
+          std::numeric_limits<unsigned char>::digits * compressedSize_) != 0;
+       ++compressedSize_) {
+  }
+
+  return compressedSize_;
+}
+
+template <typename SerialisedType> class Serialiser;
+
+template <> class Serialiser<a> {
+public:
+  inline static void serialise(const a &SerialisedType_, std::ostream &Output);
+};
+
+template <> class Serialiser<Analysis> {
+public:
+  inline static void serialise(const Analysis &SerialisedType_,
+                               std::ostream &Output);
+};
+
+template <> class Serialiser<i> {
+public:
+  inline static void serialise(const i &SerialisedType_, std::ostream &Output);
+};
+
+template <> class Serialiser<Lemma> {
+public:
+  inline static void serialise(const Lemma &SerialisedType_,
+                               std::ostream &Output);
+};
+
+template <> class Serialiser<Morpheme> {
+public:
+  inline static void serialise(const Morpheme &SerialisedType_,
+                               std::ostream &Output);
+};
+
+template <> class Serialiser<Tag> {
+public:
+  inline static void serialise(const Tag &SerialisedType_,
+                               std::ostream &Output);
+};
+
+template <typename value_type>
+class Serialiser<std::basic_string<value_type> > {
+public:
+  inline static void
+  serialise(const std::basic_string<value_type> &SerialisedType_,
+            std::ostream &Output);
+};
+
+template <typename key_type, typename mapped_type>
+class Serialiser<std::map<key_type, mapped_type> > {
+public:
+  inline static void
+  serialise(const std::map<key_type, mapped_type> &SerialisedType_,
+            std::ostream &Output);
+};
+
+template <typename first_type, typename second_type>
+class Serialiser<std::pair<first_type, second_type> > {
+public:
+  inline static void
+  serialise(const std::pair<first_type, second_type> &SerialisedType_,
+            std::ostream &Output);
+};
+
+template <> class Serialiser<std::size_t> {
+public:
+  inline static void serialise(const std::size_t &SerialisedType_,
+                               std::ostream &Output);
+};
+
+template <typename value_type> class Serialiser<std::vector<value_type> > {
+public:
+  inline static void serialise(const std::vector<value_type> &SerialisedType_,
+                               std::ostream &Output);
+};
+
+template <> class Serialiser<wchar_t> {
+public:
+  inline static void serialise(const wchar_t &SerialisedType_,
+                               std::ostream &Output);
+};
+}
+
+template <typename SerialisedType>
+inline void serialise(const SerialisedType &SerialisedType_,
+                      std::ostream &Output) {
+  Serialiser<SerialisedType>::serialise(SerialisedType_, Output);
+}
+
+void Serialiser<a>::serialise(const a &SerialisedType_, std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.TheTags, Output);
+  ::Apertium::serialise(SerialisedType_.TheMorphemes, Output);
+}
+
+void Serialiser<Analysis>::serialise(const Analysis &SerialisedType_,
+                                     std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.TheMorphemes, Output);
+}
+
+void Serialiser<i>::serialise(const i &SerialisedType_, std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.TheTags, Output);
+}
+
+void Serialiser<Lemma>::serialise(const Lemma &SerialisedType_,
+                                  std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.TheLemma, Output);
+}
+
+void Serialiser<Morpheme>::serialise(const Morpheme &SerialisedType_,
+                                     std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.TheLemma, Output);
+  ::Apertium::serialise(SerialisedType_.TheTags, Output);
+}
+
+void Serialiser<Tag>::serialise(const Tag &SerialisedType_,
+                                std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.TheTag, Output);
+}
+
+template <typename value_type>
+void Serialiser<std::basic_string<value_type> >::serialise(
+    const std::basic_string<value_type> &SerialisedType_,
+    std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.size(), Output);
+
+  for (typename std::basic_string<value_type>::const_iterator
+           SerialisedType_iterator = SerialisedType_.begin();
+       // Call .end() each iteration to save memory.
+       SerialisedType_iterator != SerialisedType_.end();
+       ++SerialisedType_iterator) {
+    ::Apertium::serialise(*SerialisedType_iterator, Output);
+  }
+}
+
+template <typename key_type, typename mapped_type>
+void Serialiser<std::map<key_type, mapped_type> >::serialise(
+    const std::map<key_type, mapped_type> &SerialisedType_,
+    std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.size(), Output);
+
+  for (typename std::map<key_type, mapped_type>::const_iterator
+           SerialisedType_iterator = SerialisedType_.begin();
+       // Call .end() each iteration to save memory.
+       SerialisedType_iterator != SerialisedType_.end();
+       ++SerialisedType_iterator) {
+    ::Apertium::serialise(*SerialisedType_iterator, Output);
+  }
+}
+
+template <typename first_type, typename second_type>
+void Serialiser<std::pair<first_type, second_type> >::serialise(
+    const std::pair<first_type, second_type> &SerialisedType_,
+    std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.first, Output);
+  ::Apertium::serialise(SerialisedType_.second, Output);
+}
+
+void Serialiser<std::size_t>::serialise(const std::size_t &SerialisedType_,
+                                        std::ostream &Output) {
+  try {
+    Output.put(compressedSize(SerialisedType_));
+
+    if (!Output) {
+      std::stringstream what_;
+      what_ << "can't serialise size " << std::hex
+            << /* [1] */ +compressedSize(SerialisedType_) << std::dec;
+      throw Exception::Serialiser::not_Stream_good(what_);
+    }
+
+    for (unsigned char CompressedSize = compressedSize(SerialisedType_);
+         CompressedSize != 0; Output.put(static_cast<unsigned char>(
+             SerialisedType_ >>
+             std::numeric_limits<unsigned char>::digits * --CompressedSize))) {
+      if (!Output) {
+        std::stringstream what_;
+        what_ << "can't serialise byte " << std::hex
+              << /* [1] */ +static_cast<unsigned char>(
+                     SerialisedType_ >>
+                     std::numeric_limits<unsigned char>::digits *
+                         CompressedSize) << std::dec;
+        throw Exception::Serialiser::not_Stream_good(what_);
+      }
+    }
+  } catch (const basic_ExceptionType &basic_ExceptionType_) {
+    std::stringstream what_;
+    what_ << "can't serialise const std::size_t & : "
+          << basic_ExceptionType_.what();
+    throw Exception::Serialiser::size_t_(what_);
+  }
+}
+
+template <typename value_type>
+void Serialiser<std::vector<value_type> >::serialise(
+    const std::vector<value_type> &SerialisedType_, std::ostream &Output) {
+  ::Apertium::serialise(SerialisedType_.size(), Output);
+
+  for (typename std::vector<value_type>::const_iterator value_type_ =
+           SerialisedType_.begin();
+       // Call .end() each iteration to save memory.
+       value_type_ != SerialisedType_.end(); ++value_type_) {
+    ::Apertium::serialise(*value_type_, Output);
+  }
+}
+
+void Serialiser<wchar_t>::serialise(const wchar_t &SerialisedType_,
+                                    std::ostream &Output) {
+  try {
+    Output.put(compressedSize(SerialisedType_));
+
+    if (!Output) {
+      std::stringstream what_;
+      what_ << "can't serialise size " << std::hex
+            << /* [1] */ +compressedSize(SerialisedType_);
+      throw Exception::Serialiser::not_Stream_good(what_);
+    }
+
+    for (unsigned char CompressedSize = compressedSize(SerialisedType_);
+         CompressedSize != 0; Output.put(static_cast<unsigned char>(
+             static_cast<unsigned wchar_t>(SerialisedType_) >>
+             std::numeric_limits<unsigned char>::digits * --CompressedSize))) {
+      if (!Output) {
+        std::stringstream what_;
+        what_ << "can't serialise byte " << std::hex
+              << /* [1] */ +(static_cast<unsigned wchar_t>(SerialisedType_) >>
+                             std::numeric_limits<unsigned char>::digits *
+                                 CompressedSize);
+        throw Exception::Serialiser::not_Stream_good(what_);
+      }
+    }
+  } catch (const basic_ExceptionType &basic_ExceptionType_) {
+    std::stringstream what_;
+    what_ << "can't serialise const wchar_t & : "
+          << basic_ExceptionType_.what();
+    throw Exception::Serialiser::wchar_t_(what_);
+  }
+}
+}
+
+// [1] operator+ promotes its operand to a printable integral type.
+
+#endif // SERIALISER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger_trainer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger_trainer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger_trainer.cc	(revision 70339)
@@ -0,0 +1,50 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "stream_5_3_1_tagger_trainer.h"
+
+#include "analysis.h"
+#include "basic_tagger.h"
+#include "serialiser.h"
+
+#include <cstddef>
+#include <map>
+#include <ostream>
+#include <utility>
+
+namespace Apertium {
+Stream_5_3_1_TaggerTrainer::Stream_5_3_1_TaggerTrainer(
+    const basic_Tagger::Flags &Flags_)
+    : basic_5_3_1_Tagger(), basic_StreamTaggerTrainer(Flags_) {}
+
+void Stream_5_3_1_TaggerTrainer::serialise(
+    std::ostream &Serialised_basic_Tagger) const {
+  ::Apertium::serialise(Model, Serialised_basic_Tagger);
+}
+
+void
+Stream_5_3_1_TaggerTrainer::train_Analysis(const Analysis &Analysis_,
+                                           const std::size_t &Coefficient_) {
+  Model.insert(std::make_pair(Analysis_, 0)).first->second += Coefficient_;
+}
+
+void Stream_5_3_1_TaggerTrainer::multiplyModel(
+    const std::size_t &OccurrenceCoefficientMultiplier) {
+  for (std::map<Analysis, std::size_t>::iterator Analysis_ = Model.begin();
+       Analysis_ != Model.end(); ++Analysis_) {
+    Analysis_->second *= OccurrenceCoefficientMultiplier;
+  }
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger_trainer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger_trainer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger_trainer.cc	(revision 70339)
@@ -0,0 +1,55 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "stream_5_3_2_tagger_trainer.h"
+
+#include "a.h"
+#include "analysis.h"
+#include "lemma.h"
+#include "serialiser.h"
+
+#include <map>
+#include <ostream>
+#include <utility>
+
+namespace Apertium {
+Stream_5_3_2_TaggerTrainer::Stream_5_3_2_TaggerTrainer(const Flags &Flags_)
+    : basic_StreamTaggerTrainer(Flags_) {}
+
+void Stream_5_3_2_TaggerTrainer::serialise(
+    std::ostream &Serialised_basic_Tagger) const {
+  ::Apertium::serialise(Model, Serialised_basic_Tagger);
+}
+
+void
+Stream_5_3_2_TaggerTrainer::train_Analysis(const Analysis &Analysis_,
+                                           const std::size_t &Coefficient_) {
+  Model.insert(std::make_pair(static_cast<a>(Analysis_),
+                              std::map<Lemma, std::size_t>()))
+      .first->second.insert(std::make_pair(static_cast<Lemma>(Analysis_), 0))
+      .first->second += Coefficient_;
+}
+
+void Stream_5_3_2_TaggerTrainer::multiplyModel(
+    const std::size_t &OccurrenceCoefficientMultiplier) {
+  for (std::map<a, std::map<Lemma, std::size_t> >::iterator a_ = Model.begin();
+       a_ != Model.end(); ++a_) {
+    for (std::map<Lemma, std::size_t>::iterator r_ = a_->second.begin();
+         r_ != a_->second.end(); ++r_) {
+      r_->second *= OccurrenceCoefficientMultiplier;
+    }
+  }
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger_trainer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger_trainer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger_trainer.cc	(revision 70339)
@@ -0,0 +1,88 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "analysis.h"
+#include "i.h"
+#include "lemma.h"
+#include "serialiser.h"
+#include "stream_5_3_3_tagger_trainer.h"
+
+#include <cstddef>
+#include <map>
+#include <ostream>
+#include <utility>
+#include <vector>
+
+namespace Apertium {
+Stream_5_3_3_TaggerTrainer::Stream_5_3_3_TaggerTrainer(const Flags &Flags_)
+    : basic_StreamTaggerTrainer(Flags_) {}
+
+void Stream_5_3_3_TaggerTrainer::serialise(
+    std::ostream &Serialised_basic_Tagger) const {
+  ::Apertium::serialise(Model, Serialised_basic_Tagger);
+}
+
+void
+Stream_5_3_3_TaggerTrainer::train_Analysis(const Analysis &Analysis_,
+                                           const std::size_t &Coefficient_) {
+  Model.first.insert(
+                  std::make_pair(i(Analysis_), std::map<Lemma, std::size_t>()))
+      .first->second.insert(std::make_pair(Lemma(Analysis_), 0))
+      .first->second += Coefficient_;
+
+  for (std::vector<Morpheme>::const_iterator Morpheme_ =
+           Analysis_.TheMorphemes.begin() + 1;
+       Morpheme_ != Analysis_.TheMorphemes.end(); ++Morpheme_) {
+    Model.second.first.insert(std::make_pair(i(*(Morpheme_ - 1)),
+                                             std::map<Lemma, std::size_t>()))
+        .first->second.insert(std::make_pair(Lemma(*Morpheme_), 0))
+        .first->second += Coefficient_;
+    Model.second.second.insert(std::make_pair(Lemma(*Morpheme_),
+                                              std::map<i, std::size_t>()))
+        .first->second.insert(std::make_pair(i(*Morpheme_), 0))
+        .first->second += Coefficient_;
+  }
+}
+
+void Stream_5_3_3_TaggerTrainer::multiplyModel(
+    const std::size_t &OccurrenceCoefficientMultiplier) {
+  for (std::map<i, std::map<Lemma, std::size_t> >::iterator i_ =
+           Model.first.begin();
+       i_ != Model.first.end(); ++i_) {
+    for (std::map<Lemma, std::size_t>::iterator Lemma_ = i_->second.begin();
+         Lemma_ != i_->second.end(); ++Lemma_) {
+      Lemma_->second *= OccurrenceCoefficientMultiplier;
+    }
+  }
+
+  for (std::map<i, std::map<Lemma, std::size_t> >::iterator i_ =
+           Model.second.first.begin();
+       i_ != Model.second.first.end(); ++i_) {
+    for (std::map<Lemma, std::size_t>::iterator Lemma_ = i_->second.begin();
+         Lemma_ != i_->second.end(); ++Lemma_) {
+      Lemma_->second *= OccurrenceCoefficientMultiplier;
+    }
+  }
+
+  for (std::map<Lemma, std::map<i, std::size_t> >::iterator Lemma_ =
+           Model.second.second.begin();
+       Lemma_ != Model.second.second.end(); ++Lemma_) {
+    for (std::map<i, std::size_t>::iterator i_ = Lemma_->second.begin();
+         i_ != Lemma_->second.end(); ++i_) {
+      i_->second *= OccurrenceCoefficientMultiplier;
+    }
+  }
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/Makefile.am	(revision 70339)
@@ -0,0 +1,651 @@
+AUTOMAKE_OPTIONS = subdir-objects
+
+h_sources = a.h \
+	    align.h \
+	    analysis.h \
+	    apertium_re.h \
+	    apertium_tagger.h \
+	    basic_5_3_1_tagger.h \
+	    basic_5_3_2_tagger.h \
+	    basic_5_3_3_tagger.h \
+	    basic_exception_type.h \
+	    basic_stream_tagger.h \
+	    basic_stream_tagger_trainer.h \
+	    basic_tagger.h \
+	    collection.h \
+	    constant_manager.h \
+	    constructor_eq_delete.h \
+	    deserialiser.h \
+	    endian_double_util.h \
+	    err_exception.h \
+	    exception.h \
+	    exception_type.h \
+	    file_tagger.h \
+	    hmm.h \
+	    i.h \
+	    interchunk.h \
+	    interchunk_word.h \
+	    latex_accentsmap.h \
+	    lemma.h \
+	    lexical_unit.h \
+	    linebreak.h \
+	    lswpost.h \
+	    morpheme.h \
+	    morpho_stream.h \
+	    optional.h \
+	    postchunk.h \
+	    serialiser.h \
+	    stream.h \
+	    stream_5_3_1_tagger.h \
+	    stream_5_3_2_tagger.h \
+	    stream_5_3_3_tagger.h \
+	    stream_5_3_1_tagger_trainer.h \
+	    stream_5_3_2_tagger_trainer.h \
+	    stream_5_3_3_tagger_trainer.h \
+	    streamed_type.h \
+	    string_utils.h \
+	    tag.h \
+	    tagger_data.h \
+	    tagger_data_hmm.h \
+	    tagger_data_lsw.h \
+	    tagger_utils.h \
+	    tagger_word.h \
+	    tmx_aligner_tool.h \
+	    tmx_alignment.h \
+	    tmx_align_parameters.h \
+	    tmx_arguments_parser.h \
+	    tmx_book_to_matrix.h \
+	    tmx_builder.h \
+	    tmx_dictionary.h \
+	    tmx_dic_tree.h \
+	    tmx_quasi_diagonal.h \
+	    tmx_serialize_impl.h \
+	    tmx_strings_and_streams.h \
+	    tmx_trail_postprocessors.h \
+	    tmx_translate.h \
+	    tmx_words.h \
+	    transfer_data.h \
+	    transfer.h \
+	    transfer_instr.h \
+	    transfer_mult.h \
+	    transfer_token.h \
+	    transfer_word.h \
+	    transfer_word_list.h \
+	    trx_reader.h \
+	    tsx_reader.h \
+	    ttag.h \
+	    unlocked_cstdio.h \
+	    utf_converter.h \
+	    wchar_t_exception.h \
+	    wchar_t_exception_type.h
+
+#DEPR.:
+#	    lextor_data.h
+#	    lextor_eval.h
+#	    lextor.h
+#	    lextor_word.h
+
+cc_sources = a.cc \
+	     align.cc \
+	     analysis.cc \
+	     apertium_re.cc \
+	     basic_5_3_1_tagger.cc \
+	     basic_5_3_2_tagger.cc \
+	     basic_exception_type.cc \
+	     basic_stream_tagger.cc \
+	     basic_stream_tagger_trainer.cc \
+	     basic_tagger.cc \
+	     collection.cc \
+	     constant_manager.cc \
+	     endian_double_util.cc \
+	     exception_type.cc \
+	     file_tagger.cc \
+	     hmm.cc \
+	     i.cc \
+	     interchunk.cc \
+	     interchunk_word.cc \
+	     latex_accentsmap.cc \
+	     lemma.cc \
+	     linebreak.cc \
+	     lswpost.cc \
+	     morpheme.cc \
+	     morpho_stream.cc \
+	     postchunk.cc \
+	     stream.cc \
+	     stream_5_3_1_tagger.cc \
+	     stream_5_3_2_tagger.cc \
+	     stream_5_3_3_tagger.cc \
+	     stream_5_3_1_tagger_trainer.cc \
+	     stream_5_3_2_tagger_trainer.cc \
+	     stream_5_3_3_tagger_trainer.cc \
+	     string_utils.cc \
+	     tag.cc \
+	     tagger_data.cc \
+	     tagger_data_hmm.cc \
+	     tagger_data_lsw.cc \
+	     tagger_utils.cc \
+	     tagger_word.cc \
+	     tmx_aligner_tool.cc \
+	     tmx_alignment.cc \
+	     tmx_arguments_parser.cc \
+	     tmx_book_to_matrix.cc \
+	     tmx_builder.cc \
+	     tmx_dictionary.cc \
+	     tmx_strings_and_streams.cc \
+	     tmx_trail_postprocessors.cc \
+	     tmx_translate.cc \
+	     transfer.cc \
+	     transfer_data.cc \
+	     transfer_instr.cc \
+	     transfer_mult.cc \
+	     transfer_token.cc \
+	     transfer_word.cc \
+	     transfer_word_list.cc \
+	     trx_reader.cc \
+	     tsx_reader.cc \
+	     utf_converter.cc \
+	     wchar_t_exception_type.cc
+#DEPR.:
+#	     lextor.cc
+#	     lextor_data.cc
+#	     lextor_eval.cc
+#	     lextor_word.cc
+
+library_includedir = $(includedir)/$(GENERIC_LIBRARY_NAME)-$(GENERIC_API_VERSION)/$(GENERIC_LIBRARY_NAME)
+library_include_HEADERS = $(h_sources)
+
+GENERATEDSCRIPTS = apertium-gen-deformat apertium-gen-reformat \
+                   apertium-validate-tagger \
+                   apertium-validate-transfer apertium-validate-dictionary \
+                   apertium-validate-modes \
+                   apertium-validate-interchunk \
+                   apertium-validate-postchunk apertium apertium-unformat \
+                   apertium-gen-modes apertium-validate-acx \
+                   apertium-utils-fixlatex
+#DEPR.:
+                   #apertium-preprocess-corpus-lextor
+                   #apertium-gen-stopwords-lextor
+                   #apertium-gen-lextorbil
+                   #apertium-gen-lextormono apertium-gen-wlist-lextor
+
+lib_LTLIBRARIES = libapertium3.la
+libapertium3_la_SOURCES = $(h_sources) $(cc_sources)
+libapertium3_la_LDFLAGS = -version-info $(GENERIC_LIBRARY_VERSION) -release $(GENERIC_RELEASE)
+
+bin_PROGRAMS = apertium-deshtml \
+	       apertium-deslatex \
+	       apertium-desmediawiki \
+	       apertium-desodt \
+	       apertium-despptx \
+	       apertium-desrtf \
+	       apertium-destxt \
+	       apertium-deswxml \
+	       apertium-desxlsx \
+	       apertium-desxpresstag \
+	       apertium-filter-ambiguity \
+	       apertium-interchunk \
+	       apertium-multiple-translations \
+	       apertium-postchunk \
+	       apertium-postlatex \
+	       apertium-postlatex-raw \
+	       apertium-prelatex \
+	       apertium-preprocess-transfer \
+	       apertium-pretransfer \
+	       apertium-rehtml \
+	       apertium-rehtml-noent \
+	       apertium-relatex \
+	       apertium-remediawiki \
+	       apertium-reodt \
+	       apertium-repptx \
+	       apertium-rertf \
+	       apertium-retxt \
+	       apertium-rewxml \
+	       apertium-rexlsx \
+	       apertium-rexpresstag \
+	       apertium-tagger \
+	       apertium-tagger-apply-new-rules \
+	       apertium-tagger-readwords \
+	       apertium-tmxbuild \
+	       apertium-transfer
+
+bin_SCRIPTS =  $(GENERATEDSCRIPTS)
+
+instdir = apertium
+
+apertiumdir = $(prefix)/share/apertium
+apertiuminclude = $(prefix)/include/apertium-$(GENERIC_API_VERSION)
+apertiumlib = $(prefix)/lib
+apertiumsysconf = $(prefix)/etc/apertium
+
+apertium_DATA = deformat.xsl reformat.xsl new2old.xsl lexchoice.xsl \
+                lexchoicebil.xsl \
+				tagger.dtd interchunk.dtd format.dtd  transfer.dtd postchunk.dtd modes.dtd \
+				tagger.rnc interchunk.rnc format.rnc  transfer.rnc postchunk.rnc modes.rnc \
+				modes2bash.xsl modes2debugmodes.xsl \
+                apertium-createmodes.awk
+
+apertium_pretransfer_SOURCES = apertium_pretransfer.cc
+apertium_multiple_translations_SOURCES = apertium-multiple-translations.cc
+apertium_multiple_translations_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+apertium_destxt_SOURCES = apertium_destxt.cc
+apertium_retxt_SOURCES = apertium_retxt.cc
+apertium_deshtml_SOURCES = apertium_deshtml.cc
+apertium_rehtml_SOURCES = apertium_rehtml.cc
+apertium_rehtml_noent_SOURCES = apertium_rehtml_noent.cc
+apertium_desxpresstag_SOURCES = apertium_desxpresstag.cc
+apertium_rexpresstag_SOURCES = apertium_rexpresstag.cc
+apertium_desodt_SOURCES = apertium_desodt.cc
+apertium_reodt_SOURCES = apertium_reodt.cc
+apertium_desrtf_SOURCES = apertium_desrtf.cc
+apertium_rertf_SOURCES = apertium_rertf.cc
+apertium_deswxml_SOURCES = apertium_deswxml.cc
+apertium_rewxml_SOURCES = apertium_rewxml.cc
+apertium_deslatex_SOURCES = apertium_deslatex.cc
+apertium_relatex_SOURCES = apertium_relatex.cc
+apertium_desxlsx_SOURCES = apertium_desxlsx.cc
+apertium_rexlsx_SOURCES = apertium_rexlsx.cc
+apertium_despptx_SOURCES = apertium_despptx.cc
+apertium_repptx_SOURCES = apertium_repptx.cc
+apertium_desmediawiki_SOURCES = apertium_desmediawiki.cc
+apertium_remediawiki_SOURCES = apertium_remediawiki.cc
+apertium_prelatex_SOURCES = apertium_prelatex.cc
+apertium_prelatex_LDADD= $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+apertium_postlatex_SOURCES = apertium_postlatex.cc
+apertium_postlatex_LDADD= $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+apertium_postlatex_raw_SOURCES = apertium_postlatex_raw.cc
+apertium_postlatex_raw_LDADD= $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_tagger_SOURCES = apertium_tagger.cc
+apertium_tagger_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_tmxbuild_SOURCES = apertium_tmxbuild.cc
+apertium_tmxbuild_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_preprocess_transfer_SOURCES = transferpp.cc
+apertium_preprocess_transfer_LDADD = $(APERTIUM_LIBS) \
+                                     -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_filter_ambiguity_SOURCES = apertium_filter_ambiguity.cc
+apertium_filter_ambiguity_LDADD = $(APERTIUM_LIBS) \
+                                  -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_transfer_SOURCES = apertium_transfer.cc
+apertium_transfer_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_interchunk_SOURCES = apertium_interchunk.cc
+apertium_interchunk_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_postchunk_SOURCES = apertium_postchunk.cc
+apertium_postchunk_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+###apertium_lextor_SOURCES = apertium_lextor.cc
+###apertium_lextor_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+#apertium_lextor_eval_SOURCES = apertium-lextor-eval.C
+#apertium_lextor_eval_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_tagger_apply_new_rules_SOURCES = apertium_tagger_apply_new_rules.cc
+apertium_tagger_apply_new_rules_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+apertium_tagger_readwords_SOURCES = apertium_tagger_readwords.cc
+apertium_tagger_readwords_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+###apertium_lextor_search_SOURCES = apertium-lextor-search.C
+###apertium_lextor_search_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+###pruebas_lextor_SOURCES = pruebas-lextor.C
+###pruebas_lextor_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+###apertium_gen_wlist_lextor_translation_SOURCES = apertium_gen_wlist_lextor_translation.cc
+###apertium_gen_wlist_lextor_translation_LDADD = $(APERTIUM_LIBS) -lapertium$(GENERIC_MAJOR_VERSION)
+
+
+if WINDOWS
+INCLUDES = -I$(top_srcdir)/apertium/win32 -I$(top_srcdir) $(APERTIUM_CFLAGS)
+else
+INCLUDES = -I$(top_srcdir) $(APERTIUM_CFLAGS)
+endif
+CLEANFILES = *~ apertium_destxt.cc apertium_retxt.cc apertium_deshtml.cc \
+             apertium_rehtml.cc apertium_desrtf.cc apertium_rertf.cc \
+             apertium_rehtml_noent.cc \
+             apertium_deswxml.cc apertium_rewxml.cc \
+             apertium_deslatex.cc apertium_relatex.cc \
+             apertium_desxlsx.cc apertium_rexlsx.cc \
+             apertium_despptx.cc apertium_repptx.cc \
+             apertium_desodt.cc apertium_reodt.cc \
+	     apertium_desxpresstag.cc apertium_rexpresstag.cc \
+             apertium_desmediawiki.cc apertium_remediawiki.cc \
+             apertium_prelatex.cc apertium_postlatex.cc \
+             $(GENERATEDSCRIPTS)
+
+apertium_destxt.cc: txt-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl txt-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_desxpresstag.cc: xpresstag-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl xpresstag-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_rexpresstag.cc: xpresstag-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl xpresstag-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_retxt.cc: txt-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl txt-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_deshtml.cc: html-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl html-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_rehtml.cc: html-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl html-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_rehtml_noent.cc: html-noent-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl html-noent-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_desodt.cc: odt-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl odt-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_reodt.cc: odt-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl odt-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_desrtf.cc: rtf-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl rtf-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_rertf.cc: rtf-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl rtf-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_deswxml.cc: wxml-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl wxml-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_rewxml.cc: wxml-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl wxml-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_deslatex.cc: latex-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl latex-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_relatex.cc: latex-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl latex-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+
+
+apertium_desxlsx.cc: xlsx-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl xlsx-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_rexlsx.cc: xlsx-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl xlsx-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_despptx.cc: pptx-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl pptx-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_repptx.cc: pptx-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl pptx-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_desmediawiki.cc: mediawiki-format.xml Makefile.am deformat.xsl
+	$(XSLTPROC) deformat.xsl mediawiki-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_remediawiki.cc: mediawiki-format.xml Makefile.am reformat.xsl
+	$(XSLTPROC) reformat.xsl mediawiki-format.xml >$@tmp
+	$(FLEX) -Cfer -o$@ $@tmp
+	rm $@tmp
+
+apertium_prelatex.cc: apertium-prelatex.l
+	$(FLEX) -Cfer -o$@ apertium-prelatex.l
+
+apertium_postlatex.cc: apertium-postlatex.l
+	$(FLEX) -Cfer -o$@ apertium-postlatex.l
+
+apertium_postlatex_raw.cc: apertium-postlatex-raw.l
+	$(FLEX) -Cfer -o$@ apertium-postlatex-raw.l
+
+apertium-validate-tagger: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-tagger script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/tagger.dtd --noout \"\$$FILE1\"" >>$@
+	@chmod a+x $@
+
+apertium-validate-transfer: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-transfer script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/transfer.dtd --noout \"\$$FILE1\"" >>$@
+	@chmod a+x $@
+
+apertium-validate-interchunk: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-interchunk script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/interchunk.dtd --noout \"\$$FILE1\"" >>$@
+	@chmod a+x $@
+
+apertium-validate-postchunk: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-postchunk script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/postchunk.dtd --noout \"\$$FILE1\"" >>$@
+	@chmod a+x $@
+
+apertium-validate-acx: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-acx script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "$(XMLLINT) --relaxng \"$(prefix)\"/share/lttoolbox/acx.rng --schema \"$(prefix)\"/share/lttoolbox/acx.xsd --noout \"\$$FILE1\"" >>$@
+	@chmod a+x $@
+
+apertium-validate-modes: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-modes script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/modes.dtd --noout \"\$$FILE1\"" >>$@
+	@chmod a+x $@
+
+
+apertium-validate-dictionary: Makefile.am validate-header.sh
+	@echo "Creating apertium-validate-dictionary script"
+	@echo "#!$(BASH)" > $@
+	@cat validate-header.sh >> $@
+	@echo "# xsd is a non-final command, so just treated as a warning when compiling:" >> $@
+	@echo "$(XMLLINT) --schema \"$(prefix)\"/share/lttoolbox/dix.xsd --noout \"\$$FILE1\" | grep -vF ' fails to validate'" >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(prefix)\"/share/lttoolbox/dix.dtd --noout \"\$$FILE1\"" >> $@
+	@chmod a+x $@
+
+apertium-gen-deformat: Makefile.am deformat-header.sh
+	@echo "Creating apertium-gen-deformat script"
+	@echo "#!$(BASH)" > $@
+	@cat deformat-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/format.dtd --noout \$$FILE1 && \\" >> $@
+	@if [ `basename $(XSLTPROC)` == xsltproc ]; \
+	  then echo "$(XSLTPROC) --stringparam mode \$$MODE \"$(apertiumdir)\"/deformat.xsl \$$FILE1 >/tmp/\$$\$$.deformat.l && \\"; \
+          else echo "$(XSLTPROC) \"$(apertiumdir)\"/deformat.xsl \$$FILE1 \"\\\$$mode=\$$MODE\" >/tmp/\$$\$$.deformat.l && \\"; \
+          fi >> $@
+	@echo "$(FLEX) \$$FLEXOPTS -o/tmp/\$$\$$.lex.cc /tmp/\$$\$$.deformat.l && \\" >> $@
+	@echo "$(CXX) -DGENFORMAT $(CXXFLAGS) -w $(APERTIUM_CFLAGS) -I $(apertiuminclude) -o \$$FILE2 /tmp/\$$\$$.lex.cc $(APERTIUM_LIBS) 2>/dev/null && \\" >> $@
+	@echo "rm /tmp/\$$\$$.deformat.l /tmp/\$$\$$.lex.cc" >> $@
+	@chmod a+x $@
+
+apertium-gen-reformat: Makefile.am gen-header.sh
+	@echo "Creating apertium-gen-reformat script"
+	@echo "#!$(BASH)" > $@
+	@cat gen-header.sh >> $@
+	@echo "$(XMLLINT) --dtdvalid \"$(apertiumdir)\"/format.dtd --noout \$$FILE1 && \\" >> $@
+	@echo "$(XSLTPROC) \"$(apertiumdir)\"/reformat.xsl \$$FILE1 >/tmp/\$$\$$.reformat.l && \\" >> $@
+	@echo "$(FLEX) \$$FLEXOPTS -o/tmp/\$$\$$.lex.cc /tmp/\$$\$$.reformat.l && \\" >> $@
+	@echo "$(CXX) -DGENFORMAT $(CXXFLAGS) -w $(APERTIUM_CFLAGS) -I $(apertiuminclude) -o \$$FILE2 /tmp/\$$\$$.lex.cc $(APERTIUM_LIBS) 2>/dev/null &&\\" >> $@
+	@echo "rm /tmp/\$$\$$.reformat.l /tmp/\$$\$$.lex.cc" >> $@
+	@chmod a+x $@
+
+apertium-gen-modes: apertium-gen-modes.in Makefile.am
+	@echo "#!$(BASH)" > $@
+	@echo "APERTIUMDIR=$(apertiumdir)" >> $@
+	@echo "XMLLINT=$(XMLLINT)" >> $@
+	@echo "XSLTPROC=$(XSLTPROC)" >> $@
+	@cat $< >> $@
+	@chmod a+x $@
+
+apertium-utils-fixlatex: Makefile.am utils-fixlatex-header.sh
+	@echo "Creating apertium-utils-fixlatex script"
+	@echo "#!$(BASH)" > $@
+	@cat utils-fixlatex-header.sh >> $@
+	@chmod a+x $@
+
+apertium: Makefile.am apertium-header.sh
+	@echo "Creating apertium script"
+	@echo "#!$(BASH)" > $@
+	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "DEFAULT_DIRECTORY=\"$(prefix)/share/apertium\"" >>$@
+	@cat apertium-header.sh >>$@
+	@chmod a+x $@
+
+apertium-unformat: Makefile.am apertium-unformat-header.sh
+	@echo "Creating apertium-unformat script"
+	@echo "#!$(BASH)" > $@
+	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "DEFAULT_DIRECTORY=\"$(prefix)/share/apertium\"" >>$@
+	@cat apertium-unformat-header.sh >>$@
+	@chmod a+x $@
+
+
+#apertium-translator-lextor: Makefile.am trans-lextor-header.sh
+#	@echo "Creating apertium-translator-lextor script"
+#	@echo "#!$(BASH)" > $@
+#	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+#	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+#	@cat trans-lextor-header.sh >>$@
+#	@chmod a+x $@
+
+#apertium-gen-oldbil: Makefile.am transformdicbil-header.sh
+#	@echo "Creating apertium-gen-oldbil script"
+#	@echo "#!$(BASH)" >$@
+#	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+#	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+#	@echo "XSLTPROC_OPTIONS=\"\"">>$@
+#	@echo "STYLESHEET=\"$(apertiumdir)/new2old.xsl\"">>$@
+#	@cat transformdicbil-header.sh >>$@
+#	@chmod a+x $@
+
+apertium-gen-lextorbil: Makefile.am transformdic-header.sh
+	@echo "Creating apertium-gen-lextorbil script"
+	@echo "#!$(BASH)" >$@
+	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "XSLTPROC_OPTIONS_LR=\"\"">>$@
+	@echo "XSLTPROC_OPTIONS_RL=\"--stringparam r2l yes\"">>$@
+	@echo "STYLESHEET=\"$(apertiumdir)/lexchoicebil.xsl\"">>$@
+	@cat transformdic-header.sh >>$@
+	@chmod a+x $@
+
+apertium-gen-lextormono: Makefile.am transformdic-header.sh
+	@echo "Creating apertium-gen-lextormono script"
+	@echo "#!$(BASH)" >$@
+	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "XSLTPROC_OPTIONS_LR=\"\"">>$@
+	@echo "XSLTPROC_OPTIONS_RL=\"--stringparam r2l yes\"">>$@
+	@echo "STYLESHEET=\"$(apertiumdir)/lexchoice.xsl\"">>$@
+	@cat transformdic-header.sh >>$@
+	@chmod a+x $@
+
+apertium-gen-wlist-lextor: Makefile.am gen-wlist-lextor-header.sh
+	@echo "Creating apertium-gen-wlist-lextor script"
+	@echo "#!$(BASH)" >$@
+	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+	@cat gen-wlist-lextor-header.sh >>$@
+	@chmod a+x $@
+
+apertium-preprocess-corpus-lextor: Makefile.am preprocess-corpus-lextor.sh
+	@echo "Creating apertium-preprocess-corpus-lextor script"
+	@echo "#!$(BASH)" >$@
+	@echo "LTTOOLBOX_PATH=\"$(prefix)/bin\"" >>$@
+	@echo "APERTIUM_PATH=\"$(prefix)/bin\"" >>$@
+	@cat preprocess-corpus-lextor.sh >>$@
+	@chmod a+x $@
+
+apertium-gen-stopwords-lextor: Makefile.am gen-stopwords-lextor.sh
+	@echo "Creating apertium-gen-stopwords-lextor script"
+	@echo "#!$(BASH)" >$@
+	@cat gen-stopwords-lextor.sh >>$@
+	@chmod a+x $@
+
+man_MANS=apertium.1 apertium-deshtml.1 apertium-desrtf.1 apertium-destxt.1 \
+         apertium-desodt.1 apertium-reodt.1 \
+         apertium-deswxml.1 apertium-rewxml.1 \
+         apertium-deslatex.1 apertium-relatex.1 \
+         apertium-prelatex.1 apertium-postlatex.1 apertium-postlatex-raw.1 \
+         apertium-desxlsx.1 apertium-rexlsx.1 \
+         apertium-despptx.1 apertium-repptx.1 \
+         apertium-desmediawiki.1 apertium-remediawiki.1 \
+         apertium-filter-ambiguity.1 apertium-gen-deformat.1 \
+         apertium-gen-reformat.1 \
+         apertium-preprocess-transfer.1 apertium-pretransfer.1 apertium-rehtml.1 \
+         apertium-rertf.1 apertium-retxt.1 apertium-tagger.1 apertium-transfer.1 \
+         apertium-validate-dictionary.1 apertium-validate-tagger.1 \
+         apertium-validate-transfer.1 apertium-gen-modes.1 apertium-interchunk.1 \
+         apertium-postchunk.1 apertium-validate-interchunk.1 apertium-utils-fixlatex.1 \
+         apertium-validate-postchunk.1 apertium-validate-modes.1 apertium-tagger-apply-new-rules.1 \
+	 apertium-validate-acx.1 apertium-multiple-translations.1 \
+	 apertium-unformat.1
+#DEPR.:
+#         apertium-lextor-eval.1
+#         apertium-gen-lextorbil.1
+#         apertium-gen-lextormono.1 apertium-gen-stopwords-lextor.1
+#         apertium-gen-wlist-lextor.1 apertium-gen-wlist-lextor-translation.1
+#         apertium-lextor.1 apertium-preprocess-corpus-lextor.1
+
+EXTRA_DIST = gen-header.sh deformat-header.sh \
+             reformat.xsl deformat.xsl new2old.xsl lexchoice.xsl lexchoicebil.xsl \
+             txt-format.xml \
+             html-format.xml odt-format.xml rtf-format.xml wxml-format.xml latex-format.xml\
+             html-noent-format.xml \
+             xlsx-format.xml pptx-format.xml mediawiki-format.xml trans-header.sh \
+             apertium-postlatex.l  apertium-postlatex-raw.l  apertium-prelatex.l \
+             apertium-header.sh apertium-unformat-header.sh $(man_MANS) \
+             xpresstag-format.xml \
+             validate-header.sh transformdic-header.sh transformdicbil-header.sh \
+			 tagger.dtd interchunk.dtd format.dtd  transfer.dtd postchunk.dtd modes.dtd \
+			 tagger.rnc interchunk.rnc format.rnc  transfer.rnc postchunk.rnc modes.rnc \
+             utils-fixlatex-header.sh \
+             apertium-gen-modes.in apertium-createmodes.awk modes2bash.xsl modes2debugmodes.xsl
+#DEPR.:
+# trans-lextor-header.sh
+# gen-wlist-lextor-header.sh
+# gen-stopwords-lextor.sh
+# preprocess-corpus-lextor.sh
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/validate-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/validate-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/validate-header.sh	(revision 70339)
@@ -0,0 +1,12 @@
+if [[ $# != 1 ]]; then
+    echo "USAGE: $(basename "$0") <input_file>"
+    exit 1
+fi
+
+FILE1=$1
+
+if [[ ! -e $FILE1 ]]; then
+    echo "ERROR: '$1' file not found"
+    exit 1
+fi
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-modes.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-modes.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-modes.in	(revision 70339)
@@ -0,0 +1,85 @@
+#!/bin/bash
+# Makefile.am prepends APERTIUMDIR, XMLLINT, XSLTPROC and the right shebang
+
+show_help () {
+    cat <<EOF
+USAGE: $(basename "$0") modes.xml
+       $(basename "$0") modes.xml BASENAME
+       $(basename "$0") -f modes.xml INSTALLDIR
+
+Creates all modes under the 'modes/' subdirectory of the directory of
+modes.xml, and further creates copies of installable modes in the same
+directory as modes.xml.
+
+If only modes.xml is given, all files refer only to datafiles under
+the same directory as modes.xml.
+
+If only modes.xml and BASENAME are given, installable modes will refer
+to datafiles in ${APERTIUMDIR}/\${BASENAME}.
+
+If -f is given, the second non-option argument INSTALLDIR is the full
+path to where installed data files for installable modes are.
+
+
+If a mode has attribute gendebug="yes", the script will also
+auto-generate debug modes (e.g. -morph, -tagger, -chunker).
+
+Use option -v to show the actual commands this script runs.
+EOF
+    exit 1
+}
+
+verbose=false
+fullpath=false
+OPTIND=1
+while getopts "hHfv" opt; do
+    case "$opt" in
+        h|H)
+            echo show_help
+            exit 0
+            ;;
+        v)  verbose=true
+            ;;
+        f)  fullpath=true
+            ;;
+        '?')
+            show_help >&2
+            exit 1
+            ;;
+    esac
+done
+shift $((OPTIND-1))
+
+xmlfile="$1"
+if [[ ! -e "${xmlfile}" ]]; then
+    echo "ERROR: '${xmlfile}' file not found"
+    exit 1
+fi
+xmldir=$(cd "$(dirname "${xmlfile}")"; pwd)
+
+case $# in
+    1) installdir="${xmldir}";;
+    2) if ${fullpath}; then
+           installdir="$2"
+       else
+           installdir="${APERTIUMDIR}/$2"
+       fi
+       ;;
+    *) show_help >&2
+       exit 1
+       ;;
+esac
+
+$verbose && set -x
+set -o pipefail # introduced in bash 3; available in OSX>=10.5; should be safe
+
+[[ -d "${xmldir}"/modes ]] || mkdir "${xmldir}"/modes
+
+"${XMLLINT}" --dtdvalid "${APERTIUMDIR}"/modes.dtd --noout "${xmlfile}" || exit $?
+
+"${XSLTPROC}" "${APERTIUMDIR}"/modes2debugmodes.xsl "${xmlfile}" \
+    | "${XSLTPROC}" --stringparam devdir "${xmldir}" \
+                    --stringparam installdir "${installdir}" \
+                    "${APERTIUMDIR}"/modes2bash.xsl \
+                    - \
+    | awk -f "${APERTIUMDIR}"/apertium-createmodes.awk
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/hmm.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/hmm.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/hmm.h	(revision 70339)
@@ -0,0 +1,164 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+/**
+ *  First order hidden Markov model (HMM) implementation (header)
+ *
+ *  @author   Felipe S�nchez-Mart�nez - fsanchez@dlsi.ua.es
+ */
+
+#ifndef __HMM_H
+#define __HMM_H
+
+#include "file_tagger.h"
+
+#include <cstdio>
+#include <fstream>
+#include <math.h>
+#include <string>
+#include <vector>
+#include <set>
+#include <map>
+#include <cfloat>
+#include <cstring>
+
+#include <apertium/collection.h>
+#include <apertium/constant_manager.h>
+#include <apertium/morpho_stream.h>
+#include <apertium/tagger_data_hmm.h>
+#include <apertium/tagger_utils.h>
+#include <apertium/tagger_word.h>
+
+using namespace std;
+
+#define ZERO 1e-10
+
+/** HMM
+ *  first-order hidden Markov Model
+ */
+class HMM : public Apertium::FILE_Tagger {
+private:
+   TaggerDataHMM tdhmm;
+   TTag eos; // end-of-sentence tag
+   
+   /** It allocs memory for the transition (a) and the emission (b) matrices.
+    *  Before calling this method the number of ambiguity classes must be known.
+    *  This methos is called within read_ambiguity_classes and read_dictionary.
+    *  @see: read_ambiguity_classes, read_dictionary
+    */
+   void init(); 
+public:  
+   void deserialise(FILE *Serialised_FILE_Tagger);
+   std::vector<std::wstring> &getArrayTags();
+   void train(FILE *Corpus, unsigned long Count);
+   void serialise(FILE *Stream_);
+   void deserialise(const TaggerData &Deserialised_FILE_Tagger);
+   void init_probabilities_from_tagged_text_(FILE *TaggedCorpus,
+                                            FILE *UntaggedCorpus);
+   void init_probabilities_kupiec_(FILE *Corpus);
+   HMM();
+   HMM(TaggerDataHMM *tdhmm);
+ 
+   /** Constructor
+    */
+   HMM(TaggerDataHMM tdhmm);
+
+   /** Destructor
+    */
+   ~HMM();
+  
+   /** Used to set the end-of-sentence tag
+    *  @param t the end-of-sentence tag
+    */
+   void set_eos(TTag t);
+
+   /** It reads the ambiguity classes from the stream received as
+    *  input
+    *  @param is the input stream
+    */  
+   void read_ambiguity_classes(FILE *in);
+  
+   /** It writes the ambiguity classes to the stream received as
+    *  a parameter
+    *  @param iosthe output stream
+    */
+   void write_ambiguity_classes(FILE *out);
+  
+   /** It reads the probabilities (matrices a and b) from the stream 
+    *  received as a parameter
+    *  @param is the input stream
+    */
+   void read_probabilities(FILE *in);
+
+   /** It writes the probabilities (matrices a and b) to the stream 
+    *  received as a parameter
+    *  @param os the output stream
+    */ 
+   void write_probabilities(FILE *out);
+  
+   /** It reads the expanded dictionary received as a parameter and calculates
+    *  the set of ambiguity classes that the tagger will manage.
+    *  @param is the input stream with the expanded dictionary to read
+    */
+   void read_dictionary(FILE *is);  
+           
+   /** It initializes the transtion (a) and emission (b) probabilities
+    *  from an untagged input text by means of Kupiec's method
+    *  @param is the input stream with the untagged corpus to process
+    */
+   void init_probabilities_kupiec (FILE *is);
+  
+   /** It initializes the transtion (a) and emission (b) probabilities
+    *  from a tagged input text by means of the expected-likelihood 
+    *  estimate (ELE) method
+    *  @param ftagged the input stream with the tagged corpus to process
+    *  @param funtagged the same corpus to process but untagged
+    */   
+   void init_probabilities_from_tagged_text(FILE *ftagged, FILE *funtagged);
+
+   /** It applies the forbid and enforce rules found in tagger specification.
+    *  To do so the transition matrix is modified by introducing null probabilities
+    *  in the involved transitions.
+    */
+   void apply_rules();
+   
+   /** Unsupervised training algorithm (Baum-Welch implementation).
+    *  @param is the input stream with the untagged corpus to process
+    */  
+   void train (FILE *is);  
+  
+   /** Tagging algorithm (Viterbi implementation).
+    *  @param in the input stream with the untagged text to tag
+    *  @param out the output stream with the tagged text
+    */
+   void tagger(FILE *Input, FILE *Output, const bool &First = false);
+
+   /** Prints the A matrix.
+    */
+   void print_A();
+
+   /** Prints the B matrix.
+    */ 
+   void print_B();
+
+   /** Prints the ambiguity classes.
+    */
+   void print_ambiguity_classes();
+
+   void filter_ambiguity_classes(FILE *in, FILE *out);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lswpost.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lswpost.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lswpost.h	(revision 70339)
@@ -0,0 +1,111 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+/**
+ *  Light Sliding-Window Part of Speech Tagger (LSWPoST) implementation (header)
+ *
+ *  @author   Gang Chen - pkuchengang@gmail.com
+ */
+
+#ifndef __LSWPOST_H
+#define __LSWPOST_H
+
+#include "file_tagger.h"
+
+#include <cstdio>
+#include <fstream>
+#include <math.h>
+#include <string>
+#include <vector>
+#include <set>
+#include <map>
+#include <cfloat>
+#include <cstring>
+
+#include <apertium/collection.h>
+#include <apertium/constant_manager.h>
+#include <apertium/morpho_stream.h>
+#include <apertium/tagger_data_lsw.h>
+#include <apertium/tagger_utils.h>
+#include <apertium/tagger_word.h>
+
+
+#define ZERO 1e-10
+
+/** LSWPoST
+ *  Light Sliding-Window Part of Speech Tagger
+ */
+class LSWPoST : public Apertium::FILE_Tagger {
+private:
+  TaggerDataLSW tdlsw;
+  TTag eos; // end-of-sentence tag
+
+public:
+  void deserialise(FILE *Serialised_FILE_Tagger);
+  std::vector<std::wstring> &getArrayTags();
+  void train(FILE *Corpus, unsigned long Count);
+  void serialise(FILE *Stream_);
+  void deserialise(const TaggerData &Deserialised_FILE_Tagger);
+  void init_probabilities_from_tagged_text_(FILE *TaggedCorpus,
+                                            FILE *UntaggedCorpus);
+  void init_probabilities_kupiec_(FILE *Corpus);
+  LSWPoST();
+  LSWPoST(TaggerDataLSW *tdlsw);
+
+   /** Constructor
+    */
+   LSWPoST(TaggerDataLSW t);
+
+   /** Destructor
+    */
+   ~LSWPoST();
+
+   /** Used to set the end-of-sentence tag
+    *  @param t the end-of-sentence tag
+    */
+   void set_eos(TTag t);
+
+   /** It reads the expanded dictionary received as a parameter and calculates
+    *  the set of ambiguity classes that the tagger will manage.
+    *  @param fdic the input stream with the expanded dictionary to read
+    */
+   void read_dictionary(FILE *fdic);
+
+   /** Whether a tag sequence is valid, according to the forbid and enforce rules
+    */
+   bool is_valid_seq(TTag left, TTag mid, TTag right);
+
+   /** Init probabilities
+    *  It applies the forbid and enforce rules found in tagger specification.
+    *  To do so, the joint probability of a tag sequence that contains a forbid
+    *  rule, or doesn't satisfy a enforce rule, is set to 0.
+    */
+   void init_probabilities(FILE *ftxt);
+
+   /** Unsupervised training algorithm (Baum-Welch implementation).
+    *  @param ftxt the input stream with the untagged corpus to process
+    */
+   void train (FILE *ftxt);
+
+   /** Prints the para matrix.
+    */
+   void print_para_matrix();
+
+   /** Do the tagging
+    */
+   void tagger(FILE *Input, FILE *Output, const bool &First = false);
+};
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/file_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/file_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/file_tagger.h	(revision 70339)
@@ -0,0 +1,52 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef FILE_TAGGER_H
+#define FILE_TAGGER_H
+
+#include <apertium/tagger_data.h>
+
+#include <cstdio>
+#include <string>
+#include <vector>
+
+namespace Apertium {
+class FILE_Tagger {
+public:
+  FILE_Tagger();
+  virtual ~FILE_Tagger();
+  virtual void deserialise(FILE *Serialised_FILE_Tagger) = 0;
+  void set_debug(const bool &Debug);
+  void set_show_sf(const bool &ShowSuperficial);
+  void setNullFlush(const bool &NullFlush);
+  virtual void tagger(FILE *Input, FILE *Output, const bool &First = false) = 0;
+  virtual std::vector<std::wstring> &getArrayTags() = 0;
+  virtual void train(FILE *Corpus, unsigned long Count) = 0;
+  virtual void serialise(FILE *Stream_) = 0;
+  void deserialise(char *const TaggerSpecificationFilename);
+  virtual void read_dictionary(FILE *Dictionary) = 0;
+  virtual void init_probabilities_from_tagged_text_(FILE *TaggedCorpus,
+                                                    FILE *Corpus) = 0;
+  virtual void init_probabilities_kupiec_(FILE *Corpus) = 0;
+
+protected:
+  virtual void deserialise(const TaggerData &Deserialised_FILE_Tagger) = 0;
+  bool debug;
+  bool show_sf;
+  bool null_flush;
+};
+}
+
+#endif // FILE_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/format.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/format.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/format.rng	(revision 70339)
@@ -0,0 +1,303 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!--
+  Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+  This program is free software; you can redistribute it and/or
+  modify it under the terms of the GNU General Public License as
+  published by the Free Software Foundation; either version 2 of the
+  License, or (at your option) any later version.
+  
+  This program is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  General Public License for more details.
+  
+  You should have received a copy of the GNU General Public License
+  along with this program; if not, see <http://www.gnu.org/licenses/>.
+  
+     DTD for the format specification files
+     Sergio Ortiz  2005.05.13
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0">
+  <define name="format">
+    <element name="format">
+      <ref name="attlist.format"/>
+      <ref name="options"/>
+      <ref name="rules"/>
+    </element>
+  </define>
+  <define name="attlist.format" combine="interleave">
+    <attribute name="name"/>
+  </define>
+  <!--
+    'format' is the root element containing the whole format specification
+    file.  The attribute 'name' specifies the name of the format
+  -->
+  <define name="options">
+    <element name="options">
+      <ref name="attlist.options"/>
+      <ref name="largeblocks"/>
+      <ref name="input"/>
+      <ref name="output"/>
+      <ref name="tag-name"/>
+      <ref name="escape-chars"/>
+      <ref name="space-chars"/>
+      <ref name="case-sensitive"/>
+    </element>
+  </define>
+  <define name="attlist.options" combine="interleave">
+    <empty/>
+  </define>
+  <!-- General options of the format -->
+  <define name="largeblocks">
+    <element name="largeblocks">
+      <ref name="attlist.largeblocks"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.largeblocks" combine="interleave">
+    <attribute name="size"/>
+  </define>
+  <!--
+    The attribute size is used to define the maximal size in bytes of
+    inline format blocks
+  -->
+  <define name="input">
+    <element name="input">
+      <ref name="attlist.input"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.input" combine="interleave">
+    <optional>
+      <attribute name="zip-path"/>
+    </optional>
+  </define>
+  <define name="attlist.input" combine="interleave">
+    <attribute name="encoding"/>
+  </define>
+  <!-- Reserved for future extensions -->
+  <define name="output">
+    <element name="output">
+      <ref name="attlist.output"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.output" combine="interleave">
+    <optional>
+      <attribute name="zip-path"/>
+    </optional>
+  </define>
+  <define name="attlist.output" combine="interleave">
+    <attribute name="encoding"/>
+  </define>
+  <!-- Reserved for future extensions -->
+  <define name="tag-name">
+    <element name="tag-name">
+      <ref name="attlist.tag-name"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.tag-name" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    The attribute regexp defines (whith a _flex_ regular expression) how 
+    take a tag name from a whole tag. '\'
+  -->
+  <define name="escape-chars">
+    <element name="escape-chars">
+      <ref name="attlist.escape-chars"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.escape-chars" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    The attribute regexp defines (whith a _flex_ regular expression) the
+    set of characters to be escaped with preceding a backslash '\'
+  -->
+  <define name="space-chars">
+    <element name="space-chars">
+      <ref name="attlist.space-chars"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.space-chars" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    Define the space characters (in regexp) with a _flex_ regular 
+    expression
+  -->
+  <define name="case-sensitive">
+    <element name="case-sensitive">
+      <ref name="attlist.case-sensitive"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.case-sensitive" combine="interleave">
+    <attribute name="value">
+      <choice>
+        <value>yes</value>
+        <value>no</value>
+      </choice>
+    </attribute>
+  </define>
+  <!--
+    The attribute 'value' is set to 'yes' if the case is relevant in the 
+    specification of the format.  Otherwise is set to 'no'
+  -->
+  <define name="rules">
+    <element name="rules">
+      <ref name="attlist.rules"/>
+      <oneOrMore>
+        <choice>
+          <ref name="format-rule"/>
+          <ref name="replacement-rule"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.rules" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    Group the rules of processing format and the rules of substitute 
+    expressions by characters that are part of the text
+  -->
+  <define name="format-rule">
+    <element name="format-rule">
+      <ref name="attlist.format-rule"/>
+      <choice>
+        <ref name="tag"/>
+        <group>
+          <ref name="begin"/>
+          <ref name="end"/>
+        </group>
+      </choice>
+    </element>
+  </define>
+  <define name="attlist.format-rule" combine="interleave">
+    <optional>
+      <attribute name="type">
+        <choice>
+          <value>comment</value>
+          <value>empty</value>
+          <value>open</value>
+          <value>close</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <define name="attlist.format-rule" combine="interleave">
+    <optional>
+      <attribute name="eos">
+        <choice>
+          <value>yes</value>
+          <value>no</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <define name="attlist.format-rule" combine="interleave">
+    <attribute name="priority"/>
+  </define>
+  <!--
+    Format rule parent element.  It may include a 'tag' element or
+    a couple of elements 'begin', 'end'.  In the first case, this element is 
+    considered to be part of the format.  In the second case, the begin and 
+    the end element are considered to enclosing format.  The attribute
+    'eos' (end of sentence) is set to 'yes' if that rule defines a dot in
+    the text being processed (is no by default).  The attribute 'priority' 
+    marks the order of precedence of the rule
+  -->
+  <define name="tag">
+    <element name="tag">
+      <ref name="attlist.tag"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.tag" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    Define an element that is part of the format by the pattern specified
+    as a value for the regexp attribute
+  -->
+  <define name="begin">
+    <element name="begin">
+      <ref name="attlist.begin"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.begin" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    The attribute 'regexp' is the regular expression that detects the
+    begining delimiter of a block of format
+  -->
+  <define name="end">
+    <element name="end">
+      <ref name="attlist.end"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.end" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    The attribute 'regexp' is the regular expression that detects the
+    ending delimiter of a block of format
+  -->
+  <define name="replacement-rule">
+    <element name="replacement-rule">
+      <ref name="attlist.replacement-rule"/>
+      <oneOrMore>
+        <ref name="replace"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.replacement-rule" combine="interleave">
+    <attribute name="regexp"/>
+  </define>
+  <!--
+    Root element for a replacement rule.  The attribute 'regexp' is the
+    general expression to detect the elements to replace
+  -->
+  <define name="replace">
+    <element name="replace">
+      <ref name="attlist.replace"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.replace" combine="interleave">
+    <attribute name="source"/>
+  </define>
+  <define name="attlist.replace" combine="interleave">
+    <attribute name="target"/>
+  </define>
+  <define name="attlist.replace" combine="interleave">
+    <optional>
+      <attribute name="prefer">
+        <choice>
+          <value>yes</value>
+          <value>no</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <start>
+    <choice>
+      <ref name="format"/>
+    </choice>
+  </start>
+</grammar>
+<!--
+  Replacement rule.  The 'source' is a string of one or more characters.
+  The 'target' MUST be a single character.  The 'prefer' attribute, when 
+  set to 'yes' defines the preferred reverse translation of the 
+  replacement.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.rng	(revision 70339)
@@ -0,0 +1,971 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!--
+  Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+  This program is free software; you can redistribute it and/or
+  modify it under the terms of the GNU General Public License as
+  published by the Free Software Foundation; either version 2 of the
+  License, or (at your option) any later version.
+  
+  This program is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  General Public License for more details.
+  
+  You should have received a copy of the GNU General Public License
+  along with this program; if not, see <http://www.gnu.org/licenses/>.
+  
+   Draft of DTD for the structural transfer rule files 
+  
+   Sergio Ortiz, Gema Ram�rez-S�nchez, Mireia Ginest�, Mikel L. Forcada, 
+   2005.07.29. 
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0" datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes">
+  <define name="condition">
+    <choice>
+      <ref name="and"/>
+      <ref name="or"/>
+      <ref name="not"/>
+      <ref name="equal"/>
+      <ref name="begins-with"/>
+      <ref name="begins-with-list"/>
+      <ref name="ends-with"/>
+      <ref name="ends-with-list"/>
+      <ref name="contains-substring"/>
+      <ref name="in"/>
+    </choice>
+  </define>
+  <define name="container">
+    <choice>
+      <ref name="var"/>
+      <ref name="clip"/>
+    </choice>
+  </define>
+  <define name="sentence">
+    <choice>
+      <ref name="let"/>
+      <ref name="out"/>
+      <ref name="choose"/>
+      <ref name="modify-case"/>
+      <ref name="call-macro"/>
+      <ref name="append"/>
+    </choice>
+  </define>
+  <define name="value">
+    <choice>
+      <ref name="b"/>
+      <ref name="clip"/>
+      <ref name="lit"/>
+      <ref name="lit-tag"/>
+      <ref name="var"/>
+      <ref name="get-case-from"/>
+      <ref name="case-of"/>
+      <ref name="concat"/>
+      <ref name="chunk"/>
+    </choice>
+  </define>
+  <define name="stringvalue">
+    <choice>
+      <ref name="clip"/>
+      <ref name="lit"/>
+      <ref name="var"/>
+      <ref name="get-case-from"/>
+      <ref name="case-of"/>
+    </choice>
+  </define>
+  <define name="interchunk">
+    <element name="interchunk">
+      <ref name="attlist.interchunk"/>
+      <ref name="section-def-cats"/>
+      <ref name="section-def-attrs"/>
+      <ref name="section-def-vars"/>
+      <optional>
+        <ref name="section-def-lists"/>
+      </optional>
+      <optional>
+        <ref name="section-def-macros"/>
+      </optional>
+      <ref name="section-rules"/>
+    </element>
+  </define>
+  <define name="attlist.interchunk" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    'interchunk' is the root element containing the whole structural
+    interchunk rule file.  
+  -->
+  <define name="section-def-cats">
+    <element name="section-def-cats">
+      <ref name="attlist.section-def-cats"/>
+      <oneOrMore>
+        <ref name="def-cat"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-cats" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+         The 'def-cats' section defines the categories used to build the
+    patterns used in rules
+  -->
+  <define name="def-cat">
+    <element name="def-cat">
+      <ref name="attlist.def-cat"/>
+      <oneOrMore>
+        <ref name="cat-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-cat" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each 'def-cat' defines one category in terms of a list of
+    category items and has a unique name 'n', which is mandatory
+  -->
+  <define name="cat-item">
+    <element name="cat-item">
+      <ref name="attlist.cat-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.cat-item" combine="interleave">
+    <optional>
+      <attribute name="lemma"/>
+    </optional>
+    <attribute name="tags"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+         Each 'cat-item' (category item) represents a set of lexical forms
+    and has a mandatory attribute 'tags' whose value is a sequence of
+    dot-separated tag names; this sequence is a subsequence of the
+    tag sequence defining each possible lexical form. For example,
+    tags="n.f" would match all lexical forms containing this tag
+    sequence, such as "^casa<n><f><pl>$".
+    
+    In addition, an optional attribute, "lemma", may be used to
+    define lexical forms having a particular substring in their lemma
+  -->
+  <define name="section-def-attrs">
+    <element name="section-def-attrs">
+      <ref name="attlist.section-def-attrs"/>
+      <oneOrMore>
+        <ref name="def-attr"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-attrs" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The 'def-attrs' section defines the attributes that will be
+    identified in matched lexical forms 
+  -->
+  <define name="def-attr">
+    <element name="def-attr">
+      <ref name="attlist.def-attr"/>
+      <oneOrMore>
+        <ref name="attr-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-attr" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each def-attr defines one attribute in terms of a list of
+    attribute items and has a mandatory unique name n 
+  -->
+  <define name="attr-item">
+    <element name="attr-item">
+      <ref name="attlist.attr-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.attr-item" combine="interleave">
+    <optional>
+      <attribute name="tags"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each 'attr-item' specifies a subsequence of the tags in
+    that lexical form (attribute 'tags')
+  -->
+  <define name="section-def-vars">
+    <element name="section-def-vars">
+      <ref name="attlist.section-def-vars"/>
+      <oneOrMore>
+        <ref name="def-var"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-vars" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The 'def-vars' section defines the global variables
+    that will be used to transfer information between rules
+  -->
+  <define name="def-var">
+    <element name="def-var">
+      <ref name="attlist.def-var"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.def-var" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="v"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The definition of a global variable has a mandatory unique name 'n' that
+    will be used to refer to it. A value of initialization can also be specified
+    by means the 'v' attribute.  The default value of the initialization is the
+    empty string.
+  -->
+  <define name="section-def-lists">
+    <element name="section-def-lists">
+      <ref name="attlist.section-def-lists"/>
+      <oneOrMore>
+        <ref name="def-list"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-lists" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Element 'section-def-lists' encloses a set of list definitions -->
+  <define name="def-list">
+    <element name="def-list">
+      <ref name="attlist.def-list"/>
+      <oneOrMore>
+        <ref name="list-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-list" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The 'def-list' element defines a named list to search with the 'in' 
+    element.  Attribute 'n' sets the name of the list
+  -->
+  <define name="list-item">
+    <element name="list-item">
+      <ref name="attlist.list-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.list-item" combine="interleave">
+    <attribute name="v"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Attribute 'v' of 'list-item' element contains the value to be added to 
+    the list being defined     
+  -->
+  <define name="section-def-macros">
+    <element name="section-def-macros">
+      <ref name="attlist.section-def-macros"/>
+      <oneOrMore>
+        <ref name="def-macro"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-macros" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    
+    The 'def-macros' section defines macros containing portions of
+    code frequently used in the action part of rules
+    
+  -->
+  <define name="def-macro">
+    <element name="def-macro">
+      <ref name="attlist.def-macro"/>
+      <oneOrMore>
+        <ref name="sentence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-macro" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+  </define>
+  <define name="attlist.def-macro" combine="interleave">
+    <attribute name="npar"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Macro definition:
+    
+    A macro has a mandatory name (the value of 'n'), a number of parameters
+    (the value of 'npar') and a body containing arguments and statements.  
+  -->
+  <define name="section-rules">
+    <element name="section-rules">
+      <ref name="attlist.section-rules"/>
+      <oneOrMore>
+        <ref name="rule"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-rules" combine="interleave">
+    <empty/>
+  </define>
+  <!-- The rules section contains a sequence of one or more rules -->
+  <define name="rule">
+    <element name="rule">
+      <ref name="attlist.rule"/>
+      <ref name="pattern"/>
+      <ref name="action"/>
+    </element>
+  </define>
+  <define name="attlist.rule" combine="interleave">
+    <optional>
+      <attribute name="comment"/>
+    </optional>
+  </define>
+  <!--
+    Each rule has a pattern and an action 
+    * attribute 'comment' allows to put in comments about the purpose of
+      the rule being defined
+  -->
+  <define name="pattern">
+    <element name="pattern">
+      <ref name="attlist.pattern"/>
+      <oneOrMore>
+        <ref name="pattern-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.pattern" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The pattern is specified in terms of pattern items, each one
+    representing a lexical form in the matched pattern 
+  -->
+  <define name="pattern-item">
+    <element name="pattern-item">
+      <ref name="attlist.pattern-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.pattern-item" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!-- Each attribute to be activated is referred to by its name in the def-cats section -->
+  <define name="action">
+    <element name="action">
+      <ref name="attlist.action"/>
+      <zeroOrMore>
+        <ref name="sentence"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.action" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- Encloses the procedural part of a rule -->
+  <define name="choose">
+    <element name="choose">
+      <ref name="attlist.choose"/>
+      <oneOrMore>
+        <ref name="when"/>
+      </oneOrMore>
+      <optional>
+        <ref name="otherwise"/>
+      </optional>
+    </element>
+  </define>
+  <define name="attlist.choose" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The choose statement is a selection statement (similar to a case
+    statement) composed of one or more tested cases and an optional
+    otherwise 
+  -->
+  <define name="when">
+    <element name="when">
+      <ref name="attlist.when"/>
+      <ref name="test"/>
+      <zeroOrMore>
+        <ref name="sentence"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.when" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- Each tested case is a block of zero or more statements -->
+  <define name="otherwise">
+    <element name="otherwise">
+      <ref name="attlist.otherwise"/>
+      <oneOrMore>
+        <ref name="sentence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.otherwise" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- The otherwise case is also a block of one or more statements -->
+  <define name="test">
+    <element name="test">
+      <ref name="attlist.test"/>
+      <ref name="condition"/>
+    </element>
+  </define>
+  <define name="attlist.test" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The test in a tested case may be a conjunction, a disjunction, or
+    a negation of simpler tests, as well as a simple equality test
+  -->
+  <define name="and">
+    <element name="and">
+      <ref name="attlist.and"/>
+      <ref name="condition"/>
+      <oneOrMore>
+        <ref name="condition"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.and" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Each conjuntion test contains two or more simpler tests -->
+  <define name="or">
+    <element name="or">
+      <ref name="attlist.or"/>
+      <ref name="condition"/>
+      <oneOrMore>
+        <ref name="condition"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.or" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Each disjunction test contains two or more simpler tests -->
+  <define name="not">
+    <element name="not">
+      <ref name="attlist.not"/>
+      <ref name="condition"/>
+    </element>
+  </define>
+  <define name="attlist.not" combine="interleave">
+    <empty/>
+  </define>
+  <!-- The negation of a simpler test is a test itself -->
+  <define name="equal">
+    <element name="equal">
+      <ref name="attlist.equal"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.equal" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    The simplest test is an equality test. The right part and the
+    left part of the equality may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="begins-with">
+    <element name="begins-with">
+      <ref name="attlist.begins-with"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.begins-with" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the beginning.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="ends-with">
+    <element name="ends-with">
+      <ref name="attlist.ends-with"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.ends-with" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the end.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="begins-with-list">
+    <element name="begins-with-list">
+      <ref name="attlist.begins-with-list"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.begins-with-list" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the beginning.
+    First parts of the test may be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section. The second part
+    must be always a list.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="ends-with-list">
+    <element name="ends-with-list">
+      <ref name="attlist.ends-with-list"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.ends-with-list" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the end.
+    First parts of the test may be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section. The second part
+    must be always a list.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="contains-substring">
+    <element name="contains-substring">
+      <ref name="attlist.contains-substring"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.contains-substring" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="in">
+    <element name="in">
+      <ref name="attlist.in"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.in" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+    this search is performed without attending to the case
+  -->
+  <define name="list">
+    <element name="list">
+      <ref name="attlist.list"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.list" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    'list' refers, with the name in attribute 'n', a list defined before in
+    the 'section-def-list' section
+  -->
+  <define name="let">
+    <element name="let">
+      <ref name="attlist.let"/>
+      <ref name="container"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.let" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    An assignment statement ('let') assigns the value of a clip (see
+    below), a literal string ('lit'), a literal tag('lit-tag') or the 
+    value of a global variable ('var') to either a global variable ('var') 
+    or a clip
+  -->
+  <define name="append">
+    <element name="append">
+      <ref name="attlist.append"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.append" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    This instruction appends the value of a clip (see
+    below), a literal string ('lit'), a literal tag('lit-tag') or the 
+    value of a global variable ('var') to either a global variable ('var') 
+    or a clip, identified by the "n" attribute
+  -->
+  <define name="out">
+    <element name="out">
+      <ref name="attlist.out"/>
+      <oneOrMore>
+        <choice>
+          <ref name="b"/>
+          <ref name="chunk"/>
+          <ref name="var"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.out" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- 'out' is an output statement; it may output blanks or chunks -->
+  <define name="modify-case">
+    <element name="modify-case">
+      <ref name="attlist.modify-case"/>
+      <ref name="container"/>
+      <ref name="stringvalue"/>
+    </element>
+  </define>
+  <define name="attlist.modify-case" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The first argument of 'modify-case' copy the case of the second 
+    argument.
+  -->
+  <define name="call-macro">
+    <element name="call-macro">
+      <ref name="attlist.call-macro"/>
+      <zeroOrMore>
+        <ref name="with-param"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.call-macro" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    A macro may be called anywhere by name with one or more
+    arguments
+  -->
+  <define name="with-param">
+    <element name="with-param">
+      <ref name="attlist.with-param"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.with-param" combine="interleave">
+    <attribute name="pos"/>
+  </define>
+  <!--
+    The attribute pos in each argument is used to refer to a lexical
+    form in the current rule. For example, if a 2-parameter macro
+    has been defined to perform noun-adjective agreement operations,
+    it may be used with arguments 1 and 2 in a noun-adjective rule,
+    with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+    arguments 1 and 3 in a noun-adverb-adjective rule, and with
+    arguments 2 and 1 in an adjective-noun rule 
+  -->
+  <define name="clip">
+    <element name="clip">
+      <ref name="attlist.clip"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.clip" combine="interleave">
+    <attribute name="pos"/>
+    <attribute name="part"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    A 'clip' is a substring of a source-language or target-language
+    lexical form, extracted according to an attribute:
+    
+    * 'pos' is an index (1, 2, 3...) used to select a lexical form
+       inside the rule;
+    
+    * the value of 'part' is the name of an attribute defined in
+      def-attrs, but may take also the values 'lem' (referring to
+      the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+      (lemma queue) and 'whole' (referring to the whole lexical form).
+    
+  -->
+  <define name="lit">
+    <element name="lit">
+      <ref name="attlist.lit"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lit" combine="interleave">
+    <attribute name="v"/>
+  </define>
+  <!--
+    A literal string value: the value of the literal is the value of
+    the 'v' attribute
+  -->
+  <define name="lit-tag">
+    <element name="lit-tag">
+      <ref name="attlist.lit-tag"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lit-tag" combine="interleave">
+    <attribute name="v"/>
+  </define>
+  <!--
+    A literal string value: the value of the literal is the value of
+    the 'v' attribute
+  -->
+  <define name="var">
+    <element name="var">
+      <ref name="attlist.var"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.var" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    Each 'var' is a variable identifier: the attribute n is the name
+    of the variable. When it is in an 'out', a 'test', or the right
+    part of a 'let', it represents the value of the variable; when in
+    the left part of a 'let' it represents the reference of the
+    variable. 
+  -->
+  <define name="get-case-from">
+    <element name="get-case-from">
+      <ref name="attlist.get-case-from"/>
+      <choice>
+        <ref name="clip"/>
+        <ref name="lit"/>
+        <ref name="var"/>
+      </choice>
+    </element>
+  </define>
+  <define name="attlist.get-case-from" combine="interleave">
+    <attribute name="pos"/>
+  </define>
+  <!--
+    Atenci�n, falta modificar todos los comentarios donde intervenga
+    get-case-from
+  -->
+  <define name="case-of">
+    <element name="case-of">
+      <ref name="attlist.case-of"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.case-of" combine="interleave">
+    <attribute name="pos"/>
+    <attribute name="part"/>
+  </define>
+  <!--
+    A 'case-of' is a value representing the case of a "clip".  This value 
+    will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+    (all uppercase).
+    
+    * 'pos' is an index (1, 2, 3...) used to select a lexical form
+       inside the rule;
+    
+    * the value of 'part' is the name of an attribute defined in
+      def-attrs, but may take also the values 'lem' (referring to
+      the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+      (lemma queue) and 'whole' (referring to the whole lexical form).
+  -->
+  <define name="concat">
+    <element name="concat">
+      <ref name="attlist.concat"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.concat" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Concatenates a sequence of values -->
+  <define name="chunk">
+    <element name="chunk">
+      <ref name="attlist.chunk"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.chunk" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Encloses a chunk      -->
+  <define name="pseudolemma">
+    <element name="pseudolemma">
+      <ref name="attlist.pseudolemma"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.pseudolemma" combine="interleave">
+    <empty/>
+  </define>
+  <define name="b">
+    <element name="b">
+      <ref name="attlist.b"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.b" combine="interleave">
+    <optional>
+      <attribute name="pos"/>
+    </optional>
+  </define>
+  <start>
+    <choice>
+      <ref name="interchunk"/>
+      <ref name="pseudolemma"/>
+    </choice>
+  </start>
+</grammar>
+<!--
+  'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+  with pos="2" refers to the [super]blanks (including format data
+  encapsulated by the de-formatter) between lexical form 2 and
+  lexical form 3. Managing [super]blanks explicitly allows for the
+  correct placement of format when the result of structural
+  transfer has more or less lexical items than the original or has
+  been reordered in some way.  If attribute "pos" is not specified, then
+  a single blank (ASCII 32) is generated.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.rng	(revision 70339)
@@ -0,0 +1,971 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!--
+  Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+  This program is free software; you can redistribute it and/or
+  modify it under the terms of the GNU General Public License as
+  published by the Free Software Foundation; either version 2 of the
+  License, or (at your option) any later version.
+  
+  This program is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  General Public License for more details.
+  
+  You should have received a copy of the GNU General Public License
+  along with this program; if not, see <http://www.gnu.org/licenses/>.
+  
+   Draft of DTD for the structural transfer rule files 
+  
+   Sergio Ortiz, Gema Ram�rez-S�nchez, Mireia Ginest�, Mikel L. Forcada, 
+   2005.07.29. 
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0" datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes">
+  <define name="condition">
+    <choice>
+      <ref name="and"/>
+      <ref name="or"/>
+      <ref name="not"/>
+      <ref name="equal"/>
+      <ref name="begins-with"/>
+      <ref name="begins-with-list"/>
+      <ref name="ends-with"/>
+      <ref name="ends-with-list"/>
+      <ref name="contains-substring"/>
+      <ref name="in"/>
+    </choice>
+  </define>
+  <define name="container">
+    <choice>
+      <ref name="var"/>
+      <ref name="clip"/>
+    </choice>
+  </define>
+  <define name="sentence">
+    <choice>
+      <ref name="let"/>
+      <ref name="out"/>
+      <ref name="choose"/>
+      <ref name="modify-case"/>
+      <ref name="call-macro"/>
+      <ref name="append"/>
+    </choice>
+  </define>
+  <define name="value">
+    <choice>
+      <ref name="b"/>
+      <ref name="clip"/>
+      <ref name="lit"/>
+      <ref name="lit-tag"/>
+      <ref name="var"/>
+      <ref name="get-case-from"/>
+      <ref name="case-of"/>
+      <ref name="concat"/>
+      <ref name="lu-count"/>
+      <ref name="lu"/>
+      <ref name="mlu"/>
+    </choice>
+  </define>
+  <define name="stringvalue">
+    <choice>
+      <ref name="clip"/>
+      <ref name="lit"/>
+      <ref name="var"/>
+      <ref name="get-case-from"/>
+      <ref name="case-of"/>
+      <ref name="lu-count"/>
+    </choice>
+  </define>
+  <define name="postchunk">
+    <element name="postchunk">
+      <ref name="attlist.postchunk"/>
+      <ref name="section-def-cats"/>
+      <ref name="section-def-attrs"/>
+      <ref name="section-def-vars"/>
+      <optional>
+        <ref name="section-def-lists"/>
+      </optional>
+      <optional>
+        <ref name="section-def-macros"/>
+      </optional>
+      <ref name="section-rules"/>
+    </element>
+  </define>
+  <define name="attlist.postchunk" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    'postchunk' is the root element containing the whole structural
+    postchunk rule file.  
+  -->
+  <define name="section-def-cats">
+    <element name="section-def-cats">
+      <ref name="attlist.section-def-cats"/>
+      <oneOrMore>
+        <ref name="def-cat"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-cats" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+         The 'def-cats' section defines the categories used to build the
+    patterns used in rules
+  -->
+  <define name="def-cat">
+    <element name="def-cat">
+      <ref name="attlist.def-cat"/>
+      <oneOrMore>
+        <ref name="cat-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-cat" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each 'def-cat' defines one category in terms of a list of
+    category items and has a unique name 'n', which is mandatory
+  -->
+  <define name="cat-item">
+    <element name="cat-item">
+      <ref name="attlist.cat-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.cat-item" combine="interleave">
+    <attribute name="name"/>
+  </define>
+  <!--
+    In addition, a required attribute, "name", is used to specify 
+    wich chunk name is detected by this cat-item
+  -->
+  <define name="section-def-attrs">
+    <element name="section-def-attrs">
+      <ref name="attlist.section-def-attrs"/>
+      <oneOrMore>
+        <ref name="def-attr"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-attrs" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The 'def-attrs' section defines the attributes that will be
+    identified in matched lexical forms 
+  -->
+  <define name="def-attr">
+    <element name="def-attr">
+      <ref name="attlist.def-attr"/>
+      <oneOrMore>
+        <ref name="attr-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-attr" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each def-attr defines one attribute in terms of a list of
+    attribute items and has a mandatory unique name n 
+  -->
+  <define name="attr-item">
+    <element name="attr-item">
+      <ref name="attlist.attr-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.attr-item" combine="interleave">
+    <optional>
+      <attribute name="tags"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each 'attr-item' specifies a subsequence of the tags in
+    that lexical form (attribute 'tags')
+  -->
+  <define name="section-def-vars">
+    <element name="section-def-vars">
+      <ref name="attlist.section-def-vars"/>
+      <oneOrMore>
+        <ref name="def-var"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-vars" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The 'def-vars' section defines the global variables
+    that will be used to transfer information between rules
+  -->
+  <define name="def-var">
+    <element name="def-var">
+      <ref name="attlist.def-var"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.def-var" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="v"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The definition of a global variable has a mandatory unique name 'n' that
+    will be used to refer to it. A value of initialization can also be specified
+    by means the 'v' attribute.  The default value of the initialization is the
+    empty string.
+  -->
+  <define name="section-def-lists">
+    <element name="section-def-lists">
+      <ref name="attlist.section-def-lists"/>
+      <oneOrMore>
+        <ref name="def-list"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-lists" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Element 'section-def-lists' encloses a set of list definitions -->
+  <define name="def-list">
+    <element name="def-list">
+      <ref name="attlist.def-list"/>
+      <oneOrMore>
+        <ref name="list-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-list" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The 'def-list' element defines a named list to search with the 'in' 
+    element.  Attribute 'n' sets the name of the list
+  -->
+  <define name="list-item">
+    <element name="list-item">
+      <ref name="attlist.list-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.list-item" combine="interleave">
+    <attribute name="v"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Attribute 'v' of 'list-item' element contains the value to be added to 
+    the list being defined     
+  -->
+  <define name="section-def-macros">
+    <element name="section-def-macros">
+      <ref name="attlist.section-def-macros"/>
+      <oneOrMore>
+        <ref name="def-macro"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-macros" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    
+    The 'def-macros' section defines macros containing portions of
+    code frequently used in the action part of rules
+    
+  -->
+  <define name="def-macro">
+    <element name="def-macro">
+      <ref name="attlist.def-macro"/>
+      <oneOrMore>
+        <ref name="sentence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-macro" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+  </define>
+  <define name="attlist.def-macro" combine="interleave">
+    <attribute name="npar"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Macro definition:
+    
+    A macro has a mandatory name (the value of 'n'), a number of parameters
+    (the value of 'npar') and a body containing arguments and statements.  
+  -->
+  <define name="section-rules">
+    <element name="section-rules">
+      <ref name="attlist.section-rules"/>
+      <oneOrMore>
+        <ref name="rule"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-rules" combine="interleave">
+    <empty/>
+  </define>
+  <!-- The rules section contains a sequence of one or more rules -->
+  <define name="rule">
+    <element name="rule">
+      <ref name="attlist.rule"/>
+      <ref name="pattern"/>
+      <ref name="action"/>
+    </element>
+  </define>
+  <define name="attlist.rule" combine="interleave">
+    <optional>
+      <attribute name="comment"/>
+    </optional>
+  </define>
+  <!--
+    Each rule has a pattern and an action 
+    * Attribute 'comment' allows to include a comment with the rule
+  -->
+  <define name="pattern">
+    <element name="pattern">
+      <ref name="attlist.pattern"/>
+      <ref name="pattern-item"/>
+    </element>
+  </define>
+  <define name="attlist.pattern" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The pattern is specified in terms of pattern items, each one
+    representing a lexical form in the matched pattern 
+  -->
+  <define name="pattern-item">
+    <element name="pattern-item">
+      <ref name="attlist.pattern-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.pattern-item" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!-- Each attribute to be activated is referred to by its name in the def-cats section -->
+  <define name="action">
+    <element name="action">
+      <ref name="attlist.action"/>
+      <zeroOrMore>
+        <ref name="sentence"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.action" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- Encloses the procedural part of a rule -->
+  <define name="choose">
+    <element name="choose">
+      <ref name="attlist.choose"/>
+      <oneOrMore>
+        <ref name="when"/>
+      </oneOrMore>
+      <optional>
+        <ref name="otherwise"/>
+      </optional>
+    </element>
+  </define>
+  <define name="attlist.choose" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The choose statement is a selection statement (similar to a case
+    statement) composed of one or more tested cases and an optional
+    otherwise 
+  -->
+  <define name="when">
+    <element name="when">
+      <ref name="attlist.when"/>
+      <ref name="test"/>
+      <zeroOrMore>
+        <ref name="sentence"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.when" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- Each tested case is a block of zero or more statements -->
+  <define name="otherwise">
+    <element name="otherwise">
+      <ref name="attlist.otherwise"/>
+      <oneOrMore>
+        <ref name="sentence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.otherwise" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- The otherwise case is also a block of one or more statements -->
+  <define name="test">
+    <element name="test">
+      <ref name="attlist.test"/>
+      <ref name="condition"/>
+    </element>
+  </define>
+  <define name="attlist.test" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The test in a tested case may be a conjunction, a disjunction, or
+    a negation of simpler tests, as well as a simple equality test
+  -->
+  <define name="and">
+    <element name="and">
+      <ref name="attlist.and"/>
+      <ref name="condition"/>
+      <oneOrMore>
+        <ref name="condition"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.and" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Each conjuntion test contains two or more simpler tests -->
+  <define name="or">
+    <element name="or">
+      <ref name="attlist.or"/>
+      <ref name="condition"/>
+      <oneOrMore>
+        <ref name="condition"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.or" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Each disjunction test contains two or more simpler tests -->
+  <define name="not">
+    <element name="not">
+      <ref name="attlist.not"/>
+      <ref name="condition"/>
+    </element>
+  </define>
+  <define name="attlist.not" combine="interleave">
+    <empty/>
+  </define>
+  <!-- The negation of a simpler test is a test itself -->
+  <define name="equal">
+    <element name="equal">
+      <ref name="attlist.equal"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.equal" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    The simplest test is an equality test. The right part and the
+    left part of the equality may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="begins-with">
+    <element name="begins-with">
+      <ref name="attlist.begins-with"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.begins-with" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the beginning.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="ends-with">
+    <element name="ends-with">
+      <ref name="attlist.ends-with"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.ends-with" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the end.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="begins-with-list">
+    <element name="begins-with-list">
+      <ref name="attlist.begins-with-list"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.begins-with-list" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the beginning.
+    First parts of the test may be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section. The second part
+    must be always a list.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="ends-with-list">
+    <element name="ends-with-list">
+      <ref name="attlist.ends-with-list"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.ends-with-list" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the end.
+    First parts of the test may be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section. The second part
+    must be always a list.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="contains-substring">
+    <element name="contains-substring">
+      <ref name="attlist.contains-substring"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.contains-substring" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="in">
+    <element name="in">
+      <ref name="attlist.in"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.in" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+    this search is performed without attending to the case
+  -->
+  <define name="list">
+    <element name="list">
+      <ref name="attlist.list"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.list" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    'list' refers, with the name in attribute 'n', a list defined before in
+    the 'section-def-list' section
+  -->
+  <define name="let">
+    <element name="let">
+      <ref name="attlist.let"/>
+      <ref name="container"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.let" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    An assignment statement ('let') assigns the value of a clip (see
+    below), a literal string ('lit'), a literal tag('lit-tag') or the 
+    value of a global variable ('var') to either a global variable ('var') 
+    or a clip
+  -->
+  <define name="append">
+    <element name="append">
+      <ref name="attlist.append"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.append" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    This instruction appends the value of a clip (see
+    below), a literal string ('lit'), a literal tag('lit-tag') or the 
+    value of a global variable ('var') to either a global variable ('var') 
+    or a clip, identified by the "n" attribute
+  -->
+  <define name="out">
+    <element name="out">
+      <ref name="attlist.out"/>
+      <oneOrMore>
+        <choice>
+          <ref name="b"/>
+          <ref name="lu"/>
+          <ref name="mlu"/>
+          <ref name="var"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.out" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- 'out' is an output statement; it may output blanks or chunks -->
+  <define name="modify-case">
+    <element name="modify-case">
+      <ref name="attlist.modify-case"/>
+      <ref name="container"/>
+      <ref name="stringvalue"/>
+    </element>
+  </define>
+  <define name="attlist.modify-case" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The first argument of 'modify-case' copy the case of the second 
+    argument.
+  -->
+  <define name="call-macro">
+    <element name="call-macro">
+      <ref name="attlist.call-macro"/>
+      <zeroOrMore>
+        <ref name="with-param"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.call-macro" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    A macro may be called anywhere by name with one or more
+    arguments
+  -->
+  <define name="with-param">
+    <element name="with-param">
+      <ref name="attlist.with-param"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.with-param" combine="interleave">
+    <attribute name="pos"/>
+  </define>
+  <!--
+    The attribute pos in each argument is used to refer to a lexical
+    form in the current rule. For example, if a 2-parameter macro
+    has been defined to perform noun-adjective agreement operations,
+    it may be used with arguments 1 and 2 in a noun-adjective rule,
+    with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+    arguments 1 and 3 in a noun-adverb-adjective rule, and with
+    arguments 2 and 1 in an adjective-noun rule 
+  -->
+  <define name="clip">
+    <element name="clip">
+      <ref name="attlist.clip"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.clip" combine="interleave">
+    <attribute name="pos"/>
+    <attribute name="part"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    A 'clip' is a substring of a source-language or target-language
+    lexical form, extracted according to an attribute:
+    
+    * 'pos' is an index (1, 2, 3...) used to select a lexical form
+       inside the rule;
+    
+    * the value of 'part' is the name of an attribute defined in
+      def-attrs, but may take also the values 'lem' (referring to
+      the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+      (lemma queue) and 'whole' (referring to the whole lexical form).
+    
+  -->
+  <define name="lit">
+    <element name="lit">
+      <ref name="attlist.lit"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lit" combine="interleave">
+    <attribute name="v"/>
+  </define>
+  <!--
+    A literal string value: the value of the literal is the value of
+    the 'v' attribute
+  -->
+  <define name="lit-tag">
+    <element name="lit-tag">
+      <ref name="attlist.lit-tag"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lit-tag" combine="interleave">
+    <attribute name="v"/>
+  </define>
+  <!--
+    A literal string value: the value of the literal is the value of
+    the 'v' attribute
+  -->
+  <define name="var">
+    <element name="var">
+      <ref name="attlist.var"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.var" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    Each 'var' is a variable identifier: the attribute n is the name
+    of the variable. When it is in an 'out', a 'test', or the right
+    part of a 'let', it represents the value of the variable; when in
+    the left part of a 'let' it represents the reference of the
+    variable. 
+  -->
+  <define name="get-case-from">
+    <element name="get-case-from">
+      <ref name="attlist.get-case-from"/>
+      <choice>
+        <ref name="clip"/>
+        <ref name="lit"/>
+        <ref name="var"/>
+      </choice>
+    </element>
+  </define>
+  <define name="attlist.get-case-from" combine="interleave">
+    <attribute name="pos"/>
+  </define>
+  <!--
+    Atenci�n, falta modificar todos los comentarios donde intervenga
+    get-case-from
+  -->
+  <define name="case-of">
+    <element name="case-of">
+      <ref name="attlist.case-of"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.case-of" combine="interleave">
+    <attribute name="pos"/>
+    <attribute name="part"/>
+  </define>
+  <!--
+    A 'case-of' is a value representing the case of a "clip".  This value 
+    will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+    (all uppercase).
+    
+    * 'pos' is an index (1, 2, 3...) used to select a lexical form
+       inside the rule;
+    
+    * the value of 'part' is the name of an attribute defined in
+      def-attrs, but may take also the values 'lem' (referring to
+      the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+      (lemma queue) and 'whole' (referring to the whole lexical form).
+  -->
+  <define name="concat">
+    <element name="concat">
+      <ref name="attlist.concat"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.concat" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Concatenates a sequence of values -->
+  <define name="mlu">
+    <element name="mlu">
+      <ref name="attlist.mlu"/>
+      <oneOrMore>
+        <ref name="lu"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.mlu" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Encloses a multiword -->
+  <define name="lu">
+    <element name="lu">
+      <ref name="attlist.lu"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.lu" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Encloses a word -->
+  <define name="b">
+    <element name="b">
+      <ref name="attlist.b"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.b" combine="interleave">
+    <optional>
+      <attribute name="pos"/>
+    </optional>
+  </define>
+  <!--
+    'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+    with pos="2" refers to the [super]blanks (including format data
+    encapsulated by the de-formatter) between lexical form 2 and
+    lexical form 3. Managing [super]blanks explicitly allows for the
+    correct placement of format when the result of structural
+    transfer has more or less lexical items than the original or has
+    been reordered in some way.  If attribute "pos" is not specified, then
+    a single blank (ASCII 32) is generated.
+  -->
+  <define name="lu-count">
+    <element name="lu-count">
+      <ref name="attlist.lu-count"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lu-count" combine="interleave">
+    <empty/>
+  </define>
+  <start>
+    <choice>
+      <ref name="postchunk"/>
+    </choice>
+  </start>
+</grammar>
+<!-- Number of lexical units (words inside the chunk) in the rule -->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.rng	(revision 70339)
@@ -0,0 +1,310 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!--
+  Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+  This program is free software; you can redistribute it and/or
+  modify it under the terms of the GNU General Public License as
+  published by the Free Software Foundation; either version 2 of the
+  License, or (at your option) any later version.
+  
+  This program is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  General Public License for more details.
+  
+  You should have received a copy of the GNU General Public License
+  along with this program; if not, see <http://www.gnu.org/licenses/>.
+  
+    DTD for the tagset and the rules to enforce the state to state
+    transition probabilities used by the part-of-speech tagger. 
+    2005.07.29.
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0">
+  <define name="tagger">
+    <element name="tagger">
+      <ref name="attlist.tagger"/>
+      <ref name="tagset"/>
+      <optional>
+        <ref name="forbid"/>
+      </optional>
+      <optional>
+        <ref name="enforce-rules"/>
+      </optional>
+      <optional>
+        <ref name="preferences"/>
+      </optional>
+      <optional>
+        <ref name="discard-on-ambiguity"/>
+      </optional>
+    </element>
+  </define>
+  <define name="attlist.tagger" combine="interleave">
+    <attribute name="name"/>
+  </define>
+  <!--
+        'tagger' is the root element containing the whole tagset for a given
+    language specified through the mandatory attribute 'name'
+  -->
+  <define name="tagset">
+    <element name="tagset">
+      <ref name="attlist.tagset"/>
+      <oneOrMore>
+        <ref name="def-label"/>
+      </oneOrMore>
+      <zeroOrMore>
+        <ref name="def-mult"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.tagset" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+        The 'tagset' section defines the correspondance between simple 
+    or multiple morphological categories defining a lexical form and the coarser 
+    ones with which the part-of-speech tagger works
+  -->
+  <define name="def-label">
+    <element name="def-label">
+      <ref name="attlist.def-label"/>
+      <oneOrMore>
+        <ref name="tags-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-label" combine="interleave">
+    <attribute name="name"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+    <optional>
+      <attribute name="closed"/>
+    </optional>
+  </define>
+  <!--
+        Each 'def-label' defines one coarse tag in terms of a list of fine tags 
+    and has a mandatory unique name. The optional attribute 'closed="true"' may be used
+    to specify if the defined fine tags belong to a closed list.
+    c is for comments and is ignored
+  -->
+  <define name="tags-item">
+    <element name="tags-item">
+      <ref name="attlist.tags-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.tags-item" combine="interleave">
+    <attribute name="tags"/>
+    <optional>
+      <attribute name="lemma"/>
+    </optional>
+  </define>
+  <!--
+        Each 'tags-item' may be a dot-separated subsequence of the morphological tags
+    corresponding to a coarse tag optionally in association with a given lemma 
+  -->
+  <define name="def-mult">
+    <element name="def-mult">
+      <ref name="attlist.def-mult"/>
+      <oneOrMore>
+        <ref name="sequence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-mult" combine="interleave">
+    <attribute name="name"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+    <optional>
+      <attribute name="closed"/>
+    </optional>
+  </define>
+  <!--
+        Each 'def-mult' defines one coarse tag in terms of a sequence of coarse
+    tags previously defined as 'def-labels' or a sequence of fine tags. A mandatory 
+    name is required for each 'def-mult' which may also has an optional attribute 
+    'closed="true"' if it belongs to a closed list
+    c is for comments and is ignored
+  -->
+  <define name="sequence">
+    <element name="sequence">
+      <ref name="attlist.sequence"/>
+      <oneOrMore>
+        <choice>
+          <ref name="tags-item"/>
+          <ref name="label-item"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.sequence" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+        Element 'sequence' encloses a set of tags or labels which defines 
+    a unit with more than one label
+  -->
+  <define name="label-item">
+    <element name="label-item">
+      <ref name="attlist.label-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.label-item" combine="interleave">
+    <attribute name="label"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+        Each 'label' of the 'label-item' correspond to a coarse tag previously 
+    defined as a 'def-label' by a name.
+    c is for comments and is ignored
+  -->
+  <define name="forbid">
+    <element name="forbid">
+      <ref name="attlist.forbid"/>
+      <oneOrMore>
+        <ref name="label-sequence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.forbid" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+        Element 'forbid' contains sequences of morphological categories that are not 
+    allowed in a given language
+  -->
+  <define name="label-sequence">
+    <element name="label-sequence">
+      <ref name="attlist.label-sequence"/>
+      <oneOrMore>
+        <ref name="label-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.label-sequence" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+        Each 'label-sequence' is restricted to two 'label-items' 
+    c is for comments and is ignored
+  -->
+  <define name="enforce-rules">
+    <element name="enforce-rules">
+      <ref name="attlist.enforce-rules"/>
+      <oneOrMore>
+        <ref name="enforce-after"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.enforce-rules" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Element 'enforce-rules' defines sets of coarse tags that must follow specified ones -->
+  <define name="enforce-after">
+    <element name="enforce-after">
+      <ref name="attlist.enforce-after"/>
+      <ref name="label-set"/>
+    </element>
+  </define>
+  <define name="attlist.enforce-after" combine="interleave">
+    <attribute name="label"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+        Each 'enforce-after' encloses the set of coarse tags ('label-set') that must follow 
+    the one defined in 'label', as a mandatory attribute
+    c is for comments and is ignored
+  -->
+  <define name="label-set">
+    <element name="label-set">
+      <ref name="attlist.label-set"/>
+      <oneOrMore>
+        <ref name="label-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.label-set" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+        The set of 'label-items' enforced after a 'label' are enclosed inside element 'label-set'  
+    c is for comments and is ignored
+  -->
+  <define name="preferences">
+    <element name="preferences">
+      <ref name="attlist.preferences"/>
+      <oneOrMore>
+        <ref name="prefer"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.preferences" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+        Element 'preferences' allows to decide amongst two or more fine tag sequences 
+    which are grouped in the same coarse tag. 
+  -->
+  <define name="prefer">
+    <element name="prefer">
+      <ref name="attlist.prefer"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.prefer" combine="interleave">
+    <attribute name="tags"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+        Each 'prefer' element has a mandatory attribute 'tags' made of a sequence of fine tags 
+    c is for comments and is ignored
+  -->
+  <define name="discard-on-ambiguity">
+    <element name="discard-on-ambiguity">
+      <ref name="attlist.discard-on-ambiguity"/>
+      <oneOrMore>
+        <ref name="discard"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.discard-on-ambiguity" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    List of label-item or tags-item to be discarded when an ambiguity
+    occurs inside a word
+  -->
+  <define name="discard">
+    <element name="discard">
+      <ref name="attlist.discard"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.discard" combine="interleave">
+    <attribute name="tags"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <start>
+    <choice>
+      <ref name="tagger"/>
+    </choice>
+  </start>
+</grammar>
+<!--
+      Each 'discard' element has a mandatory attribute 'tags' made of a sequence of fine tags 
+  c is for comments and is ignored
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/format.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/format.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/format.rnc	(revision 70339)
@@ -0,0 +1,111 @@
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+# 
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+# 
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+# 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+# 
+#    DTD for the format specification files
+#    Sergio Ortiz  2005.05.13
+
+format = element format { attlist.format, options, rules }
+attlist.format &= attribute name { text }
+# 'format' is the root element containing the whole format specification
+# file.  The attribute 'name' specifies the name of the format
+options =
+  element options {
+    attlist.options,
+    largeblocks,
+    input,
+    output,
+    tag-name,
+    escape-chars,
+    space-chars,
+    case-sensitive
+  }
+attlist.options &= empty
+# General options of the format 
+largeblocks = element largeblocks { attlist.largeblocks, empty }
+attlist.largeblocks &= attribute size { text }
+# The attribute size is used to define the maximal size in bytes of
+# inline format blocks
+input = element input { attlist.input, empty }
+attlist.input &= attribute zip-path { text }?
+attlist.input &= attribute encoding { text }
+# Reserved for future extensions
+output = element output { attlist.output, empty }
+attlist.output &= attribute zip-path { text }?
+attlist.output &= attribute encoding { text }
+# Reserved for future extensions
+tag-name = element tag-name { attlist.tag-name, empty }
+attlist.tag-name &= attribute regexp { text }
+# The attribute regexp defines (whith a _flex_ regular expression) how 
+# take a tag name from a whole tag. '\'
+escape-chars = element escape-chars { attlist.escape-chars, empty }
+attlist.escape-chars &= attribute regexp { text }
+# The attribute regexp defines (whith a _flex_ regular expression) the
+# set of characters to be escaped with preceding a backslash '\'
+space-chars = element space-chars { attlist.space-chars, empty }
+attlist.space-chars &= attribute regexp { text }
+# Define the space characters (in regexp) with a _flex_ regular 
+# expression
+case-sensitive =
+  element case-sensitive { attlist.case-sensitive, empty }
+attlist.case-sensitive &= attribute value { "yes" | "no" }
+# The attribute 'value' is set to 'yes' if the case is relevant in the 
+# specification of the format.  Otherwise is set to 'no'
+rules =
+  element rules { attlist.rules, (format-rule | replacement-rule)+ }
+attlist.rules &= empty
+# Group the rules of processing format and the rules of substitute 
+# expressions by characters that are part of the text
+format-rule =
+  element format-rule {
+    attlist.format-rule,
+    (tag | (begin, end))
+  }
+attlist.format-rule &=
+  attribute type { "comment" | "empty" | "open" | "close" }?
+attlist.format-rule &= attribute eos { "yes" | "no" }?
+attlist.format-rule &= attribute priority { text }
+# Format rule parent element.  It may include a 'tag' element or
+# a couple of elements 'begin', 'end'.  In the first case, this element is 
+# considered to be part of the format.  In the second case, the begin and 
+# the end element are considered to enclosing format.  The attribute
+# 'eos' (end of sentence) is set to 'yes' if that rule defines a dot in
+# the text being processed (is no by default).  The attribute 'priority' 
+# marks the order of precedence of the rule
+tag = element tag { attlist.tag, empty }
+attlist.tag &= attribute regexp { text }
+# Define an element that is part of the format by the pattern specified
+# as a value for the regexp attribute
+begin = element begin { attlist.begin, empty }
+attlist.begin &= attribute regexp { text }
+# The attribute 'regexp' is the regular expression that detects the
+# begining delimiter of a block of format
+end = element end { attlist.end, empty }
+attlist.end &= attribute regexp { text }
+# The attribute 'regexp' is the regular expression that detects the
+# ending delimiter of a block of format
+replacement-rule =
+  element replacement-rule { attlist.replacement-rule, replace+ }
+attlist.replacement-rule &= attribute regexp { text }
+# Root element for a replacement rule.  The attribute 'regexp' is the
+# general expression to detect the elements to replace
+replace = element replace { attlist.replace, empty }
+attlist.replace &= attribute source { text }
+attlist.replace &= attribute target { text }
+attlist.replace &= attribute prefer { "yes" | "no" }?
+start = format
+# Replacement rule.  The 'source' is a string of one or more characters.
+# The 'target' MUST be a single character.  The 'prefer' attribute, when 
+# set to 'yes' defines the preferred reverse translation of the 
+# replacement.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.rnc	(revision 70339)
@@ -0,0 +1,353 @@
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+# 
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+# 
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+# 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+# 
+#  Draft of DTD for the structural transfer rule files 
+# 
+#  Sergio Ortiz, Gema Ramírez-Sánchez, Mireia Ginestí, Mikel L. Forcada, 
+#  2005.07.29. 
+
+condition =
+  and
+  | or
+  | not
+  | equal
+  | begins-with
+  | begins-with-list
+  | ends-with
+  | ends-with-list
+  | contains-substring
+  | in
+container = var | clip
+sentence = let | out | choose | modify-case | call-macro | append
+value =
+  b
+  | clip
+  | lit
+  | lit-tag
+  | var
+  | get-case-from
+  | case-of
+  | concat
+  | chunk
+stringvalue = clip | lit | var | get-case-from | case-of
+interchunk =
+  element interchunk {
+    attlist.interchunk,
+    section-def-cats,
+    section-def-attrs,
+    section-def-vars,
+    section-def-lists?,
+    section-def-macros?,
+    section-rules
+  }
+attlist.interchunk &= empty
+# 'interchunk' is the root element containing the whole structural
+# interchunk rule file.  
+section-def-cats =
+  element section-def-cats { attlist.section-def-cats, def-cat+ }
+attlist.section-def-cats &= empty
+#      The 'def-cats' section defines the categories used to build the
+# patterns used in rules
+def-cat = element def-cat { attlist.def-cat, cat-item+ }
+attlist.def-cat &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# Each 'def-cat' defines one category in terms of a list of
+# category items and has a unique name 'n', which is mandatory
+cat-item = element cat-item { attlist.cat-item, empty }
+attlist.cat-item &=
+  attribute lemma { text }?,
+  attribute tags { text },
+  attribute c { text }?
+#      Each 'cat-item' (category item) represents a set of lexical forms
+# and has a mandatory attribute 'tags' whose value is a sequence of
+# dot-separated tag names; this sequence is a subsequence of the
+# tag sequence defining each possible lexical form. For example,
+# tags="n.f" would match all lexical forms containing this tag
+# sequence, such as "^casa<n><f><pl>$".
+# 
+# In addition, an optional attribute, "lemma", may be used to
+# define lexical forms having a particular substring in their lemma
+section-def-attrs =
+  element section-def-attrs { attlist.section-def-attrs, def-attr+ }
+attlist.section-def-attrs &= empty
+# The 'def-attrs' section defines the attributes that will be
+# identified in matched lexical forms 
+def-attr = element def-attr { attlist.def-attr, attr-item+ }
+attlist.def-attr &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# Each def-attr defines one attribute in terms of a list of
+# attribute items and has a mandatory unique name n 
+attr-item = element attr-item { attlist.attr-item, empty }
+attlist.attr-item &=
+  attribute tags { text }?,
+  attribute c { text }?
+# Each 'attr-item' specifies a subsequence of the tags in
+# that lexical form (attribute 'tags')
+section-def-vars =
+  element section-def-vars { attlist.section-def-vars, def-var+ }
+attlist.section-def-vars &= empty
+# The 'def-vars' section defines the global variables
+# that will be used to transfer information between rules
+def-var = element def-var { attlist.def-var, empty }
+attlist.def-var &=
+  attribute n { xsd:ID },
+  attribute v { text }?,
+  attribute c { text }?
+# The definition of a global variable has a mandatory unique name 'n' that
+# will be used to refer to it. A value of initialization can also be specified
+# by means the 'v' attribute.  The default value of the initialization is the
+# empty string.
+section-def-lists =
+  element section-def-lists { attlist.section-def-lists, def-list+ }
+attlist.section-def-lists &= empty
+# Element 'section-def-lists' encloses a set of list definitions
+def-list = element def-list { attlist.def-list, list-item+ }
+attlist.def-list &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# The 'def-list' element defines a named list to search with the 'in' 
+# element.  Attribute 'n' sets the name of the list
+list-item = element list-item { attlist.list-item, empty }
+attlist.list-item &=
+  attribute v { text },
+  attribute c { text }?
+# Attribute 'v' of 'list-item' element contains the value to be added to 
+# the list being defined     
+section-def-macros =
+  element section-def-macros { attlist.section-def-macros, def-macro+ }
+attlist.section-def-macros &= empty
+# 
+# The 'def-macros' section defines macros containing portions of
+# code frequently used in the action part of rules
+#
+def-macro = element def-macro { attlist.def-macro, sentence+ }
+attlist.def-macro &= attribute n { xsd:ID }
+attlist.def-macro &=
+  attribute npar { text },
+  attribute c { text }?
+# Macro definition:
+# 
+# A macro has a mandatory name (the value of 'n'), a number of parameters
+# (the value of 'npar') and a body containing arguments and statements.  
+section-rules = element section-rules { attlist.section-rules, rule+ }
+attlist.section-rules &= empty
+# The rules section contains a sequence of one or more rules
+rule = element rule { attlist.rule, pattern, action }
+attlist.rule &= attribute comment { text }?
+# Each rule has a pattern and an action 
+# * attribute 'comment' allows to put in comments about the purpose of
+#   the rule being defined
+pattern = element pattern { attlist.pattern, pattern-item+ }
+attlist.pattern &= empty
+# The pattern is specified in terms of pattern items, each one
+# representing a lexical form in the matched pattern 
+pattern-item = element pattern-item { attlist.pattern-item, empty }
+attlist.pattern-item &= attribute n { xsd:IDREF }
+# Each attribute to be activated is referred to by its name in the def-cats section 
+action = element action { attlist.action, sentence* }
+attlist.action &= attribute c { text }?
+# Encloses the procedural part of a rule
+choose = element choose { attlist.choose, when+, otherwise? }
+attlist.choose &= attribute c { text }?
+# The choose statement is a selection statement (similar to a case
+# statement) composed of one or more tested cases and an optional
+# otherwise 
+when = element when { attlist.when, test, sentence* }
+attlist.when &= attribute c { text }?
+# Each tested case is a block of zero or more statements 
+otherwise = element otherwise { attlist.otherwise, sentence+ }
+attlist.otherwise &= attribute c { text }?
+# The otherwise case is also a block of one or more statements 
+test = element test { attlist.test, condition }
+attlist.test &= attribute c { text }?
+# The test in a tested case may be a conjunction, a disjunction, or
+# a negation of simpler tests, as well as a simple equality test
+and = element and { attlist.and, condition, condition+ }
+attlist.and &= empty
+# Each conjuntion test contains two or more simpler tests 
+or = element or { attlist.or, condition, condition+ }
+attlist.or &= empty
+# Each disjunction test contains two or more simpler tests 
+not = element not { attlist.not, condition }
+attlist.not &= empty
+# The negation of a simpler test is a test itself 
+equal = element equal { attlist.equal, value, value }
+attlist.equal &= attribute caseless { "no" | "yes" }?
+# The simplest test is an equality test. The right part and the
+# left part of the equality may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+begins-with = element begins-with { attlist.begins-with, value, value }
+attlist.begins-with &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the beginning.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+ends-with = element ends-with { attlist.ends-with, value, value }
+attlist.ends-with &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the end.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+begins-with-list =
+  element begins-with-list { attlist.begins-with-list, value, \list }
+attlist.begins-with-list &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the beginning.
+# First parts of the test may be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section. The second part
+# must be always a list.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+ends-with-list =
+  element ends-with-list { attlist.ends-with-list, value, \list }
+attlist.ends-with-list &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the end.
+# First parts of the test may be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section. The second part
+# must be always a list.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+contains-substring =
+  element contains-substring {
+    attlist.contains-substring, value, value
+  }
+attlist.contains-substring &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+in = element in { attlist.in, value, \list }
+attlist.in &= attribute caseless { "no" | "yes" }?
+# 'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+# this search is performed without attending to the case
+\list = element list { attlist.list, empty }
+attlist.list &= attribute n { xsd:IDREF }
+# 'list' refers, with the name in attribute 'n', a list defined before in
+# the 'section-def-list' section
+let = element let { attlist.let, container, value }
+attlist.let &= empty
+# An assignment statement ('let') assigns the value of a clip (see
+# below), a literal string ('lit'), a literal tag('lit-tag') or the 
+# value of a global variable ('var') to either a global variable ('var') 
+# or a clip
+append = element append { attlist.append, value+ }
+attlist.append &= attribute n { xsd:IDREF }
+# This instruction appends the value of a clip (see
+# below), a literal string ('lit'), a literal tag('lit-tag') or the 
+# value of a global variable ('var') to either a global variable ('var') 
+# or a clip, identified by the "n" attribute
+out = element out { attlist.out, (b | chunk | var)+ }
+attlist.out &= attribute c { text }?
+# 'out' is an output statement; it may output blanks or chunks
+modify-case =
+  element modify-case { attlist.modify-case, container, stringvalue }
+attlist.modify-case &= empty
+# The first argument of 'modify-case' copy the case of the second 
+# argument.
+call-macro = element call-macro { attlist.call-macro, with-param* }
+attlist.call-macro &= attribute n { xsd:IDREF }
+# A macro may be called anywhere by name with one or more
+# arguments
+with-param = element with-param { attlist.with-param, empty }
+attlist.with-param &= attribute pos { text }
+# The attribute pos in each argument is used to refer to a lexical
+# form in the current rule. For example, if a 2-parameter macro
+# has been defined to perform noun-adjective agreement operations,
+# it may be used with arguments 1 and 2 in a noun-adjective rule,
+# with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+# arguments 1 and 3 in a noun-adverb-adjective rule, and with
+# arguments 2 and 1 in an adjective-noun rule 
+clip = element clip { attlist.clip, empty }
+attlist.clip &=
+  attribute pos { text },
+  attribute part { text },
+  attribute c { text }?
+# A 'clip' is a substring of a source-language or target-language
+# lexical form, extracted according to an attribute:
+# 
+# * 'pos' is an index (1, 2, 3...) used to select a lexical form
+#    inside the rule;
+# 
+# * the value of 'part' is the name of an attribute defined in
+#   def-attrs, but may take also the values 'lem' (referring to
+#   the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+#   (lemma queue) and 'whole' (referring to the whole lexical form).
+#
+lit = element lit { attlist.lit, empty }
+attlist.lit &= attribute v { text }
+# A literal string value: the value of the literal is the value of
+# the 'v' attribute
+lit-tag = element lit-tag { attlist.lit-tag, empty }
+attlist.lit-tag &= attribute v { text }
+# A literal string value: the value of the literal is the value of
+# the 'v' attribute
+var = element var { attlist.var, empty }
+attlist.var &= attribute n { xsd:IDREF }
+# Each 'var' is a variable identifier: the attribute n is the name
+# of the variable. When it is in an 'out', a 'test', or the right
+# part of a 'let', it represents the value of the variable; when in
+# the left part of a 'let' it represents the reference of the
+# variable. 
+get-case-from =
+  element get-case-from { attlist.get-case-from, (clip | lit | var) }
+attlist.get-case-from &= attribute pos { text }
+# Atención, falta modificar todos los comentarios donde intervenga
+# get-case-from
+case-of = element case-of { attlist.case-of, empty }
+attlist.case-of &=
+  attribute pos { text },
+  attribute part { text }
+# A 'case-of' is a value representing the case of a "clip".  This value 
+# will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+# (all uppercase).
+# 
+# * 'pos' is an index (1, 2, 3...) used to select a lexical form
+#    inside the rule;
+# 
+# * the value of 'part' is the name of an attribute defined in
+#   def-attrs, but may take also the values 'lem' (referring to
+#   the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+#   (lemma queue) and 'whole' (referring to the whole lexical form).
+concat = element concat { attlist.concat, value+ }
+attlist.concat &= empty
+# Concatenates a sequence of values
+chunk = element chunk { attlist.chunk, value+ }
+attlist.chunk &= empty
+# Encloses a chunk      
+pseudolemma = element pseudolemma { attlist.pseudolemma, value }
+attlist.pseudolemma &= empty
+b = element b { attlist.b, empty }
+attlist.b &= attribute pos { text }?
+start = interchunk | pseudolemma
+# 'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+# with pos="2" refers to the [super]blanks (including format data
+# encapsulated by the de-formatter) between lexical form 2 and
+# lexical form 3. Managing [super]blanks explicitly allows for the
+# correct placement of format when the result of structural
+# transfer has more or less lexical items than the original or has
+# been reordered in some way.  If attribute "pos" is not specified, then
+# a single blank (ASCII 32) is generated.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.rnc	(revision 70339)
@@ -0,0 +1,348 @@
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+# 
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+# 
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+# 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+# 
+#  Draft of DTD for the structural transfer rule files 
+# 
+#  Sergio Ortiz, Gema Ramírez-Sánchez, Mireia Ginestí, Mikel L. Forcada, 
+#  2005.07.29. 
+
+condition =
+  and
+  | or
+  | not
+  | equal
+  | begins-with
+  | begins-with-list
+  | ends-with
+  | ends-with-list
+  | contains-substring
+  | in
+container = var | clip
+sentence = let | out | choose | modify-case | call-macro | append
+value =
+  b
+  | clip
+  | lit
+  | lit-tag
+  | var
+  | get-case-from
+  | case-of
+  | concat
+  | lu-count
+  | lu
+  | mlu
+stringvalue = clip | lit | var | get-case-from | case-of | lu-count
+postchunk =
+  element postchunk {
+    attlist.postchunk,
+    section-def-cats,
+    section-def-attrs,
+    section-def-vars,
+    section-def-lists?,
+    section-def-macros?,
+    section-rules
+  }
+attlist.postchunk &= empty
+# 'postchunk' is the root element containing the whole structural
+# postchunk rule file.  
+section-def-cats =
+  element section-def-cats { attlist.section-def-cats, def-cat+ }
+attlist.section-def-cats &= empty
+#      The 'def-cats' section defines the categories used to build the
+# patterns used in rules
+def-cat = element def-cat { attlist.def-cat, cat-item+ }
+attlist.def-cat &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# Each 'def-cat' defines one category in terms of a list of
+# category items and has a unique name 'n', which is mandatory
+cat-item = element cat-item { attlist.cat-item, empty }
+attlist.cat-item &= attribute name { text }
+# In addition, a required attribute, "name", is used to specify 
+# wich chunk name is detected by this cat-item
+section-def-attrs =
+  element section-def-attrs { attlist.section-def-attrs, def-attr+ }
+attlist.section-def-attrs &= empty
+# The 'def-attrs' section defines the attributes that will be
+# identified in matched lexical forms 
+def-attr = element def-attr { attlist.def-attr, attr-item+ }
+attlist.def-attr &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# Each def-attr defines one attribute in terms of a list of
+# attribute items and has a mandatory unique name n 
+attr-item = element attr-item { attlist.attr-item, empty }
+attlist.attr-item &=
+  attribute tags { text }?,
+  attribute c { text }?
+# Each 'attr-item' specifies a subsequence of the tags in
+# that lexical form (attribute 'tags')
+section-def-vars =
+  element section-def-vars { attlist.section-def-vars, def-var+ }
+attlist.section-def-vars &= empty
+# The 'def-vars' section defines the global variables
+# that will be used to transfer information between rules
+def-var = element def-var { attlist.def-var, empty }
+attlist.def-var &=
+  attribute n { xsd:ID },
+  attribute v { text }?,
+  attribute c { text }?
+# The definition of a global variable has a mandatory unique name 'n' that
+# will be used to refer to it. A value of initialization can also be specified
+# by means the 'v' attribute.  The default value of the initialization is the
+# empty string.
+section-def-lists =
+  element section-def-lists { attlist.section-def-lists, def-list+ }
+attlist.section-def-lists &= empty
+# Element 'section-def-lists' encloses a set of list definitions
+def-list = element def-list { attlist.def-list, list-item+ }
+attlist.def-list &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# The 'def-list' element defines a named list to search with the 'in' 
+# element.  Attribute 'n' sets the name of the list
+list-item = element list-item { attlist.list-item, empty }
+attlist.list-item &=
+  attribute v { text },
+  attribute c { text }?
+# Attribute 'v' of 'list-item' element contains the value to be added to 
+# the list being defined     
+section-def-macros =
+  element section-def-macros { attlist.section-def-macros, def-macro+ }
+attlist.section-def-macros &= empty
+# 
+# The 'def-macros' section defines macros containing portions of
+# code frequently used in the action part of rules
+#
+def-macro = element def-macro { attlist.def-macro, sentence+ }
+attlist.def-macro &= attribute n { xsd:ID }
+attlist.def-macro &=
+  attribute npar { text },
+  attribute c { text }?
+# Macro definition:
+# 
+# A macro has a mandatory name (the value of 'n'), a number of parameters
+# (the value of 'npar') and a body containing arguments and statements.  
+section-rules = element section-rules { attlist.section-rules, rule+ }
+attlist.section-rules &= empty
+# The rules section contains a sequence of one or more rules
+rule = element rule { attlist.rule, pattern, action }
+attlist.rule &= attribute comment { text }?
+# Each rule has a pattern and an action 
+# * Attribute 'comment' allows to include a comment with the rule
+pattern = element pattern { attlist.pattern, pattern-item }
+attlist.pattern &= empty
+# The pattern is specified in terms of pattern items, each one
+# representing a lexical form in the matched pattern 
+pattern-item = element pattern-item { attlist.pattern-item, empty }
+attlist.pattern-item &= attribute n { xsd:IDREF }
+# Each attribute to be activated is referred to by its name in the def-cats section 
+action = element action { attlist.action, sentence* }
+attlist.action &= attribute c { text }?
+# Encloses the procedural part of a rule
+choose = element choose { attlist.choose, when+, otherwise? }
+attlist.choose &= attribute c { text }?
+# The choose statement is a selection statement (similar to a case
+# statement) composed of one or more tested cases and an optional
+# otherwise 
+when = element when { attlist.when, test, sentence* }
+attlist.when &= attribute c { text }?
+# Each tested case is a block of zero or more statements 
+otherwise = element otherwise { attlist.otherwise, sentence+ }
+attlist.otherwise &= attribute c { text }?
+# The otherwise case is also a block of one or more statements 
+test = element test { attlist.test, condition }
+attlist.test &= attribute c { text }?
+# The test in a tested case may be a conjunction, a disjunction, or
+# a negation of simpler tests, as well as a simple equality test
+and = element and { attlist.and, condition, condition+ }
+attlist.and &= empty
+# Each conjuntion test contains two or more simpler tests 
+or = element or { attlist.or, condition, condition+ }
+attlist.or &= empty
+# Each disjunction test contains two or more simpler tests 
+not = element not { attlist.not, condition }
+attlist.not &= empty
+# The negation of a simpler test is a test itself 
+equal = element equal { attlist.equal, value, value }
+attlist.equal &= attribute caseless { "no" | "yes" }?
+# The simplest test is an equality test. The right part and the
+# left part of the equality may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+begins-with = element begins-with { attlist.begins-with, value, value }
+attlist.begins-with &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the beginning.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+ends-with = element ends-with { attlist.ends-with, value, value }
+attlist.ends-with &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the end.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+begins-with-list =
+  element begins-with-list { attlist.begins-with-list, value, \list }
+attlist.begins-with-list &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the beginning.
+# First parts of the test may be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section. The second part
+# must be always a list.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+ends-with-list =
+  element ends-with-list { attlist.ends-with-list, value, \list }
+attlist.ends-with-list &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the end.
+# First parts of the test may be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section. The second part
+# must be always a list.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+contains-substring =
+  element contains-substring {
+    attlist.contains-substring, value, value
+  }
+attlist.contains-substring &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+in = element in { attlist.in, value, \list }
+attlist.in &= attribute caseless { "no" | "yes" }?
+# 'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+# this search is performed without attending to the case
+\list = element list { attlist.list, empty }
+attlist.list &= attribute n { xsd:IDREF }
+# 'list' refers, with the name in attribute 'n', a list defined before in
+# the 'section-def-list' section
+let = element let { attlist.let, container, value }
+attlist.let &= empty
+# An assignment statement ('let') assigns the value of a clip (see
+# below), a literal string ('lit'), a literal tag('lit-tag') or the 
+# value of a global variable ('var') to either a global variable ('var') 
+# or a clip
+append = element append { attlist.append, value+ }
+attlist.append &= attribute n { xsd:IDREF }
+# This instruction appends the value of a clip (see
+# below), a literal string ('lit'), a literal tag('lit-tag') or the 
+# value of a global variable ('var') to either a global variable ('var') 
+# or a clip, identified by the "n" attribute
+out = element out { attlist.out, (b | lu | mlu | var)+ }
+attlist.out &= attribute c { text }?
+# 'out' is an output statement; it may output blanks or chunks
+modify-case =
+  element modify-case { attlist.modify-case, container, stringvalue }
+attlist.modify-case &= empty
+# The first argument of 'modify-case' copy the case of the second 
+# argument.
+call-macro = element call-macro { attlist.call-macro, with-param* }
+attlist.call-macro &= attribute n { xsd:IDREF }
+# A macro may be called anywhere by name with one or more
+# arguments
+with-param = element with-param { attlist.with-param, empty }
+attlist.with-param &= attribute pos { text }
+# The attribute pos in each argument is used to refer to a lexical
+# form in the current rule. For example, if a 2-parameter macro
+# has been defined to perform noun-adjective agreement operations,
+# it may be used with arguments 1 and 2 in a noun-adjective rule,
+# with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+# arguments 1 and 3 in a noun-adverb-adjective rule, and with
+# arguments 2 and 1 in an adjective-noun rule 
+clip = element clip { attlist.clip, empty }
+attlist.clip &=
+  attribute pos { text },
+  attribute part { text },
+  attribute c { text }?
+# A 'clip' is a substring of a source-language or target-language
+# lexical form, extracted according to an attribute:
+# 
+# * 'pos' is an index (1, 2, 3...) used to select a lexical form
+#    inside the rule;
+# 
+# * the value of 'part' is the name of an attribute defined in
+#   def-attrs, but may take also the values 'lem' (referring to
+#   the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+#   (lemma queue) and 'whole' (referring to the whole lexical form).
+#
+lit = element lit { attlist.lit, empty }
+attlist.lit &= attribute v { text }
+# A literal string value: the value of the literal is the value of
+# the 'v' attribute
+lit-tag = element lit-tag { attlist.lit-tag, empty }
+attlist.lit-tag &= attribute v { text }
+# A literal string value: the value of the literal is the value of
+# the 'v' attribute
+var = element var { attlist.var, empty }
+attlist.var &= attribute n { xsd:IDREF }
+# Each 'var' is a variable identifier: the attribute n is the name
+# of the variable. When it is in an 'out', a 'test', or the right
+# part of a 'let', it represents the value of the variable; when in
+# the left part of a 'let' it represents the reference of the
+# variable. 
+get-case-from =
+  element get-case-from { attlist.get-case-from, (clip | lit | var) }
+attlist.get-case-from &= attribute pos { text }
+# Atención, falta modificar todos los comentarios donde intervenga
+# get-case-from
+case-of = element case-of { attlist.case-of, empty }
+attlist.case-of &=
+  attribute pos { text },
+  attribute part { text }
+# A 'case-of' is a value representing the case of a "clip".  This value 
+# will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+# (all uppercase).
+# 
+# * 'pos' is an index (1, 2, 3...) used to select a lexical form
+#    inside the rule;
+# 
+# * the value of 'part' is the name of an attribute defined in
+#   def-attrs, but may take also the values 'lem' (referring to
+#   the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+#   (lemma queue) and 'whole' (referring to the whole lexical form).
+concat = element concat { attlist.concat, value+ }
+attlist.concat &= empty
+# Concatenates a sequence of values
+mlu = element mlu { attlist.mlu, lu+ }
+attlist.mlu &= empty
+# Encloses a multiword
+lu = element lu { attlist.lu, value+ }
+attlist.lu &= empty
+# Encloses a word
+b = element b { attlist.b, empty }
+attlist.b &= attribute pos { text }?
+# 'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+# with pos="2" refers to the [super]blanks (including format data
+# encapsulated by the de-formatter) between lexical form 2 and
+# lexical form 3. Managing [super]blanks explicitly allows for the
+# correct placement of format when the result of structural
+# transfer has more or less lexical items than the original or has
+# been reordered in some way.  If attribute "pos" is not specified, then
+# a single blank (ASCII 32) is generated.
+lu-count = element lu-count { attlist.lu-count, empty }
+attlist.lu-count &= empty
+start = postchunk
+# Number of lexical units (words inside the chunk) in the rule
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.rnc	(revision 70339)
@@ -0,0 +1,122 @@
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+# 
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+# 
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+# 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+# 
+#   DTD for the tagset and the rules to enforce the state to state
+#   transition probabilities used by the part-of-speech tagger. 
+#   2005.07.29.
+
+tagger =
+  element tagger {
+    attlist.tagger,
+    tagset,
+    forbid?,
+    enforce-rules?,
+    preferences?,
+    discard-on-ambiguity?
+  }
+attlist.tagger &= attribute name { text }
+#     'tagger' is the root element containing the whole tagset for a given
+# language specified through the mandatory attribute 'name'
+tagset = element tagset { attlist.tagset, def-label+, def-mult* }
+attlist.tagset &= empty
+#     The 'tagset' section defines the correspondance between simple 
+# or multiple morphological categories defining a lexical form and the coarser 
+# ones with which the part-of-speech tagger works
+def-label = element def-label { attlist.def-label, tags-item+ }
+attlist.def-label &=
+  attribute name { text },
+  attribute c { text }?,
+  attribute closed { text }?
+#     Each 'def-label' defines one coarse tag in terms of a list of fine tags 
+# and has a mandatory unique name. The optional attribute 'closed="true"' may be used
+# to specify if the defined fine tags belong to a closed list.
+# c is for comments and is ignored
+tags-item = element tags-item { attlist.tags-item, empty }
+attlist.tags-item &=
+  attribute tags { text },
+  attribute lemma { text }?
+#     Each 'tags-item' may be a dot-separated subsequence of the morphological tags
+# corresponding to a coarse tag optionally in association with a given lemma 
+def-mult = element def-mult { attlist.def-mult, sequence+ }
+attlist.def-mult &=
+  attribute name { text },
+  attribute c { text }?,
+  attribute closed { text }?
+#     Each 'def-mult' defines one coarse tag in terms of a sequence of coarse
+# tags previously defined as 'def-labels' or a sequence of fine tags. A mandatory 
+# name is required for each 'def-mult' which may also has an optional attribute 
+# 'closed="true"' if it belongs to a closed list
+# c is for comments and is ignored
+sequence =
+  element sequence { attlist.sequence, (tags-item | label-item)+ }
+attlist.sequence &= empty
+#     Element 'sequence' encloses a set of tags or labels which defines 
+# a unit with more than one label
+label-item = element label-item { attlist.label-item, empty }
+attlist.label-item &=
+  attribute label { text },
+  attribute c { text }?
+#     Each 'label' of the 'label-item' correspond to a coarse tag previously 
+# defined as a 'def-label' by a name.
+# c is for comments and is ignored
+forbid = element forbid { attlist.forbid, label-sequence+ }
+attlist.forbid &= empty
+#     Element 'forbid' contains sequences of morphological categories that are not 
+# allowed in a given language
+label-sequence =
+  element label-sequence { attlist.label-sequence, label-item+ }
+attlist.label-sequence &= attribute c { text }?
+#     Each 'label-sequence' is restricted to two 'label-items' 
+# c is for comments and is ignored
+enforce-rules =
+  element enforce-rules { attlist.enforce-rules, enforce-after+ }
+attlist.enforce-rules &= empty
+# Element 'enforce-rules' defines sets of coarse tags that must follow specified ones
+enforce-after =
+  element enforce-after { attlist.enforce-after, label-set }
+attlist.enforce-after &=
+  attribute label { text },
+  attribute c { text }?
+#     Each 'enforce-after' encloses the set of coarse tags ('label-set') that must follow 
+# the one defined in 'label', as a mandatory attribute
+# c is for comments and is ignored
+label-set = element label-set { attlist.label-set, label-item+ }
+attlist.label-set &= attribute c { text }?
+#     The set of 'label-items' enforced after a 'label' are enclosed inside element 'label-set'  
+# c is for comments and is ignored
+preferences = element preferences { attlist.preferences, prefer+ }
+attlist.preferences &= empty
+#     Element 'preferences' allows to decide amongst two or more fine tag sequences 
+# which are grouped in the same coarse tag. 
+prefer = element prefer { attlist.prefer, empty }
+attlist.prefer &=
+  attribute tags { text },
+  attribute c { text }?
+#     Each 'prefer' element has a mandatory attribute 'tags' made of a sequence of fine tags 
+# c is for comments and is ignored
+discard-on-ambiguity =
+  element discard-on-ambiguity {
+    attlist.discard-on-ambiguity, discard+
+  }
+attlist.discard-on-ambiguity &= empty
+# List of label-item or tags-item to be discarded when an ambiguity
+# occurs inside a word
+discard = element discard { attlist.discard, empty }
+attlist.discard &=
+  attribute tags { text },
+  attribute c { text }?
+start = tagger
+#     Each 'discard' element has a mandatory attribute 'tags' made of a sequence of fine tags 
+# c is for comments and is ignored
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.rnc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.rnc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.rnc	(revision 70339)
@@ -0,0 +1,407 @@
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+# 
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+# 
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+# 
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+# 
+#  Draft of DTD for the structural transfer rule files 
+# 
+#  Sergio Ortiz, Gema Ramírez-Sánchez, Mireia Ginestí, Mikel L. Forcada, 
+#  2005.07.29. 
+
+condition =
+  and
+  | or
+  | not
+  | equal
+  | begins-with
+  | begins-with-list
+  | ends-with
+  | ends-with-list
+  | contains-substring
+  | in
+container = var | clip
+sentence =
+  let
+  | out
+  | choose
+  | modify-case
+  | call-macro
+  | append
+  | reject-current-rule
+value =
+  b
+  | clip
+  | lit
+  | lit-tag
+  | var
+  | get-case-from
+  | case-of
+  | concat
+  | lu
+  | mlu
+  | chunk
+stringvalue = clip | lit | var | get-case-from | case-of
+transfer =
+  element transfer {
+    attlist.transfer,
+    section-def-cats,
+    section-def-attrs?,
+    section-def-vars?,
+    section-def-lists?,
+    section-def-macros?,
+    section-rules
+  }
+attlist.transfer &= attribute default { "lu" | "chunk" }?
+# 'transfer' is the root element containing the whole structural
+# transfer rule file.  Attribute 'default' specifies if
+# unmatched words have to be written as lexical units ("lu", this is
+# the default value) or as chunks ("chunk").
+section-def-cats =
+  element section-def-cats { attlist.section-def-cats, def-cat+ }
+attlist.section-def-cats &= empty
+#      The 'def-cats' section defines the categories used to build the
+# patterns used in rules
+def-cat = element def-cat { attlist.def-cat, cat-item+ }
+attlist.def-cat &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# Each 'def-cat' defines one category in terms of a list of
+# category items and has a unique name 'n', which is mandatory
+cat-item = element cat-item { attlist.cat-item, empty }
+attlist.cat-item &=
+  attribute lemma { text }?,
+  attribute tags { text },
+  attribute c { text }?
+#      Each 'cat-item' (category item) represents a set of lexical forms
+# and has a mandatory attribute 'tags' whose value is a sequence of
+# dot-separated tag names; this sequence is a subsequence of the
+# tag sequence defining each possible lexical form. For example,
+# tags="n.f" would match all lexical forms containing this tag
+# sequence, such as "^casa<n><f><pl>$".
+# 
+# In addition, an optional attribute, "lemma", may be used to
+# define lexical forms having a particular substring in their lemma
+section-def-attrs =
+  element section-def-attrs { attlist.section-def-attrs, def-attr+ }
+attlist.section-def-attrs &= empty
+# The 'def-attrs' section defines the attributes that will be
+# identified in matched lexical forms 
+def-attr = element def-attr { attlist.def-attr, attr-item+ }
+attlist.def-attr &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# Each def-attr defines one attribute in terms of a list of
+# attribute items and has a mandatory unique name n 
+attr-item = element attr-item { attlist.attr-item, empty }
+attlist.attr-item &=
+  attribute tags { text }?,
+  attribute c { text }?
+# Each 'attr-item' specifies a subsequence of the tags in
+# that lexical form (attribute 'tags')
+section-def-vars =
+  element section-def-vars { attlist.section-def-vars, def-var+ }
+attlist.section-def-vars &= empty
+# The 'def-vars' section defines the global variables
+# that will be used to transfer information between rules
+def-var = element def-var { attlist.def-var, empty }
+attlist.def-var &=
+  attribute n { xsd:ID },
+  attribute v { text }?,
+  attribute c { text }?
+# The definition of a global variable has a mandatory unique name 'n' that
+# will be used to refer to it. A value of initialization can also be specified
+# by means the 'v' attribute.  The default value of the initialization is the
+# empty string.
+section-def-lists =
+  element section-def-lists { attlist.section-def-lists, def-list+ }
+attlist.section-def-lists &= empty
+# Element 'section-def-lists' encloses a set of list definitions
+def-list = element def-list { attlist.def-list, list-item+ }
+attlist.def-list &=
+  attribute n { xsd:ID },
+  attribute c { text }?
+# The 'def-list' element defines a named list to search with the 'in' 
+# element.  Attribute 'n' sets the name of the list
+list-item = element list-item { attlist.list-item, empty }
+attlist.list-item &=
+  attribute v { text },
+  attribute c { text }?
+# Attribute 'v' of 'list-item' element contains the value to be added to 
+# the list being defined     
+section-def-macros =
+  element section-def-macros { attlist.section-def-macros, def-macro+ }
+attlist.section-def-macros &= empty
+# 
+# The 'def-macros' section defines macros containing portions of
+# code frequently used in the action part of rules
+#
+def-macro = element def-macro { attlist.def-macro, sentence+ }
+attlist.def-macro &= attribute n { xsd:ID }
+attlist.def-macro &=
+  attribute npar { text },
+  attribute c { text }?
+# Macro definition:
+# 
+# A macro has a mandatory name (the value of 'n'), a number of parameters
+# (the value of 'npar') and a body containing arguments and statements.  
+section-rules = element section-rules { attlist.section-rules, rule+ }
+attlist.section-rules &= empty
+# The rules section contains a sequence of one or more rules
+rule = element rule { attlist.rule, pattern, action }
+attlist.rule &= attribute comment { text }?
+# Each rule has a pattern and an action 
+# * attribute 'comment' allows to put in comments about the purpose of
+#   the rule being defined
+pattern = element pattern { attlist.pattern, pattern-item+ }
+attlist.pattern &= empty
+# The pattern is specified in terms of pattern items, each one
+# representing a lexical form in the matched pattern 
+pattern-item = element pattern-item { attlist.pattern-item, empty }
+attlist.pattern-item &= attribute n { xsd:IDREF }
+# Each attribute to be activated is referred to by its name in the def-cats section 
+action = element action { attlist.action, sentence* }
+attlist.action &= attribute c { text }?
+# Encloses the procedural part of a rule
+choose = element choose { attlist.choose, when+, otherwise? }
+attlist.choose &= attribute c { text }?
+# The choose statement is a selection statement (similar to a case
+# statement) composed of one or more tested cases and an optional
+# otherwise 
+when = element when { attlist.when, test, sentence* }
+attlist.when &= attribute c { text }?
+# Each tested case is a block of zero or more statements 
+otherwise = element otherwise { attlist.otherwise, sentence+ }
+attlist.otherwise &= attribute c { text }?
+# The otherwise case is also a block of one or more statements 
+test = element test { attlist.test, condition }
+attlist.test &= attribute c { text }?
+# The test in a tested case may be a conjunction, a disjunction, or
+# a negation of simpler tests, as well as a simple equality test
+and = element and { attlist.and, condition, condition+ }
+attlist.and &= empty
+# Each conjuntion test contains two or more simpler tests 
+or = element or { attlist.or, condition, condition+ }
+attlist.or &= empty
+# Each disjunction test contains two or more simpler tests 
+not = element not { attlist.not, condition }
+attlist.not &= empty
+# The negation of a simpler test is a test itself 
+equal = element equal { attlist.equal, value, value }
+attlist.equal &= attribute caseless { "no" | "yes" }?
+# The simplest test is an equality test. The right part and the
+# left part of the equality may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+begins-with = element begins-with { attlist.begins-with, value, value }
+attlist.begins-with &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the beginning.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+ends-with = element ends-with { attlist.ends-with, value, value }
+attlist.ends-with &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the end.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+begins-with-list =
+  element begins-with-list { attlist.begins-with-list, value, \list }
+attlist.begins-with-list &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the beginning.
+# First parts of the test may be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section. The second part
+# must be always a list.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+ends-with-list =
+  element ends-with-list { attlist.ends-with-list, value, \list }
+attlist.ends-with-list &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part at the end.
+# First parts of the test may be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section. The second part
+# must be always a list.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+contains-substring =
+  element contains-substring {
+    attlist.contains-substring, value, value
+  }
+attlist.contains-substring &= attribute caseless { "no" | "yes" }?
+# Tests if the left part contains the right part.
+# Both parts of the test may both be a clip (see below), a
+# literal string ('lit'), a literal tag ('lit-tag') or the value of 
+# a variable ('var') defined in the def-vars section.  When the attribute
+# 'caseless' is set to 'yes', the comparison is made without attending
+# to the case.
+in = element in { attlist.in, value, \list }
+attlist.in &= attribute caseless { "no" | "yes" }?
+# 'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+# this search is performed without attending to the case
+\list = element list { attlist.list, empty }
+attlist.list &= attribute n { xsd:IDREF }
+# 'list' refers, with the name in attribute 'n', a list defined before in
+# the 'section-def-list' section
+let = element let { attlist.let, container, value }
+attlist.let &= empty
+# An assignment statement ('let') assigns the value of a clip (see
+# below), a literal string ('lit'), a literal tag('lit-tag') or the 
+# value of a global variable ('var') to either a global variable ('var') 
+# or a clip
+append = element append { attlist.append, value+ }
+attlist.append &= attribute n { xsd:IDREF }
+# This instruction appends the value of a clip (see
+# below), a literal string ('lit'), a literal tag('lit-tag') or the 
+# value of a global variable ('var') to either a global variable ('var') 
+# or a clip, identified by the "n" attribute
+out = element out { attlist.out, (mlu | lu | b | chunk | var)+ }
+attlist.out &= attribute c { text }?
+# 'out' is an output statement; it may output any sequence of
+# clips, literal strings, literal tags, variables, and whitespace items 
+# (see below) 
+modify-case =
+  element modify-case { attlist.modify-case, container, stringvalue }
+attlist.modify-case &= empty
+# The first argument of 'modify-case' copy the case of the second 
+# argument.
+call-macro = element call-macro { attlist.call-macro, with-param* }
+attlist.call-macro &= attribute n { xsd:IDREF }
+# A macro may be called anywhere by name with one or more
+# arguments
+with-param = element with-param { attlist.with-param, empty }
+attlist.with-param &= attribute pos { text }
+# The attribute pos in each argument is used to refer to a lexical
+# form in the current rule. For example, if a 2-parameter macro
+# has been defined to perform noun-adjective agreement operations,
+# it may be used with arguments 1 and 2 in a noun-adjective rule,
+# with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+# arguments 1 and 3 in a noun-adverb-adjective rule, and with
+# arguments 2 and 1 in an adjective-noun rule 
+clip = element clip { attlist.clip, empty }
+attlist.clip &=
+  attribute pos { text },
+  attribute side { "sl" | "tl" },
+  attribute part { text },
+  attribute queue { text }?,
+  attribute link-to { text }?,
+  attribute c { text }?
+# A 'clip' is a substring of a source-language or target-language
+# lexical form, extracted according to an attribute:
+# 
+# * 'pos' is an index (1, 2, 3...) used to select a lexical form
+#    inside the rule;
+# 
+# * 'side' is used to select a source-language ('sl') or a
+#   target-language ('tl') clip
+# 
+# * the value of 'part' is the name of an attribute defined in
+#   def-attrs, but may take also the values 'lem' (referring to
+#   the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+#   (lemma queue) and 'whole' (referring to the whole lexical form).
+# 
+# * the value of 'queue' may be 'no' or 'yes'.  'yes' is assumed  by 
+#   default.
+# 
+# * 'link-to' causes the other attributes to be ignored in clip evaluation
+#   when using 'clip' as a right hand side element (as value), and 
+#   returns its value.  When using as a left hand side (as reference), 
+#   the value of the 'as' attribute is ignored.
+lit = element lit { attlist.lit, empty }
+attlist.lit &= attribute v { text }
+# A literal string value: the value of the literal is the value of
+# the 'v' attribute
+lit-tag = element lit-tag { attlist.lit-tag, empty }
+attlist.lit-tag &= attribute v { text }
+# A literal string value: the value of the literal is the value of
+# the 'v' attribute
+var = element var { attlist.var, empty }
+attlist.var &= attribute n { xsd:IDREF }
+# Each 'var' is a variable identifier: the attribute n is the name
+# of the variable. When it is in an 'out', a 'test', or the right
+# part of a 'let', it represents the value of the variable; when in
+# the left part of a 'let' it represents the reference of the
+# variable. 
+get-case-from =
+  element get-case-from { attlist.get-case-from, (clip | lit | var) }
+attlist.get-case-from &= attribute pos { text }
+# Atención, falta modificar todos los comentarios donde intervenga
+# get-case-from
+case-of = element case-of { attlist.case-of, empty }
+attlist.case-of &=
+  attribute pos { text },
+  attribute side { "sl" | "tl" },
+  attribute part { text }
+# A 'case-of' is a value representing the case of a "clip".  This value 
+# will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+# (all uppercase).
+# 
+# * 'pos' is an index (1, 2, 3...) used to select a lexical form
+#    inside the rule;
+# 
+# * 'side' is used to select a source-language ('sl') or a
+#   target-language ('tl') clip
+# 
+# * the value of 'part' is the name of an attribute defined in
+#   def-attrs, but may take also the values 'lem' (referring to
+#   the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+#   (lemma queue) and 'whole' (referring to the whole lexical form).
+concat = element concat { attlist.concat, value+ }
+attlist.concat &= empty
+# Concatenates a sequence of values
+mlu = element mlu { attlist.mlu, lu+ }
+attlist.mlu &= empty
+# Encloses a multiword
+lu = element lu { attlist.lu, value+ }
+attlist.lu &= empty
+# Encloses a word inside an 'out' element.
+reject-current-rule =
+  element reject-current-rule { attlist.reject-current-rule, empty }
+attlist.reject-current-rule &= attribute shifting { "yes" | "no" }?
+# This instruction cancels the execution of the rule being processed.
+# If "shifting" is set to "yes" or is not specified, the matching process
+# consumes exactly one word at the input. If "shifting" is set to "no"
+# then marks the rule to not to be considered in the current matching 
+# until the input buffer advances at least one single word 
+chunk = element chunk { attlist.chunk, tags, (mlu | lu | b | var)+ }
+attlist.chunk &=
+  attribute name { text }?,
+  attribute namefrom { text }?,
+  attribute case { text }?,
+  attribute c { text }?
+# Encloses a chunk inside an 'out' element.      
+# * 'name' the pseudolemma of the chunk.
+# * 'namefrom' get the name from a variable.
+# * 'case' the variable to get the uppercase/lowercase policy
+#    to apply it to the chunk name
+tags = element tags { attlist.tags, tag+ }
+attlist.tags &= empty
+tag = element tag { attlist.tag, value }
+attlist.tag &= empty
+b = element b { attlist.b, empty }
+attlist.b &= attribute pos { text }?
+start = transfer
+# 'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+# with pos="2" refers to the [super]blanks (including format data
+# encapsulated by the de-formatter) between lexical form 2 and
+# lexical form 3. Managing [super]blanks explicitly allows for the
+# correct placement of format when the result of structural
+# transfer has more or less lexical items than the original or has
+# been reordered in some way.  If attribute "pos" is not specified, then
+# a single blank (ASCII 32) is generated.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.rng
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.rng	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer.rng	(revision 70339)
@@ -0,0 +1,1104 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!--
+  Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+  This program is free software; you can redistribute it and/or
+  modify it under the terms of the GNU General Public License as
+  published by the Free Software Foundation; either version 2 of the
+  License, or (at your option) any later version.
+  
+  This program is distributed in the hope that it will be useful, but
+  WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+  General Public License for more details.
+  
+  You should have received a copy of the GNU General Public License
+  along with this program; if not, see <http://www.gnu.org/licenses/>.
+  
+   Draft of DTD for the structural transfer rule files 
+  
+   Sergio Ortiz, Gema Ram�rez-S�nchez, Mireia Ginest�, Mikel L. Forcada, 
+   2005.07.29. 
+-->
+<grammar xmlns="http://relaxng.org/ns/structure/1.0" datatypeLibrary="http://www.w3.org/2001/XMLSchema-datatypes">
+  <define name="condition">
+    <choice>
+      <ref name="and"/>
+      <ref name="or"/>
+      <ref name="not"/>
+      <ref name="equal"/>
+      <ref name="begins-with"/>
+      <ref name="begins-with-list"/>
+      <ref name="ends-with"/>
+      <ref name="ends-with-list"/>
+      <ref name="contains-substring"/>
+      <ref name="in"/>
+    </choice>
+  </define>
+  <define name="container">
+    <choice>
+      <ref name="var"/>
+      <ref name="clip"/>
+    </choice>
+  </define>
+  <define name="sentence">
+    <choice>
+      <ref name="let"/>
+      <ref name="out"/>
+      <ref name="choose"/>
+      <ref name="modify-case"/>
+      <ref name="call-macro"/>
+      <ref name="append"/>
+      <ref name="reject-current-rule"/>
+    </choice>
+  </define>
+  <define name="value">
+    <choice>
+      <ref name="b"/>
+      <ref name="clip"/>
+      <ref name="lit"/>
+      <ref name="lit-tag"/>
+      <ref name="var"/>
+      <ref name="get-case-from"/>
+      <ref name="case-of"/>
+      <ref name="concat"/>
+      <ref name="lu"/>
+      <ref name="mlu"/>
+      <ref name="chunk"/>
+    </choice>
+  </define>
+  <define name="stringvalue">
+    <choice>
+      <ref name="clip"/>
+      <ref name="lit"/>
+      <ref name="var"/>
+      <ref name="get-case-from"/>
+      <ref name="case-of"/>
+    </choice>
+  </define>
+  <define name="transfer">
+    <element name="transfer">
+      <ref name="attlist.transfer"/>
+      <ref name="section-def-cats"/>
+      <optional>
+        <ref name="section-def-attrs"/>
+      </optional>
+      <optional>
+        <ref name="section-def-vars"/>
+      </optional>
+      <optional>
+        <ref name="section-def-lists"/>
+      </optional>
+      <optional>
+        <ref name="section-def-macros"/>
+      </optional>
+      <ref name="section-rules"/>
+    </element>
+  </define>
+  <define name="attlist.transfer" combine="interleave">
+    <optional>
+      <attribute name="default">
+        <choice>
+          <value>lu</value>
+          <value>chunk</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    'transfer' is the root element containing the whole structural
+    transfer rule file.  Attribute 'default' specifies if
+    unmatched words have to be written as lexical units ("lu", this is
+    the default value) or as chunks ("chunk").
+  -->
+  <define name="section-def-cats">
+    <element name="section-def-cats">
+      <ref name="attlist.section-def-cats"/>
+      <oneOrMore>
+        <ref name="def-cat"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-cats" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+         The 'def-cats' section defines the categories used to build the
+    patterns used in rules
+  -->
+  <define name="def-cat">
+    <element name="def-cat">
+      <ref name="attlist.def-cat"/>
+      <oneOrMore>
+        <ref name="cat-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-cat" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each 'def-cat' defines one category in terms of a list of
+    category items and has a unique name 'n', which is mandatory
+  -->
+  <define name="cat-item">
+    <element name="cat-item">
+      <ref name="attlist.cat-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.cat-item" combine="interleave">
+    <optional>
+      <attribute name="lemma"/>
+    </optional>
+    <attribute name="tags"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+         Each 'cat-item' (category item) represents a set of lexical forms
+    and has a mandatory attribute 'tags' whose value is a sequence of
+    dot-separated tag names; this sequence is a subsequence of the
+    tag sequence defining each possible lexical form. For example,
+    tags="n.f" would match all lexical forms containing this tag
+    sequence, such as "^casa<n><f><pl>$".
+    
+    In addition, an optional attribute, "lemma", may be used to
+    define lexical forms having a particular substring in their lemma
+  -->
+  <define name="section-def-attrs">
+    <element name="section-def-attrs">
+      <ref name="attlist.section-def-attrs"/>
+      <oneOrMore>
+        <ref name="def-attr"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-attrs" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The 'def-attrs' section defines the attributes that will be
+    identified in matched lexical forms 
+  -->
+  <define name="def-attr">
+    <element name="def-attr">
+      <ref name="attlist.def-attr"/>
+      <oneOrMore>
+        <ref name="attr-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-attr" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each def-attr defines one attribute in terms of a list of
+    attribute items and has a mandatory unique name n 
+  -->
+  <define name="attr-item">
+    <element name="attr-item">
+      <ref name="attlist.attr-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.attr-item" combine="interleave">
+    <optional>
+      <attribute name="tags"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Each 'attr-item' specifies a subsequence of the tags in
+    that lexical form (attribute 'tags')
+  -->
+  <define name="section-def-vars">
+    <element name="section-def-vars">
+      <ref name="attlist.section-def-vars"/>
+      <oneOrMore>
+        <ref name="def-var"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-vars" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The 'def-vars' section defines the global variables
+    that will be used to transfer information between rules
+  -->
+  <define name="def-var">
+    <element name="def-var">
+      <ref name="attlist.def-var"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.def-var" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="v"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The definition of a global variable has a mandatory unique name 'n' that
+    will be used to refer to it. A value of initialization can also be specified
+    by means the 'v' attribute.  The default value of the initialization is the
+    empty string.
+  -->
+  <define name="section-def-lists">
+    <element name="section-def-lists">
+      <ref name="attlist.section-def-lists"/>
+      <oneOrMore>
+        <ref name="def-list"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-lists" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Element 'section-def-lists' encloses a set of list definitions -->
+  <define name="def-list">
+    <element name="def-list">
+      <ref name="attlist.def-list"/>
+      <oneOrMore>
+        <ref name="list-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-list" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The 'def-list' element defines a named list to search with the 'in' 
+    element.  Attribute 'n' sets the name of the list
+  -->
+  <define name="list-item">
+    <element name="list-item">
+      <ref name="attlist.list-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.list-item" combine="interleave">
+    <attribute name="v"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Attribute 'v' of 'list-item' element contains the value to be added to 
+    the list being defined     
+  -->
+  <define name="section-def-macros">
+    <element name="section-def-macros">
+      <ref name="attlist.section-def-macros"/>
+      <oneOrMore>
+        <ref name="def-macro"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-def-macros" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    
+    The 'def-macros' section defines macros containing portions of
+    code frequently used in the action part of rules
+    
+  -->
+  <define name="def-macro">
+    <element name="def-macro">
+      <ref name="attlist.def-macro"/>
+      <oneOrMore>
+        <ref name="sentence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.def-macro" combine="interleave">
+    <attribute name="n">
+      <data type="ID"/>
+    </attribute>
+  </define>
+  <define name="attlist.def-macro" combine="interleave">
+    <attribute name="npar"/>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Macro definition:
+    
+    A macro has a mandatory name (the value of 'n'), a number of parameters
+    (the value of 'npar') and a body containing arguments and statements.  
+  -->
+  <define name="section-rules">
+    <element name="section-rules">
+      <ref name="attlist.section-rules"/>
+      <oneOrMore>
+        <ref name="rule"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.section-rules" combine="interleave">
+    <empty/>
+  </define>
+  <!-- The rules section contains a sequence of one or more rules -->
+  <define name="rule">
+    <element name="rule">
+      <ref name="attlist.rule"/>
+      <ref name="pattern"/>
+      <ref name="action"/>
+    </element>
+  </define>
+  <define name="attlist.rule" combine="interleave">
+    <optional>
+      <attribute name="comment"/>
+    </optional>
+  </define>
+  <!--
+    Each rule has a pattern and an action 
+    * attribute 'comment' allows to put in comments about the purpose of
+      the rule being defined
+  -->
+  <define name="pattern">
+    <element name="pattern">
+      <ref name="attlist.pattern"/>
+      <oneOrMore>
+        <ref name="pattern-item"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.pattern" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The pattern is specified in terms of pattern items, each one
+    representing a lexical form in the matched pattern 
+  -->
+  <define name="pattern-item">
+    <element name="pattern-item">
+      <ref name="attlist.pattern-item"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.pattern-item" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!-- Each attribute to be activated is referred to by its name in the def-cats section -->
+  <define name="action">
+    <element name="action">
+      <ref name="attlist.action"/>
+      <zeroOrMore>
+        <ref name="sentence"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.action" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- Encloses the procedural part of a rule -->
+  <define name="choose">
+    <element name="choose">
+      <ref name="attlist.choose"/>
+      <oneOrMore>
+        <ref name="when"/>
+      </oneOrMore>
+      <optional>
+        <ref name="otherwise"/>
+      </optional>
+    </element>
+  </define>
+  <define name="attlist.choose" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The choose statement is a selection statement (similar to a case
+    statement) composed of one or more tested cases and an optional
+    otherwise 
+  -->
+  <define name="when">
+    <element name="when">
+      <ref name="attlist.when"/>
+      <ref name="test"/>
+      <zeroOrMore>
+        <ref name="sentence"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.when" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- Each tested case is a block of zero or more statements -->
+  <define name="otherwise">
+    <element name="otherwise">
+      <ref name="attlist.otherwise"/>
+      <oneOrMore>
+        <ref name="sentence"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.otherwise" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!-- The otherwise case is also a block of one or more statements -->
+  <define name="test">
+    <element name="test">
+      <ref name="attlist.test"/>
+      <ref name="condition"/>
+    </element>
+  </define>
+  <define name="attlist.test" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    The test in a tested case may be a conjunction, a disjunction, or
+    a negation of simpler tests, as well as a simple equality test
+  -->
+  <define name="and">
+    <element name="and">
+      <ref name="attlist.and"/>
+      <ref name="condition"/>
+      <oneOrMore>
+        <ref name="condition"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.and" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Each conjuntion test contains two or more simpler tests -->
+  <define name="or">
+    <element name="or">
+      <ref name="attlist.or"/>
+      <ref name="condition"/>
+      <oneOrMore>
+        <ref name="condition"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.or" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Each disjunction test contains two or more simpler tests -->
+  <define name="not">
+    <element name="not">
+      <ref name="attlist.not"/>
+      <ref name="condition"/>
+    </element>
+  </define>
+  <define name="attlist.not" combine="interleave">
+    <empty/>
+  </define>
+  <!-- The negation of a simpler test is a test itself -->
+  <define name="equal">
+    <element name="equal">
+      <ref name="attlist.equal"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.equal" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    The simplest test is an equality test. The right part and the
+    left part of the equality may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="begins-with">
+    <element name="begins-with">
+      <ref name="attlist.begins-with"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.begins-with" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the beginning.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="ends-with">
+    <element name="ends-with">
+      <ref name="attlist.ends-with"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.ends-with" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the end.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="begins-with-list">
+    <element name="begins-with-list">
+      <ref name="attlist.begins-with-list"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.begins-with-list" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the beginning.
+    First parts of the test may be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section. The second part
+    must be always a list.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="ends-with-list">
+    <element name="ends-with-list">
+      <ref name="attlist.ends-with-list"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.ends-with-list" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part at the end.
+    First parts of the test may be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section. The second part
+    must be always a list.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="contains-substring">
+    <element name="contains-substring">
+      <ref name="attlist.contains-substring"/>
+      <ref name="value"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.contains-substring" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    Tests if the left part contains the right part.
+    Both parts of the test may both be a clip (see below), a
+    literal string ('lit'), a literal tag ('lit-tag') or the value of 
+    a variable ('var') defined in the def-vars section.  When the attribute
+    'caseless' is set to 'yes', the comparison is made without attending
+    to the case.
+  -->
+  <define name="in">
+    <element name="in">
+      <ref name="attlist.in"/>
+      <ref name="value"/>
+      <ref name="list"/>
+    </element>
+  </define>
+  <define name="attlist.in" combine="interleave">
+    <optional>
+      <attribute name="caseless">
+        <choice>
+          <value>no</value>
+          <value>yes</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+    this search is performed without attending to the case
+  -->
+  <define name="list">
+    <element name="list">
+      <ref name="attlist.list"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.list" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    'list' refers, with the name in attribute 'n', a list defined before in
+    the 'section-def-list' section
+  -->
+  <define name="let">
+    <element name="let">
+      <ref name="attlist.let"/>
+      <ref name="container"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.let" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    An assignment statement ('let') assigns the value of a clip (see
+    below), a literal string ('lit'), a literal tag('lit-tag') or the 
+    value of a global variable ('var') to either a global variable ('var') 
+    or a clip
+  -->
+  <define name="append">
+    <element name="append">
+      <ref name="attlist.append"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.append" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    This instruction appends the value of a clip (see
+    below), a literal string ('lit'), a literal tag('lit-tag') or the 
+    value of a global variable ('var') to either a global variable ('var') 
+    or a clip, identified by the "n" attribute
+  -->
+  <define name="out">
+    <element name="out">
+      <ref name="attlist.out"/>
+      <oneOrMore>
+        <choice>
+          <ref name="mlu"/>
+          <ref name="lu"/>
+          <ref name="b"/>
+          <ref name="chunk"/>
+          <ref name="var"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.out" combine="interleave">
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    'out' is an output statement; it may output any sequence of
+    clips, literal strings, literal tags, variables, and whitespace items 
+    (see below) 
+  -->
+  <define name="modify-case">
+    <element name="modify-case">
+      <ref name="attlist.modify-case"/>
+      <ref name="container"/>
+      <ref name="stringvalue"/>
+    </element>
+  </define>
+  <define name="attlist.modify-case" combine="interleave">
+    <empty/>
+  </define>
+  <!--
+    The first argument of 'modify-case' copy the case of the second 
+    argument.
+  -->
+  <define name="call-macro">
+    <element name="call-macro">
+      <ref name="attlist.call-macro"/>
+      <zeroOrMore>
+        <ref name="with-param"/>
+      </zeroOrMore>
+    </element>
+  </define>
+  <define name="attlist.call-macro" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    A macro may be called anywhere by name with one or more
+    arguments
+  -->
+  <define name="with-param">
+    <element name="with-param">
+      <ref name="attlist.with-param"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.with-param" combine="interleave">
+    <attribute name="pos"/>
+  </define>
+  <!--
+    The attribute pos in each argument is used to refer to a lexical
+    form in the current rule. For example, if a 2-parameter macro
+    has been defined to perform noun-adjective agreement operations,
+    it may be used with arguments 1 and 2 in a noun-adjective rule,
+    with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+    arguments 1 and 3 in a noun-adverb-adjective rule, and with
+    arguments 2 and 1 in an adjective-noun rule 
+  -->
+  <define name="clip">
+    <element name="clip">
+      <ref name="attlist.clip"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.clip" combine="interleave">
+    <attribute name="pos"/>
+    <attribute name="side">
+      <choice>
+        <value>sl</value>
+        <value>tl</value>
+      </choice>
+    </attribute>
+    <attribute name="part"/>
+    <optional>
+      <attribute name="queue"/>
+    </optional>
+    <optional>
+      <attribute name="link-to"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    A 'clip' is a substring of a source-language or target-language
+    lexical form, extracted according to an attribute:
+    
+    * 'pos' is an index (1, 2, 3...) used to select a lexical form
+       inside the rule;
+    
+    * 'side' is used to select a source-language ('sl') or a
+      target-language ('tl') clip
+    
+    * the value of 'part' is the name of an attribute defined in
+      def-attrs, but may take also the values 'lem' (referring to
+      the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+      (lemma queue) and 'whole' (referring to the whole lexical form).
+    
+    * the value of 'queue' may be 'no' or 'yes'.  'yes' is assumed  by 
+      default.
+    
+    * 'link-to' causes the other attributes to be ignored in clip evaluation
+      when using 'clip' as a right hand side element (as value), and 
+      returns its value.  When using as a left hand side (as reference), 
+      the value of the 'as' attribute is ignored.
+  -->
+  <define name="lit">
+    <element name="lit">
+      <ref name="attlist.lit"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lit" combine="interleave">
+    <attribute name="v"/>
+  </define>
+  <!--
+    A literal string value: the value of the literal is the value of
+    the 'v' attribute
+  -->
+  <define name="lit-tag">
+    <element name="lit-tag">
+      <ref name="attlist.lit-tag"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.lit-tag" combine="interleave">
+    <attribute name="v"/>
+  </define>
+  <!--
+    A literal string value: the value of the literal is the value of
+    the 'v' attribute
+  -->
+  <define name="var">
+    <element name="var">
+      <ref name="attlist.var"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.var" combine="interleave">
+    <attribute name="n">
+      <data type="IDREF"/>
+    </attribute>
+  </define>
+  <!--
+    Each 'var' is a variable identifier: the attribute n is the name
+    of the variable. When it is in an 'out', a 'test', or the right
+    part of a 'let', it represents the value of the variable; when in
+    the left part of a 'let' it represents the reference of the
+    variable. 
+  -->
+  <define name="get-case-from">
+    <element name="get-case-from">
+      <ref name="attlist.get-case-from"/>
+      <choice>
+        <ref name="clip"/>
+        <ref name="lit"/>
+        <ref name="var"/>
+      </choice>
+    </element>
+  </define>
+  <define name="attlist.get-case-from" combine="interleave">
+    <attribute name="pos"/>
+  </define>
+  <!--
+    Atenci�n, falta modificar todos los comentarios donde intervenga
+    get-case-from
+  -->
+  <define name="case-of">
+    <element name="case-of">
+      <ref name="attlist.case-of"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.case-of" combine="interleave">
+    <attribute name="pos"/>
+    <attribute name="side">
+      <choice>
+        <value>sl</value>
+        <value>tl</value>
+      </choice>
+    </attribute>
+    <attribute name="part"/>
+  </define>
+  <!--
+    A 'case-of' is a value representing the case of a "clip".  This value 
+    will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+    (all uppercase).
+    
+    * 'pos' is an index (1, 2, 3...) used to select a lexical form
+       inside the rule;
+    
+    * 'side' is used to select a source-language ('sl') or a
+      target-language ('tl') clip
+    
+    * the value of 'part' is the name of an attribute defined in
+      def-attrs, but may take also the values 'lem' (referring to
+      the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+      (lemma queue) and 'whole' (referring to the whole lexical form).
+  -->
+  <define name="concat">
+    <element name="concat">
+      <ref name="attlist.concat"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.concat" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Concatenates a sequence of values -->
+  <define name="mlu">
+    <element name="mlu">
+      <ref name="attlist.mlu"/>
+      <oneOrMore>
+        <ref name="lu"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.mlu" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Encloses a multiword -->
+  <define name="lu">
+    <element name="lu">
+      <ref name="attlist.lu"/>
+      <oneOrMore>
+        <ref name="value"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.lu" combine="interleave">
+    <empty/>
+  </define>
+  <!-- Encloses a word inside an 'out' element. -->
+  <define name="reject-current-rule">
+    <element name="reject-current-rule">
+      <ref name="attlist.reject-current-rule"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.reject-current-rule" combine="interleave">
+    <optional>
+      <attribute name="shifting">
+        <choice>
+          <value>yes</value>
+          <value>no</value>
+        </choice>
+      </attribute>
+    </optional>
+  </define>
+  <!--
+    This instruction cancels the execution of the rule being processed.
+    If "shifting" is set to "yes" or is not specified, the matching process
+    consumes exactly one word at the input. If "shifting" is set to "no"
+    then marks the rule to not to be considered in the current matching 
+    until the input buffer advances at least one single word 
+  -->
+  <define name="chunk">
+    <element name="chunk">
+      <ref name="attlist.chunk"/>
+      <ref name="tags"/>
+      <oneOrMore>
+        <choice>
+          <ref name="mlu"/>
+          <ref name="lu"/>
+          <ref name="b"/>
+          <ref name="var"/>
+        </choice>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.chunk" combine="interleave">
+    <optional>
+      <attribute name="name"/>
+    </optional>
+    <optional>
+      <attribute name="namefrom"/>
+    </optional>
+    <optional>
+      <attribute name="case"/>
+    </optional>
+    <optional>
+      <attribute name="c"/>
+    </optional>
+  </define>
+  <!--
+    Encloses a chunk inside an 'out' element.      
+    * 'name' the pseudolemma of the chunk.
+    * 'namefrom' get the name from a variable.
+    * 'case' the variable to get the uppercase/lowercase policy
+       to apply it to the chunk name
+  -->
+  <define name="tags">
+    <element name="tags">
+      <ref name="attlist.tags"/>
+      <oneOrMore>
+        <ref name="tag"/>
+      </oneOrMore>
+    </element>
+  </define>
+  <define name="attlist.tags" combine="interleave">
+    <empty/>
+  </define>
+  <define name="tag">
+    <element name="tag">
+      <ref name="attlist.tag"/>
+      <ref name="value"/>
+    </element>
+  </define>
+  <define name="attlist.tag" combine="interleave">
+    <empty/>
+  </define>
+  <define name="b">
+    <element name="b">
+      <ref name="attlist.b"/>
+      <empty/>
+    </element>
+  </define>
+  <define name="attlist.b" combine="interleave">
+    <optional>
+      <attribute name="pos"/>
+    </optional>
+  </define>
+  <start>
+    <choice>
+      <ref name="transfer"/>
+    </choice>
+  </start>
+</grammar>
+<!--
+  'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+  with pos="2" refers to the [super]blanks (including format data
+  encapsulated by the de-formatter) between lexical form 2 and
+  lexical form 3. Managing [super]blanks explicitly allows for the
+  correct placement of format when the result of structural
+  transfer has more or less lexical items than the original or has
+  been reordered in some way.  If attribute "pos" is not specified, then
+  a single blank (ASCII 32) is generated.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-transfer.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-transfer.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-transfer.1	(revision 70339)
@@ -0,0 +1,80 @@
+.TH apertium-transfer 1 2006-03-08 "" ""
+.SH NAME
+apertium-transfer \- This application is part of (
+.B apertium
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-transfer
+[\-n] trules preproc biltrans [input [output]]
+.PP
+.B apertium-transfer
+trules preproc [input [output]]
+.PP
+.B apertium-transfer
+\-x extended trules preproc biltrans [input [output]]
+.PP
+.B apertium-transfer
+\-c trules preproc biltrans [input [output]]
+.PP
+.B apertium-transfer
+\-t trules preproc biltrans [input [output]]
+.SH DESCRIPTION
+.BR apertium-transfer 
+is the program that performs the transfer from input language
+into output language. Normally this program will not be used independently, but in combination with other programs:
+.PP
+.RE
+.SH FILES
+These are the five files that can be used with this command:
+.PP
+.B trules
+Transfer rules file
+.PP
+.B preproc    
+Result of preprocess trules file
+.PP
+.B biltrans   
+Bilingual letter transducer file
+.PP
+.B infile
+Input file (stdin by default).
+.PP
+.B outfile
+Output file (stdout by default).
+.PP
+\-.B \-b
+\-input from lexical transfer (single level transfer only)
+\-.PP
+\-.B \-h
+\-shows this message
+\-.PP
+.B -n
+Do not use a bilingual dictionary to process the input.
+.PP
+.B  -x bindix  
+extended mode with user dictionary
+.PP
+.B -c
+case-sensitiveness while accessing bilingual dictionary
+.PP
+.B -t
+trace mode: show rule numbers and matched content
+.PP
+.B -T
+extended trace mode, for use with apertium-transfer-tools
+.PP
+.B -z
+null-flushing output on
+.PP
+.SH SEE ALSO
+.I apertium \fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/a.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/a.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/a.cc	(revision 70339)
@@ -0,0 +1,50 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "a.h"
+
+#include "analysis.h"
+#include "exception.h"
+
+namespace Apertium {
+bool operator==(const a &a_, const a &b_) {
+  return a_.TheTags == b_.TheTags && a_.TheMorphemes == b_.TheMorphemes;
+}
+
+bool operator<(const a &a_, const a &b_) {
+  if (a_.TheTags == b_.TheTags)
+    return a_.TheMorphemes < b_.TheMorphemes;
+
+  return a_.TheTags < b_.TheTags;
+}
+
+a::a() : TheTags(), TheMorphemes() {}
+
+a::a(const Analysis &Analysis_) : TheTags(), TheMorphemes() {
+  if (Analysis_.TheMorphemes.empty())
+    throw Exception::Analysis::TheMorphemes_empty("can't convert const "
+                                                  "Analysis & comprising empty "
+                                                  "Morpheme std::vector to a");
+
+  if (Analysis_.TheMorphemes.front().TheTags.empty())
+    throw Exception::Morpheme::TheTags_empty("can't convert const Analysis & "
+                                             "comprising Morpheme comprising "
+                                             "empty Tag std::vector to a");
+
+  TheTags = Analysis_.TheMorphemes.front().TheTags;
+  TheMorphemes = std::vector<Morpheme>(Analysis_.TheMorphemes.begin() + 1,
+                                       Analysis_.TheMorphemes.end());
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/a.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/a.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/a.h	(revision 70339)
@@ -0,0 +1,37 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef A_H
+#define A_H
+
+#include "analysis.h"
+#include "morpheme.h"
+#include "tag.h"
+
+#include <vector>
+
+namespace Apertium {
+class a {
+public:
+  friend bool operator==(const a &a_, const a &b_);
+  friend bool operator<(const a &a_, const a &b_);
+  a();
+  a(const Analysis &Analysis_);
+  std::vector<Tag> TheTags;
+  std::vector<Morpheme> TheMorphemes;
+};
+}
+
+#endif // A_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/align.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/align.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/align.h	(revision 70339)
@@ -0,0 +1,35 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef ALIGN_H
+#define ALIGN_H
+
+#include <string>
+#include <utility>
+#include <vector>
+
+namespace Apertium {
+class align {
+public:
+  static void
+  align_(const std::vector<std::pair<std::string, std::string> > &string_);
+
+private:
+  static std::string::size_type
+  col(const std::vector<std::pair<std::string, std::string> > &string_);
+};
+}
+
+#endif // ALIGN_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/analysis.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/analysis.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/analysis.cc	(revision 70339)
@@ -0,0 +1,55 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "analysis.h"
+
+#include "exception.h"
+#include "morpheme.h"
+
+#include <string>
+#include <vector>
+
+namespace Apertium {
+std::wostream &operator<<(std::wostream &Stream_, const Analysis &Analysis_) {
+  Stream_ << static_cast<std::wstring>(Analysis_);
+  return Stream_;
+}
+
+bool operator==(const Analysis &a, const Analysis &b) {
+  return a.TheMorphemes == b.TheMorphemes;
+}
+
+bool operator<(const Analysis &a, const Analysis &b) {
+  return a.TheMorphemes < b.TheMorphemes;
+}
+
+Analysis::operator std::wstring() const {
+  if (TheMorphemes.empty())
+    throw Exception::Analysis::TheMorphemes_empty(
+        "can't convert Analysis comprising empty Morpheme std::vector to "
+        "std::wstring");
+
+  std::vector<Morpheme>::const_iterator Morpheme_ = TheMorphemes.begin();
+  std::wstring wstring_ = *Morpheme_;
+  ++Morpheme_;
+
+  // Call .end() each iteration to save memory.
+  for (; Morpheme_ != TheMorphemes.end(); ++Morpheme_) {
+    wstring_ += L"+" + static_cast<std::wstring>(*Morpheme_);
+  }
+
+  return wstring_;
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/analysis.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/analysis.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/analysis.h	(revision 70339)
@@ -0,0 +1,37 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef ANALYSIS_H
+#define ANALYSIS_H
+
+#include "morpheme.h"
+
+#include <ostream>
+#include <string>
+#include <vector>
+
+namespace Apertium {
+class Analysis {
+public:
+  friend std::wostream &operator<<(std::wostream &Stream_,
+                                   const Analysis &Analysis_);
+  friend bool operator==(const Analysis &a, const Analysis &b);
+  friend bool operator<(const Analysis &a, const Analysis &b);
+  operator std::wstring() const;
+  std::vector<Morpheme> TheMorphemes;
+};
+}
+
+#endif // ANALYSIS_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_1_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_1_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_1_tagger.cc	(revision 70339)
@@ -0,0 +1,20 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "basic_5_3_1_tagger.h"
+
+namespace Apertium {
+basic_5_3_1_Tagger::basic_5_3_1_Tagger() {}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_1_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_1_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_1_tagger.h	(revision 70339)
@@ -0,0 +1,32 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_5_3_1_TAGGER_H
+#define BASIC_5_3_1_TAGGER_H
+
+#include "analysis.h"
+
+#include <cstddef>
+#include <map>
+
+namespace Apertium {
+class basic_5_3_1_Tagger {
+protected:
+  basic_5_3_1_Tagger();
+  std::map<Analysis, std::size_t> Model;
+};
+}
+
+#endif // BASIC_5_3_1_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_2_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_2_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_2_tagger.cc	(revision 70339)
@@ -0,0 +1,20 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "basic_5_3_2_tagger.h"
+
+namespace Apertium {
+basic_5_3_2_Tagger::basic_5_3_2_Tagger() {}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_2_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_2_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_2_tagger.h	(revision 70339)
@@ -0,0 +1,33 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_5_3_2_TAGGER_H
+#define BASIC_5_3_2_TAGGER_H
+
+#include "a.h"
+#include "lemma.h"
+
+#include <cstddef>
+#include <map>
+
+namespace Apertium {
+class basic_5_3_2_Tagger {
+protected:
+  basic_5_3_2_Tagger();
+  std::map<a, std::map<Lemma, std::size_t> > Model;
+};
+}
+
+#endif // BASIC_5_3_2_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_3_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_3_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_5_3_3_tagger.h	(revision 70339)
@@ -0,0 +1,35 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_5_3_3_TAGGER_H
+#define BASIC_5_3_3_TAGGER_H
+
+#include "i.h"
+#include "lemma.h"
+
+#include <cstddef>
+#include <map>
+#include <utility>
+
+namespace Apertium {
+class basic_5_3_3_Tagger {
+protected:
+  std::pair<std::map<i, std::map<Lemma, std::size_t> >,
+            std::pair<std::map<i, std::map<Lemma, std::size_t> >,
+                      std::map<Lemma, std::map<i, std::size_t> > > > Model;
+};
+}
+
+#endif // BASIC_5_3_3_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_exception_type.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_exception_type.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_exception_type.cc	(revision 70339)
@@ -0,0 +1,20 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "basic_exception_type.h"
+
+namespace Apertium {
+basic_ExceptionType::~basic_ExceptionType() throw() {}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_exception_type.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_exception_type.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_exception_type.h	(revision 70339)
@@ -0,0 +1,29 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_EXCEPTION_TYPE_H
+#define BASIC_EXCEPTION_TYPE_H
+
+#include <exception>
+
+namespace Apertium {
+class basic_ExceptionType : public std::exception {
+public:
+  virtual ~basic_ExceptionType() throw() = 0;
+  virtual const char *what() const throw() = 0;
+};
+}
+
+#endif // BASIC_EXCEPTION_TYPE_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger.cc	(revision 70339)
@@ -0,0 +1,125 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "basic_stream_tagger.h"
+
+#include "apertium_config.h"
+
+#include "basic_tagger.h"
+#include "lexical_unit.h"
+#include "stream.h"
+#include "streamed_type.h"
+
+#include <ostream>
+
+#if ENABLE_DEBUG
+
+#include <iomanip>
+#include <iostream>
+#include <limits>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+basic_StreamTagger::~basic_StreamTagger() {}
+
+void basic_StreamTagger::tag(Stream &Input, std::wostream &Output) const {
+  while (true) {
+    StreamedType StreamedType_ = Input.get();
+    Output << StreamedType_.TheString;
+
+    if (!StreamedType_.TheLexicalUnit) {
+      if (!Input.flush_())
+        break;
+
+      Output << std::flush;
+      continue;
+    }
+
+#if ENABLE_DEBUG
+
+    std::wcerr << L"\n\n";
+
+#endif // ENABLE_DEBUG
+
+    tag(*StreamedType_.TheLexicalUnit, Output);
+
+    if (Input.flush_())
+      Output << std::flush;
+  }
+}
+
+basic_StreamTagger::basic_StreamTagger(const basic_Tagger::Flags &Flags_)
+    : basic_Tagger(Flags_) {}
+
+void basic_StreamTagger::tag(const LexicalUnit &LexicalUnit_,
+                             std::wostream &Output) const {
+#if ENABLE_DEBUG
+
+  for (std::vector<Analysis>::const_iterator Analysis_ =
+           LexicalUnit_.TheAnalyses.begin();
+       Analysis_ != LexicalUnit_.TheAnalyses.end(); ++Analysis_) {
+    std::wcerr << L"score(\"" << *Analysis_ << L"\") ==\n  "
+               << score_DEBUG(*Analysis_) << L" ==\n  " << std::fixed
+               << std::setprecision(std::numeric_limits<long double>::digits10)
+               << score(*Analysis_) << L"\n";
+  }
+
+#endif // ENABLE_DEBUG
+
+  Output << L"^";
+
+  if (LexicalUnit_.TheAnalyses.empty()) {
+    if (TheFlags.getShowSuperficial())
+      Output << LexicalUnit_.TheSurfaceForm << L"/";
+
+    Output << L"*" << LexicalUnit_.TheSurfaceForm << L"$";
+    return;
+  }
+
+  if (TheFlags.getMark()) {
+    if (LexicalUnit_.TheAnalyses.size() != 1)
+      Output << L"=";
+  }
+
+  if (TheFlags.getShowSuperficial())
+    Output << LexicalUnit_.TheSurfaceForm << L"/";
+
+  std::vector<Analysis>::const_iterator TheAnalysis =
+      LexicalUnit_.TheAnalyses.begin();
+
+  for (std::vector<Analysis>::const_iterator Analysis_ =
+           LexicalUnit_.TheAnalyses.begin() + 1;
+       // Call .end() each iteration to save memory.
+       Analysis_ != LexicalUnit_.TheAnalyses.end(); ++Analysis_) {
+    if (score(*Analysis_) > score(*TheAnalysis))
+      TheAnalysis = Analysis_;
+  }
+
+  Output << *TheAnalysis;
+
+  if (TheFlags.getFirst()) {
+    for (std::vector<Analysis>::const_iterator Analysis_ =
+             LexicalUnit_.TheAnalyses.begin();
+         // Call .end() each iteration to save memory.
+         Analysis_ != LexicalUnit_.TheAnalyses.end(); ++Analysis_) {
+      if (Analysis_ != TheAnalysis)
+        Output << L"/" << *Analysis_;
+    }
+  }
+
+  Output << L"$";
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger.h	(revision 70339)
@@ -0,0 +1,56 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_STREAM_TAGGER_H
+#define BASIC_STREAM_TAGGER_H
+
+#include "apertium_config.h"
+
+#include "basic_tagger.h"
+#include "lexical_unit.h"
+#include "stream.h"
+
+#include <istream>
+#include <ostream>
+
+#if ENABLE_DEBUG
+
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+class basic_StreamTagger : protected basic_Tagger {
+public:
+  virtual ~basic_StreamTagger();
+  virtual void deserialise(std::istream &Serialised_basic_Tagger) = 0;
+  void tag(Stream &Input, std::wostream &Output) const;
+
+protected:
+  basic_StreamTagger(const Flags &Flags_);
+  virtual long double score(const Analysis &Analysis_) const = 0;
+
+#if ENABLE_DEBUG
+
+  virtual std::wstring score_DEBUG(const Analysis &Analysis_) const = 0;
+
+#endif // ENABLE_DEBUG
+
+private:
+  void tag(const LexicalUnit &LexicalUnit_, std::wostream &Output) const;
+};
+}
+
+#endif // BASIC_STREAM_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger_trainer.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger_trainer.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger_trainer.cc	(revision 70339)
@@ -0,0 +1,59 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "basic_stream_tagger_trainer.h"
+
+#include "analysis.h"
+#include "basic_tagger.h"
+#include "exception.h"
+#include "stream.h"
+#include "streamed_type.h"
+
+namespace Apertium {
+basic_StreamTaggerTrainer::~basic_StreamTaggerTrainer() {}
+
+void basic_StreamTaggerTrainer::train(Stream &TaggedCorpus) {
+  while (true) {
+    StreamedType StreamedType_ = TaggedCorpus.get();
+
+    if (!StreamedType_.TheLexicalUnit)
+      break;
+
+    if (StreamedType_.TheLexicalUnit->TheAnalyses.empty())
+      throw Exception::LexicalUnit::TheAnalyses_empty(
+          "can't train LexicalUnit comprising empty Analysis std::vector");
+
+    if (OccurrenceCoefficient %
+            StreamedType_.TheLexicalUnit->TheAnalyses.size() !=
+        0) {
+      OccurrenceCoefficient *= StreamedType_.TheLexicalUnit->TheAnalyses.size();
+      multiplyModel(StreamedType_.TheLexicalUnit->TheAnalyses.size());
+    }
+
+    for (std::vector<Analysis>::const_iterator Analysis_ =
+             StreamedType_.TheLexicalUnit->TheAnalyses.begin();
+         Analysis_ != StreamedType_.TheLexicalUnit->TheAnalyses.end();
+         ++Analysis_) {
+      train_Analysis(*Analysis_,
+                     OccurrenceCoefficient /
+                         StreamedType_.TheLexicalUnit->TheAnalyses.size());
+    }
+  }
+}
+
+basic_StreamTaggerTrainer::basic_StreamTaggerTrainer(
+    const basic_Tagger::Flags &Flags_)
+    : basic_Tagger(Flags_), OccurrenceCoefficient(1) {}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger_trainer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger_trainer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_stream_tagger_trainer.h	(revision 70339)
@@ -0,0 +1,41 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_STREAM_TAGGER_TRAINER_H
+#define BASIC_STREAM_TAGGER_TRAINER_H
+
+#include "basic_tagger.h"
+#include "stream.h"
+
+#include <ostream>
+
+namespace Apertium {
+class basic_StreamTaggerTrainer : protected basic_Tagger {
+public:
+  virtual ~basic_StreamTaggerTrainer();
+  void train(Stream &TaggedCorpus);
+  virtual void serialise(std::ostream &Serialised_basic_Tagger) const = 0;
+
+protected:
+  basic_StreamTaggerTrainer(const Flags &Flags_);
+  virtual void train_Analysis(const Analysis &Analysis_,
+                              const std::size_t &Coefficient_) = 0;
+  virtual void
+  multiplyModel(const std::size_t &OccurrenceCoefficientMultiplier) = 0;
+  std::size_t OccurrenceCoefficient;
+};
+}
+
+#endif // BASIC_STREAM_TAGGER_TRAINER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_tagger.cc	(revision 70339)
@@ -0,0 +1,48 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "basic_tagger.h"
+
+namespace Apertium {
+basic_Tagger::Flags::Flags()
+    : Debug(false), First(false), Mark(false), ShowSuperficial(false),
+      NullFlush(false) {}
+
+bool basic_Tagger::Flags::getDebug() const { return Debug; }
+
+void basic_Tagger::Flags::setDebug(const bool &Debug_) { Debug = Debug_; }
+
+bool basic_Tagger::Flags::getFirst() const { return First; }
+
+void basic_Tagger::Flags::setFirst(const bool &First_) { First = First_; }
+
+bool basic_Tagger::Flags::getMark() const { return Mark; }
+
+void basic_Tagger::Flags::setMark(const bool &Mark_) { Mark = Mark_; }
+
+bool basic_Tagger::Flags::getShowSuperficial() const { return ShowSuperficial; }
+
+void basic_Tagger::Flags::setShowSuperficial(const bool &ShowSuperficial_) {
+  ShowSuperficial = ShowSuperficial_;
+}
+
+bool basic_Tagger::Flags::getNullFlush() const { return NullFlush; }
+
+void basic_Tagger::Flags::setNullFlush(const bool &NullFlush_) {
+  NullFlush = NullFlush_;
+}
+
+basic_Tagger::basic_Tagger(const Flags &Flags_) : TheFlags(Flags_) {}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/basic_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/basic_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/basic_tagger.h	(revision 70339)
@@ -0,0 +1,60 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef BASIC_TAGGER_H
+#define BASIC_TAGGER_H
+
+namespace Apertium {
+class basic_Tagger {
+public:
+  class Flags {
+  public:
+    Flags();
+    bool getDebug() const;
+    void setDebug(const bool &Debug_);
+    bool getFirst() const;
+    void setFirst(const bool &First_);
+    bool getMark() const;
+    void setMark(const bool &Mark_);
+    bool getShowSuperficial() const;
+    void setShowSuperficial(const bool &ShowSuperficial_);
+    bool getNullFlush() const;
+    void setNullFlush(const bool &NullFlush_);
+    static bool (Flags::*GetDebug)() const;
+    static void (Flags::*SetDebug)(const bool &);
+    static bool (Flags::*GetFirst)() const;
+    static void (Flags::*SetFirst)(const bool &);
+    static bool (Flags::*GetMark)() const;
+    static void (Flags::*SetMark)(const bool &);
+    static bool (Flags::*GetShowSuperficial)() const;
+    static void (Flags::*SetShowSuperficial)(const bool &);
+    static bool (Flags::*GetNullFlush)() const;
+    static void (Flags::*SetNullFlush)(const bool &);
+
+  private:
+    bool Debug : 1;
+    bool First : 1;
+    bool Mark : 1;
+    bool ShowSuperficial : 1;
+    bool NullFlush : 1;
+  };
+
+protected:
+  basic_Tagger(const Flags &Flags_);
+  Flags TheFlags;
+};
+}
+
+#endif // BASIC_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/constructor_eq_delete.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/constructor_eq_delete.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/constructor_eq_delete.h	(revision 70339)
@@ -0,0 +1,32 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef CONSTRUCTOR_EQ_DELETE_H
+#define CONSTRUCTOR_EQ_DELETE_H
+
+namespace Apertium {
+class constructor_eq_delete {
+protected:
+  constructor_eq_delete() {}
+  ~constructor_eq_delete() {}
+
+private:
+  constructor_eq_delete(const constructor_eq_delete &constructor_eq_delete_);
+  constructor_eq_delete &
+  operator=(constructor_eq_delete constructor_eq_delete_);
+};
+}
+
+#endif // CONSTRUCTOR_EQ_DELETE_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/deserialiser.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/deserialiser.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/deserialiser.h	(revision 70339)
@@ -0,0 +1,255 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef DESERIALISER_H
+#define DESERIALISER_H
+
+#include "a.h"
+#include "analysis.h"
+#include "basic_exception_type.h"
+#include "exception.h"
+#include "i.h"
+#include "lemma.h"
+#include "morpheme.h"
+#include "tag.h"
+
+#include <cstddef>
+#include <istream>
+#include <limits>
+#include <map>
+#include <sstream>
+#include <string>
+#include <utility>
+#include <vector>
+
+namespace Apertium {
+template <typename DeserialisedType> class Deserialiser;
+
+template <> class Deserialiser<a> {
+public:
+  inline static a deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<Analysis> {
+public:
+  inline static Analysis deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<i> {
+public:
+  inline static i deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<Lemma> {
+public:
+  inline static Lemma deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<Morpheme> {
+public:
+  inline static Morpheme deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<Tag> {
+public:
+  inline static Tag deserialise(std::istream &Stream_);
+};
+
+template <typename value_type>
+class Deserialiser<std::basic_string<value_type> > {
+public:
+  inline static std::basic_string<value_type>
+  deserialise(std::istream &Stream_);
+};
+
+template <typename key_type, typename mapped_type>
+class Deserialiser<std::map<key_type, mapped_type> > {
+public:
+  inline static std::map<key_type, mapped_type>
+  deserialise(std::istream &Stream_);
+};
+
+template <typename first_type, typename second_type>
+class Deserialiser<std::pair<first_type, second_type> > {
+public:
+  inline static std::pair<first_type, second_type>
+  deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<std::size_t> {
+public:
+  inline static std::size_t deserialise(std::istream &Stream_);
+};
+
+template <typename value_type> class Deserialiser<std::vector<value_type> > {
+public:
+  inline static std::vector<value_type> deserialise(std::istream &Stream_);
+};
+
+template <> class Deserialiser<wchar_t> {
+public:
+  inline static wchar_t deserialise(std::istream &Stream_);
+};
+
+a Deserialiser<a>::deserialise(std::istream &Stream_) {
+  a StreamedType_;
+  StreamedType_.TheTags = Deserialiser<std::vector<Tag> >::deserialise(Stream_);
+  StreamedType_.TheMorphemes =
+      Deserialiser<std::vector<Morpheme> >::deserialise(Stream_);
+  return StreamedType_;
+}
+
+Analysis Deserialiser<Analysis>::deserialise(std::istream &Stream_) {
+  Analysis SerialisedType_;
+  SerialisedType_.TheMorphemes =
+      Deserialiser<std::vector<Morpheme> >::deserialise(Stream_);
+  return SerialisedType_;
+}
+
+i Deserialiser<i>::deserialise(std::istream &Stream_) {
+  i StreamedType_;
+  StreamedType_.TheTags = Deserialiser<std::vector<Tag> >::deserialise(Stream_);
+  return StreamedType_;
+}
+
+Lemma Deserialiser<Lemma>::deserialise(std::istream &Stream_) {
+  Lemma StreamedType_;
+  StreamedType_.TheLemma = Deserialiser<std::wstring>::deserialise(Stream_);
+  return StreamedType_;
+}
+
+Morpheme Deserialiser<Morpheme>::deserialise(std::istream &Stream_) {
+  Morpheme SerialisedType_;
+  SerialisedType_.TheLemma = Deserialiser<std::wstring>::deserialise(Stream_);
+  SerialisedType_.TheTags =
+      Deserialiser<std::vector<Tag> >::deserialise(Stream_);
+  return SerialisedType_;
+}
+
+Tag Deserialiser<Tag>::deserialise(std::istream &Stream_) {
+  Tag SerialisedType_;
+  SerialisedType_.TheTag = Deserialiser<std::wstring>::deserialise(Stream_);
+  return SerialisedType_;
+}
+
+template <typename value_type>
+std::basic_string<value_type>
+Deserialiser<std::basic_string<value_type> >::deserialise(
+    std::istream &Stream_) {
+  std::size_t SerialisedValueCount =
+      Deserialiser<std::size_t>::deserialise(Stream_);
+  std::basic_string<value_type> SerialisedType_;
+
+  for (; SerialisedValueCount != 0; --SerialisedValueCount) {
+    SerialisedType_.push_back(Deserialiser<value_type>::deserialise(Stream_));
+  }
+
+  return SerialisedType_;
+}
+
+template <typename key_type, typename mapped_type>
+std::map<key_type, mapped_type>
+Deserialiser<std::map<key_type, mapped_type> >::deserialise(
+    std::istream &Stream_) {
+  std::size_t SerialisedValueCount =
+      Deserialiser<std::size_t>::deserialise(Stream_);
+  std::map<key_type, mapped_type> SerialisedType_;
+
+  for (; SerialisedValueCount != 0; --SerialisedValueCount) {
+    SerialisedType_.insert(
+        Deserialiser<std::pair<key_type, mapped_type> >::deserialise(Stream_));
+  }
+
+  return SerialisedType_;
+}
+
+template <typename first_type, typename second_type>
+std::pair<first_type, second_type>
+Deserialiser<std::pair<first_type, second_type> >::deserialise(
+    std::istream &Stream_) {
+  std::pair<first_type, second_type> SerialisedType_;
+  SerialisedType_.first = Deserialiser<first_type>::deserialise(Stream_);
+  SerialisedType_.second = Deserialiser<second_type>::deserialise(Stream_);
+  return SerialisedType_;
+}
+
+std::size_t Deserialiser<std::size_t>::deserialise(std::istream &Stream_) {
+  try {
+    std::size_t SerialisedType_ = 0;
+    unsigned char SerialisedTypeSize = Stream_.get();
+
+    if (!Stream_)
+      throw Exception::Deserialiser::not_Stream_good("can't deserialise size");
+
+    for (; SerialisedTypeSize != 0;) {
+      SerialisedType_ +=
+          static_cast<std::size_t>(Stream_.get())
+          << std::numeric_limits<unsigned char>::digits * --SerialisedTypeSize;
+
+      if (!Stream_)
+        throw Exception::Deserialiser::not_Stream_good(
+            "can't deserialise byte");
+    }
+
+    return SerialisedType_;
+  } catch (const basic_ExceptionType &basic_ExceptionType_) {
+    std::stringstream what_;
+    what_ << "can't deserialise std::size_t: " << basic_ExceptionType_.what();
+    throw Exception::Deserialiser::size_t_(what_);
+  }
+}
+
+template <typename value_type>
+std::vector<value_type>
+Deserialiser<std::vector<value_type> >::deserialise(std::istream &Stream_) {
+  std::size_t SerialisedValueCount =
+      Deserialiser<std::size_t>::deserialise(Stream_);
+  std::vector<value_type> SerialisedType_;
+
+  for (; SerialisedValueCount != 0; --SerialisedValueCount) {
+    SerialisedType_.push_back(Deserialiser<value_type>::deserialise(Stream_));
+  }
+
+  return SerialisedType_;
+}
+
+wchar_t Deserialiser<wchar_t>::deserialise(std::istream &Stream_) {
+  try {
+    unsigned wchar_t SerialisedType_ = 0;
+    unsigned char SerialisedTypeSize = Stream_.get();
+
+    if (!Stream_)
+      throw Exception::Deserialiser::not_Stream_good("can't deserialise size");
+
+    for (; SerialisedTypeSize != 0;) {
+      SerialisedType_ +=
+          static_cast<std::size_t>(Stream_.get())
+          << std::numeric_limits<unsigned char>::digits * --SerialisedTypeSize;
+
+      if (!Stream_)
+        throw Exception::Deserialiser::not_Stream_good(
+            "can't deserialise byte");
+    }
+
+    return static_cast<wchar_t>(SerialisedType_);
+  } catch (const basic_ExceptionType &basic_ExceptionType_) {
+    std::stringstream what_;
+    what_ << "can't deserialise wchar_t: " << basic_ExceptionType_.what();
+    throw Exception::Deserialiser::wchar_t_(what_);
+  }
+}
+}
+
+#endif // DESERIALISER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/err_exception.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/err_exception.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/err_exception.h	(revision 70339)
@@ -0,0 +1,23 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef ERR_EXCEPTION_H
+#define ERR_EXCEPTION_H
+
+namespace Apertium {
+class err_Exception {};
+}
+
+#endif // ERR_EXCEPTION_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/exception_type.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/exception_type.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/exception_type.cc	(revision 70339)
@@ -0,0 +1,32 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "exception_type.h"
+
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+ExceptionType::ExceptionType(const char *const what_) : what_(what_) {}
+
+ExceptionType::ExceptionType(const std::string &what_) : what_(what_) {}
+
+ExceptionType::ExceptionType(const std::stringstream &what_)
+    : what_(what_.str()) {}
+
+ExceptionType::~ExceptionType() throw() {}
+
+const char *ExceptionType::what() const throw() { return what_.c_str(); }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/exception_type.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/exception_type.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/exception_type.h	(revision 70339)
@@ -0,0 +1,38 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef EXCEPTION_TYPE_H
+#define EXCEPTION_TYPE_H
+
+#include "basic_exception_type.h"
+
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+class ExceptionType : public basic_ExceptionType {
+public:
+  ExceptionType(const char *const what_);
+  ExceptionType(const std::string &what_);
+  ExceptionType(const std::stringstream &what_);
+  virtual ~ExceptionType() throw() = 0;
+  const char *what() const throw();
+
+protected:
+  const std::string what_;
+};
+}
+
+#endif // EXCEPTION_TYPE_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/file_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/file_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/file_tagger.cc	(revision 70339)
@@ -0,0 +1,42 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "file_tagger.h"
+
+#include <apertium/tsx_reader.h>
+
+#include <cstdio>
+
+namespace Apertium {
+FILE_Tagger::FILE_Tagger() : debug(false), show_sf(false), null_flush(false) {}
+
+FILE_Tagger::~FILE_Tagger() {}
+
+void FILE_Tagger::set_debug(const bool &Debug) { debug = Debug; }
+
+void FILE_Tagger::set_show_sf(const bool &ShowSuperficial) {
+  show_sf = ShowSuperficial;
+}
+
+void FILE_Tagger::setNullFlush(const bool &NullFlush) {
+  null_flush = NullFlush;
+}
+
+void FILE_Tagger::deserialise(char *const TaggerSpecificationFilename) {
+  TSXReader TaggerSpecificationReader_;
+  TaggerSpecificationReader_.read(TaggerSpecificationFilename);
+  deserialise(TaggerSpecificationReader_.getTaggerData());
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/i.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/i.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/i.cc	(revision 70339)
@@ -0,0 +1,50 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "i.h"
+
+#include "analysis.h"
+#include "exception.h"
+#include "morpheme.h"
+
+namespace Apertium {
+bool operator==(const i &a_, const i &b_) { return a_.TheTags == b_.TheTags; }
+
+bool operator<(const i &a_, const i &b_) { return a_.TheTags < b_.TheTags; }
+
+i::i() {}
+
+i::i(const Analysis &Analysis_) : TheTags() {
+  if (Analysis_.TheMorphemes.empty())
+    throw Exception::Analysis::TheMorphemes_empty("can't convert const "
+                                                  "Analysis & comprising empty "
+                                                  "Morpheme std::vector to i");
+
+  if (Analysis_.TheMorphemes.front().TheTags.empty())
+    throw Exception::Morpheme::TheTags_empty("can't convert const Analysis & "
+                                             "comprising Morpheme comprising "
+                                             "empty Tag std::vector to i");
+
+  TheTags = Analysis_.TheMorphemes.front().TheTags;
+}
+
+i::i(const Morpheme &Morpheme_) : TheTags() {
+  if (Morpheme_.TheTags.empty())
+    throw Exception::Morpheme::TheTags_empty(
+        "can't convert const Morpheme & comprising empty Tag std::vector to i");
+
+  TheTags = Morpheme_.TheTags;
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/i.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/i.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/i.h	(revision 70339)
@@ -0,0 +1,38 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef I_H
+#define I_H
+
+#include "analysis.h"
+#include "morpheme.h"
+#include "tag.h"
+
+#include <vector>
+
+namespace Apertium {
+class i {
+  friend bool operator==(const i &a_, const i &b_);
+  friend bool operator<(const i &a_, const i &b_);
+
+public:
+  i();
+  i(const Analysis &Analysis_);
+  i(const Morpheme &Morpheme_);
+  std::vector<Tag> TheTags;
+};
+}
+
+#endif // I_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lemma.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lemma.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lemma.cc	(revision 70339)
@@ -0,0 +1,55 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "lemma.h"
+
+#include "analysis.h"
+#include "exception.h"
+#include "morpheme.h"
+
+namespace Apertium {
+bool operator==(const Lemma &a_, const Lemma &b_) {
+  return a_.TheLemma == b_.TheLemma;
+}
+
+bool operator<(const Lemma &a_, const Lemma &b_) {
+  return a_.TheLemma < b_.TheLemma;
+}
+
+Lemma::Lemma() : TheLemma() {}
+
+Lemma::Lemma(const Analysis &Analysis_) : TheLemma() {
+  if (Analysis_.TheMorphemes.empty())
+    throw Exception::Analysis::TheMorphemes_empty(
+        "can't convert const Analysis & comprising empty Morpheme std::vector "
+        "to Lemma");
+
+  if (Analysis_.TheMorphemes.front().TheLemma.empty())
+    throw Exception::Morpheme::TheLemma_empty(
+        "can't convert const Analysis & comprising Morpheme comprising empty "
+        "Lemma std::wstring to Lemma");
+
+  TheLemma = Analysis_.TheMorphemes.front().TheLemma;
+}
+
+Lemma::Lemma(const Morpheme &Morpheme_) : TheLemma() {
+  if (Morpheme_.TheLemma.empty())
+    throw Exception::Morpheme::TheLemma_empty("can't convert const Morpheme & "
+                                              "comprising empty Lemma "
+                                              "std::wstring to Lemma");
+
+  TheLemma = Morpheme_.TheLemma;
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lemma.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lemma.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lemma.h	(revision 70339)
@@ -0,0 +1,36 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef LEMMA_H
+#define LEMMA_H
+
+#include "analysis.h"
+#include "morpheme.h"
+
+#include <string>
+
+namespace Apertium {
+class Lemma {
+public:
+  friend bool operator==(const Lemma &a_, const Lemma &b_);
+  friend bool operator<(const Lemma &a_, const Lemma &b_);
+  Lemma();
+  Lemma(const Analysis &Analysis_);
+  Lemma(const Morpheme &Morpheme_);
+  std::wstring TheLemma;
+};
+}
+
+#endif // LEMMA_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lexical_unit.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lexical_unit.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lexical_unit.h	(revision 70339)
@@ -0,0 +1,32 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef TAGGING_EXPRESSION_H
+#define TAGGING_EXPRESSION_H
+
+#include "analysis.h"
+
+#include <string>
+#include <vector>
+
+namespace Apertium {
+class LexicalUnit {
+public:
+  std::wstring TheSurfaceForm;
+  std::vector<Analysis> TheAnalyses;
+};
+}
+
+#endif // LEXICAL_UNIT_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/linebreak.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/linebreak.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/linebreak.cc	(revision 70339)
@@ -0,0 +1,94 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "linebreak.h"
+
+#include <string>
+
+namespace Apertium {
+std::string linebreak::linebreak_(std::string string_,
+                                  std::string::size_type col,
+                                  const std::string::size_type &wrapmargin) {
+  std::string::size_type i_ = 0;
+
+  while (true) {
+    if (i_ == string_.size())
+      return string_;
+
+    if (col < 79) {
+      if (string_.at(i_) == '\n') {
+        if (i_ + 1 == string_.size()) {
+          string_.erase(i_, 1);
+          return string_;
+        }
+
+        string_.insert(i_ + 1, wrapmargin, ' ');
+        col = wrapmargin;
+        i_ += wrapmargin;
+        continue;
+      }
+
+      ++col;
+      ++i_;
+      continue;
+    }
+
+    if (string_.at(i_) == ' ') {
+      std::string::size_type j_ = i_ + 1;
+
+      for (; i_ != 0; --i_) {
+        if (string_.at(i_ - 1) != ' ')
+          break;
+      }
+
+      for (;; ++j_) {
+        if (j_ == string_.size()) {
+          string_.erase(i_, j_ - i_);
+          return string_;
+        }
+
+        if (string_.at(j_) != ' ')
+          break;
+      }
+
+      linebreak_(string_, col, wrapmargin, i_, j_);
+      continue;
+    }
+
+    std::string::size_type j_ = i_;
+
+    for (; j_ != 0; --j_) {
+      if (string_.at(j_ - 1) == ' ')
+        break;
+    }
+
+    for (i_ = j_; i_ != 0; --i_) {
+      if (string_.at(i_ - 1) != ' ')
+        break;
+    }
+
+    linebreak_(string_, col, wrapmargin, i_, j_);
+  }
+}
+
+void linebreak::linebreak_(std::string &string_, std::string::size_type &col,
+                           const std::string::size_type &wrapmargin,
+                           std::string::size_type &i_,
+                           const std::string::size_type &j_) {
+  string_.replace(i_, j_ - i_, '\n' + std::string(wrapmargin, ' '));
+  col = wrapmargin;
+  i_ += 1 /* '\n' */ + wrapmargin /* std::string(wrapmargin, ' ') */;
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/linebreak.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/linebreak.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/linebreak.h	(revision 70339)
@@ -0,0 +1,36 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef LINEBREAK_H
+#define LINEBREAK_H
+
+#include <string>
+
+namespace Apertium {
+class linebreak {
+public:
+  static std::string linebreak_(std::string string_,
+                                std::string::size_type col,
+                                const std::string::size_type &wrapmargin);
+
+private:
+  static void linebreak_(std::string &string_, std::string::size_type &col,
+                         const std::string::size_type &wrapmargin,
+                         std::string::size_type &i_,
+                         const std::string::size_type &j_);
+};
+}
+
+#endif // LINEBREAK_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/morpheme.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/morpheme.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/morpheme.cc	(revision 70339)
@@ -0,0 +1,57 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "morpheme.h"
+
+#include "exception.h"
+#include "tag.h"
+
+#include <string>
+#include <vector>
+
+namespace Apertium {
+bool operator==(const Morpheme &a, const Morpheme &b) {
+  return a.TheLemma == b.TheLemma && a.TheTags == b.TheTags;
+}
+
+bool operator<(const Morpheme &a, const Morpheme &b) {
+  if (a.TheLemma != b.TheLemma)
+    return a.TheLemma < b.TheLemma;
+
+  return a.TheTags < b.TheTags;
+}
+
+Morpheme::operator std::wstring() const {
+  if (TheTags.empty())
+    throw Exception::Morpheme::TheTags_empty("can't convert Morpheme "
+                                             "comprising empty Tag std::vector "
+                                             "to std::wstring");
+
+  if (TheLemma.empty())
+    throw Exception::Morpheme::TheLemma_empty("can't convert Morpheme "
+                                              "comprising empty TheLemma "
+                                              "std::wstring to std::wstring");
+
+  std::wstring wstring_ = TheLemma;
+
+  for (std::vector<Tag>::const_iterator Tag_ = TheTags.begin();
+       // Call .end() each iteration to save memory.
+       Tag_ != TheTags.end(); ++Tag_) {
+    wstring_ += static_cast<std::wstring>(*Tag_);
+  }
+
+  return wstring_;
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/morpheme.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/morpheme.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/morpheme.h	(revision 70339)
@@ -0,0 +1,35 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef MORPHEME_H
+#define MORPHEME_H
+
+#include "tag.h"
+
+#include <string>
+#include <vector>
+
+namespace Apertium {
+class Morpheme {
+public:
+  friend bool operator==(const Morpheme &a, const Morpheme &b);
+  friend bool operator<(const Morpheme &a, const Morpheme &b);
+  operator std::wstring() const;
+  std::wstring TheLemma;
+  std::vector<Tag> TheTags;
+};
+}
+
+#endif // MORPHEME_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/optional.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/optional.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/optional.h	(revision 70339)
@@ -0,0 +1,123 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef OPTIONAL_H
+#define OPTIONAL_H
+
+#include "exception.h"
+
+#include <algorithm>
+#include <cstddef>
+#include <exception>
+#include <new>
+
+namespace Apertium {
+template <typename OptionalType> class Optional;
+
+template <typename OptionalType>
+void swap(Optional<OptionalType> &A, Optional<OptionalType> &B);
+
+template <typename OptionalType> class Optional {
+public:
+  friend void swap<OptionalType>(Optional &A, Optional &B);
+  Optional();
+  Optional(const OptionalType &OptionalType_);
+  Optional(const Optional &Optional_);
+  Optional &operator=(Optional Optional_);
+  ~Optional();
+  const OptionalType &operator*() const;
+  OptionalType &operator*();
+  const OptionalType *operator->() const;
+  OptionalType *operator->();
+  operator bool() const;
+
+private:
+  OptionalType *TheOptionalTypePointer;
+};
+
+template <typename OptionalType>
+void swap(Optional<OptionalType> &A, Optional<OptionalType> &B) {
+  using std::swap;
+  swap(A.TheOptionalTypePointer, B.TheOptionalTypePointer);
+}
+
+template <typename OptionalType>
+Optional<OptionalType>::Optional()
+    : TheOptionalTypePointer(NULL) {}
+
+template <typename OptionalType>
+Optional<OptionalType>::Optional(const OptionalType &OptionalType_)
+    : TheOptionalTypePointer(new OptionalType(OptionalType_)) {}
+
+template <typename OptionalType>
+Optional<OptionalType>::Optional(const Optional &Optional_) {
+  if (Optional_.TheOptionalTypePointer == NULL) {
+    TheOptionalTypePointer = NULL;
+    return;
+  }
+
+  TheOptionalTypePointer =
+      new OptionalType(*(Optional_.TheOptionalTypePointer));
+}
+
+template <typename OptionalType>
+Optional<OptionalType> &Optional<OptionalType>::operator=(Optional Optional_) {
+  swap(*this, Optional_);
+  return *this;
+}
+
+template <typename OptionalType> Optional<OptionalType>::~Optional() {
+  if (TheOptionalTypePointer == NULL)
+    return;
+
+  delete TheOptionalTypePointer;
+}
+
+template <typename OptionalType>
+const OptionalType &Optional<OptionalType>::operator*() const {
+  if (TheOptionalTypePointer == NULL)
+    throw Exception::Optional::TheOptionalTypePointer_null(
+        "can't dereference Optional comprising null OptionalType pointer");
+
+  return *TheOptionalTypePointer;
+}
+
+template <typename OptionalType>
+OptionalType &Optional<OptionalType>::operator*() {
+  return const_cast<OptionalType &>(
+      static_cast<const Optional &>(*this).operator*());
+}
+
+template <typename OptionalType>
+const OptionalType *Optional<OptionalType>::operator->() const {
+  if (TheOptionalTypePointer == NULL)
+    throw Exception::Optional::TheOptionalTypePointer_null(
+        "can't dereference Optional comprising null OptionalType pointer");
+
+  return TheOptionalTypePointer;
+}
+
+template <typename OptionalType>
+OptionalType *Optional<OptionalType>::operator->() {
+  return const_cast<OptionalType *>(
+      static_cast<const Optional &>(*this).operator->());
+}
+
+template <typename OptionalType> Optional<OptionalType>::operator bool() const {
+  return TheOptionalTypePointer != NULL;
+}
+}
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream.cc	(revision 70339)
@@ -0,0 +1,774 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "stream.h"
+
+#include "analysis.h"
+#include "basic_tagger.h"
+#include "streamed_type.h"
+#include "wchar_t_exception.h"
+
+#include <climits>
+#include <cstdlib>
+#include <fstream>
+#include <iostream>
+#include <istream>
+#include <ostream>
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+Stream::Stream(const basic_Tagger::Flags &Flags_)
+    : TheCharacterStream(std::wcin), TheFilename(), TheLineNumber(1), TheLine(),
+      TheFlags(Flags_), private_flush_(false), ThePreviousCase() {}
+
+Stream::Stream(const basic_Tagger::Flags &Flags_,
+               std::wifstream &CharacterStream_, const char *const Filename_)
+    : TheCharacterStream(CharacterStream_), TheFilename(Filename_),
+      TheLineNumber(1), TheLine(), TheFlags(Flags_), private_flush_(false),
+      ThePreviousCase() {}
+
+Stream::Stream(const basic_Tagger::Flags &Flags_,
+               std::wifstream &CharacterStream_, const std::string &Filename_)
+    : TheCharacterStream(CharacterStream_), TheFilename(Filename_),
+      TheLineNumber(1), TheLine(), TheFlags(Flags_), private_flush_(false),
+      ThePreviousCase() {}
+
+Stream::Stream(const basic_Tagger::Flags &Flags_,
+               std::wifstream &CharacterStream_,
+               const std::stringstream &Filename_)
+    : TheCharacterStream(CharacterStream_), TheFilename(Filename_.str()),
+      TheLineNumber(1), TheLine(), TheFlags(Flags_), private_flush_(false),
+      ThePreviousCase() {}
+
+StreamedType Stream::get() {
+  StreamedType TheStreamedType;
+  std::wstring Lemma;
+  private_flush_ = false;
+
+  if (!is_eof_throw_if_not_TheCharacterStream_good()) {
+    while (true) {
+      const wchar_t Character_ = TheCharacterStream.get();
+
+      if (is_eof_throw_if_not_TheCharacterStream_good(TheStreamedType, Lemma,
+                                                      Character_))
+        break;
+
+      TheLine.push_back(Character_);
+
+      switch (Character_) {
+      case L'\\': // <\>  92,  Hex 5c,  Octal 134
+        case_0x5c(TheStreamedType, Lemma, Character_);
+        continue;
+      case L'[':
+        if (ThePreviousCase) {
+          switch (ThePreviousCase->ThePreviousCase) {
+          case L']':
+          case L'$':
+            break;
+          default:
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_ << L"' following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '[' expected to follow ']' or '$'";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+        }
+
+        push_back_Character(TheStreamedType, Lemma, Character_);
+        ThePreviousCase = PreviousCaseType(Character_);
+        continue;
+      case L']':
+        if (!ThePreviousCase) {
+          std::wstringstream Message;
+          Message << L"unexpected '" << Character_
+                  << L"', ']' expected to follow '['";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        switch (ThePreviousCase->ThePreviousCase) {
+        case L'[':
+          push_back_Character(TheStreamedType, Lemma, Character_);
+          ThePreviousCase = PreviousCaseType(Character_);
+          continue;
+        default:
+          std::wstringstream Message;
+          Message << L"unexpected '" << Character_ << L"' following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', ']' expected to follow '['";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        std::abort();
+      case L'^':
+        if (ThePreviousCase) {
+          switch (ThePreviousCase->ThePreviousCase) {
+          case L'[':
+            push_back_Character(TheStreamedType, Lemma, Character_);
+            continue;
+          case L']':
+          case L'$':
+            break;
+          default:
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_ << L"' following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '^' expected to follow '[', ']', or '$'";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+        }
+
+        TheStreamedType.TheLexicalUnit = LexicalUnit();
+        ThePreviousCase = PreviousCaseType(Character_);
+        continue;
+      case L'/':
+        if (!ThePreviousCase) {
+          std::wstringstream Message;
+          Message
+              << L"unexpected '" << Character_
+              << L"', '/' expected to follow '[', to follow '>' immediately, "
+                 L"or to follow '^' or '#' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        switch (ThePreviousCase->ThePreviousCase) {
+        case L'[':
+          push_back_Character(TheStreamedType, Lemma, Character_);
+          continue;
+        case L'^':
+          if (ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_
+                    << L"' immediately following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '/' expected to follow '[', to follow '>' "
+                       L"immediately, or to follow '^' or '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          ThePreviousCase = PreviousCaseType(Character_);
+
+          {
+            const wchar_t Character_ = TheCharacterStream.get();
+
+            if (is_eof_throw_if_not_TheCharacterStream_good(
+                    TheStreamedType, Lemma, Character_)) {
+              std::wstringstream Message;
+              Message << L"unexpected end-of-file following '"
+                      << ThePreviousCase->ThePreviousCase
+                      << "', end-of-file expected to follow ']' or '$'";
+              throw wchar_t_Exception::Stream::UnexpectedEndOfFile(
+                  Message_what(Message));
+            }
+
+            TheLine.push_back(Character_);
+
+            switch (Character_) {
+            case L'\\':
+              TheStreamedType.TheLexicalUnit->TheAnalyses.push_back(Analysis());
+              TheStreamedType.TheLexicalUnit->TheAnalyses.back()
+                  .TheMorphemes.push_back(Morpheme());
+              case_0x5c(TheStreamedType, Lemma, Character_);
+              continue;
+            case L'*':
+              ThePreviousCase = PreviousCaseType(Character_);
+              continue;
+            case L'\n': {
+              std::wstringstream Message;
+              Message << L"unexpected newline following '"
+                      << ThePreviousCase->ThePreviousCase
+                      << "', newline expected to follow '[', ']', or '$'";
+              throw wchar_t_Exception::Stream::UnexpectedCharacter(
+                  Message_what(Message));
+            };
+            case L'[':
+            case L']':
+            case L'^':
+            case L'#':
+            case L'<':
+            case L'>':
+            case L'+':
+            case L'$': {
+              std::wstringstream Message;
+              Message << L"unexpected '" << Character_
+                      << L"' immediately following '"
+                      << ThePreviousCase->ThePreviousCase << L"', expected '*'";
+              throw wchar_t_Exception::Stream::UnexpectedPreviousCase(
+                  Message_what(Message));
+            }
+            default:
+              TheStreamedType.TheLexicalUnit->TheAnalyses.push_back(Analysis());
+              TheStreamedType.TheLexicalUnit->TheAnalyses.back()
+                  .TheMorphemes.push_back(Morpheme());
+              push_back_Character(TheStreamedType, Lemma, Character_);
+              continue;
+            }
+          }
+
+          continue;
+        case L'>':
+          if (!ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_
+                    << L"' not immediately following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '/' expected to follow '[', to follow '>' "
+                       L"immediately, or to follow '^' or '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          break;
+        case L'#':
+          if (ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_
+                    << L"' immediately following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '/' expected to follow '[', to follow '>' "
+                       L"immediately, or to follow '^' or '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          break;
+        default:
+          std::wstringstream Message;
+          Message << L"unexpected '" << Character_ << L"' following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', '/' expected to follow '[', to follow '>' "
+                     L"immediately, or to follow '^' or '#' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        TheStreamedType.TheLexicalUnit->TheAnalyses.push_back(Analysis());
+        TheStreamedType.TheLexicalUnit->TheAnalyses.back()
+            .TheMorphemes.push_back(Morpheme());
+        ThePreviousCase = PreviousCaseType(Character_);
+        continue;
+      case L'*':
+        if (ThePreviousCase) {
+          switch (ThePreviousCase->ThePreviousCase) {
+          case L'[':
+          case L']':
+          case L'$':
+            break;
+          default:
+            std::wstringstream Message;
+            Message
+                << L"unexpected '" << Character_ << L"' following '"
+                << ThePreviousCase->ThePreviousCase
+                << L"', '*' expected to follow '[', ']', or '$' or to follow "
+                   L"'/' immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+        }
+
+        push_back_Character(TheStreamedType, Lemma, Character_);
+        continue;
+      case L'<':
+        if (!ThePreviousCase) {
+          std::wstringstream Message;
+          Message
+              << L"unexpected '" << Character_
+              << L"', '<' expected to follow '[', to follow '>' immediately, "
+                 L"or to follow '#', '/' or '+' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        switch (ThePreviousCase->ThePreviousCase) {
+        case L'[':
+          push_back_Character(TheStreamedType, Lemma, Character_);
+          continue;
+        case L'/':
+        case L'#':
+        case L'+':
+          if (ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message
+                << L"unexpected '" << Character_ << L"' immediately following '"
+                << ThePreviousCase->ThePreviousCase
+                << L"', '<' expected to follow '[', to follow '>' immediately, "
+                   L"or to follow '#', '/' or '+' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          break;
+        case L'>':
+          if (!ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message
+                << L"unexpected '" << Character_
+                << L"' not immediately following '"
+                << ThePreviousCase->ThePreviousCase
+                << L"', '<' expected to follow '[', to follow '>' immediately, "
+                   L"or to follow '#', '/' or '+' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          break;
+        default:
+          std::wstringstream Message;
+          Message
+              << L"unexpected '" << Character_ << L"' following '"
+              << ThePreviousCase->ThePreviousCase
+              << L"', '<' expected to follow '[', to follow '>' immediately, "
+                 L"or to follow '#', '/' or '+' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        TheStreamedType.TheLexicalUnit->TheAnalyses.back()
+            .TheMorphemes.back()
+            .TheTags.push_back(Tag());
+        ThePreviousCase = PreviousCaseType(Character_);
+        continue;
+      case L'>':
+        if (!ThePreviousCase) {
+          std::wstringstream Message;
+          Message << L"unexpected '" << Character_
+                  << L"', '>' expected to "
+                     L"follow '[' or to follow "
+                     L"'<' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        switch (ThePreviousCase->ThePreviousCase) {
+        case L'[':
+          push_back_Character(TheStreamedType, Lemma, Character_);
+          continue;
+        case L'<':
+          if (ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_
+                    << L"' immediately following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '>' expected to "
+                       L"follow '[' or to follow "
+                       L"'<' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          ThePreviousCase = PreviousCaseType(Character_);
+          continue;
+        default:
+          std::wstringstream Message;
+          Message << L"unexpected '" << Character_ << L"' following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', '>' expected to "
+                     L"follow '[' or to follow "
+                     L"'<' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        std::abort();
+      case L'#':
+        if (ThePreviousCase) {
+          switch (ThePreviousCase->ThePreviousCase) {
+          case L'[':
+          case L']':
+          case L'$':
+            push_back_Character(TheStreamedType, Lemma, Character_);
+            continue;
+          case L'/':
+            if (ThePreviousCase->isPreviousCharacter) {
+              std::wstringstream Message;
+              Message
+                  << L"unexpected '" << Character_
+                  << L"' immediately following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', '#' expected to follow '[', ']', or '$', to follow "
+                     L"'>' immediately, or to follow '/' not immediately";
+              throw wchar_t_Exception::Stream::UnexpectedCase(
+                  Message_what(Message));
+            }
+
+            break;
+          case L'>':
+            if (!ThePreviousCase->isPreviousCharacter) {
+              std::wstringstream Message;
+              Message
+                  << L"unexpected '" << Character_
+                  << L"' not immediately following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', '#' expected to follow '[', ']', or '$', to follow "
+                     L"'>' immediately, or to follow '/' not immediately";
+              throw wchar_t_Exception::Stream::UnexpectedCase(
+                  Message_what(Message));
+            }
+
+            break;
+          default:
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_ << L"' following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '#' expected to follow '[', ']', or '$', to follow "
+                       L"'>' immediately, or to follow '/' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          ThePreviousCase = PreviousCaseType(Character_);
+          continue;
+        }
+
+        push_back_Character(TheStreamedType, Lemma, Character_);
+        continue;
+      case L'+':
+        if (ThePreviousCase) {
+          switch (ThePreviousCase->ThePreviousCase) {
+          case L'[':
+          case L']':
+          case L'$':
+            push_back_Character(TheStreamedType, Lemma, Character_);
+            continue;
+          case L'>':
+            if (!ThePreviousCase->isPreviousCharacter) {
+              std::wstringstream Message;
+              Message
+                  << L"unexpected '" << Character_
+                  << L"' not immediately following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', '+' expected to follow '[', ']', or '$', to follow "
+                     L"'>' "
+                     L"immediately, or to follow '#' not immediately";
+              throw wchar_t_Exception::Stream::UnexpectedCase(
+                  Message_what(Message));
+            }
+
+            break;
+          case L'#':
+            if (ThePreviousCase->isPreviousCharacter) {
+              std::wstringstream Message;
+              Message
+                  << L"unexpected '" << Character_
+                  << L"' immediately following '"
+                  << ThePreviousCase->ThePreviousCase
+                  << L"', '+' expected to follow '[', ']', or '$', to follow "
+                     L"'>' "
+                     L"immediately, or to follow '#' not immediately";
+              throw wchar_t_Exception::Stream::UnexpectedCase(
+                  Message_what(Message));
+            }
+
+            break;
+          default: {
+            std::wstringstream Message;
+            Message << L"unexpected '" << Character_ << L"' following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', '+' expected to follow '[', ']', or '$', to follow "
+                       L"'>' immediately, or to follow '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+          }
+
+          TheStreamedType.TheLexicalUnit->TheAnalyses.back()
+              .TheMorphemes.push_back(Morpheme());
+          ThePreviousCase = PreviousCaseType(Character_);
+          continue;
+        }
+
+        push_back_Character(TheStreamedType, Lemma, Character_);
+        continue;
+      case L'$':
+        if (!ThePreviousCase) {
+          std::wstringstream Message;
+          Message
+              << L"unexpected '" << Character_
+              << L"', '$' expected to follow '[', to follow '>' immediately, "
+                 L"or to follow '*' or '#' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        switch (ThePreviousCase->ThePreviousCase) {
+        case L'[':
+          push_back_Character(TheStreamedType, Lemma, Character_);
+          continue;
+        case L'*':
+          if (ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message
+                << L"unexpected '" << Character_ << L"' immediately following '"
+                << ThePreviousCase->ThePreviousCase
+                << L"', '$' expected to follow '[', to follow '>' immediately, "
+                   L"or to follow '*' or '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          if (TheFlags.getDebug()) {
+            if (Lemma != TheStreamedType.TheLexicalUnit->TheSurfaceForm)
+              std::wcerr << L"unexpected lemma \"" << Lemma
+                         << L"\", expected \""
+                         << TheStreamedType.TheLexicalUnit->TheSurfaceForm
+                         << L"\"\n";
+          }
+
+          ThePreviousCase = PreviousCaseType(Character_);
+          return TheStreamedType;
+        case L'>':
+          if (!ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message
+                << L"unexpected '" << Character_
+                << L"' not immediately following '"
+                << ThePreviousCase->ThePreviousCase
+                << L"', '$' expected to follow '[', to follow '>' immediately, "
+                   L"or to follow '*' or '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          break;
+        case L'#':
+          if (ThePreviousCase->isPreviousCharacter) {
+            std::wstringstream Message;
+            Message
+                << L"unexpected '" << Character_ << L"' immediately following '"
+                << ThePreviousCase->ThePreviousCase
+                << L"', '$' expected to follow '[', to follow '>' immediately, "
+                   L"or to follow '*' or '#' not immediately";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+
+          break;
+        default:
+          std::wstringstream Message;
+          Message
+              << L"unexpected '" << Character_ << L"' following '"
+              << ThePreviousCase->ThePreviousCase
+              << L"', '$' expected to follow '[', to follow '>' immediately, "
+                 L"or to follow '*' or '#' not immediately";
+          throw wchar_t_Exception::Stream::UnexpectedCase(
+              Message_what(Message));
+        }
+
+        ThePreviousCase = PreviousCaseType(Character_);
+        return TheStreamedType;
+      case L'\n':
+        if (ThePreviousCase) {
+          switch (ThePreviousCase->ThePreviousCase) {
+          case L'[':
+          case L']':
+          case L'$':
+            break;
+          default:
+            std::wstringstream Message;
+            Message << L"unexpected newline following '"
+                    << ThePreviousCase->ThePreviousCase
+                    << L"', newline expected to follow '[', ']', or '$'";
+            throw wchar_t_Exception::Stream::UnexpectedCase(
+                Message_what(Message));
+          }
+        }
+
+        push_back_Character(TheStreamedType, Lemma, Character_);
+        ++TheLineNumber;
+        TheLine.clear();
+        continue;
+      default:
+        push_back_Character(TheStreamedType, Lemma, Character_);
+        continue;
+      }
+
+      std::abort();
+    }
+  }
+
+  if (ThePreviousCase) {
+    switch (ThePreviousCase->ThePreviousCase) {
+    case L']':
+    case L'$':
+      break;
+    default:
+      std::wstringstream Message;
+      Message << L"unexpected end-of-file following '"
+              << ThePreviousCase->ThePreviousCase
+              << L"', end-of-file expected to follow ']' "
+                 L"or '$'";
+      throw wchar_t_Exception::Stream::UnexpectedEndOfFile(
+          Message_what(Message));
+    }
+  }
+
+  return TheStreamedType;
+}
+
+bool Stream::flush_() const { return private_flush_; }
+
+Stream::PreviousCaseType::PreviousCaseType(const wchar_t &PreviousCase_)
+    : ThePreviousCase(PreviousCase_), isPreviousCharacter(true) {}
+
+bool Stream::is_eof_throw_if_not_TheCharacterStream_good() const {
+  if (TheCharacterStream.eof())
+    return true;
+
+  if (!TheCharacterStream) {
+    std::wstringstream Message;
+    Message << L"can't get const wchar_t: TheCharacterStream not good";
+    throw wchar_t_Exception::Stream::TheCharacterStream_not_good(
+        Message_what(Message));
+  }
+
+  return false;
+}
+
+std::wstring Stream::Message_what(const std::wstringstream &Message) const {
+  std::wstringstream what_;
+
+  if (TheFilename)
+    what_ << std::wstring(TheFilename->begin(), TheFilename->end()) << L": ";
+
+  what_ << TheLineNumber << L":" << TheLine.size() << L": " << Message.str()
+        << L'\n' << TheLine << L'\n' << std::wstring(TheLine.size() - 1, L' ')
+        << L'^';
+  return what_.str();
+}
+
+bool
+Stream::is_eof_throw_if_not_TheCharacterStream_good(StreamedType &StreamedType_,
+                                                    std::wstring &Lemma,
+                                                    const wchar_t &Character_) {
+  if (isTheCharacterStream_eof(StreamedType_, Lemma, Character_))
+    return true;
+
+  if (!TheCharacterStream) {
+    std::wstringstream Message;
+    Message << L"can't get const wchar_t: TheCharacterStream not good";
+    throw wchar_t_Exception::Stream::TheCharacterStream_not_good(
+        Message_what(Message));
+  }
+
+  return false;
+}
+
+bool Stream::isTheCharacterStream_eof(StreamedType &StreamedType_,
+                                      std::wstring &Lemma,
+                                      const wchar_t &Character_) {
+  if (TheCharacterStream.eof())
+    return true;
+
+  if (TheFlags.getNullFlush()) {
+    if (Character_ == L'\0') {
+      push_back_Character(StreamedType_, Lemma, Character_);
+      private_flush_ = true;
+      return true;
+    }
+  }
+
+  return false;
+}
+
+void Stream::push_back_Character(StreamedType &StreamedType_,
+                                 std::wstring &Lemma,
+                                 const wchar_t &Character_) {
+  if (ThePreviousCase) {
+    switch (ThePreviousCase->ThePreviousCase) {
+    case L'[':
+      StreamedType_.TheString += Character_;
+      break;
+    case L']':
+      StreamedType_.TheString += Character_;
+      break;
+    case L'^':
+      StreamedType_.TheLexicalUnit->TheSurfaceForm += Character_;
+      break;
+    case L'/':
+      StreamedType_.TheLexicalUnit->TheAnalyses.back()
+          .TheMorphemes.back()
+          .TheLemma.push_back(Character_);
+      break;
+    case L'*':
+      Lemma += Character_;
+      break;
+    case L'<':
+      StreamedType_.TheLexicalUnit->TheAnalyses.back()
+          .TheMorphemes.back()
+          .TheTags.back()
+          .TheTag += Character_;
+      break;
+    case L'>': {
+      std::wstringstream Message;
+      Message << L"unexpected '" << Character_ << L"' immediately following '"
+              << ThePreviousCase->ThePreviousCase << L"'";
+      throw wchar_t_Exception::Stream::UnexpectedCharacter(
+          Message_what(Message));
+    }
+    case L'#':
+      StreamedType_.TheLexicalUnit->TheAnalyses.back()
+          .TheMorphemes.back()
+          .TheLemma.push_back(Character_);
+      break;
+    case L'+':
+      StreamedType_.TheLexicalUnit->TheAnalyses.back()
+          .TheMorphemes.back()
+          .TheLemma.push_back(Character_);
+      break;
+    case L'$':
+      StreamedType_.TheString += Character_;
+      break;
+    default:
+      std::wstringstream Message;
+      Message << L"unexpected previous reserved or special character '"
+              << ThePreviousCase->ThePreviousCase << L"'";
+      throw wchar_t_Exception::Stream::UnexpectedPreviousCase(
+          Message_what(Message));
+    }
+
+    ThePreviousCase->isPreviousCharacter = false;
+    return;
+  }
+
+  StreamedType_.TheString += Character_;
+}
+
+void Stream::case_0x5c(StreamedType &StreamedType_, std::wstring &Lemma,
+                       const wchar_t &Character_) {
+  push_back_Character(StreamedType_, Lemma, Character_);
+
+  {
+    const wchar_t Character_ = TheCharacterStream.get();
+
+    if (is_eof_throw_if_not_TheCharacterStream_good(StreamedType_, Lemma,
+                                                    Character_)) {
+      std::wstringstream Message;
+      Message << L"unexpected end-of-file following '\\', end-of-file "
+                 L"expected to follow ']' or '$'";
+      throw wchar_t_Exception::Stream::UnexpectedEndOfFile(
+          Message_what(Message));
+    }
+
+    TheLine.push_back(Character_);
+    push_back_Character(StreamedType_, Lemma, Character_);
+  }
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream.h	(revision 70339)
@@ -0,0 +1,69 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_H
+#define STREAM_H
+
+#include "basic_tagger.h"
+#include "optional.h"
+#include "streamed_type.h"
+
+#include <cstddef>
+#include <istream>
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+class Stream {
+public:
+  Stream(const basic_Tagger::Flags &Flags_);
+  Stream(const basic_Tagger::Flags &Flags_, std::wifstream &CharacterStream_,
+         const char *const Filename_);
+  Stream(const basic_Tagger::Flags &Flags_, std::wifstream &CharacterStream_,
+         const std::string &Filename_);
+  Stream(const basic_Tagger::Flags &Flags_, std::wifstream &CharacterStream_,
+         const std::stringstream &Filename_);
+  StreamedType get();
+  bool flush_() const;
+
+private:
+  class PreviousCaseType {
+  public:
+    PreviousCaseType(const wchar_t &PreviousCase_);
+    wchar_t ThePreviousCase;
+    bool isPreviousCharacter : 1;
+  };
+  bool is_eof_throw_if_not_TheCharacterStream_good() const;
+  std::wstring Message_what(const std::wstringstream &Message) const;
+  bool is_eof_throw_if_not_TheCharacterStream_good(StreamedType &StreamedType_,
+                                                   std::wstring &Lemma,
+                                                   const wchar_t &Character_);
+  bool isTheCharacterStream_eof(StreamedType &StreamedType_,
+                                std::wstring &Lemma, const wchar_t &Character_);
+  void push_back_Character(StreamedType &StreamedType_, std::wstring &Lemma,
+                           const wchar_t &Character_);
+  void case_0x5c(StreamedType &StreamedType_, std::wstring &Lemma,
+                 const wchar_t &Character_);
+  std::wistream &TheCharacterStream;
+  Optional<std::string> TheFilename;
+  std::size_t TheLineNumber;
+  std::wstring TheLine;
+  const basic_Tagger::Flags &TheFlags;
+  bool private_flush_ : 1;
+  Optional<PreviousCaseType> ThePreviousCase;
+};
+}
+
+#endif // STREAM_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger.cc	(revision 70339)
@@ -0,0 +1,68 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "stream_5_3_1_tagger.h"
+
+#include "apertium_config.h"
+
+#include "analysis.h"
+#include "deserialiser.h"
+#include "lexical_unit.h"
+#include "stream.h"
+#include "streamed_type.h"
+
+#include <cstddef>
+#include <istream>
+#include <map>
+#include <ostream>
+
+#if ENABLE_DEBUG
+
+#include <sstream>
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+Stream_5_3_1_Tagger::Stream_5_3_1_Tagger(const Flags &Flags_)
+    : basic_5_3_1_Tagger(), basic_StreamTagger(Flags_) {}
+
+void Stream_5_3_1_Tagger::deserialise(std::istream &Serialised_basic_Tagger) {
+  Model = Deserialiser<std::map<Analysis, std::size_t> >::deserialise(
+      Serialised_basic_Tagger);
+}
+
+long double Stream_5_3_1_Tagger::score(const Analysis &Analysis_) const {
+  return tokenCount_T(Analysis_);
+}
+
+long double Stream_5_3_1_Tagger::tokenCount_T(const Analysis &Analysis_) const {
+  if (Model.find(Analysis_) == Model.end())
+    return 1;
+
+  return 1 + Model.find(Analysis_)->second;
+}
+
+#if ENABLE_DEBUG
+
+std::wstring Stream_5_3_1_Tagger::score_DEBUG(const Analysis &Analysis_) const {
+  std::wstringstream score_DEBUG_;
+  score_DEBUG_ << tokenCount_T(Analysis_);
+  return score_DEBUG_.str();
+}
+
+#endif // ENABLE_DEBUG
+
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger.h	(revision 70339)
@@ -0,0 +1,53 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_5_3_1_TAGGER_H
+#define STREAM_5_3_1_TAGGER_H
+
+#include "apertium_config.h"
+
+#include "analysis.h"
+#include "basic_5_3_1_tagger.h"
+#include "basic_stream_tagger.h"
+
+#include <istream>
+
+#if ENABLE_DEBUG
+
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+class Stream_5_3_1_Tagger : private basic_5_3_1_Tagger,
+                            public basic_StreamTagger {
+public:
+  Stream_5_3_1_Tagger(const Flags &Flags_);
+  void deserialise(std::istream &Serialised_basic_Tagger);
+
+private:
+  long double score(const Analysis &Analysis_) const;
+  long double tokenCount_T(const Analysis &Analysis_) const;
+
+#if ENABLE_DEBUG
+
+  std::wstring score_DEBUG(const Analysis &Analysis_) const;
+
+#endif // ENABLE_DEBUG
+
+};
+}
+
+#endif // STREAM_5_3_1_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger_trainer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger_trainer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_1_tagger_trainer.h	(revision 70339)
@@ -0,0 +1,41 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_5_3_1_TAGGER_TRAINER_H
+#define STREAM_5_3_1_TAGGER_TRAINER_H
+
+#include "basic_5_3_1_tagger.h"
+#include "basic_stream_tagger_trainer.h"
+
+#include "analysis.h"
+#include "stream.h"
+
+#include <ostream>
+
+namespace Apertium {
+class Stream_5_3_1_TaggerTrainer : private basic_5_3_1_Tagger,
+                                   public basic_StreamTaggerTrainer {
+public:
+  Stream_5_3_1_TaggerTrainer(const Flags &Flags_);
+  void serialise(std::ostream &Serialised_basic_Tagger) const;
+
+private:
+  void train_Analysis(const Analysis &Analysis_,
+                      const std::size_t &Coefficient_);
+  void multiplyModel(const std::size_t &OccurrenceCoefficientMultiplier);
+};
+}
+
+#endif // STREAM_5_3_1_TAGGER_TRAINER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger.cc	(revision 70339)
@@ -0,0 +1,104 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "stream_5_3_2_tagger.h"
+
+#include "apertium_config.h"
+
+#include "a.h"
+#include "analysis.h"
+#include "deserialiser.h"
+#include "lemma.h"
+
+#include <cstddef>
+#include <istream>
+#include <map>
+
+#if ENABLE_DEBUG
+
+#include <sstream>
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+Stream_5_3_2_Tagger::Stream_5_3_2_Tagger(const Flags &Flags_)
+    : basic_5_3_2_Tagger(), basic_StreamTagger(Flags_) {}
+
+void Stream_5_3_2_Tagger::deserialise(std::istream &Serialised_basic_Tagger) {
+  Model =
+      Deserialiser<std::map<a, std::map<Lemma, std::size_t> > >::deserialise(
+          Serialised_basic_Tagger);
+}
+
+long double Stream_5_3_2_Tagger::score(const Analysis &Analysis_) const {
+  return (tokenCount_r_a(Analysis_) * tokenCount_a(Analysis_)) /
+         (tokenCount_a(Analysis_) + typeCount_a(Analysis_));
+}
+
+long double
+Stream_5_3_2_Tagger::tokenCount_r_a(const Analysis &Analysis_) const {
+  if (Model.find(a(Analysis_)) == Model.end())
+    return 1;
+
+  if (Model.find(a(Analysis_))->second.find(Lemma(Analysis_)) ==
+      Model.find(a(Analysis_))->second.end())
+    return 1;
+
+  return 1 + Model.find(a(Analysis_))->second.find(Lemma(Analysis_))->second;
+}
+
+long double Stream_5_3_2_Tagger::tokenCount_a(const Analysis &Analysis_) const {
+  if (Model.find(a(Analysis_)) == Model.end())
+    return 1;
+
+  long double tokenCount_a_ = 1;
+
+  for (std::map<Lemma, std::size_t>::const_iterator Lemma_ =
+           Model.find(a(Analysis_))->second.begin();
+       Lemma_ != Model.find(a(Analysis_))->second.end(); ++Lemma_) {
+    tokenCount_a_ += Lemma_->second;
+  }
+
+  return tokenCount_a_;
+}
+
+long double Stream_5_3_2_Tagger::typeCount_a(const Analysis &Analysis_) const {
+  if (Model.find(a(Analysis_)) == Model.end())
+    return 1;
+
+  return (Model.find(a(Analysis_))->second.find(Lemma(Analysis_)) ==
+                  Model.find(a(Analysis_))->second.end()
+              ? 1
+              : 0) +
+         Model.find(a(Analysis_))->second.size();
+}
+
+#if ENABLE_DEBUG
+
+std::wstring Stream_5_3_2_Tagger::score_DEBUG(const Analysis &Analysis_) const {
+  std::wstringstream score_DEBUG_;
+
+  score_DEBUG_ << L"(" << tokenCount_r_a(Analysis_) << L" * "
+               << tokenCount_a(Analysis_) << L") /\n    ("
+               << tokenCount_a(Analysis_) << L" + " << typeCount_a(Analysis_)
+               << L")";
+
+  return score_DEBUG_.str();
+}
+
+#endif // ENABLE_DEBUG
+
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger.h	(revision 70339)
@@ -0,0 +1,55 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_5_3_2_TAGGER_H
+#define STREAM_5_3_2_TAGGER_H
+
+#include "apertium_config.h"
+
+#include "analysis.h"
+#include "basic_5_3_2_tagger.h"
+#include "basic_stream_tagger.h"
+
+#include <istream>
+
+#if ENABLE_DEBUG
+
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+class Stream_5_3_2_Tagger : private basic_5_3_2_Tagger,
+                            public basic_StreamTagger {
+public:
+  Stream_5_3_2_Tagger(const Flags &Flags_);
+  void deserialise(std::istream &Serialised_basic_Tagger);
+
+private:
+  long double score(const Analysis &Analysis_) const;
+  long double tokenCount_r_a(const Analysis &Analysis_) const;
+  long double tokenCount_a(const Analysis &Analysis_) const;
+  long double typeCount_a(const Analysis &Analysis_) const;
+
+#if ENABLE_DEBUG
+
+  std::wstring score_DEBUG(const Analysis &Analysis_) const;
+
+#endif // ENABLE_DEBUG
+
+};
+}
+
+#endif // STREAM_5_3_2_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger_trainer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger_trainer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_2_tagger_trainer.h	(revision 70339)
@@ -0,0 +1,38 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_5_3_2_TAGGER_TRAINER_H
+#define STREAM_5_3_2_TAGGER_TRAINER_H
+
+#include "basic_5_3_2_tagger.h"
+#include "basic_stream_tagger_trainer.h"
+
+#include <ostream>
+
+namespace Apertium {
+class Stream_5_3_2_TaggerTrainer : private basic_5_3_2_Tagger,
+                                   public basic_StreamTaggerTrainer {
+public:
+  Stream_5_3_2_TaggerTrainer(const Flags &Flags_);
+  void serialise(std::ostream &Serialised_basic_Tagger) const;
+
+private:
+  void train_Analysis(const Analysis &Analysis_,
+                      const std::size_t &Coefficient_);
+  void multiplyModel(const std::size_t &OccurrenceCoefficientMultiplier);
+};
+}
+
+#endif // STREAM_5_3_2_TAGGER_TRAINER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger.cc	(revision 70339)
@@ -0,0 +1,223 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "stream_5_3_3_tagger.h"
+
+#include "apertium_config.h"
+
+#include "analysis.h"
+#include "deserialiser.h"
+#include "i.h"
+#include "lemma.h"
+#include "morpheme.h"
+
+#include <vector>
+
+#if ENABLE_DEBUG
+
+#include <sstream>
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+Stream_5_3_3_Tagger::Stream_5_3_3_Tagger(const Flags &Flags_)
+    : basic_StreamTagger(Flags_) {}
+
+void Stream_5_3_3_Tagger::deserialise(std::istream &Serialised_basic_Tagger) {
+  Model = Deserialiser<
+      std::pair<std::map<i, std::map<Lemma, std::size_t> >,
+                std::pair<std::map<i, std::map<Lemma, std::size_t> >,
+                          std::map<Lemma, std::map<i, std::size_t> > > > >::
+      deserialise(Serialised_basic_Tagger);
+}
+
+long double Stream_5_3_3_Tagger::score(const Analysis &Analysis_) const {
+  long double score = tokenCount_r_i(Analysis_) * tokenCount_i(Analysis_),
+              score_Divisor = tokenCount_i(Analysis_) + typeCount_i(Analysis_);
+
+  for (std::vector<Morpheme>::const_iterator Morpheme_ =
+           Analysis_.TheMorphemes.begin() + 1;
+       Morpheme_ != Analysis_.TheMorphemes.end(); ++Morpheme_) {
+    score *= tokenCount_d_i_Morpheme(Lemma(*Morpheme_), i(*(Morpheme_ - 1))) *
+             tokenCount_i_d_Morpheme(i(*Morpheme_), Lemma(*Morpheme_));
+    score_Divisor *=
+        (tokenCount_i_Morpheme(i(*(Morpheme_ - 1))) +
+         typeCount_i_Morpheme(i(*(Morpheme_ - 1)), Lemma(*Morpheme_))) *
+        (tokenCount_d_Morpheme(Lemma(*Morpheme_)) +
+         typeCount_d_Morpheme(Lemma(*Morpheme_), i(*Morpheme_)));
+  }
+
+  return score / score_Divisor;
+}
+
+long double
+Stream_5_3_3_Tagger::tokenCount_r_i(const Analysis &Analysis_) const {
+  if (Model.first.find(i(Analysis_)) == Model.first.end())
+    return 1;
+
+  if (Model.first.find(i(Analysis_))->second.find(Lemma(Analysis_)) ==
+      Model.first.find(i(Analysis_))->second.end())
+    return 1;
+
+  return 1 +
+         Model.first.find(i(Analysis_))->second.find(Lemma(Analysis_))->second;
+}
+
+long double Stream_5_3_3_Tagger::tokenCount_i(const Analysis &Analysis_) const {
+  if (Model.first.find(i(Analysis_)) == Model.first.end())
+    return 1;
+
+  long double tokenCount_i_ = 1;
+
+  for (std::map<Lemma, std::size_t>::const_iterator Lemma_ =
+           Model.first.find(i(Analysis_))->second.begin();
+       Lemma_ != Model.first.find(i(Analysis_))->second.end(); ++Lemma_) {
+    tokenCount_i_ += Lemma_->second;
+  }
+
+  return tokenCount_i_;
+}
+
+long double Stream_5_3_3_Tagger::typeCount_i(const Analysis &Analysis_) const {
+  if (Model.first.find(i(Analysis_)) == Model.first.end())
+    return 1;
+
+  return (Model.first.find(i(Analysis_))->second.find(Lemma(Analysis_)) ==
+                  Model.first.find(i(Analysis_))->second.end()
+              ? 1
+              : 0) +
+         Model.first.find(i(Analysis_))->second.size();
+}
+
+long double Stream_5_3_3_Tagger::tokenCount_d_i_Morpheme(const Lemma &Lemma_,
+                                                         const i &i_) const {
+  if (Model.second.first.find(i_) == Model.second.first.end())
+    return 1;
+
+  if (Model.second.first.find(i_)->second.find(Lemma_) ==
+      Model.second.first.find(i_)->second.end())
+    return 1;
+
+  return 1 + Model.second.first.find(i_)->second.find(Lemma_)->second;
+}
+
+long double
+Stream_5_3_3_Tagger::tokenCount_i_d_Morpheme(const i &i_,
+                                             const Lemma &Lemma_) const {
+  if (Model.second.second.find(Lemma_) == Model.second.second.end())
+    return 1;
+
+  if (Model.second.second.find(Lemma_)->second.find(i_) ==
+      Model.second.second.find(Lemma_)->second.end())
+    return 1;
+
+  return 1 + Model.second.second.find(Lemma_)->second.find(i_)->second;
+}
+
+long double Stream_5_3_3_Tagger::tokenCount_i_Morpheme(const i &i_) const {
+  if (Model.second.first.find(i_) == Model.second.first.end())
+    return 1;
+
+  long double typeCount_i_Morpheme_ = 1;
+
+  for (std::map<Lemma, std::size_t>::const_iterator Lemma_ =
+           Model.second.first.find(i_)->second.begin();
+       Lemma_ != Model.second.first.find(i_)->second.end(); ++Lemma_) {
+    typeCount_i_Morpheme_ += Lemma_->second;
+  }
+
+  return typeCount_i_Morpheme_;
+}
+
+long double
+Stream_5_3_3_Tagger::typeCount_i_Morpheme(const i &i_,
+                                          const Lemma &Lemma_) const {
+  if (Model.second.first.find(i_) == Model.second.first.end())
+    return 1;
+
+  return (Model.second.first.find(i_)->second.find(Lemma_) ==
+                  Model.second.first.find(i_)->second.end()
+              ? 1
+              : 0) +
+         Model.second.first.find(i_)->second.size();
+}
+
+long double
+Stream_5_3_3_Tagger::tokenCount_d_Morpheme(const Lemma &Lemma_) const {
+  if (Model.second.second.find(Lemma_) == Model.second.second.end())
+    return 1;
+
+  long double tokenCount_d_Morpheme_ = 1;
+
+  for (std::map<i, std::size_t>::const_iterator i_ =
+           Model.second.second.find(Lemma_)->second.begin();
+       i_ != Model.second.second.find(Lemma_)->second.end(); ++i_) {
+    tokenCount_d_Morpheme_ += i_->second;
+  }
+
+  return tokenCount_d_Morpheme_;
+}
+
+long double Stream_5_3_3_Tagger::typeCount_d_Morpheme(const Lemma &Lemma_,
+                                                      const i &i_) const {
+  if (Model.second.second.find(Lemma_) == Model.second.second.end())
+    return 1;
+
+  return (Model.second.second.find(Lemma_)->second.find(i_) ==
+                  Model.second.second.find(Lemma_)->second.end()
+              ? 1
+              : 0) +
+         Model.second.second.find(Lemma_)->second.size();
+}
+
+#if ENABLE_DEBUG
+
+std::wstring Stream_5_3_3_Tagger::score_DEBUG(const Analysis &Analysis_) const {
+  std::wstringstream score_DEBUG_;
+
+  score_DEBUG_ << L"(" << tokenCount_r_i(Analysis_) << L" * "
+               << tokenCount_i(Analysis_);
+
+  for (std::vector<Morpheme>::const_iterator Morpheme_ =
+           Analysis_.TheMorphemes.begin() + 1;
+       Morpheme_ != Analysis_.TheMorphemes.end(); ++Morpheme_) {
+    score_DEBUG_ << L" * " << tokenCount_d_i_Morpheme(Lemma(*Morpheme_),
+                                                      i(*(Morpheme_ - 1)))
+                 << L" * "
+                 << tokenCount_i_d_Morpheme(i(*Morpheme_), Lemma(*Morpheme_));
+  }
+
+  score_DEBUG_ << L") /\n    [(" << tokenCount_i(Analysis_) << L" + "
+               << typeCount_i(Analysis_) << L")";
+
+  for (std::vector<Morpheme>::const_iterator Morpheme_ =
+           Analysis_.TheMorphemes.begin() + 1;
+       Morpheme_ != Analysis_.TheMorphemes.end(); ++Morpheme_) {
+    score_DEBUG_ << L" * (" << tokenCount_i_Morpheme(i(*(Morpheme_ - 1)))
+                 << L" + "
+                 << typeCount_i_Morpheme(i(*(Morpheme_ - 1)), Lemma(*Morpheme_))
+                 << L") * (" << tokenCount_d_Morpheme(Lemma(*Morpheme_))
+                 << L" + "
+                 << typeCount_d_Morpheme(Lemma(*Morpheme_), i(*Morpheme_))
+                 << L")";
+  }
+
+  score_DEBUG_ << L"]";
+  return score_DEBUG_.str();
+}
+
+#endif // ENABLE_DEBUG
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger.h	(revision 70339)
@@ -0,0 +1,62 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_5_3_3_TAGGER_H
+#define STREAM_5_3_3_TAGGER_H
+
+#include "apertium_config.h"
+
+#include "analysis.h"
+#include "basic_5_3_3_tagger.h"
+#include "basic_stream_tagger.h"
+#include "i.h"
+#include "lemma.h"
+
+#include <istream>
+
+#if ENABLE_DEBUG
+
+#include <string>
+
+#endif // ENABLE_DEBUG
+
+namespace Apertium {
+class Stream_5_3_3_Tagger : private basic_5_3_3_Tagger,
+                            public basic_StreamTagger {
+public:
+  Stream_5_3_3_Tagger(const Flags &Flags_);
+  void deserialise(std::istream &Serialised_basic_Tagger);
+
+private:
+  long double score(const Analysis &Analysis_) const;
+  long double tokenCount_r_i(const Analysis &Analysis_) const;
+  long double tokenCount_i(const Analysis &Analysis_) const;
+  long double typeCount_i(const Analysis &Analysis_) const;
+  long double tokenCount_d_i_Morpheme(const Lemma &Lemma_, const i &i_) const;
+  long double tokenCount_i_d_Morpheme(const i &i_, const Lemma &Lemma_) const;
+  long double tokenCount_i_Morpheme(const i &i_) const;
+  long double typeCount_i_Morpheme(const i &i_, const Lemma &Lemma_) const;
+  long double tokenCount_d_Morpheme(const Lemma &Lemma_) const;
+  long double typeCount_d_Morpheme(const Lemma &Lemma_, const i &i_) const;
+
+#if ENABLE_DEBUG
+
+  std::wstring score_DEBUG(const Analysis &Analysis_) const;
+
+#endif // ENABLE_DEBUG
+};
+}
+
+#endif // STREAM_5_3_3_TAGGER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger_trainer.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger_trainer.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/stream_5_3_3_tagger_trainer.h	(revision 70339)
@@ -0,0 +1,39 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAM_5_3_3_TAGGER_TRAINER_H
+#define STREAM_5_3_3_TAGGER_TRAINER_H
+
+#include "analysis.h"
+#include "basic_5_3_3_tagger.h"
+#include "basic_stream_tagger_trainer.h"
+
+#include <ostream>
+
+namespace Apertium {
+class Stream_5_3_3_TaggerTrainer : private basic_5_3_3_Tagger,
+                                   public basic_StreamTaggerTrainer {
+public:
+  Stream_5_3_3_TaggerTrainer(const Flags &Flags_);
+  void serialise(std::ostream &Serialised_basic_Tagger) const;
+
+private:
+  void train_Analysis(const Analysis &Analysis_,
+                      const std::size_t &Coefficient_);
+  void multiplyModel(const std::size_t &OccurrenceCoefficientMultiplier);
+};
+}
+
+#endif // STREAM_5_3_3_TAGGER_TRAINER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/streamed_type.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/streamed_type.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/streamed_type.h	(revision 70339)
@@ -0,0 +1,32 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef STREAMED_TYPE_H
+#define STREAMED_TYPE_H
+
+#include "lexical_unit.h"
+#include "optional.h"
+
+#include <string>
+
+namespace Apertium {
+class StreamedType {
+public:
+  std::wstring TheString;
+  Optional<LexicalUnit> TheLexicalUnit;
+};
+}
+
+#endif // STREAMED_TYPE_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tag.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tag.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tag.cc	(revision 70339)
@@ -0,0 +1,34 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "tag.h"
+
+#include "exception.h"
+
+#include <string>
+
+namespace Apertium {
+bool operator==(const Tag &a, const Tag &b) { return a.TheTag == b.TheTag; }
+
+bool operator<(const Tag &a, const Tag &b) { return a.TheTag < b.TheTag; }
+
+Tag::operator std::wstring() const {
+  if (TheTag.empty())
+    throw Exception::Tag::TheTags_empty("can't convert Tag comprising empty "
+                                        "TheTag std::wstring to std::wstring");
+
+  return L"<" + TheTag + L">";
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tag.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tag.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tag.h	(revision 70339)
@@ -0,0 +1,31 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef TAG_H
+#define TAG_H
+
+#include <string>
+
+namespace Apertium {
+class Tag {
+public:
+  friend bool operator==(const Tag &a, const Tag &b);
+  friend bool operator<(const Tag &a, const Tag &b);
+  operator std::wstring() const;
+  std::wstring TheTag;
+};
+}
+
+#endif // TAG_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception.h	(revision 70339)
@@ -0,0 +1,53 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef WCHAR_T_EXCEPTION_H
+#define WCHAR_T_EXCEPTION_H
+
+#include "wchar_t_exception_type.h"
+
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+namespace wchar_t_Exception {
+
+#define WCHAR_T_EXCEPTION(WCHAR_T_EXCEPTION_TYPE)                              \
+  class WCHAR_T_EXCEPTION_TYPE : public ::Apertium::wchar_t_ExceptionType {    \
+  public:                                                                      \
+    WCHAR_T_EXCEPTION_TYPE(const wchar_t *wchar_t_what_)                       \
+        : wchar_t_ExceptionType(wchar_t_what_) {}                              \
+    WCHAR_T_EXCEPTION_TYPE(const std::wstring &wchar_t_what_)                  \
+        : wchar_t_ExceptionType(wchar_t_what_) {}                              \
+    WCHAR_T_EXCEPTION_TYPE(const std::wstringstream &wchar_t_what_)            \
+        : wchar_t_ExceptionType(wchar_t_what_) {}                              \
+    ~WCHAR_T_EXCEPTION_TYPE() throw() {}                                       \
+  };
+
+namespace Stream {
+WCHAR_T_EXCEPTION(TheCharacterStream_not_good)
+WCHAR_T_EXCEPTION(UnexpectedAnalysis)
+WCHAR_T_EXCEPTION(UnexpectedCase)
+WCHAR_T_EXCEPTION(UnexpectedCharacter)
+WCHAR_T_EXCEPTION(UnexpectedEndOfFile)
+WCHAR_T_EXCEPTION(UnexpectedLemma)
+WCHAR_T_EXCEPTION(UnexpectedPreviousCase)
+}
+
+#undef WCHAR_T_EXCEPTION
+}
+}
+
+#endif // WCHAR_T_EXCEPTION_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception_type.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception_type.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception_type.cc	(revision 70339)
@@ -0,0 +1,90 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#include "wchar_t_exception_type.h"
+
+#include "exception.h"
+
+#include <algorithm>
+#include <cerrno>
+#include <cstdlib>
+#include <cstring>
+#include <cwchar>
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+void swap(wchar_t_ExceptionType &a, wchar_t_ExceptionType &b) {
+  using std::swap;
+
+  swap(a.what_, b.what_);
+}
+
+wchar_t_ExceptionType::wchar_t_ExceptionType(const wchar_t *wchar_t_what_)
+    : what_(new char[size(wchar_t_what_)]) {
+  constructor(wchar_t_what_);
+}
+
+wchar_t_ExceptionType::wchar_t_ExceptionType(const std::wstring &wchar_t_what_)
+    : what_(new char[size(wchar_t_what_.c_str())]) {
+  constructor(wchar_t_what_.c_str());
+}
+
+wchar_t_ExceptionType::wchar_t_ExceptionType(
+    const std::wstringstream &wchar_t_what_)
+    : what_(new char[size(wchar_t_what_.str().c_str())]) {
+  constructor(wchar_t_what_.str().c_str());
+}
+
+wchar_t_ExceptionType::wchar_t_ExceptionType(
+    const wchar_t_ExceptionType &wchar_t_ExceptionType_)
+    : what_(new char[std::strlen(wchar_t_ExceptionType_.what_) + 1]) {
+  std::strcpy(what_, wchar_t_ExceptionType_.what_);
+}
+
+wchar_t_ExceptionType &wchar_t_ExceptionType::
+operator=(wchar_t_ExceptionType wchar_t_ExceptionType_) {
+  swap(*this, wchar_t_ExceptionType_);
+  return *this;
+}
+
+wchar_t_ExceptionType::~wchar_t_ExceptionType() throw() { delete[] what_; }
+
+const char *wchar_t_ExceptionType::what() const throw() { return what_; }
+
+std::size_t wchar_t_ExceptionType::size(const wchar_t *wchar_t_what_) {
+  std::mbstate_t ps = {0};
+  errno = 0;
+  std::size_t size_ = std::wcsrtombs(NULL, &wchar_t_what_, 0, &ps);
+
+  if (errno == EILSEQ)
+    throw Exception::wchar_t_ExceptionType::EILSEQ_(
+        "can't convert const wchar_t *wchar_t_what_ to char * : unexpected "
+        "wide character");
+
+  return size_ + 1;
+}
+
+void wchar_t_ExceptionType::constructor(const wchar_t *wchar_t_what_) {
+  std::mbstate_t ps = {0};
+  errno = 0;
+  std::wcsrtombs(what_, &wchar_t_what_, size(wchar_t_what_), &ps);
+
+  if (errno == EILSEQ)
+    throw Exception::wchar_t_ExceptionType::EILSEQ_(
+        "can't convert const wchar_t *const wchar_t_what_ to char *what_: "
+        "unexpected wide character");
+}
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception_type.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception_type.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/wchar_t_exception_type.h	(revision 70339)
@@ -0,0 +1,45 @@
+// Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+//
+// This program is free software; you can redistribute it and/or
+// modify it under the terms of the GNU General Public License as
+// published by the Free Software Foundation; either version 2 of the
+// License, or (at your option) any later version.
+//
+// This program is distributed in the hope that it will be useful, but
+// WITHOUT ANY WARRANTY; without even the implied warranty of
+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+// General Public License for more details.
+//
+// You should have received a copy of the GNU General Public License
+// along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+#ifndef WCHAR_T_EXCEPTION_TYPE_H
+#define WCHAR_T_EXCEPTION_TYPE_H
+
+#include "basic_exception_type.h"
+
+#include <cstddef>
+#include <sstream>
+#include <string>
+
+namespace Apertium {
+class wchar_t_ExceptionType : public basic_ExceptionType {
+public:
+  friend void swap(wchar_t_ExceptionType &a, wchar_t_ExceptionType &b);
+  wchar_t_ExceptionType(const wchar_t *wchar_t_what_);
+  wchar_t_ExceptionType(const std::wstring &wchar_t_what_);
+  wchar_t_ExceptionType(const std::wstringstream &wchar_t_what_);
+  wchar_t_ExceptionType(const wchar_t_ExceptionType &wchar_t_ExceptionType_);
+  wchar_t_ExceptionType &
+  operator=(wchar_t_ExceptionType wchar_t_ExceptionType_);
+  virtual ~wchar_t_ExceptionType() throw();
+  const char *what() const throw();
+
+private:
+  static std::size_t size(const wchar_t *wchar_t_what_);
+  void constructor(const wchar_t *wchar_t_what_);
+  char *what_;
+};
+}
+
+#endif // WCHAR_T_EXCEPTION_TYPE_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desmediawiki.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desmediawiki.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desmediawiki.1	(revision 70339)
@@ -0,0 +1,46 @@
+.TH apertium-desmediawiki 1 2009-08-30 "" ""
+.SH NAME
+apertium-desmediawiki \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-desmediawiki
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-desmediawiki
+is a processor for mediawiki XML dumps (i.e., those produced using 
+Special:Export. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of a text file and produces output suitable for
+processing with lt-proc. Format information (newlines, tabs, etc.) is enclosed in brackets so that lt-proc treats it as whitespace between words.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "gener" | apertium-destxt | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-deshtml\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated links - [[page|alternative text]], [[link]]s, etc. are not
+supported.
+.PP
+The mediawiki parser has special support for mixing apostrophes and 
+apostrophes as formatting. This is not supported either.
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-header.sh	(revision 70339)
@@ -0,0 +1,660 @@
+# -*- sh-basic-offset: 2 -*-
+
+# Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+
+message ()
+{
+  echo "USAGE: $(basename $0) [-d datadir] [-f format] [-u] <direction> [in [out]]"
+  echo " -d datadir       directory of linguistic data"
+  echo " -f format        one of: txt (default), html, rtf, odt, docx, wxml, xlsx, pptx,"
+  echo "                  xpresstag, html-noent, latex, latex-raw"
+  echo " -a               display ambiguity"
+  echo " -u               don't display marks '*' for unknown words"
+  echo " -n               don't insert period before possible sentence-ends"
+  echo " -m memory.tmx    use a translation memory to recycle translations"
+  echo " -o direction     translation direction using the translation memory,"
+  echo "                  by default 'direction' is used instead"
+  echo " -l               lists the available translation directions and exits"
+  echo " direction        typically, LANG1-LANG2, but see modes.xml in language data"
+  echo " in               input file (stdin by default)"
+  echo " out              output file (stdout by default)"
+  exit 1
+}
+
+list_directions ()
+{
+  for mode in "$DATADIR"/modes/*.mode; do
+    echo "  $(basename "${mode%%.mode}")"
+  done
+}
+
+locale_utf8 ()
+{
+  export LC_CTYPE=$(locale -a|grep -i "utf[.]*8"|head -1);
+  if [ LC_CTYPE = "" ]; then
+    echo "Error: Install an UTF-8 locale in your system";
+    exit 1;
+  fi
+}
+
+locale_latin1 ()
+{
+  export LC_CTYPE=$(locale -a|grep -i -e "8859-1" -e "@euro"|head -1);
+  if [ LC_CTYPE = "" ]; then
+    echo "Error: Install a Latin-1 locale in your system";
+    exit 1;
+  fi
+}
+
+test_zip ()
+{
+  if [ "$(which zip)" = "" ]; then
+    echo "Error: Install 'zip' command in your system";
+    exit 1;
+  fi
+
+  if [ "$(which unzip)" = "" ]; then
+    echo "Error: Install 'unzip' command in your system";
+    exit 1;
+  fi
+}
+
+test_gawk ()
+{
+  GAWK=$(which gawk)
+  if [ "$GAWK" = "" ]; then
+    echo "Error: Install 'gawk' in your system"
+    exit 1
+  fi
+}
+
+
+translate_latex()
+{
+  test_gawk
+
+  if [ "$INFILE" = ""  -o "$INFILE" = /dev/stdin ]; then
+    INFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    cat > "$INFILE"
+    BORRAFICHERO="true"
+  fi
+
+  if [ "$(file -b --mime-encoding "$INFILE")" == "utf-8" ]; then
+    locale_latin1
+  else locale_utf8
+  fi
+
+  "$APERTIUM_PATH/apertium-prelatex" "$INFILE" | \
+    "$APERTIUM_PATH/apertium-utils-fixlatex" | \
+    "$APERTIUM_PATH/apertium-deslatex" ${FORMAT_OPTIONS} | \
+    if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+    then cat;
+    else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+    fi | \
+      if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+      sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+    else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+    fi | \
+      "$APERTIUM_PATH/apertium-relatex"| \
+      awk '{gsub("</CONTENTS-noeos>", "</CONTENTS>"); print;}' | \
+      if [ "$REDIR" == "" ]; then "$APERTIUM_PATH/apertium-postlatex-raw"; else "$APERTIUM_PATH/apertium-postlatex-raw" > "$SALIDA"; fi
+
+    if [ "$BORRAFICHERO" = "true" ]; then
+      rm -Rf "$INFILE"
+    fi
+}
+
+
+translate_latex_raw()
+{
+  test_gawk
+
+  if [ "$INFILE" = "" -o "$INFILE" = /dev/stdin ]; then
+    INFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    cat > "$INFILE"
+    BORRAFICHERO="true"
+  fi
+
+  if [ "$(file -b --mime-encoding "$INFILE")" = "utf-8" ]; then
+    locale_latin1
+  else locale_utf8
+  fi
+
+  "$APERTIUM_PATH/apertium-prelatex" "$INFILE" | \
+    "$APERTIUM_PATH/apertium-utils-fixlatex" | \
+    "$APERTIUM_PATH/apertium-deslatex" ${FORMAT_OPTIONS} | \
+    if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+    then cat;
+    else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+    fi | \
+      if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+      sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+    else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+    fi | \
+      "$APERTIUM_PATH/apertium-relatex"| \
+      awk '{gsub("</CONTENTS-noeos>", "</CONTENTS>"); print;}' | \
+      if [ "$REDIR" == "" ]; then "$APERTIUM_PATH/apertium-postlatex-raw"; else "$APERTIUM_PATH/apertium-postlatex-raw" > "$SALIDA"; fi
+}
+
+
+translate_odt ()
+{
+  INPUT_TMPDIR=$(mktemp -d "$TMPDIR/apertium.XXXXXXXX")
+
+  locale_utf8
+  test_zip
+
+  if [ "$INFILE" = "" ]; then
+    INFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    cat > "$INFILE"
+    BORRAFICHERO="true"
+  fi
+  OTRASALIDA=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+
+  unzip -q -o -d "$INPUT_TMPDIR" "$INFILE"
+  find "$INPUT_TMPDIR" | grep "content\\.xml\\|styles\\.xml" |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  "$APERTIUM_PATH/apertium-desodt" ${FORMAT_OPTIONS} |\
+  if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+  then cat;
+  else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+  fi | \
+    if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+    sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  fi | \
+    "$APERTIUM_PATH/apertium-reodt"|\
+  awk '{punto = index($0, "/>") + 3; cabeza = substr($0, 1, punto-1); cola = substr($0, punto); n1 = substr(cabeza, index(cabeza, "\"")+1); name = substr(n1, 1, index(n1, "\"")-1); gsub("[?]> ", "?>\n", cola); print cola > name;}'
+  VUELVE=$(pwd)
+  cd "$INPUT_TMPDIR"
+  rm -Rf ObjectReplacements
+  zip -q -r - . >"$OTRASALIDA"
+  cd "$VUELVE"
+  rm -Rf "$INPUT_TMPDIR"
+
+  if [ "$BORRAFICHERO" = "true" ]; then
+    rm -Rf "$INFILE";
+  fi
+
+  if [ "$REDIR" == "" ]; then cat "$OTRASALIDA"; else cat "$OTRASALIDA" > "$SALIDA"; fi
+  rm -Rf "$OTRASALIDA"
+  rm -Rf "$TMCOMPFILE"
+}
+
+translate_docx ()
+{
+  INPUT_TMPDIR=$(mktemp -d "$TMPDIR/apertium.XXXXXXXX")
+
+  locale_utf8
+  test_zip
+
+  if [ "$INFILE" = "" ]; then
+    INFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    cat > "$INFILE"
+    BORRAFICHERO="true"
+  fi
+  OTRASALIDA=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+
+  if [ "$UWORDS" = "no" ]; then
+    OPCIONU="-u";
+  else OPCIONU="";
+  fi
+
+  unzip -q -o -d "$INPUT_TMPDIR" "$INFILE"
+
+  for i in $(find "$INPUT_TMPDIR"|grep "xlsx$");
+  do LOCALTEMP=$(mktemp "$TMPDIR/apertium.XXXXXXXX");
+    "$APERTIUM_PATH/apertium" -f xlsx -d "$DATADIR" "$OPCIONU" "$PAIR" <"$i" >"$LOCALTEMP";
+    cp "$LOCALTEMP" "$i";
+    rm "$LOCALTEMP";
+  done;
+
+  find "$INPUT_TMPDIR" | grep "xml" |\
+  grep -v -i \\\(settings\\\|theme\\\|styles\\\|font\\\|rels\\\|docProps\\\) |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  "$APERTIUM_PATH/apertium-deswxml" ${FORMAT_OPTIONS} |\
+  if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+  then cat;
+  else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+  fi | \
+    if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+    sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  fi | \
+    "$APERTIUM_PATH/apertium-rewxml"|\
+  awk '{punto = index($0, "/>") + 3; cabeza = substr($0, 1, punto-1); cola = substr($0, punto); n1 = substr(cabeza, index(cabeza, "\"")+1); name = substr(n1, 1, index(n1, "\"")-1); gsub("[?]> ", "?>\n", cola); print cola > name;}'
+  VUELVE=$(pwd)
+  cd "$INPUT_TMPDIR"
+  zip -q -r - . >"$OTRASALIDA"
+  cd "$VUELVE"
+  rm -Rf "$INPUT_TMPDIR"
+
+  if [ "$BORRAFICHERO" = "true" ]; then
+    rm -Rf "$INFILE";
+  fi
+
+  if [ "$REDIR" == "" ]; then cat "$OTRASALIDA"; else cat "$OTRASALIDA" > "$SALIDA"; fi
+  rm -Rf "$OTRASALIDA"
+  rm -Rf "$TMCOMPFILE"
+}
+
+translate_pptx ()
+{
+  INPUT_TMPDIR=$(mktemp -d "$TMPDIR/apertium.XXXXXXXX")
+
+  locale_utf8
+  test_zip
+
+  if [ "$INFILE" = "" ]; then
+    INFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    cat > "$INFILE"
+    BORRAFICHERO="true"
+  fi
+  OTRASALIDA=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+
+  if [ "$UWORDS" = "no" ]; then
+    OPCIONU="-u";
+  else OPCIONU="";
+  fi
+
+  unzip -q -o -d "$INPUT_TMPDIR" "$INFILE"
+
+  for i in $(find "$INPUT_TMPDIR"|grep "xlsx$"); do
+    LOCALTEMP=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    "$APERTIUM_PATH/apertium" -f xlsx -d "$DATADIR" "$OPCIONU" "$PAIR" <"$i" >"$LOCALTEMP";
+    cp "$LOCALTEMP" "$i"
+    rm "$LOCALTEMP"
+  done;
+
+  find "$INPUT_TMPDIR" | grep "xml$" |\
+  grep "slides\/slide" |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  "$APERTIUM_PATH/apertium-despptx" ${FORMAT_OPTIONS} |\
+  if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+  then cat;
+  else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+  fi | \
+    if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+    sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  fi | \
+    "$APERTIUM_PATH/apertium-repptx" |\
+  awk '{punto = index($0, "/>") + 3; cabeza = substr($0, 1, punto-1); cola = substr($0, punto); n1 = substr(cabeza, index(cabeza, "\"")+1); name = substr(n1, 1, index(n1, "\"")-1); gsub("[?]> ", "?>\n", cola); print cola > name;}'
+  VUELVE=$(pwd)
+  cd "$INPUT_TMPDIR"
+  zip -q -r - . >"$OTRASALIDA"
+  cd "$VUELVE"
+  rm -Rf "$INPUT_TMPDIR"
+
+  if [ "$BORRAFICHERO" = "true" ]; then
+    rm -Rf "$INFILE";
+  fi
+
+  if [ "$REDIR" == "" ]; then cat "$OTRASALIDA"; else cat "$OTRASALIDA" > "$SALIDA"; fi
+  rm -Rf "$OTRASALIDA"
+  rm -Rf "$TMCOMPFILE"
+}
+
+
+translate_xlsx ()
+{
+  INPUT_TMPDIR=$(mktemp -d "$TMPDIR/apertium.XXXXXXXX")
+
+  locale_utf8
+  test_zip
+
+  if [ "$INFILE" = "" ]; then
+    INFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+    cat > "$INFILE"
+    BORRAFICHERO="true"
+  fi
+  OTRASALIDA=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+
+  unzip -q -o -d "$INPUT_TMPDIR" "$INFILE"
+  find "$INPUT_TMPDIR" | grep "sharedStrings.xml" |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  "$APERTIUM_PATH/apertium-desxlsx" ${FORMAT_OPTIONS} |\
+  if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+  then cat;
+  else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+  fi | \
+    if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+    sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  fi | \
+    "$APERTIUM_PATH/apertium-rexlsx" |\
+  awk '{punto = index($0, "/>") + 3; cabeza = substr($0, 1, punto-1); cola = substr($0, punto); n1 = substr(cabeza, index(cabeza, "\"")+1); name = substr(n1, 1, index(n1, "\"")-1); gsub("[?]> ", "?>\n", cola); print cola > name;}'
+  VUELVE=$(pwd)
+  cd "$INPUT_TMPDIR"
+  zip -q -r - . >"$OTRASALIDA"
+  cd "$VUELVE"
+  rm -Rf "$INPUT_TMPDIR"
+
+  if [ "$BORRAFICHERO" = "true" ]; then
+    rm -Rf "$INFILE";
+  fi
+
+  if [ "$REDIR" == "" ]; then cat "$OTRASALIDA"; else cat "$OTRASALIDA" > "$SALIDA"; fi
+  rm -Rf "$OTRASALIDA"
+  rm -Rf "$TMCOMPFILE"
+}
+
+translate_htmlnoent ()
+{
+  "$APERTIUM_PATH/apertium-deshtml" ${FORMAT_OPTIONS} "$INFILE" | \
+    if [ "$TRANSLATION_MEMORY_FILE" = "" ]; then
+    cat
+  else "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE";
+  fi | if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+    sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  else "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+  fi | if [ "$FORMAT" = "none" ]; then
+    if [ "$REDIR" == "" ]; then cat; else cat > "$SALIDA"; fi
+  else if [ "$REDIR" == "" ]; then "$APERTIUM_PATH/apertium-rehtml-noent"; else "$APERTIUM_PATH/apertium-rehtml-noent" > "$SALIDA"; fi
+  fi
+
+  rm -Rf "$TMCOMPFILE"
+}
+
+
+
+
+
+##########################################################
+# Option and argument parsing, setting globals variables #
+##########################################################
+PATH="${APERTIUM_PATH}:${PATH}"
+[[ -z $TMPDIR ]] && TMPDIR=/tmp
+TMCOMPFILE=$(mktemp "$TMPDIR/apertium.XXXXXXXX")
+trap 'rm -Rf "$TMCOMPFILE"' EXIT
+
+# Default values, may be overridden below:
+PAIR=""
+INFILE="/dev/stdin"
+FORMAT="txt"
+DATADIR=$DEFAULT_DIRECTORY
+TRANSLATION_MEMORY_DIRECTION=$PAIR
+LIST_MODES_AND_EXIT=false
+FORMAT_OPTIONS=""
+
+# Skip (but store) non-option arguments that come before options:
+declare -a ARGS_PREOPT
+declare -i OPTIND=1
+while [[ $OPTIND -le $# ]]; do
+  arg=${@:$OPTIND:1}
+  case $arg in
+    -*) break ;;
+    *) ARGS_PREOPT+=($arg); (( OPTIND++ )) ;;
+  esac
+done
+
+
+while getopts ":uahlf:d:m:o:n" opt; do
+  case "$opt" in
+    f) FORMAT=$OPTARG ;;
+    d) DATADIR=$OPTARG ;;
+    m) TRANSLATION_MEMORY_FILE=$OPTARG ;;
+    o) TRANSLATION_MEMORY_DIRECTION=$OPTARG ;;
+    u) UWORDS="no" ;;
+    n) FORMAT_OPTIONS="-n" ;;
+    a) OPTION_TAGGER="-m" ;;
+    l) LIST_MODES_AND_EXIT=true ;;
+    h) message ;;
+    \?) echo "ERROR: Unknown option $OPTARG"; message ;;
+    :) echo "ERROR: $OPTARG requires an argument"; message ;;
+  esac
+done
+shift $(($OPTIND-1))
+
+if $LIST_MODES_AND_EXIT; then list_directions; exit 0; fi
+
+# Restore non-option arguments that came before options back into arg list:
+set -- "${ARGS_PREOPT[@]}" "$@"
+
+case "$#" in
+  3)
+    SALIDA=$3
+    REDIR=">"
+    INFILE=$2
+    PAIR=$1
+    if [[ ! -e "$INFILE" ]]; then
+      echo "Error: file '$INFILE' not found."
+      message
+    fi
+    ;;
+  2)
+    INFILE=$2
+    PAIR=$1
+    if [[ ! -e "$INFILE" ]]; then
+      echo "Error: file '$INFILE' not found."
+      message
+    fi
+    ;;
+  1)
+    PAIR=$1
+    ;;
+  *)
+    message
+    ;;
+esac
+
+
+if [[ -n $TRANSLATION_MEMORY_FILE ]]; then
+  "$APERTIUM_PATH/lt-tmxcomp" "$TRANSLATION_MEMORY_DIRECTION" "$TRANSLATION_MEMORY_FILE" "$TMCOMPFILE" >/dev/null
+  if [ "$?" != "0" ]; then
+    echo "Error: Cannot compile TM '$TRANSLATION_MEMORY_FILE'"
+    echo"   hint: use -o parameter"
+    message
+  fi
+fi
+
+if [[ ! -d "$DATADIR/modes" ]]; then
+  echo "Error: Directory '$DATADIR/modes' does not exist."
+  message
+fi
+
+if [[ ! -e "$DATADIR/modes/$PAIR.mode" ]]; then
+  echo -n "Error: Mode $PAIR does not exist"
+  c=$(find "$DATADIR/modes"|wc -l)
+  if [ "$c" -le 1 ]; then
+    echo "."
+  else
+    echo ". Try one of:"
+    list_directions
+  fi
+  exit 1
+fi
+
+#Parametro opcional, de no estar, lee de la entrada estandar (stdin)
+
+case "$FORMAT" in
+  none)
+    if [ "$UWORDS" = "no" ]; then
+      OPTION="-n";
+    else OPTION="-g";
+    fi
+    ;;
+  txt|rtf|html|xpresstag|mediawiki)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    ;;
+  rtf)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    MILOCALE=$(locale -a|grep -i -v "utf\|^C$\|^POSIX$"|head -1);
+    if [ "$MILOCALE" = "" ]; then
+      echo "Error: Install a ISO-8859-1 compatible locale in your system";
+      exit 1;
+    fi
+    export LC_CTYPE=$MILOCALE
+    ;;
+
+  odt)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_odt
+    exit 0
+    ;;
+  latex)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_latex
+    exit 0
+    ;;
+  latex-raw)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_latex_raw
+    exit 0
+    ;;
+  
+  
+  docx)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_docx
+    exit 0
+    ;;
+  xlsx)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_xlsx
+    exit 0
+    ;;
+  pptx)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_pptx
+    exit 0
+    ;;
+  html-noent)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    translate_htmlnoent
+    exit 0
+    ;;
+  
+  wxml)
+    if [ "$UWORDS" = "no" ]; then OPTION="-n";
+    else OPTION="-g";
+    fi;
+    locale_utf8
+    ;;
+  
+  txtu)
+    FORMAT="txt";
+    OPTION="-n"
+    ;;
+  htmlu)
+    FORMAT="html";
+    OPTION="-n";
+    ;;
+  xpresstagu)
+    FORMAT="xpresstag";
+    OPTION="-n";
+    ;;
+  rtfu)
+    FORMAT="rtf";
+    OPTION="-n";
+    MILOCALE=$(locale -a|grep -i -v "utf\|^C$\|^POSIX$"|head -1);
+    if [ "$MILOCALE" = "" ]; then
+      echo "Error: Install a ISO-8859-1 compatible locale in your system";
+      exit 1;
+    fi
+    export LC_CTYPE=$MILOCALE
+    ;;
+
+  odtu)
+    OPTION="-n"
+    translate_odt
+    exit 0
+    ;;
+
+  docxu)
+    OPTION="-n"
+    translate_docx
+    exit 0
+    ;;
+
+  xlsxu)
+    OPTION="-n"
+    translate_xlsx
+    exit 0
+    ;;
+
+  pptxu)
+    OPTION="-n"
+    translate_pptx
+    exit 0
+    ;;
+
+  wxmlu)
+    OPTION="-n";
+    locale_utf8
+    ;;
+
+
+
+  *) # Por defecto asumimos txt
+    FORMAT="txt"
+    OPTION="-g"
+    ;;
+esac
+
+if [ -z "$REF" ]
+then
+    REF=$FORMAT
+fi
+
+set -e -o pipefail
+
+if [ "$FORMAT" = "none" ]; then
+    cat "$INFILE"
+else
+  "$APERTIUM_PATH/apertium-des$FORMAT" ${FORMAT_OPTIONS} "$INFILE"
+fi | if [ "$TRANSLATION_MEMORY_FILE" = "" ];
+     then
+         cat
+     else
+       "$APERTIUM_PATH/lt-tmxproc" "$TMCOMPFILE"
+     fi | if [ ! -x "$DATADIR/modes/$PAIR.mode" ]; then
+              sh "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+          else
+            "$DATADIR/modes/$PAIR.mode" "$OPTION" "$OPTION_TAGGER"
+          fi | if [ "$FORMAT" = "none" ]; then
+                   if [ "$REDIR" = "" ]; then
+                       cat
+                   else
+                     cat > "$SALIDA"
+                   fi
+               else
+                 if [ "$REDIR" = "" ]; then
+                     "$APERTIUM_PATH/apertium-re$FORMAT"
+                 else
+                   "$APERTIUM_PATH/apertium-re$FORMAT" > "$SALIDA"
+                 fi
+               fi
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/unlocked_cstdio.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/unlocked_cstdio.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/unlocked_cstdio.h	(revision 70339)
@@ -0,0 +1,61 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _APERTIUM_UNLOCKED_CSTDIO_
+#define _APERTIUM_UNLOCKED_CSTDIO_
+
+#include <cstdio>
+
+#if !HAVE_DECL_FPUTS_UNLOCKED
+#define fputs_unlocked fputs
+#endif
+
+#if !HAVE_DECL_FGETC_UNLOCKED 
+#define fgetc_unlocked fgetc
+#endif
+
+#if !HAVE_DECL_FPUTC_UNLOCKED
+#define fputc_unlocked fputc
+#endif
+
+#if !HAVE_DECL_FWRITE_UNLOCKED
+#define fwrite_unlocked fwrite
+#endif
+
+#if !HAVE_DECL_FREAD_UNLOCKED
+#define fread_unlocked fread
+#endif
+
+#if !HAVE_DECL_FGETWC_UNLOCKED
+#define fgetwc_unlocked fgetwc
+#endif
+
+#if !HAVE_DECL_FPUTWC_UNLOCKED
+#define fputwc_unlocked fputwc
+#endif
+
+#if !HAVE_DECL_FPUTWS_UNLOCKED
+#define fputws_unlocked fputws
+#endif
+
+#if !HAVE_MBTOWC
+#include <cwchar>
+inline int wctomb(char *s, wchar_t wc) { return wcrtomb(s,wc,NULL); }
+inline int mbtowc(wchar_t *pwc, const char *s, size_t n) { return mbrtowc(pwc, s, n, NULL); }
+#endif
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor.cc	(revision 70339)
@@ -0,0 +1,1045 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/lextor.h>
+#include <apertium/string_utils.h>
+
+#include <algorithm>
+#include <string>
+#include <cmath>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+
+#define PI 3.14159265358979323846264338327950288
+
+bool LexTor::debug;
+double LexTor::angleth;
+
+LexTor::LexTor() :
+fstpbil(0)
+{
+  lextor_data=NULL;
+  tlmodel=NULL;
+}
+  
+LexTor::LexTor(const LexTor& lt) :
+fstpbil(0)
+{
+  lextor_data=lt.lextor_data;
+  tlmodel=lt.tlmodel;
+}
+  
+LexTor::~LexTor() {
+}
+
+void 
+LexTor::set_lextor_data(LexTorData* ltd) {
+  lextor_data=ltd;
+}
+
+void 
+LexTor::set_tlmodel(LexTorData* tlm) {
+  tlmodel=tlm;
+}
+
+void 
+LexTor::set_bildic(FSTProcessor *fstp) {
+  fstpbil=fstp;
+}
+
+void 
+LexTor::trainwrd(wistream& is, int left, int right, double weigth_exponent) {
+  if (lextor_data==NULL) {
+    wcerr<<L"Error in LexTor::trainwrd, you must call set_lextor_data before training\n";
+    exit(EXIT_FAILURE);
+  }
+
+  lextor_data->ensure_stopwords_ok();
+
+  wcerr<<L"Number of words to take into account on the left side: "<<left<<L"\n";
+  wcerr<<L"Number of words to take into account on the right side: "<<right<<L"\n";
+
+  set<wstring> words2workwith=lextor_data->get_words();
+  set<wstring>::iterator itword;
+
+  map<wstring, COUNT_DATA_TYPE> wordsum;
+
+  wcerr<<L"Words to work with:\n";
+  for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+    wcerr<<*itword<<L"\n";
+  }
+  wcerr<<L"\n";
+
+  is.clear();
+  is.seekg(ios::beg);
+
+  int nw=0;
+
+  map<wstring, map<wstring, COUNT_DATA_TYPE> > context;
+  deque<wstring> buffer;
+  unsigned word_index=(unsigned)left;
+
+  unsigned buffer_max_size=(unsigned)(left+1+right);
+  
+  LexTorWord *ltword;
+  ltword=LexTorWord::next_word(is);
+  while(ltword!=NULL) {
+    if ((++nw%250000)==0)
+      wcerr<<nw<<L" words processed\n";
+      
+    if(debug) {
+      wcerr<<L"Word read from corpus: "<<ltword->get_word_string()
+	  <<L", reduced: "<<lextor_data->reduce(ltword->get_word_string())<<flush;
+      getchar();
+    }
+
+    wstring reduced_word=lextor_data->reduce(ltword->get_word_string());
+
+    if (!lextor_data->is_stopword(reduced_word)) {
+      if (buffer.size()>=buffer_max_size) {
+	buffer.pop_front();
+      }
+      buffer.push_back(reduced_word);
+
+      wordsum[reduced_word]+=1.0;
+
+      //The buffer is already full
+      if (buffer.size()==buffer_max_size) {
+	for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+	  if (buffer[word_index]==(*itword)) {
+	    if(debug) {
+	      wcerr<<L"WINDOW: ";
+	      for (unsigned i=0; i<buffer.size(); i++) {
+		if(i==word_index)
+		  wcerr<<L"[>>>>"<<buffer[i]<<L"<<<<] ";
+		else
+		  wcerr<<L"["<<buffer[i]<<L"] ";
+	      }
+	      wcerr<<L"\n";
+	    }
+
+	    int distance=(-1)*left;
+	    for(unsigned i=0; i<buffer.size(); i++) {
+	      if ((i!=word_index) && (buffer[i]!=(*itword))) {
+		if (debug) {
+		  wcerr<<L"   WORD: ["<<buffer[i]<<L"] ";
+		  wcerr<<L"   DISTANCE: "<<distance<<L" ";
+		  wcerr<<L"   ADDED COUNT: "<<1.0/pow(fabs((double)distance),weigth_exponent)<<L" ";
+		  wcerr<<L"   TO ["<<*itword<<L"]\n";
+		}
+		context[*itword][buffer[i]]+=1.0/pow(fabs((double)distance),weigth_exponent);
+	      }
+	      distance++;
+	    }
+	    if (debug)
+	      getchar();
+	    break;
+	  }
+	}
+      }
+    }
+
+    delete ltword;
+    ltword=LexTorWord::next_word(is);
+  }
+
+  wcerr<<L"Corpus has "<<nw<<L" words\n";
+
+  //Set the count of each word
+  map<wstring, COUNT_DATA_TYPE>::iterator itws;
+  for(itws=wordsum.begin(); itws!=wordsum.end(); itws++) {
+    lextor_data->set_wordcount(itws->first,itws->second);
+    //if(debug) {
+    wcerr<<L"wordcount("<<itws->first<<L") = "<<itws->second<<L"\n";
+    //}
+  }
+
+  //All co-occurrences have been collected. We need to filter them
+  //so as to take into account only the n most frequents
+  for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+    PairStringCountComparer comparer;
+    vector<pair<wstring, COUNT_DATA_TYPE> > context_v;
+    map<wstring, COUNT_DATA_TYPE>::iterator itm;
+
+    while(context[*itword].size()>0) {
+      itm=context[*itword].begin();
+      context_v.push_back(*itm);
+      context[*itword].erase(itm);
+    }
+
+    sort(context_v.begin(), context_v.end(), comparer);
+    wstring w=*itword;
+    lextor_data->set_cooccurrence_context(w, context_v);
+    lextor_data->set_lexchoice_sum(w, wordsum[w]);
+
+    //if (debug) {
+    wcerr<<L"lexchoice_sum("<<w<<L") = "<<wordsum[w]<<L"\n";
+    //}
+  }
+}
+
+void 
+LexTor::trainlch(wistream& is, int left, int right, LexTorData& tlwordmodel, 
+                 FSTProcessor& dic, FSTProcessor& bildic, double weigth_exponent) {
+  if (lextor_data==NULL) {
+    wcerr<<L"Error in LexTor::trainlch, you must call set_lextor_data before training\n";
+    exit(EXIT_FAILURE);
+  }
+
+  lextor_data->ensure_stopwords_ok();
+
+  wcerr<<L"Number of words to take into account on the left side: "<<left<<L"\n";
+  wcerr<<L"Number of words to take into account on the right side: "<<right<<L"\n";
+
+  set<wstring> words2workwith=lextor_data->get_words();
+  set<wstring>::iterator itword;
+
+  map<wstring, COUNT_DATA_TYPE> wordsum;
+  map<wstring, COUNT_DATA_TYPE> lechsum;
+
+  wcerr<<L"Words to work with:\n";
+  for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+    wcerr<<*itword<<L"\n";
+  }
+  wcerr<<L"\n";
+
+  //For a given lexical choice it stores its translation
+  map<wstring, wstring> lexchoice_translation;
+  map<wstring, set<wstring> > lexical_choices_of_word;
+
+  wcerr<<L"Lexical choices:\n";
+  for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+    set<wstring> lexical_choices=lextor_data->get_lexical_choices(*itword);
+    lexical_choices_of_word[*itword]=lexical_choices;
+    set<wstring>::iterator itlch;
+    for(itlch=lexical_choices.begin(); itlch!=lexical_choices.end(); itlch++) {
+      lexchoice_translation[*itlch]=tlwordmodel.reduce(bildic.biltrans(*itlch,false));
+      wcerr<<*itlch<<L", tr:"<<lexchoice_translation[*itlch]<<L"\n";
+    }
+  }
+  wcerr<<L"\n";
+
+
+  is.clear();
+  is.seekg(ios::beg);
+
+  int nw=0;
+
+  map<wstring, map<wstring, COUNT_DATA_TYPE> > context;
+  deque<LexTorWord> buffer;
+
+  int word_index=left;
+  unsigned buffer_max_size=left+right+1;
+
+  LexTorWord *ltword;
+  ltword=LexTorWord::next_word(is,&dic);
+  while(ltword!=NULL) {
+    if (debug) {
+      wcerr<<L"Word read from corpus: "<<ltword->get_word_string()<<L", reduce: "<<lextor_data->reduce(ltword->get_word_string());
+      getchar();
+    }
+    if ((++nw%250000)==0)
+      wcerr<<nw<<L" words processed\n";
+
+    wstring reduced_word=lextor_data->reduce(ltword->get_word_string());
+
+    if (!lextor_data->is_stopword(reduced_word)) {	
+      if (buffer.size()>=buffer_max_size) {
+	buffer.pop_front();
+      }
+      buffer.push_back(*ltword);
+
+      wordsum[reduced_word]+=1.0;
+
+      //The buffer is already full
+      if (buffer.size()==buffer_max_size) {
+
+	wstring reduced_buffer_word=lextor_data->reduce(buffer[word_index].get_word_string());
+
+        for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+	  if (reduced_buffer_word==(*itword)) {
+	    //We translate each word in the context
+	    //Note: Words in the context can also be ambiguous (with more than one lexical choice)
+	    //In that case the count will come from all the possible
+	    //translations 
+        vector <vector<wstring> > translation_buffer(buffer_max_size);
+		vector <wstring> reduced_buffer(buffer_max_size);
+
+	    for (int i=0; i<(int)buffer_max_size; i++) {
+	      reduced_buffer[i]=lextor_data->reduce(buffer[i].get_word_string());	      
+	    }
+
+	    if(debug) {
+	      wcerr<<L"WINDOW: ";
+	      for (unsigned i=0; i<buffer.size(); i++) {
+		if(i==(unsigned)word_index)
+		  wcerr<<L"[>>>>"<<reduced_buffer[i]<<L"<<<<] ";
+		else
+		  wcerr<<L"["<<reduced_buffer[i]<<L"] ";
+	      }
+	      wcerr<<L"\n";
+	      wcerr<<L"TRANSLATED: ";
+	    }
+
+	    for (int i=0; i<(int)buffer_max_size; i++) {
+	      wstring str_translations=L"";
+	      for(int j=0; j<buffer[i].n_lexical_choices(); j++) {
+		wstring aux_tr=buffer[i].translate(bildic,j);
+		if (aux_tr.length()>0) {
+		  wstring tr=tlwordmodel.reduce(aux_tr);
+		  translation_buffer[i].push_back(tr);
+		  str_translations+=tr+L"/";
+		} else {
+		  wcerr<<L"Warning in LexTor::trainlch: translation of ["<<buffer[i].get_word_string()
+		      <<L"] is empty\n";
+		}
+	      }
+	      if (debug) {
+		if (i==word_index)
+		  wcerr<<L"[>>>>"<<str_translations<<L"<<<<] ";
+		else
+		  wcerr<<L"["<<str_translations<<L"] ";
+	      }
+	    }
+
+	    if(debug)
+	      wcerr<<L"\n";
+
+	    set<wstring> lexical_choices=lexical_choices_of_word[*itword];
+	    set<wstring>::iterator itlch;
+
+	    map<wstring, map<wstring, COUNT_DATA_TYPE> > local_context;
+	    map<wstring, COUNT_DATA_TYPE> sumvotes_context;
+
+	    //For each lexical choice the counts from the TL are collected
+	    for(itlch=lexical_choices.begin(); itlch!=lexical_choices.end(); itlch++) {
+	      for (int i=0; i<(int)buffer_max_size; i++) {
+		if ((i!=word_index)&&(reduced_buffer[i]!=(*itword))) {
+		  COUNT_DATA_TYPE target_vote=0;
+
+		  //The counts of the TL co-occurrence model are transferred to the SL. If the SL word is ambiguous
+		  //it will have more than one translation into TL, so we need to normalize using the frequency of words
+		  //in the TL
+		  vector <double> translation_weighs(translation_buffer[i].size());
+		  double sum=0.0;
+		  if (translation_buffer[i].size()>1) {
+		    for(int j=0; j<(int)translation_buffer[i].size(); j++) {
+		      translation_weighs[j]=tlwordmodel.get_lexchoice_sum(translation_buffer[i][j]);
+		      sum+=translation_weighs[j];
+
+		      //!!!!! Para hacer que no tenga en cuenta las polisemicas del contexto
+		      ///////translation_weighs[j]=0;
+		      //!!!!!
+
+		      if (debug) {
+			wcerr<<L"Frequency of translation ["<<translation_buffer[i][j]<<L"] ="
+			    <<translation_weighs[j]<<L"\n";
+		      }
+		    }
+		  } else {
+		    translation_weighs[0]=1;
+		    sum=1;
+		  }
+
+		  for(int j=0; j<(int)translation_buffer[i].size(); j++) {
+		    translation_weighs[j]=translation_weighs[j]/sum;
+		    if (debug) {
+		      wcerr<<L"Weight of translation ["<<translation_buffer[i][j]<<L"] ="
+			  <<translation_weighs[j]<<L"\n";
+		    }
+		  }
+
+		  for(int j=0; j<(int)translation_buffer[i].size(); j++) {
+		    if (lexchoice_translation[*itlch].length()==0) {
+		      wcerr<<L"Error: Translation of lexical choice '"<<*itlch<<L"' is empty\n";
+		    }
+
+		    double aux_vote=0;
+		    //aux_vote=tlwordmodel.vote_from_word(lexchoice_translation[*itlch], 
+		    //				    translation_buffer[i][j])*translation_weighs[j];
+		    if (tlwordmodel.get_wordcount(lexchoice_translation[*itlch])>0) {
+		      aux_vote=(tlwordmodel.vote_from_word(lexchoice_translation[*itlch],translation_buffer[i][j])/
+				tlwordmodel.get_wordcount(lexchoice_translation[*itlch]))*translation_weighs[j];
+		      if (debug) {
+			wcerr<<L"C("<<lexchoice_translation[*itlch]<<L", "<<translation_buffer[i][j]<<L") = "
+			    <<tlwordmodel.vote_from_word(lexchoice_translation[*itlch],translation_buffer[i][j])<<L"\n";
+			wcerr<<L"C("<<lexchoice_translation[*itlch]<<L") = "<<tlwordmodel.get_wordcount(lexchoice_translation[*itlch])<<L"\n";
+		      }
+		    } else {
+		      if (tlwordmodel.vote_from_word(lexchoice_translation[*itlch],translation_buffer[i][j])>0) {
+			wcerr<<L"Error in LexTor::trainlch: TL vote is not null, but its word count is null.\n";
+			wcerr<<L"lexchoice_translation: "<<lexchoice_translation[*itlch]<<L"\n";
+			wcerr<<L"translation_buffer: "<<translation_buffer[i][j]<<L"\n";
+		      }
+		    }
+		    target_vote+=aux_vote;
+
+		    if(debug) {
+		      wcerr<<L"Target vote for ["<<lexchoice_translation[*itlch]
+			  <<L"] from ["<<translation_buffer[i][j]<<L"] = "<<aux_vote<<L"\n";
+		    }
+		  }
+
+		  if (target_vote>0) {
+		    local_context[*itlch][reduced_buffer[i]]+=target_vote;
+		    sumvotes_context[reduced_buffer[i]]+=target_vote;
+		  }
+		}
+	      }
+	    }
+
+	    if (debug) {
+	      wcerr<<L"COUNTS NORMALIZATION\n";
+	    }
+
+	    //Now we normalize the counts and estimate the number of
+	    //times each lexical choice has been seen.
+	    map<wstring, COUNT_DATA_TYPE> local_lexsum;
+	    double local_lexsumsum=0.0;
+	    for(itlch=lexical_choices.begin(); itlch!=lexical_choices.end(); itlch++) {
+	      int distance=(-1)*left;
+	      for (int i=0; i<(int)buffer_max_size; i++) { 
+		if ((i!=word_index)&&(reduced_buffer[i]!=(*itword))) {
+		  if (local_context[*itlch][reduced_buffer[i]]>0) {
+		    double cc=local_context[*itlch][reduced_buffer[i]]/sumvotes_context[reduced_buffer[i]];
+		    double count_to_apply=cc/pow(fabs((double)distance),weigth_exponent);
+		    context[*itlch][reduced_buffer[i]]+=count_to_apply;
+		    if (debug) {
+		      wcerr<<L"Lexical choice: ["<<*itlch
+                          <<L"], context word: ["<<reduced_buffer[i]<<L"], "
+			  <<L"normalize count: "<<cc<<L"\n";
+		      wcerr<<L"Distance: "<<distance<<L", count to apply: "
+			  <<count_to_apply<<L"\n";
+
+		    }
+
+		    local_lexsum[*itlch]+=count_to_apply;
+		    local_lexsumsum+=count_to_apply;
+
+		    if (debug) {
+		      wcerr<<L"local_lexsum["<<*itlch<<L"] = "<<local_lexsum[*itlch]<<L"\n";
+		      wcerr<<L"local_lexsumsum = "<<local_lexsumsum<<L"\n";
+		    }
+
+		  }
+		}
+		distance++;
+	      }
+	    }
+
+	    for(itlch=lexical_choices.begin(); itlch!=lexical_choices.end(); itlch++) {
+	      if ((local_lexsum[*itlch]>0) && (local_lexsumsum>0))
+		lechsum[*itlch]+=local_lexsum[*itlch]/local_lexsumsum;
+	      if (debug) {
+		wcerr<<L"lechsum["<<*itlch<<L"] = "<<lechsum[*itlch]<<L"\n";
+	      }
+	    }
+	    
+
+	    if(debug) {
+	      wcerr<<L"\n";
+	      getchar();
+	    }
+
+	    break;
+	  }
+	}
+      }
+    } 
+
+    delete ltword;
+    ltword=LexTorWord::next_word(is,&dic);
+  }
+  
+  wcerr<<L"Corpus has "<<nw<<L" words\n";
+
+  //Set the count of each word
+  map<wstring, COUNT_DATA_TYPE>::iterator itws;
+  for(itws=wordsum.begin(); itws!=wordsum.end(); itws++) {
+    lextor_data->set_wordcount(itws->first,itws->second);
+    //if(debug) {
+    wcerr<<L"wordcount("<<itws->first<<L") = "<<itws->second<<L"\n";
+    //}
+  }
+
+  //All co-occurrences have been collected. We need to filter them
+  //so as to take into account only the n most frequent
+  for(itword=words2workwith.begin(); itword!=words2workwith.end(); itword++) {
+    set<wstring> lexical_choices=lexical_choices_of_word[*itword];
+    set<wstring>::iterator itlch;
+    for(itlch=lexical_choices.begin(); itlch!=lexical_choices.end(); itlch++) {
+      PairStringCountComparer comparer;
+      vector<pair<wstring, COUNT_DATA_TYPE> > context_v;
+      map<wstring, COUNT_DATA_TYPE>::iterator itm;
+
+      while(context[*itlch].size()>0) {
+	itm=context[*itlch].begin();
+	//wcerr<<itm->first<<L" "<<itm->second<<L"\n";
+	context_v.push_back(*itm);
+	context[*itlch].erase(itm);
+      }
+    
+      sort(context_v.begin(), context_v.end(), comparer);
+      wstring lch=*itlch;
+      lextor_data->set_cooccurrence_context(lch, context_v);
+      //lextor_data->set_lexchoice_sum(lch, tlwordmodel.get_lexchoice_sum(lexchoice_translation[lch]));
+
+      //wcerr<<L"lexchoice_sum("<<lch<<L") = lexchoice_sum_target("<<lexchoice_translation[lch]<<L") ="
+      //    <<tlwordmodel.get_lexchoice_sum(lexchoice_translation[lch])<<L"\n";
+    }
+  } 
+
+  //Set the count of each lexical choice
+  map<wstring, COUNT_DATA_TYPE>::iterator itlcs;
+  for(itlcs=lechsum.begin(); itlcs!=lechsum.end(); itlcs++) {
+    lextor_data->set_lexchoice_sum(itlcs->first,itlcs->second);
+    //if(debug) {
+    wcerr<<L"lexchoice_sum("<<itlcs->first<<L") = "<<itlcs->second<<L"\n";
+    //}
+  }
+
+
+  wcerr<<L"Training done\n"; 
+}
+
+void 
+LexTor::lexical_selector(wistream& is, FSTProcessor &fstp, int left, int right, double weigth_exponent, LexTorEval* lteval) {
+  if (lextor_data==NULL) {
+    wcerr<<L"Error in LexTor::lexical_selector, you must call set_lextor_data before\n";
+    exit(EXIT_FAILURE);
+  }
+
+  deque<LexTorWord> buffer;
+  deque<LexTorWord> window;
+
+  LexTorWord  nullword(L"NULLWORD", &fstp);
+
+  for(int i=0; i<(left+right+1); i++)
+    window.push_back(nullword);
+
+  int retain=0;
+
+  LexTorWord* ltword=NULL;
+  ltword=LexTorWord::next_word(is, &fstp);
+
+  while(ltword) {
+    //wcerr<<L"Word read: "<<ltword->get_word_string()
+    //<<L", reduced: "<<lextor_data->reduce(ltword->get_word_string())<<L" ";
+    //wcerr<<L"# lexical choices: "<<ltword->n_lexical_choices()<<L"\n";
+
+    if (!lextor_data->is_stopword(lextor_data->reduce(ltword->get_word_string()))) { 
+      if (window.size()>=(unsigned)(left+1+right)) 
+	window.pop_front();
+      
+      window.push_back(*ltword);
+
+      if (ltword->n_lexical_choices()>1) {
+	retain++;
+	if (retain>1)
+	  buffer.push_back(*ltword);
+      } else {
+	if (retain>0) 
+	  buffer.push_back(*ltword);
+	else {
+	  wcout<<ltword->get_lexical_choice(-1,true);
+	  if (lteval) 
+	    lteval->evalword(*ltword, -1, lextor_data);
+	}
+      }
+
+      if (window[left].n_lexical_choices()>1) {
+
+	if (debug) {
+	  wcerr<<L"WINDOW: ";
+	  for(int i=0; i<(int)window.size(); i++) {
+	    if(i==left)
+	      wcerr<<L"[>>>>"<<window[i].get_word_string()<<L"<<<<] ";
+	    else
+	      wcerr<<L"["<<window[i].get_word_string()<<L"] ";
+	  }
+	  wcerr<<L"\n";
+	  wcerr<<L"BUFFER: ";
+	  for(int i=0; i<(int)buffer.size(); i++)
+	    wcerr<<L"["<<buffer[i].get_word_string()<<L"] ";
+	  wcerr<<L"\n\n";
+  
+	}
+
+	int winner=estimate_winner_lch(window, left, weigth_exponent);
+
+	wcout<<window[left].get_lexical_choice(winner,true);
+	if (lteval) 
+	  lteval->evalword(window[left], winner, lextor_data);
+	
+	//For debug
+	/*
+	  cout<<L" | ";
+	  for(int j=0; j<window[left].n_lexical_choices(); j++) {
+	  if (j>0)
+	  cout<<L"|";
+	  cout<<window[left].get_lexical_choice(j,false);
+	  }
+	  cout<<L"\n";
+	*/
+
+	//Now those words that were retained must be released
+	if(retain>0) {
+	  while ((buffer.size()>0)&&(buffer[0].n_lexical_choices()==1)) {
+	    wcout<<buffer[0].get_lexical_choice(-1,true);
+	    if (lteval) 
+	      lteval->evalword(buffer[0], -1, lextor_data);
+	    buffer.pop_front();
+	  }
+	  if ((buffer.size()>0)&&(buffer[0].n_lexical_choices()>1))
+	    buffer.pop_front(); 
+
+	  retain--;
+	}
+      } 
+    } else { //It's a stopword
+      if (retain>0) 
+	buffer.push_back(*ltword);
+      else {
+	wcout<<ltword->get_lexical_choice(-1,true);
+	if (lteval) 
+	  lteval->evalword(*ltword, -1, lextor_data);
+      }
+    }
+
+    delete ltword;
+    ltword=LexTorWord::next_word(is, &fstp);
+  }
+
+  if (retain>0) {
+    for(unsigned i=left+1; i<window.size(); i++) {
+      if (window[i].n_lexical_choices()>1) {
+	int winner=estimate_winner_lch(window, i, weigth_exponent);
+
+	wcout<<window[i].get_lexical_choice(winner,true);
+	if (lteval)
+	  lteval->evalword(window[i], winner, lextor_data);
+
+	//For debug
+	/*
+	  cout<<L" | ";
+	  for(int j=0; j<window[i].n_lexical_choices(); j++) {
+	  if (j>0)
+	  cout<<L"|";
+	  cout<<window[i].get_lexical_choice(j,false);
+	  }
+	  cout<<L"\n";
+	*/
+
+	//Now those words that were retained must be released
+	if(retain>0) {
+	  while ((buffer.size()>0)&&(buffer[0].n_lexical_choices()==1)) {
+	    wcout<<buffer[0].get_lexical_choice(-1,true);
+	    if (lteval) 
+	      lteval->evalword(buffer[0], -1, lextor_data);
+	    buffer.pop_front();
+	  }
+	  if ((buffer.size()>0)&&(buffer[0].n_lexical_choices()>1))
+	    buffer.pop_front(); 
+
+	  retain--;
+	}
+
+      }
+    }
+  }
+
+  //wcerr<<L"retain: "<<retain<<L"\n";
+}
+
+int 
+LexTor::estimate_winner_lch(deque<LexTorWord>& window, int word_index, double weigth_exponent) {
+  //return estimate_winner_lch_cosine(window, word_index, weigth_exponent);
+  return estimate_winner_lch_voting(window, word_index, weigth_exponent);
+  //return estimate_winner_lch_mostprob(window, word_index, weigth_exponent);
+  //return estimate_winner_lch_votingtl(window, word_index, weigth_exponent);
+  //return -1;
+}
+
+int 
+LexTor::estimate_winner_lch_voting(deque<LexTorWord>& window, int word_index, double weigth_exponent) {
+  vector <double> lexchoices_count(window[word_index].n_lexical_choices());
+
+  if (debug) {
+    wcerr<<L"WINDOW: ";
+    for(unsigned i=0; i<window.size(); i++) {
+      if (i==(unsigned)word_index)
+	wcerr<<L"[>>>>"<<lextor_data->reduce(window[i].get_word_string())<<L"<<<<] ";
+      else
+	wcerr<<L"["<<lextor_data->reduce(window[i].get_word_string())<<L"] ";
+    }
+    wcerr<<L"\n";
+  }
+
+  //
+  double sum_lexchoices=0.0;
+  for(int i=0; i<window[word_index].n_lexical_choices(); i++) {
+    double aux_lexchoice_sum=lextor_data->get_lexchoice_sum(lextor_data->reduce_lexical_choice(window[word_index].get_lexical_choice(i,false)));
+    sum_lexchoices+=aux_lexchoice_sum;
+    if (debug) {
+      wcerr<<L"lexchoice_sum("<<lextor_data->reduce_lexical_choice(window[word_index].get_lexical_choice(i,false))<<L") = "<<aux_lexchoice_sum<<L"\n";
+    }
+  }
+  double wordcount=lextor_data->get_wordcount(lextor_data->reduce(window[word_index].get_word_string()));
+  if (debug) {
+    wcerr<<L"wordcount("<<lextor_data->reduce(window[word_index].get_word_string())<<L") = "<<wordcount<<L"\n";
+  }
+  //
+
+  for(int i=0; i<window[word_index].n_lexical_choices(); i++) {
+    lexchoices_count[i]=0;
+    wstring reduced_lexchoice=lextor_data->reduce_lexical_choice(window[word_index].get_lexical_choice(i,false));
+    if (debug) {
+      wcerr<<L"lexical choice: "<<window[word_index].get_lexical_choice(i)<<L" reduced: "<<reduced_lexchoice<<L"\n";
+    }
+
+    int distance=(-1)*(word_index);
+    for(int j=0; j<(int)window.size(); j++) { 
+      //For all words in the context window
+      if(j!=word_index) {
+	COUNT_DATA_TYPE vote=0;
+
+	wstring reduced_word=lextor_data->reduce(window[j].get_word_string());
+
+	if (lextor_data->get_wordcount(reduced_word)>0) {
+	  vote=lextor_data->vote_from_word(reduced_lexchoice, reduced_word)/
+	    (((lextor_data->get_lexchoice_sum(reduced_lexchoice))/sum_lexchoices)*wordcount);
+
+	  lexchoices_count[i]+=vote/pow(fabs((double)distance),weigth_exponent);
+	}
+
+	if (debug) {
+	  wcerr<<L"Count for "<<reduced_lexchoice<<L" from "<<reduced_word<<L" is "<<vote<<L"\n";
+	  wcerr<<L"Vote: "<<lextor_data->vote_from_word(reduced_lexchoice, reduced_word)<<L" word count: "
+	      <<lextor_data->get_wordcount(reduced_word)<<L"\n";
+	  wcerr<<L"["<<reduced_word<<L"] DISTANCE: "<<distance<<L", ";
+	  wcerr<<L" Count to apply: "<<vote/pow(fabs((double)distance),weigth_exponent)<<L"\n";
+	}
+      }
+      distance++;
+    }
+  }
+
+  //Now the winner is calculated
+  int winner=-1; //This will make the default one to be used if unchanged
+  COUNT_DATA_TYPE winner_vote=-100000000;
+  for(int i=0; i<window[word_index].n_lexical_choices(); i++) {
+    if ((lexchoices_count[i]>0) && (lexchoices_count[i]>winner_vote)) {
+      winner_vote=lexchoices_count[i];
+      winner=i;
+    } 
+    /*
+      else if ((lexchoices_count[i]>0) && (lexchoices_count[i]==winner_vote)) {
+      //Take the most probable one, the one with the highest sum
+      COUNT_DATA_TYPE sum_i=lextor_data->get_lexchoice_sum(lextor_data->reduce(window[word_index].get_lexical_choice(i)));
+      COUNT_DATA_TYPE sum_win=lextor_data->get_lexchoice_sum(lextor_data->reduce(window[word_index].get_lexical_choice(winner)));
+      if (sum_i>sum_win)
+      winner=i;
+      }
+    */
+  }
+  
+  if (debug) {
+    wcerr<<L"WINNER: "<<winner<<L" "<<window[word_index].get_lexical_choice(winner)<<L"\n";
+  }
+  return winner;
+}
+
+int 
+LexTor::estimate_winner_lch_mostprob(deque<LexTorWord>& window, int word_index,  double weigth_exponent) {
+  int winner=-1;
+  double greatest_sum=-1;
+  for(int i=0; i<window[word_index].n_lexical_choices(); i++) {
+    wstring reduced_lexchoice=lextor_data->reduce_lexical_choice(window[word_index].get_lexical_choice(i,false));
+    double sumlch=lextor_data->get_lexchoice_sum(reduced_lexchoice);
+
+
+    if (debug) {
+      wcerr<<L"sum("<<reduced_lexchoice<<L") = "<<sumlch<<L"\n";
+    }
+
+    if (sumlch>greatest_sum) {
+      greatest_sum=sumlch;
+      winner=i;
+    }
+  }
+
+  if (greatest_sum==0)
+    winner=-1;
+
+  if (debug) 
+    wcerr<<L"WINNER: "<<winner<<L" "<<window[word_index].get_lexical_choice(winner)<<L"\n";
+
+  return winner;
+}
+
+int 
+LexTor::estimate_winner_lch_cosine(deque<LexTorWord>& window, int word_index, double weigth_exponent) {
+  map<wstring, double> vcontext;
+
+  int distance=(-1)*(word_index);
+  for(int i=0; i<(int)window.size(); i++) {
+    if (i!=word_index) {
+      wstring reduced_word=lextor_data->reduce(window[i].get_word_string());
+      vcontext[reduced_word]+=1.0/pow(fabs((double)distance),weigth_exponent);
+    }
+    distance++;
+  }
+
+  if (debug) {
+    wcerr<<L"CONTEXT VECTOR\n-------------------\n";
+    map<wstring, double>::iterator it;
+    for(it=vcontext.begin(); it!=vcontext.end(); it++)
+      wcerr<<it->first<<L", "<<it->second<<L"\n";
+  }
+
+  ////double max_cosine=-2;
+  double min_angle=360;
+  int winner=-1;
+  double diff_angle=-1;
+  for(int i=0; i<window[word_index].n_lexical_choices(); i++) {
+    wstring reduced_lexchoice=lextor_data->reduce_lexical_choice(window[word_index].get_lexical_choice(i,false));
+
+    double aux_cosine=cosine(vcontext, reduced_lexchoice);
+    double aux_angle=(acos(aux_cosine)*180)/PI;
+    if (debug) {
+      wcerr<<L"cos("<<lextor_data->reduce(window[word_index].get_word_string())<<L", "
+	  <<reduced_lexchoice<<L") = "<<aux_cosine<<L"; ang = "<<aux_angle<<L" grades\n";
+    }
+
+    if (aux_angle<min_angle) {
+      if (min_angle!=360) {
+	diff_angle=min_angle-aux_angle;
+      }
+      min_angle=aux_angle;
+      winner=i;
+    } else if ((min_angle!=360)&&(diff_angle==-1)) {
+      diff_angle=fabs(min_angle-aux_angle);
+    }
+
+
+    /*
+      if (aux_cosine>max_cosine) {
+      diff_angle=abs(min_angle-aux_angle);
+      winner=i;
+      max_cosine=aux_cosine;
+      min_angle=aux_angle;
+      }
+    */
+  }
+
+  if (debug) {
+    wcerr<<L"DIFF ANGLE: "<<diff_angle<<L"\n";
+  }
+  if (diff_angle<=angleth)
+    winner=-1;
+
+  if (debug) 
+    wcerr<<L"WINNER: "<<winner<<L" "<<window[word_index].get_lexical_choice(winner)<<L"\n";
+  
+  return winner;
+}
+
+int 
+LexTor::estimate_winner_lch_votingtl(deque<LexTorWord>& window, int word_index, double weigth_exponent) {
+  if (tlmodel==NULL) {
+    wcerr<<L"Error in LexTor::estimate_winner_lch_votingtl: you must call LexTor::set_tlmodel first.\n";
+    exit(EXIT_FAILURE);
+  }  
+
+  vector <double> lexchoices_count(window[word_index].n_lexical_choices());
+  vector <vector <wstring> > translation_window (window.size());
+  vector <wstring> reduced_window(window.size());
+
+  for (unsigned i=0; i<window.size(); i++) 
+    reduced_window[i]=lextor_data->reduce(window[i].get_word_string());	      
+  
+  if(debug) {
+    wcerr<<L"WINDOW: ";
+    for (unsigned i=0; i<window.size(); i++) {
+      if(i==(unsigned)word_index)
+	wcerr<<L"[>>>>"<<reduced_window[i]<<L"<<<<] ";
+      else
+	wcerr<<L"["<<reduced_window[i]<<L"] ";
+    }
+    wcerr<<L"\n";
+    wcerr<<L"TRANSLATED: ";
+  }
+
+  //We translate each word in the context
+  //Note: Words in the context can also be ambiguous (with more than one lexical choice)
+  for (unsigned i=0; i<window.size(); i++) {
+    wstring str_translations=L"";
+    for(int j=0; j<window[i].n_lexical_choices(); j++) {
+      wstring tr=tlmodel->reduce(window[i].translate(*fstpbil,j));
+      translation_window[i].push_back(tr);
+      str_translations+=tr+L"/";
+    }
+    if (debug) {
+      if (i==(unsigned)word_index)
+	wcerr<<L"[>>>>"<<str_translations<<L"<<<<] ";
+      else
+	wcerr<<L"["<<str_translations<<L"] ";
+    }
+  }
+
+  if(debug)
+    wcerr<<L"\n";
+
+  //For each lexical choice the counts from the TL are collected
+  for(unsigned i=0; i<(unsigned)window[word_index].n_lexical_choices(); i++) {
+    lexchoices_count[i]=0;
+
+    for (unsigned k=0; k<window.size(); k++) {
+      if ((k!=(unsigned)word_index)&&(reduced_window[k]!=reduced_window[word_index])) {
+	COUNT_DATA_TYPE target_vote=0;
+
+	//If the SL word is ambiguous it will have more than one
+	//translation into TL, so we need to normalize using the
+	//frequency of words in the TL
+    vector <double> translation_weighs(translation_window[k].size());
+	double sum=0.0;
+	if (translation_window[k].size()>1) {
+	  for(unsigned j=0; j<translation_window[k].size(); j++) {
+	    translation_weighs[j]=tlmodel->get_lexchoice_sum(translation_window[k][j]);
+	    sum+=translation_weighs[j];
+
+	    //!!!!! Para hacer que no tenga en cuenta las
+	    //!!!!! polisemicas del contexto
+	    ///////translation_weighs[j]=0;
+	    //!!!!!
+	    //!!!!!
+
+	    if (debug) {
+	      wcerr<<L"Frequency of translation ["<<translation_window[k][j]<<L"] ="
+		  <<translation_weighs[j]<<L"\n";
+	    }
+	  }
+	} else {
+	  translation_weighs[0]=1;
+	  sum=1;
+	}
+
+	for(unsigned j=0; j<translation_window[k].size(); j++) {
+	  translation_weighs[j]=translation_weighs[j]/sum;
+	  if (debug) {
+	    wcerr<<L"Weight of translation ["<<translation_window[k][j]<<L"] ="
+		<<translation_weighs[j]<<L"\n";
+	  }
+	}
+
+	for(unsigned j=0; j<translation_window[k].size(); j++) {
+	  double aux_vote=0;
+	  //aux_vote=tlwordmodel.vote_from_word(lexchoice_translation[*itlch], 
+	  //				    translation_buffer[i][j])*translation_weighs[j];
+	  if(debug) 
+	    wcerr<<translation_window[word_index][i]<<L" "<<translation_window[k][j]<<L" "
+		<<tlmodel->vote_from_word(translation_window[word_index][i],translation_window[k][j])<<L" "
+		<<tlmodel->get_wordcount(translation_window[k][j])<<L" "<<translation_weighs[j]<<L"\n";
+	
+	  if (tlmodel->get_wordcount(translation_window[k][j])>0) {
+	    aux_vote=(tlmodel->vote_from_word(translation_window[word_index][i],translation_window[k][j])/
+		      tlmodel->get_wordcount(translation_window[k][j]))*translation_weighs[j];
+	  } 
+	  target_vote+=aux_vote;
+
+	  if(debug) {
+	    wcerr<<L"Target vote for ["<<translation_window[word_index][i]
+		<<L"] from ["<<translation_window[k][j]<<L"] = "<<aux_vote<<L"\n";
+	  }
+	}
+
+	lexchoices_count[i]+=target_vote;
+      }
+    }
+  }
+
+
+  if(debug) {
+    for(int i=0; i<window[word_index].n_lexical_choices(); i++) 
+      wcerr<<L"lexchoicecount["<<i<<L"] = "<<lexchoices_count[i]<<L"\n";
+    //getchar();
+  }
+
+  //Now the winner is calculated
+  int winner=-1; //This will make the default one to be used if unchanged
+  COUNT_DATA_TYPE winner_vote=-100000000;
+  for(int i=0; i<window[word_index].n_lexical_choices(); i++) {
+    if ((lexchoices_count[i]>0) && (lexchoices_count[i]>winner_vote)) {
+      winner_vote=lexchoices_count[i];
+      winner=i;
+    } 
+  }
+
+  if (debug) 
+    wcerr<<L"WINNER: "<<winner<<L" "<<window[word_index].get_lexical_choice(winner)<<L"\n";
+
+  return winner;
+}
+
+double 
+LexTor::cosine(map<wstring, double>& vcontext, const wstring& reduced_lexchoice) {
+  map<wstring, double>::iterator itc;
+
+  //We calculate the scalar product between vcontext and the lexchoice vector
+  double scalar_product=0;
+  for(itc=vcontext.begin(); itc!=vcontext.end(); itc++) {
+    scalar_product+=(itc->second)*(lextor_data->vote_from_word(reduced_lexchoice, itc->first));
+  }
+
+  //We calculate the module of vcontext, ||vcontext||
+  double module_vcontext=0;
+  for(itc=vcontext.begin(); itc!=vcontext.end(); itc++) {
+    module_vcontext+=(itc->second)*(itc->second);
+  }
+  module_vcontext=sqrt(module_vcontext);
+
+  //We get the module of the lexchoice vector, ||lexchoice vector||
+  double module_lexchoice_vector=lextor_data->get_module_lexchoice_vector(reduced_lexchoice);
+
+  if (module_vcontext==0) { 
+    wcerr<<L"Error in LexTor::vectors_cosine: module_vcontext is equal to zero.\n"
+	<<L"The cosine cannot be computed\n";
+    if (debug) {
+      wcerr<<L"CONTEXT VECTOR\n-------------------\n";
+      map<wstring, double>::iterator it;
+      for(it=vcontext.begin(); it!=vcontext.end(); it++)
+	wcerr<<it->first<<L", "<<it->second<<L"\n";
+    }
+
+    return -2;
+    //exit(EXIT_FAILURE);
+  }
+
+  if (module_lexchoice_vector==0) {
+    if (debug) {
+      wcerr<<L"Warning in LexTor::vectors_cosine: module_lexchoice_vector is equal to zero.\n"
+	  <<L"The cosine cannot be computed\n";
+      wcerr<<L"reduced lexical choice: "<<reduced_lexchoice<<L"\n";
+    }
+    return -2;
+  }
+
+  return scalar_product/(module_vcontext*module_lexchoice_vector);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.h	(revision 70339)
@@ -0,0 +1,132 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _INTERCHUNK_
+#define _INTERCHUNK_
+
+#include <apertium/transfer_instr.h>
+#include <apertium/transfer_token.h>
+#include <apertium/interchunk_word.h>
+#include <apertium/apertium_re.h>
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/buffer.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/match_state.h>
+
+#include <cstring>
+#include <cstdio>
+#include <libxml/parser.h>
+#include <libxml/tree.h>
+#include <map>
+#include <set>
+#include <vector>
+
+using namespace std;
+
+class Interchunk
+{
+private:
+  
+  Alphabet alphabet;
+  MatchExe *me;
+  MatchState ms;
+  map<string, ApertiumRE, Ltstr> attr_items;
+  map<string, string, Ltstr> variables;
+  map<string, int, Ltstr> macros;
+  map<string, set<string, Ltstr>, Ltstr> lists;
+  map<string, set<string, Ltstr>, Ltstr> listslow;
+  vector<xmlNode *> macro_map;
+  vector<xmlNode *> rule_map;
+  xmlDoc *doc;
+  xmlNode *root_element;
+  InterchunkWord **word;
+  string **blank;
+  int lword, lblank;
+  Buffer<TransferToken> input_buffer;
+  vector<wstring *> tmpword;
+  vector<wstring *> tmpblank;
+
+  FILE *output;
+  int any_char;
+  int any_tag;
+
+  xmlNode *lastrule;
+  unsigned int nwords;
+  
+  map<xmlNode *, TransferInstr> evalStringCache;
+  bool inword;
+  bool null_flush;
+  bool internal_null_flush;
+  bool trace;
+  string emptyblank;
+  
+  void destroy();
+  void readData(FILE *input);
+  void readInterchunk(string const &input);
+  void collectMacros(xmlNode *localroot);
+  void collectRules(xmlNode *localroot);
+  string caseOf(string const &str);
+  string copycase(string const &source_word, string const &target_word);
+
+  void processLet(xmlNode *localroot);
+  void processAppend(xmlNode *localroot);
+  void processOut(xmlNode *localroot);
+  void processCallMacro(xmlNode *localroot);
+  void processModifyCase(xmlNode *localroot);
+  bool processLogical(xmlNode *localroot);
+  bool processTest(xmlNode *localroot);
+  bool processAnd(xmlNode *localroot);
+  bool processOr(xmlNode *localroot);
+  bool processEqual(xmlNode *localroot);
+  bool processBeginsWith(xmlNode *localroot);
+  bool processBeginsWithList(xmlNode *localroot);
+  bool processEndsWith(xmlNode *localroot);
+  bool processEndsWithList(xmlNode *localroot);
+  bool processContainsSubstring(xmlNode *localroot);
+  bool processNot(xmlNode *localroot);
+  bool processIn(xmlNode *localroot);
+  void processRule(xmlNode *localroot);
+  string evalString(xmlNode *localroot);
+  void processInstruction(xmlNode *localroot);
+  void processChoose(xmlNode *localroot);
+  string processChunk(xmlNode *localroot);
+
+  bool beginsWith(string const &str1, string const &str2) const;
+  bool endsWith(string const &str1, string const &str2) const;
+  string tolower(string const &str) const;
+  string tags(string const &str) const;
+  string readWord(FILE *in);
+  string readBlank(FILE *in);
+  string readUntil(FILE *in, int const symbol) const;
+  void applyWord(wstring const &word_str);
+  void applyRule();
+  TransferToken & readToken(FILE *in);
+  bool checkIndex(xmlNode *element, int index, int limit); 
+  void interchunk_wrapper_null_flush(FILE *in, FILE *out);
+
+public:
+  Interchunk();
+  ~Interchunk();
+  
+  void read(string const &transferfile, string const &datafile);
+  void interchunk(FILE *in, FILE *out);
+  bool getNullFlush(void);
+  void setNullFlush(bool null_flush);
+  void setTrace(bool trace);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.h	(revision 70339)
@@ -0,0 +1,138 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _POSTCHUNK_
+#define _POSTCHUNK_
+
+#include <apertium/transfer_instr.h>
+#include <apertium/transfer_token.h>
+#include <apertium/interchunk_word.h>
+#include <apertium/apertium_re.h>
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/buffer.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/match_state.h>
+
+#include <cstdio>
+#include <libxml/parser.h>
+#include <libxml/tree.h>
+#include <map>
+#include <set>
+#include <vector>
+
+using namespace std;
+
+class Postchunk
+{
+private:
+  
+  Alphabet alphabet;
+  MatchExe *me;
+  MatchState ms;
+  map<string, ApertiumRE, Ltstr> attr_items;
+  map<string, string, Ltstr> variables;
+  map<string, int, Ltstr> macros;
+  map<string, set<string, Ltstr>, Ltstr> lists;
+  map<string, set<string, Ltstr>, Ltstr> listslow;
+  vector<xmlNode *> macro_map;
+  vector<xmlNode *> rule_map;
+  xmlDoc *doc;
+  xmlNode *root_element;
+  InterchunkWord **word;
+  string **blank;
+  int lword, lblank;
+  Buffer<TransferToken> input_buffer;
+  vector<wstring *> tmpword;
+  vector<wstring *> tmpblank;
+
+  FILE *output;
+  int any_char;
+  int any_tag;
+
+  xmlNode *lastrule;
+  unsigned int nwords;
+  
+  map<xmlNode *, TransferInstr> evalStringCache;
+
+  bool inword;
+  bool null_flush;
+  bool internal_null_flush;
+
+  void destroy();
+  void readData(FILE *input);
+  void readPostchunk(string const &input);
+  void collectMacros(xmlNode *localroot);
+  void collectRules(xmlNode *localroot);
+  static string caseOf(string const &str);
+  static wstring caseOf(wstring const &str);
+  string copycase(string const &source_word, string const &target_word);
+
+  void processLet(xmlNode *localroot);
+  void processAppend(xmlNode *localroot);
+  void processOut(xmlNode *localroot);
+  void processCallMacro(xmlNode *localroot);
+  void processModifyCase(xmlNode *localroot);
+  bool processLogical(xmlNode *localroot);
+  bool processTest(xmlNode *localroot);
+  bool processAnd(xmlNode *localroot);
+  bool processOr(xmlNode *localroot);
+  bool processEqual(xmlNode *localroot);
+  bool processBeginsWith(xmlNode *localroot);
+  bool processBeginsWithList(xmlNode *localroot);
+  bool processEndsWith(xmlNode *localroot);
+  bool processEndsWithList(xmlNode *localroot);
+  bool processContainsSubstring(xmlNode *localroot);
+  bool processNot(xmlNode *localroot);
+  bool processIn(xmlNode *localroot);
+  void processRule(xmlNode *localroot);
+  string evalString(xmlNode *localroot);
+  void processInstruction(xmlNode *localroot);
+  void processChoose(xmlNode *localroot);
+  void processTags(xmlNode *localroot);
+  bool beginsWith(string const &str1, string const &str2) const;
+  bool endsWith(string const &str1, string const &str2) const;
+  string tolower(string const &str) const;
+  string tags(string const &str) const;
+  string readWord(FILE *in);
+  string readBlank(FILE *in);
+  string readUntil(FILE *in, int const symbol) const;
+  void applyWord(wstring const &word_str);
+  void applyRule();
+  TransferToken & readToken(FILE *in);
+  static void unchunk(wstring const &chunk, FILE *output);
+  static vector<wstring> getVecTags(wstring const &chunk);
+  static int beginChunk(wstring const &chunk);
+  static int endChunk(wstring const &chunk);
+  static void splitWordsAndBlanks(wstring const &chunk, 
+				  vector<wstring *> &words,
+				  vector<wstring *> &blanks);
+  static wstring pseudolemma(wstring const &chunk);
+  static wstring wordzero(wstring const &chunk);
+  bool checkIndex(xmlNode *element, int index, int limit);  
+  void postchunk_wrapper_null_flush(FILE *in, FILE *out);
+
+public:
+  Postchunk();
+  ~Postchunk();
+  
+  void read(string const &transferfile, string const &datafile);
+  void postchunk(FILE *in, FILE *out);
+  bool getNullFlush(void);
+  void setNullFlush(bool null_flush);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_hmm.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_hmm.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_hmm.cc	(revision 70339)
@@ -0,0 +1,403 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/hmm.h>
+#include <apertium/tagger_data_hmm.h>
+#include <lttoolbox/compression.h>
+#include <apertium/endian_double_util.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+void
+TaggerDataHMM::destroy()
+{
+  if(a != NULL)
+  {
+    for(int i = 0; i != N; i++)
+    {
+      delete [] a[i];
+    }
+    delete [] a;
+  }
+  a = NULL;
+
+  if(b != NULL)
+  {
+    for(int i = 0; i != N; i++)
+    {
+      delete [] b[i];
+    }
+    delete [] b;
+  }
+  b = NULL;
+
+  N = 0;
+  M = 0;
+}
+
+TaggerDataHMM::TaggerDataHMM()
+{
+  a = NULL;
+  b = NULL;
+  N = 0;
+  M = 0;
+}
+
+TaggerDataHMM::~TaggerDataHMM()
+{
+  destroy();
+}
+
+TaggerDataHMM::TaggerDataHMM(TaggerDataHMM const &o)
+{
+  a = NULL;
+  b = NULL;
+  N = 0;
+  M = 0;
+
+  TaggerData::copy(o);
+  this->setProbabilities(o.N, o.M, o.a, o.b);
+}
+
+TaggerDataHMM::TaggerDataHMM(TaggerData const &o)
+{
+
+  a = NULL;
+  b = NULL;
+  N = 0;
+  M = 0;
+  
+  TaggerData::copy(o);
+}
+
+TaggerDataHMM &
+TaggerDataHMM::operator =(TaggerDataHMM const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    TaggerData::copy(o);
+    this->setProbabilities(o.N, o.M, o.a, o.b);
+  }
+  return *this;
+}
+  
+void
+TaggerDataHMM::setProbabilities(int const myN, int const myM, 
+                             double **myA, double **myB)
+{
+  this->destroy();
+  N = myN;
+  M = myM;
+  
+  if(N != 0 && M != 0)
+  {
+    // NxN matrix
+    a = new double * [N];
+    for(int i = 0; i != N; i++)
+    {
+      a[i] = new double[N];
+      if(myA != NULL)
+      {
+        for(int j = 0; j != N; j++) // ToDo: N should be M? Check use of N and M in this function
+        { 
+          a[i][j] = myA[i][j];
+        }
+      }
+    }
+  
+    // NxM matrix
+    b = new double * [N];
+    for(int i = 0; i != N; i++)
+    {
+      b[i] = new double[M];
+      if(myB != NULL)
+      {
+        for(int j = 0; j != M; j++)
+        {
+          b[i][j] = myB[i][j];
+        }
+      }
+    }
+  }
+  else
+  {
+    a = NULL;
+    b = NULL;
+  }  
+}
+
+double ** 
+TaggerDataHMM::getA()
+{
+  return a;
+}
+
+double ** 
+TaggerDataHMM::getB()
+{
+  return b;
+}
+
+int 
+TaggerDataHMM::getN()
+{  
+  return N;
+}
+
+int
+TaggerDataHMM::getM()
+{
+  return M;
+}
+
+void
+TaggerDataHMM::read(FILE *in)
+{
+  destroy();
+
+  // open_class
+  int val = 0;
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    val += Compression::multibyte_read(in);
+    open_class.insert(val);
+  }
+  
+  // forbid_rules
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    TForbidRule aux;
+    aux.tagi = Compression::multibyte_read(in);
+    aux.tagj = Compression::multibyte_read(in);
+    forbid_rules.push_back(aux);
+  }
+
+  
+  // array_tags
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    array_tags.push_back(Compression::wstring_read(in));
+  }
+  
+  // tag_index
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    wstring tmp = Compression::wstring_read(in);    
+    tag_index[tmp] = Compression::multibyte_read(in);
+  }
+
+  // enforce_rules  
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    TEnforceAfterRule aux;
+    aux.tagi = Compression::multibyte_read(in);
+    for(int j = Compression::multibyte_read(in); j != 0; j--)
+    {
+      aux.tagsj.push_back(Compression::multibyte_read(in));
+    }
+    enforce_rules.push_back(aux);
+  }
+
+  // prefer_rules
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    prefer_rules.push_back(Compression::wstring_read(in));
+  }
+
+  // constants
+  constants.read(in);
+
+  // output
+  output.read(in); 
+
+  // dimensions
+  N = Compression::multibyte_read(in);
+  M = Compression::multibyte_read(in);
+
+  
+  a = new double * [N];
+  b = new double * [N];
+  for(int i = 0; i != N; i++)
+  {
+    a[i] = new double[N];
+    b[i] = new double[M];
+  }
+   
+  // read a
+  for(int i = 0; i != N; i++)
+  {
+    for(int j = 0; j != N; j++)
+    {
+      a[i][j] = EndianDoubleUtil::read(in);
+    }
+  }
+
+  // initializing b matrix
+  for(int i = 0 ; i != N; i++)
+  {
+    for(int j = 0; j != M; j++)
+    {
+      b[i][j] = ZERO;
+    }
+  }
+
+  // read nonZERO values of b
+  int nval = Compression::multibyte_read(in);
+
+  for(; nval != 0; --nval)
+  {
+    int i = Compression::multibyte_read(in);
+    int j = Compression::multibyte_read(in);
+    b[i][j] = EndianDoubleUtil::read(in);
+  }
+
+  // read pattern list
+  plist.read(in);
+    
+  // read discards on ambiguity
+  discard.clear();
+
+  int limit = Compression::multibyte_read(in);  
+  if(feof(in))
+  {
+    return;
+  }
+  
+  for(int i = 0; i < limit; i++)
+  {
+    discard.push_back(Compression::wstring_read(in));
+  }
+}
+
+void
+TaggerDataHMM::write(FILE *out)
+{
+  
+  // open_class
+  Compression::multibyte_write(open_class.size(), out);  
+  int val = 0;
+  for(set<TTag>::const_iterator it = open_class.begin(), limit = open_class.end();
+      it != limit; it++)
+  {
+    Compression::multibyte_write(*it-val, out);    
+    val = *it;
+  }
+  
+  // forbid_rules
+  Compression::multibyte_write(forbid_rules.size(), out);
+  for(unsigned int i = 0, limit = forbid_rules.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(forbid_rules[i].tagi, out);
+    Compression::multibyte_write(forbid_rules[i].tagj, out);
+  }
+  
+  // array_tags
+  Compression::multibyte_write(array_tags.size(), out);
+  for(unsigned int i = 0, limit = array_tags.size(); i != limit; i++)
+  {
+    Compression::wstring_write(array_tags[i], out);
+  }
+
+  // tag_index
+  Compression::multibyte_write(tag_index.size(), out);
+  for(map<wstring, int, Ltstr>::iterator it = tag_index.begin(), limit = tag_index.end();
+      it != limit; it++)
+  {
+    Compression::wstring_write(it->first, out);
+    Compression::multibyte_write(it->second, out);
+  }
+  
+  // enforce_rules
+  Compression::multibyte_write(enforce_rules.size(), out);
+  for(unsigned int i = 0, limit = enforce_rules.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(enforce_rules[i].tagi, out);
+    Compression::multibyte_write(enforce_rules[i].tagsj.size(), out);
+    for(unsigned int j = 0, limit2 = enforce_rules[i].tagsj.size(); j != limit2; j++)
+    {
+      Compression::multibyte_write(enforce_rules[i].tagsj[j], out);
+    }
+  }
+
+  // prefer_rules
+  Compression::multibyte_write(prefer_rules.size(), out);
+  for(unsigned int i = 0, limit = prefer_rules.size(); i != limit; i++)
+  {
+    Compression::wstring_write(prefer_rules[i], out);
+  }
+  
+  // constants
+  constants.write(out);  
+
+  // output
+  output.write(out);
+
+  // a matrix
+  Compression::multibyte_write(N, out);
+  Compression::multibyte_write(M, out);
+  for(int i = 0; i != N; i++)
+  {
+    for(int j = 0; j != N; j++)
+    {
+      EndianDoubleUtil::write(out, a[i][j]);
+    }
+  }
+
+  // b matrix, writing only useful values
+  
+  int nval = 0;
+  for(int i = 0; i != N; i++)
+  {
+    for(int j = 0; j != M; j++)
+    {
+      if(output[j].find(i) != output[j].end())
+      {
+        nval++;
+      }
+    }
+  }
+
+  Compression::multibyte_write(nval, out);
+  for(int i = 0; i != N; i++)
+  {
+    for(int j = 0; j != M; j++)
+    {
+      if(output[j].find(i) != output[j].end())
+      {
+        Compression::multibyte_write(i, out);
+        Compression::multibyte_write(j, out);
+        EndianDoubleUtil::write(out, b[i][j]);
+      }
+    }
+  }  
+  
+  // write pattern list
+  plist.write(out);
+  
+  // write discard list
+  
+  if(discard.size() != 0)
+  {
+    Compression::multibyte_write(discard.size(), out);
+    for(unsigned int i = 0, limit = discard.size(); i != limit; i++)
+    {
+      Compression::wstring_write(discard[i], out);
+    }
+  }  
+}
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_word.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_word.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_word.cc	(revision 70339)
@@ -0,0 +1,384 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/tagger_word.h>
+#include <apertium/utf_converter.h>
+#include <apertium/string_utils.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+using namespace Apertium;
+
+bool TaggerWord::generate_marks=false;
+
+vector<wstring> TaggerWord::array_tags;
+
+bool TaggerWord::show_ignored_string=true;
+
+map<wstring, ApertiumRE, Ltstr> TaggerWord::patterns;
+
+TaggerWord::TaggerWord(bool prev_plus_cut) :
+show_sf(false)
+{
+   ignored_string = L"";
+   plus_cut=false;
+   previous_plus_cut=prev_plus_cut;
+}
+
+TaggerWord::TaggerWord(const TaggerWord &w){
+  superficial_form = w.superficial_form;
+  tags = w.tags;
+  show_sf = false;
+  lexical_forms = w.lexical_forms;
+  ignored_string = w.ignored_string;
+  plus_cut = w.plus_cut;
+  previous_plus_cut=w.previous_plus_cut;
+}
+
+TaggerWord::~TaggerWord(){
+}
+
+void
+TaggerWord::set_show_sf(bool sf){
+  show_sf = sf;
+}
+
+bool
+TaggerWord::get_show_sf(){
+  return show_sf;
+}
+
+void
+TaggerWord::set_superficial_form(const wstring &sf){
+  superficial_form = sf;
+}
+
+wstring& 
+TaggerWord::get_superficial_form() {
+  return superficial_form;
+}
+
+bool
+TaggerWord::match(wstring const &s, wstring const &pattern)
+{
+  map<wstring, ApertiumRE, Ltstr>::iterator it = patterns.find(pattern);
+  string const utfs = UtfConverter::toUtf8(s);
+
+  if(it == patterns.end())
+  {
+    string utfpattern = UtfConverter::toUtf8(pattern);
+    string regexp = "";
+    
+    while(true)
+    {
+      size_t pos = utfpattern.find("<*>");
+      if(pos == string::npos)
+      {
+        break;
+      }
+      utfpattern.replace(pos, 3, "(<[^>]+>)+");
+    }
+    patterns[pattern].compile(utfpattern);
+    return patterns[pattern].match(utfs) != "";
+  }
+  else
+  {
+    return it->second.match(utfs) != "";
+  }
+}
+
+void
+TaggerWord::add_tag(TTag &t, const wstring &lf, vector<wstring> const &prefer_rules){
+
+  //Tag is added only is it is not present yet
+  //Sometime one word can have more than one lexical form assigned to the same tag
+  if (tags.find(t)==tags.end()) {
+    tags.insert(t);
+    lexical_forms[t]=lf;
+  } else {
+    //Take a look at the prefer rules
+    for(int i=0; i < (int) prefer_rules.size(); i++)
+    {
+      if (match(lf, prefer_rules[i])) 
+      {
+	lexical_forms[t]=lf;
+	break;
+      }
+    }
+  }
+}
+
+set<TTag>&
+TaggerWord::get_tags() {
+  return tags;
+}
+
+bool
+TaggerWord::isAmbiguous() const
+{
+  return tags.size() > 1;
+}
+
+wstring
+TaggerWord::get_string_tags() {
+  wstring st;
+  set<TTag>::iterator itag = tags.begin();
+  
+  st=L"{";  
+  for(itag=tags.begin(); itag!=tags.end(); itag++) {
+    if (itag!=tags.begin())
+      st+=L',';
+    st+=array_tags[*itag];
+  }
+  st += L'}';  
+  
+  return st;  
+}
+
+wstring
+TaggerWord::get_lexical_form(TTag &t, int const TAG_kEOF) {
+  wstring ret= L"";
+
+  if (show_ignored_string)
+    ret.append(ignored_string);
+   
+  if(t==TAG_kEOF)
+    return ret;
+
+  if (!previous_plus_cut){
+    if(TaggerWord::generate_marks && isAmbiguous())
+    {
+      ret.append(L"^=");
+    }
+    else
+    {
+      ret += L'^';
+    }
+
+    if(get_show_sf()){   // append the superficial form
+      ret.append(superficial_form);
+      ret+=L'/'; 
+    }
+  }
+
+  if (lexical_forms.size()==0) { // This is an UNKNOWN WORD
+    ret +=L'*';
+    ret.append(superficial_form);
+  } else if ((*lexical_forms.begin()).second[0]==L'*') { //This is an
+							//unknown word
+							//that has
+							//been guessed
+    ret += L'*';
+    ret.append(superficial_form);
+  } else if (lexical_forms.size()>1) {  //This is an ambiguous word
+    ret.append(lexical_forms[t]);
+  } else {
+    ret.append(lexical_forms[t]);
+  }
+  
+  if (ret != ignored_string) {
+    if (plus_cut)
+      ret+=L'+';
+    else {
+      ret += L'$';	
+    }
+  }
+
+
+  //if ((superficial_form.length()>0)&&(superficial_form[superficial_form.length()-1]=='\''))
+  //   //Si la forma superficial termina en apostrofo metemos un espacio en blanco tras la cadena '/$'
+  //   //o '/'. De no hacerlo en la traducci�n aparecer�n dos palabras sin blanco alguno.
+  //   ret+=" "; //Quiz� este no sea el sitio apropiado para hacer esto, lo suyo ser�a un m�dulo
+  //             //antes del tagger o del anmor.
+     
+  return ret;
+}
+
+wstring 
+TaggerWord::get_all_chosen_tag_first(TTag &t, int const TAG_kEOF) {
+  wstring ret=L"";
+
+  if (show_ignored_string)
+    ret.append(ignored_string);
+   
+  if(t==TAG_kEOF)
+    return ret;
+ 
+  if (!previous_plus_cut)
+  {
+    if(TaggerWord::generate_marks && isAmbiguous())
+    {
+      ret.append(L"^=");
+    }
+    else
+    {
+      ret += L'^';
+    }
+  }
+ 
+  ret.append(superficial_form);
+ 
+  if (lexical_forms.size()==0) { // This is an UNKNOWN WORD
+    ret+=L"/*";
+    ret.append(superficial_form);
+  } else {
+    ret+=L"/";
+    ret.append(lexical_forms[t]);
+    if (lexical_forms.size()>1) {
+      set<TTag>::iterator it;
+      for (it=tags.begin(); it!=tags.end(); it++) {
+	if (*it != t) {
+	  ret+=L"/";
+          ret.append(lexical_forms[*it]);
+	}
+      }
+    }
+  }
+   
+  if (ret != ignored_string) {
+    if (plus_cut)
+      ret+=L"+";
+    else {
+      ret+=L"$";
+    }
+  }
+      
+  return ret;
+}
+
+//OBSOLETE
+wstring
+TaggerWord::get_lexical_form_without_ignored_string(TTag &t, int const TAG_kEOF) {
+  wstring ret;
+   
+  if(t==TAG_kEOF)
+     return ret;
+ 
+  if (lexical_forms.size()==0) { //This is an unknown word
+      ret.append(L"*^");
+      ret.append(superficial_form);
+  } else if ((*lexical_forms.begin()).second[0]=='*') {  //This is an unknown word that has been guessed
+    ret.append(L"*^");
+    ret.append(superficial_form);
+  } else {
+    ret += L'^';
+    ret.append(lexical_forms[t]);
+  }
+  
+  if (ret.length() != 0) {
+    if (plus_cut)
+      ret+=L'+';
+    else {
+      ret +=L'$';	
+    }
+  }
+
+  return ret;
+}
+
+void
+TaggerWord::add_ignored_string(wstring const &s) {
+  ignored_string.append(s);
+}
+
+void 
+TaggerWord::set_plus_cut(const bool &c) {
+  plus_cut=c;
+}
+
+bool
+TaggerWord::get_plus_cut() {
+  return plus_cut;
+}
+
+wostream&
+operator<< (wostream& os, TaggerWord &w) {
+  os<<w.get_string_tags()<< L" \t Word: " << w.get_superficial_form();
+  return os;
+}
+
+void 
+TaggerWord::setArrayTags(vector<wstring> const &at)
+{
+  array_tags = at;
+}
+
+void
+TaggerWord::print()
+{
+  wcout << L"[#" << superficial_form << L"# ";
+  for(set<TTag>::iterator it=tags.begin(), limit = tags.end(); it != limit; it++)
+  {
+    wcout << L"(" << *it << L" " << lexical_forms[*it] << L") ";
+  }
+  wcout << L"\b]\n";
+}
+
+void
+TaggerWord::outputOriginal(FILE *output) {
+
+  wstring s=superficial_form;
+
+  map<TTag, wstring>::iterator it;
+  for(it=lexical_forms.begin(); it!=lexical_forms.end(); it++) {
+    if (it->second.length()>0)
+    {
+      s+=L'/';
+      s.append(it->second);
+    }
+  }
+
+  if (s.length()>0)
+  {
+    s=L"^"+s+L"$\n";
+  }
+
+  fputws_unlocked(s.c_str(), output);
+}
+
+void
+TaggerWord::discardOnAmbiguity(wstring const &tags)
+{
+  if(isAmbiguous())
+  {
+    map<TTag, wstring>::iterator it = lexical_forms.begin(),
+                              limit = lexical_forms.end();
+    set<TTag> newsettag;
+    while(it != limit)
+    {
+      if(match(it->second, tags))
+      {
+        lexical_forms.erase(it);
+        it = lexical_forms.begin();
+      }
+      else
+      {
+        newsettag.insert(it->first);
+      }
+        
+      if(lexical_forms.size() == 1)
+      {
+        newsettag.insert(lexical_forms.begin()->first);
+        break;
+      }
+      it++;
+    }
+    if(tags.size() != newsettag.size())
+    { 
+      this->tags = newsettag;
+    }
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_align_parameters.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_align_parameters.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_align_parameters.h	(revision 70339)
@@ -0,0 +1,51 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGN_PARAMETERS_H
+#define __TMXALIGNER_ALIGN_PARAMETERS_H
+
+
+class AlignParameters
+{
+public:
+  enum RealignType { NoRealign, ModelOneRealign, FineTranslationRealign };
+
+  bool justSentenceIds;
+  bool justBisentences;
+
+  bool cautiousMode;
+  RealignType realignType;
+  double qualityThreshold;
+
+  double postprocessTrailQualityThreshold;
+  double postprocessTrailStartAndEndQualityThreshold;
+  double postprocessTrailByTopologyQualityThreshold;
+
+  std::string handAlignFilename;
+
+  bool utfCharCountingMode;
+  
+  std::string autoDictionaryDumpFilename; // Empty string means do not dump.
+
+AlignParameters() : justSentenceIds(true), 
+    justBisentences(false), cautiousMode(false),
+    realignType(NoRealign),
+    qualityThreshold(-100000),
+    postprocessTrailQualityThreshold(-1),
+    postprocessTrailStartAndEndQualityThreshold(-1),
+    postprocessTrailByTopologyQualityThreshold(-1),
+    utfCharCountingMode(false)
+      {}
+
+
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_builder.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_builder.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_builder.cc	(revision 70339)
@@ -0,0 +1,1027 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/tmx_builder.h>
+#include <apertium/utf_converter.h>
+#include <apertium/string_utils.h>
+#include <apertium/tmx_aligner_tool.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/compression.h>
+
+
+#include <cmath>
+#include <cstdlib>
+#include <iostream>
+#include <iomanip>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#include <apertium/string_utils.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+#ifdef _MSC_VER
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace Apertium;
+using namespace std;
+
+TMXBuilder::TMXBuilder(wstring const &l1, wstring const &l2):
+low_limit(0)
+{
+  lang1 = l1;
+  lang2 = l2;
+
+  // default values of the parameters
+    
+  max_edit = 50;
+  diagonal_width = 10;
+  window_size = 100;
+  step = 75;
+  percent=0.85;
+  edit_distance_percent=0.30;
+ 
+  freference = NULL;
+}
+
+TMXBuilder::~TMXBuilder()
+{
+}
+
+wstring 
+TMXBuilder::restOfBlank(FILE *input)
+{
+  wstring result = L"[";
+  
+  while(true)
+  {
+    wint_t val = fgetwc(input);
+    if(feof(input))
+    {
+      return L"";
+    }
+    switch(val)
+    {
+      case L'\\':
+        result += L'\\';
+        val = fgetwc(input);
+        if(feof(input))
+        {
+          return L"";
+        }
+        result += static_cast<wchar_t>(val);
+        break;
+      
+      case L']':
+        result += L']';
+        return result;
+        
+      default:
+        result += static_cast<wchar_t>(val);
+        break;
+    }
+  }
+  
+  return L"";
+}
+
+wstring 
+TMXBuilder::nextBlank(FILE *input)
+{
+  wstring result = L"";
+  
+  while(true)
+  {
+    wint_t val = fgetwc(input);
+    if(feof(input))
+    {
+      return L"";
+    }
+    switch(val)
+    {
+      case L'\\':
+        fgetwc(input);
+        break;
+      case L'[':
+        
+        result = restOfBlank(input);
+        return result;
+    }
+  }  
+}
+
+bool
+TMXBuilder::compatible(FILE *f1, FILE *f2, bool lazy)
+{
+  wstring s1 = nextBlank(f1), s2 = nextBlank(f2);
+  if(!lazy)
+  {  
+    while(!feof(f1) && !feof(f2))
+    {
+      if(s1 != s2)
+      {
+        return false;
+      }
+      s1 = nextBlank(f1);
+      s2 = nextBlank(f2);
+    }
+  }    
+  else
+  {
+    while(!feof(f1) && !feof(f2))
+    {
+      if(s1.size() < s2.size()*(1-0.05) || s1.size() > s2.size()*(1+0.05))
+      {
+        return false;
+      }
+      s1 = nextBlank(f1);
+      s2 = nextBlank(f2);
+    }    
+  }
+  return true;
+}
+
+bool
+TMXBuilder::check(string const &file1, string const &file2, bool lazy)
+{
+  FILE *f1 = fopen(file1.c_str(), "rb");
+  FILE *f2 = fopen(file2.c_str(), "rb");
+  if(!f1 && !f2)
+  {
+    wcerr << L"Error: Cannot access files '" << UtfConverter::fromUtf8(file1);
+    wcerr << L"' and '" << UtfConverter::fromUtf8(file2) << "'" << endl;
+    return false;
+  }
+  else if(!f1)
+  {
+    wcerr << L"Error: Cannot access file '";
+    wcerr << UtfConverter::fromUtf8(file2);
+    wcerr << "'" << endl;
+    fclose(f2);
+    return false;
+  }
+  else if(!f2)
+  {
+    wcerr << L"Error: Cannot access file '";
+    wcerr << UtfConverter::fromUtf8(file2);
+    wcerr << "'" << endl;
+    fclose(f1);
+    return false;
+  }
+     
+  bool retval = compatible(f1, f2, lazy);
+
+  fclose(f1);
+  fclose(f2);
+  return retval;
+}
+
+wstring
+TMXBuilder::nextTU(FILE *input)
+{
+  wstring current_tu = L"";
+  wstring tmp;
+  
+  while(true)
+  {
+    wint_t symbol = fgetwc_unlocked(input);
+    if(feof(input))
+    {
+      if(current_tu == L"")
+      {
+        return L"";
+      }
+      else
+      {
+        return current_tu;
+      }
+    }
+    switch(symbol)
+    {
+      case L'\\':
+        symbol = fgetwc_unlocked(input);
+        if(feof(input))
+        {
+          if(current_tu == L"")
+          {
+            return L"";
+          }
+          else
+          {
+            return current_tu;
+          }
+        }
+        // continued down
+      default:
+        current_tu += static_cast<wchar_t>(symbol);
+        break;
+      
+      case L'[':
+        tmp = restOfBlank(input);
+        if(tmp.substr(0,2) == L"[ ")
+        {
+          current_tu.append(L" ");
+        }  
+        current_tu.append(L"<ph/>");
+        if(tmp.substr(tmp.size()-2, 2) == L" ]")
+        {
+          current_tu.append(L" ");
+        }   
+        break;
+      
+      case L'.':
+        current_tu += L'.';
+        symbol = fgetwc_unlocked(input);
+
+        if(symbol != L'[' && !iswspace(symbol))
+        {
+          if(!feof(input))          
+          {
+            ungetwc(symbol, input);
+          }
+        }
+        else
+        {
+          if(!feof(input))
+          {
+            ungetwc(symbol, input);
+          }
+
+          return current_tu;
+/*          size_t idx = current_tu.size()-1;
+          while(current_tu[idx] == L'.')
+          {
+            idx--;
+          }
+          return current_tu.substr(0, idx+1);*/
+        }
+        break;
+      
+      case L'?':
+      case L'!':
+        current_tu += static_cast<wchar_t>(symbol);
+        return current_tu;
+    }
+  }
+  
+  return current_tu;
+}
+
+wstring
+TMXBuilder::xmlize(wstring const &str)
+{
+  wstring result = L"";
+  
+  for(size_t i = 0, limit = str.size(); i < limit; i++)
+  {
+    switch(str[i])
+    {
+      case L'<':
+        if(i + 5 <= limit && str.substr(i,5)==L"<ph/>")
+        {
+          result.append(L"<ph/>");
+          i += 4;
+          break;
+        }
+        else
+        {
+          result.append(L"&lt;");
+        }
+        break;
+        
+      case L'>':
+        result.append(L"&gt;");
+        break;
+        
+      case L'&':
+        result.append(L"&amp;");
+        break;
+      
+      default:
+        result += str[i];
+        break;
+    }
+  }
+  
+  // remove leading <ph/>'s
+  
+  bool cambio = true;
+  while(cambio == true)
+  {
+    cambio = false;
+    while(result.size() >= 5 && result.substr(0,5) == L"<ph/>")
+    {
+      result = result.substr(5);
+      cambio = true;
+    }
+    while(result.size() > 0 && !iswalnum(result[0]) && !iswpunct(result[0]))
+    {
+      result = result.substr(1);
+      cambio = true;
+    }
+  }
+  // remove trailing <ph/>'s
+  
+  cambio = true;
+  while(cambio == true)
+  {
+    cambio = false;
+    while(result.size() > 5 && result.substr(result.size()-5) == L"<ph/>")
+    {
+      result = result.substr(0, result.size()-5);
+      cambio = true;
+    }
+    while(result.size() > 0 && !iswalnum(result[result.size()-1]) && !iswpunct(result[result.size()-1]))
+    {
+      result = result.substr(0, result.size()-1);
+      cambio = true;
+    }
+  }
+  
+  // remove trailing punctuation
+
+  
+  for(unsigned int i = result.size()-1; result.size() > 0 && i > 0; i--)
+  {
+    if(!isRemovablePunct(result[i]))
+    {
+      result = result.substr(0, i+1);
+      break;
+    }
+  }
+
+  while(result.size() > 0 && isRemovablePunct(result[result.size()-1]))
+  {
+    result = result.substr(0,result.size()-1);
+  }
+
+  return result;
+} 
+
+void 
+TMXBuilder::generate(string const &file1, string const &file2, 
+                     string const &outfile)
+{
+  FILE *output = stdout;
+
+  if(outfile != "")
+  {
+    output = fopen(outfile.c_str(), "w");
+    if(!output)
+    {
+      wcerr << L"Error: file '" << UtfConverter::fromUtf8(outfile);
+      wcerr << L"' cannot be opened for writing" << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+#ifdef _MSC_VER
+  _setmode(_fileno(output), _O_U8TEXT);
+#endif
+
+  FILE *f1 = fopen(file1.c_str(), "r");
+  if(!f1)
+  {
+    wcerr << L"Error: file '" << UtfConverter::fromUtf8(file1);
+    wcerr << L"' cannot be opened for reading" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  FILE *f2 = fopen(file2.c_str(), "r");
+  if(!f2)
+  {
+    wcerr << L"Error: file '" << UtfConverter::fromUtf8(file2);
+    wcerr << L"' cannot be opened for reading" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+#ifdef _MSC_VER
+  _setmode(_fileno(f1), _O_U8TEXT);
+  _setmode(_fileno(f2), _O_U8TEXT);
+#endif   
+ 
+  generateTMX(f1, f2, output);
+}
+
+vector<wstring>
+TMXBuilder::reverseList(vector<wstring> const &v)
+{
+  vector<wstring> retval(v.size());
+ 
+  for(int j = v.size() - 1, i = 0; j >=0; j--, i++)
+  {
+    retval[i] = v[j];
+  }
+  
+  return retval;
+}
+
+vector<wstring>
+TMXBuilder::sentenceList(FILE *file)
+{
+  vector<wstring> retval;
+  
+  while(true)
+  {
+    wstring f = nextTU(file);
+    if(feof(file))
+    {
+      break;
+    }   
+    retval.push_back(f);
+  }
+  
+  return retval;
+}  
+
+vector<wstring>
+TMXBuilder::extractFragment(vector<wstring> const &text, unsigned int base, unsigned int width)
+{
+  vector<wstring> result;
+  
+  for(unsigned int i = base; i < (base + width) && i < text.size(); i++)
+  {
+    result.push_back(text[i]);
+  }
+  
+  return result;
+}
+
+int
+TMXBuilder::argmin(int nw, int n, int w)
+{
+  if(nw <= n)
+  {
+    if(nw <= w)
+    {
+      return 1;
+    }
+    else
+    {
+      return 3;
+    }
+  }
+  else if(n <= w)
+  {
+    return 2;
+  }
+  else
+  {
+    return 3;
+  }
+}  
+
+void
+TMXBuilder::generateTMX(FILE *f1, FILE *f2, FILE *output)
+{
+  fprintf(output, "<?xml version=\"1.0\"?>\n");
+  fprintf(output, "<tmx version=\"1.4\">\n");
+  fprintf(output, "<header creationtool=\"Apertium TMX Builder\"\n");
+  fprintf(output, "        creationtoolversion=\"%s\"\n", PACKAGE_VERSION);
+  fprintf(output, "        segtype=\"sentence\"\n");
+  fprintf(output, "        srclang=\"%s\"\n", UtfConverter::toUtf8(lang1).c_str());
+  fprintf(output, "        adminlang=\"%s\"\n", UtfConverter::toUtf8(lang2).c_str());
+  fprintf(output, "        datatype=\"plaintext\"\n");
+  fprintf(output, "        o-tmf=\"none\">\n");
+  fprintf(output, "</header>\n");
+  fprintf(output, "<body>\n");
+  outputTU(f1, f2, output);
+  fprintf(output, "</body>\n</tmx>\n");
+
+}
+
+void
+TMXBuilder::printTable(int *table, unsigned int nrows, unsigned int ncols)
+{
+  for(unsigned int i = 0; i < nrows; i++)
+  {
+    for(unsigned int j = 0; j < ncols; j++)
+    {
+      if(j != 0)
+      {
+        wcerr << L" ";
+      }
+      wcerr << setw(10) << table[i*ncols + j];
+    }
+    wcerr << endl;
+  }
+}
+
+
+void
+TMXBuilder::printTUCond(FILE *output, wstring const &tu1, wstring const &tu2, bool secure_zone)
+{
+  if(secure_zone && similar(tu1, tu2))
+  {
+    printTU(output, tu1, tu2);
+  }  
+}
+
+void
+TMXBuilder::splitAndMove(FILE *f1, string const &filename)
+{
+  FILE *stream = fopen(filename.c_str(), "w");
+  vector<wstring> fichero_por_cadenas = sentenceList(f1);
+  for(size_t i = 0; i < fichero_por_cadenas.size(); i++)
+  {
+    fputws_unlocked(fichero_por_cadenas[i].c_str(), stream);
+    fputws_unlocked(L"\n", stream);
+  }
+  fclose(stream);
+}
+
+void
+TMXBuilder::outputTU(FILE *f1, FILE *f2, FILE *output)
+{
+  string left = tmpnam(NULL);
+  string right = tmpnam(NULL);
+  string out = tmpnam(NULL);
+
+  splitAndMove(f1, left);
+  fclose(f1);
+
+  splitAndMove(f2, right);
+  fclose(f2);
+
+  TMXAligner::DictionaryItems dict;
+  AlignParameters ap;
+  
+  ap.justSentenceIds = false;
+  ap.utfCharCountingMode = false;
+  ap.realignType=AlignParameters::NoRealign;
+
+  TMXAligner::alignerToolWithFilenames(dict, left, right, ap, out);
+
+  FILE *stream = fopen(out.c_str(), "r");
+  int conta = 0;
+  wstring partes[2];
+  while(true)
+  {
+    wchar_t val = fgetwc(stream);
+    if(feof(stream))
+    {
+      break;
+    }
+  
+    if(val == L'\t')
+    {
+      conta++;
+    }
+    else if(val == L'\n')
+    {
+      if(partes[0] != L"" && partes[1] != L"")
+      {
+        printTU(output, partes[0], partes[1]);
+      }
+      partes[0] = L"";
+      partes[1] = L"";
+      conta = 0;
+    }
+    if(conta < 2)
+    {
+      partes[conta] += val;
+    }
+  }
+  
+  unlink(left.c_str());
+  unlink(right.c_str());
+  unlink(out.c_str());
+
+  /*
+
+
+  int base_i = 0, base_j = 0;
+
+  vector<wstring> lista1 = reverseList(sentenceList(f1)),
+                  lista2 = reverseList(sentenceList(f2)), lista3;
+
+  if(freference != NULL)
+  {
+    lista3 = reverseList(sentenceList(freference));
+  } 
+
+  while(true)
+  { 
+    vector<wstring> l1 = extractFragment(lista1, base_i, window_size);
+    vector<wstring> l2 = extractFragment(lista2, base_j, window_size) , l3;
+
+    if(lista3.size() != 0)
+    {
+      l3 = extractFragment(lista3, base_j, window_size);
+    }
+
+    int *table;
+    if(lista3.size() == 0)
+    {
+      table = levenshteinTable(l1, l2, diagonal_width, max_edit);
+    }
+    else
+    {
+      table = levenshteinTable(l1, l3, diagonal_width, max_edit);
+    }
+
+    unsigned int const nrows = l1.size() + 1;
+    unsigned int const ncols = l2.size() + 1;
+    unsigned int i = nrows - 1;
+    unsigned int j = ncols - 1;
+  
+  
+    //    printTable(table, nrows, ncols);
+  
+    bool newBase = false;
+  
+
+    while(true)
+    {
+      int v = argmin(table[(i-1)*ncols + j-1], // i-1, j-1
+                     table[(i-1)*ncols + j],  // i-j, j
+                     table[i*ncols + j-1]); // i, j-1
+      switch(v)
+      {
+        case 1:
+          i--;
+          j--;
+	  
+          if(l3.size() == 0)
+	  {
+            if((newBase || l1.size() < step) && similar(l1[i], l2[j]))
+  	    {
+  	      printTU(output, l1[i], l2[j]);
+	    }
+	  }
+	  else
+	  {
+            if((newBase || l1.size() < step) && similar(l1[i], l3[j]))
+  	    {
+  	      printTU(output, l1[i], l2[j]);
+	    }
+	  }	    
+          break;
+      
+        case 2: 
+          i--;
+          if(i > 2 && argmin(table[(i-1)*ncols + j-1],
+			     table[(i-1)*ncols + j],  
+			     table[i*ncols + j-1]) == 3 && 
+	              argmin(table[(i-1)*ncols + j-2],
+			     table[(i-1)*ncols + j-1],  
+			     table[i*ncols + j-2]) != 1)
+	    {
+	      if(l3.size() == 0)
+	      {
+		if((newBase || l1.size() < step) && similar(l1[i], l2[j]))
+		  {
+		      printTU(output, l1[i], l2[j]);
+		  }
+		}
+	      else
+		{
+		  if((newBase || l1.size() < step) && similar(l1[i], l3[j]))
+		    {
+		      printTU(output, l1[i], l2[j]);
+		    }
+		}	    
+	    } 
+
+	  //          wcerr << L"[" << i << L" " << j << L"]" << endl;
+         break;
+    
+        case 3:
+          j--;
+          if(j > 2 && argmin(table[(i-1)*ncols + j-1],
+			     table[(i-1)*ncols + j],  
+			     table[i*ncols + j-1]) == 1 && 
+	              argmin(table[(i-1)*ncols + j-2],
+			     table[(i-1)*ncols + j-1],  
+			     table[i*ncols + j-2]) != 3)
+	    {
+	      if(l3.size() == 0)
+	      {
+		if((newBase || l1.size() < step) && similar(l1[i], l2[j]))
+		  {
+		      printTU(output, l1[i], l2[j]);
+		  }
+		}
+	      else
+		{
+		  if((newBase || l1.size() < step) && similar(l1[i], l3[j]))
+		    {
+		      printTU(output, l1[i], l2[j]);
+		    }
+		}	    
+	    } 
+
+
+          break;
+    
+        default:
+          // error
+          break;
+      }
+  
+      if(i == step  && !newBase)
+      {
+         base_i += i;
+         base_j += j;
+         newBase = true;
+      }
+      
+      if(i == 0 || j == 0)
+      {
+        break;
+      }
+    }
+  
+    delete[] table;  
+    
+    if(l1.size() < window_size)
+    {
+      break;
+    }
+    }*/
+}
+
+int 
+TMXBuilder::weight(wstring const &s)
+{
+  return s.size()*2;  // just the size of the string
+}
+
+int * 
+TMXBuilder::levenshteinTable(vector<wstring> &l1, vector<wstring> &l2, 
+			     unsigned int diagonal_width, unsigned int max_edit)
+{  
+  unsigned int const nrows = l1.size() + 1;
+  unsigned int const ncols = l2.size() + 1;
+  
+  int *table = new int[nrows * ncols];
+  
+  table[0] = 0;
+  
+  for(unsigned int i = 1; i < nrows; i++)
+  {
+    table[i*ncols] = table[(i-1)*ncols] + weight(l1[i-1]);
+  }
+  
+  for(unsigned int j = 1; j < ncols; j++)
+  {
+    table[j] = table[j-1] + weight(l2[j-1]);
+  }
+  
+  for(unsigned int i = 1; i < nrows; i++)
+  {
+    for(unsigned int j = 1; j < ncols; j++)
+    {
+      int ed = 0;
+      
+      if(i > (j + diagonal_width))
+      {
+        ed = table[i*ncols]+table[j];
+      }
+      else if(j > (i + diagonal_width))
+      {
+        ed = table[i*ncols]+table[j];
+      }
+      else
+      {
+        ed = editDistance(l1[i-1], l2[j-1], max_edit);
+      }
+      
+      table[i*ncols+j] = min3(table[(i-1)*ncols + j-1] + ed,
+                              table[(i-1)*ncols + j] + weight(l2[j-1]),
+                              table[i*ncols + j-1] + weight(l1[i-1]));
+    }
+  }
+  
+  return table;
+}
+
+wstring
+TMXBuilder::filter(wstring const &tu)
+{
+  bool has_text = false;  
+  unsigned int count_blank = 0;
+
+  for(unsigned int i = 0, limit = tu.size(); i != limit; i++)
+  {
+    if(iswalpha(tu[i]))
+    {
+      has_text = true;
+    }      
+    else if(has_text && iswspace(tu[i]))
+    {
+      count_blank++;
+    }
+  }  
+
+  if(!has_text || count_blank <= 2 || tu.size() == 0)
+  {
+    return L"";
+  }
+
+  return xmlize(tu);  
+}
+
+void
+TMXBuilder::printTU(FILE *output, wstring const &tu1, wstring const &tu2) const
+{
+  wstring tu1_filtered = filter(tu1);
+  wstring tu2_filtered = filter(tu2);
+
+  if(tu1_filtered != L"" && tu2_filtered != L"")
+  {
+
+    fprintf(output, "<tu>\n  <tuv xml:lang=\"%s\"><seg>%s</seg></tuv>\n", 
+                    UtfConverter::toUtf8(lang1).c_str(), 
+                    UtfConverter::toUtf8(tu1_filtered).c_str());
+                  
+    fprintf(output, "  <tuv xml:lang=\"%s\"><seg>%s</seg></tuv>\n</tu>\n",
+                    UtfConverter::toUtf8(lang2).c_str(), 
+                    UtfConverter::toUtf8(tu2_filtered).c_str());  
+  }
+} 
+
+int
+TMXBuilder::min3(int i1, int i2, int i3)
+{
+  if(i1 <= i2)
+  {
+    if(i1 <= i3)
+    {
+      return i1;
+    }
+    else
+    {
+      return i3;
+    }
+  }
+  else if(i2 <= i3)
+  {
+    return i2;
+  }
+  else
+  {
+    return i3;
+  }
+}
+
+int
+TMXBuilder::min2(int i1, int i2)
+{
+  if(i1 <= i2)
+  {
+    return i1;
+  }
+  else
+  {
+    return i2;
+  }
+}
+
+int
+TMXBuilder::editDistance(wstring const &s1, wstring const &s2, unsigned int max_edit)
+{
+  int const nrows = min2(s1.size() + 1, max_edit);
+  int const ncols = min2(s2.size() + 1, max_edit);
+  
+  int *table = new int[nrows*ncols];
+ 
+  table[0] = 0;
+  
+  for(int i = 1; i < nrows; i++)
+  {
+    table[i*ncols] = i;
+  }
+
+  for(int j = 1; j < nrows; j++)
+  {
+    table[j] = j;
+  }
+    
+  for(int i = 1; i < nrows; i++)
+  {
+    for(int j = 1; j < ncols; j++)
+    {
+      int coste = 0;
+      if(s1[i-1] != s2[j-1])
+      {
+        coste = 1;
+      }
+      
+      table[i*ncols+j] = min3(table[(i-1)*ncols+(j-1)]+coste,
+                              table[(i-1)*ncols+j] + 2,
+                              table[i*ncols+(j-1)] + 2);
+    }
+  }
+  int result = table[(nrows*ncols)-1];
+  delete[] table;
+  return result;
+}
+
+void
+TMXBuilder::setMaxEdit(int me)
+{
+  max_edit = me;
+}
+
+void
+TMXBuilder::setDiagonalWidth(int dw)
+{
+  diagonal_width = dw;
+}
+
+void
+TMXBuilder::setWindowSize(int ws)
+{
+  window_size = ws;
+}
+
+void
+TMXBuilder::setStep(int s)
+{
+  step = s;
+}
+
+void
+TMXBuilder::setPercent(double p)
+{
+  percent = p;
+}
+
+void
+TMXBuilder::setLowLimit(int l)
+{
+  low_limit = l;
+}
+
+void
+TMXBuilder::setEditDistancePercent(double e)
+{
+  edit_distance_percent = e;
+}
+
+bool
+TMXBuilder::isRemovablePunct(wchar_t const &c)
+{
+  return c == L'.';
+}
+
+bool
+TMXBuilder::similar(wstring const &s1, wstring const &s2)
+{
+  unsigned int l1 = s1.size();
+  unsigned int l2 = s2.size(); 
+
+  if((l1 <= low_limit) && (l2 <= low_limit))
+  {
+    return true;
+  }
+  else
+  {
+    int maxlength = max(l1, l2);
+    int minlength = min(l1, l2);
+    int ed = editDistance(s1, s2, maxlength);
+
+    if(double(ed) < edit_distance_percent*double(maxlength))
+    { 
+      return double(minlength)/double(maxlength) > percent;
+    }
+    else
+    {
+      return false;
+    }
+  }
+}
+
+void
+TMXBuilder::setTranslation(string const &filename)
+{
+  freference = fopen(filename.c_str(), "r");
+  if(!freference)
+  {
+    wcerr << L"Error: file '" << UtfConverter::fromUtf8(filename);
+    wcerr << L"' cannot be opened for reading" << endl;
+    freference = NULL;
+  }
+
+#ifdef _MSC_VER
+  if(freference != NULL)
+  {
+    _setmode(_fileno(freference), _O_U8TEXT);
+  }
+#endif     
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_instr.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_instr.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_instr.h	(revision 70339)
@@ -0,0 +1,72 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSFERINSTR_
+#define _TRANSFERINSTR_
+
+#include<string>
+
+using namespace std;
+
+enum TransferInstrType
+{
+  ti_clip_sl,
+  ti_clip_tl,
+  ti_var,
+  ti_lit_tag,
+  ti_lit,
+  ti_b,
+  ti_get_case_from,
+  ti_case_of_sl,
+  ti_case_of_tl,
+  ti_linkto_sl,
+  ti_linkto_tl,
+  ti_lu_count
+};
+
+class TransferInstr
+{
+private:
+  TransferInstrType type;
+  string content;
+  int pos;
+  void *pointer;
+  bool condition;
+  
+  void copy(TransferInstr const &o);
+  void destroy();
+public:
+  TransferInstr() :
+  type(ti_clip_sl),
+  pos(0),
+  pointer(0),
+  condition(false)
+  {}
+  TransferInstr(TransferInstrType t, string const &c, int const p, 
+                void *ptr=NULL, bool cond = true);
+  ~TransferInstr();
+  TransferInstr(TransferInstr const &o);
+  TransferInstr & operator =(TransferInstr const &o);
+  
+  
+  TransferInstrType getType();
+  string const & getContent();
+  int getPos();
+  void * getPointer();
+  bool getCondition();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_mult.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_mult.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_mult.h	(revision 70339)
@@ -0,0 +1,98 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSFER_MULT_
+#define _TRANSFER_MULT_
+
+#include <apertium/transfer_instr.h>
+#include <apertium/transfer_token.h>
+#include <apertium/transfer_word.h>
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/buffer.h>
+#include <lttoolbox/fst_processor.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/match_state.h>
+
+#include <cstdio>
+#include <map>
+#include <set>
+#include <vector>
+
+using namespace std;
+
+class TransferMult
+{
+private:
+  
+  Alphabet alphabet;
+  MatchExe *me;
+  MatchState ms;
+  map<string, ApertiumRE, Ltstr> attr_items;
+  map<string, string, Ltstr> variables;
+  map<string, int, Ltstr> macros;
+  map<string, set<string, Ltstr>, Ltstr> lists;
+  map<string, set<string, Ltstr>, Ltstr> listslow;
+  TransferWord **word;
+  string **blank;
+  Buffer<TransferToken> input_buffer;
+  vector<wstring *> tmpword;
+  vector<wstring *> tmpblank;
+  wstring output_string;  
+
+  FSTProcessor fstp;
+  FILE *output;
+  int any_char;
+  int any_tag;
+  bool isRule;
+  unsigned int numwords;
+  
+  unsigned int nwords;
+  
+  enum OutputType{lu,chunk};
+  
+  OutputType defaultAttrs;
+  
+  void destroy();
+  void readData(FILE *input);
+  void readBil(string const &filename);
+  string caseOf(string const &str);
+  string copycase(string const &source_word, string const &target_word);
+
+  bool beginsWith(string const &str1, string const &str2) const;
+  bool endsWith(string const &str1, string const &str2) const;
+  string tolower(string const &str) const;
+  string tags(string const &str) const;
+  wstring readWord(FILE *in);
+  wstring readBlank(FILE *in);
+  wstring readUntil(FILE *in, int const symbol) const;
+  void applyWord(wstring const &word_str);
+  void applyRule();
+  TransferToken & readToken(FILE *in);
+  void writeMultiple(list<vector<wstring> >::iterator itwords,
+                     list<wstring>::iterator itblanks, 
+                     list<vector<wstring> >::const_iterator limitwords, 
+                     wstring acum = L"", bool multiple = false);
+  vector<wstring> acceptions(wstring str);
+  bool isDefaultWord(wstring const &str);
+public:
+  TransferMult();
+  ~TransferMult();
+  
+  void read(string const &datafile, string const &fstfile);
+  void transfer(FILE *in, FILE *out);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_token.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_token.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_token.cc	(revision 70339)
@@ -0,0 +1,90 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer_token.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+void
+TransferToken::copy(TransferToken const &o)
+{
+  type = o.type;
+  content = o.content;
+}
+
+void
+TransferToken::destroy()
+{
+}
+
+TransferToken::TransferToken() :
+type(tt_eof)
+{
+}
+
+TransferToken::TransferToken(wstring const &content,
+			     TransferTokenType type)
+{
+  this->content = content;
+  this->type = type;
+}
+
+TransferToken::~TransferToken()
+{
+  destroy();
+}
+
+TransferToken::TransferToken(TransferToken const &o)
+{
+  copy(o);
+}
+
+TransferToken &
+TransferToken::operator =(TransferToken const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+TransferTokenType
+TransferToken::getType()
+{
+  return type;
+}
+
+wstring & 
+TransferToken::getContent()
+{
+  return content;
+}
+
+void 
+TransferToken::setType(TransferTokenType type)
+{
+  this->type = type;
+}
+
+void 
+TransferToken::setContent(wstring const &content)
+{
+  this->content = content;
+}
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word.cc	(revision 70339)
@@ -0,0 +1,131 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/transfer_word.h>
+#include <iostream>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+void
+TransferWord::copy(TransferWord const &o)
+{
+  s_str = o.s_str;
+  t_str = o.t_str;
+  queue_length = o.queue_length;
+}
+
+void
+TransferWord::destroy()
+{
+}
+
+TransferWord::TransferWord() :
+queue_length(0)
+{
+}
+
+TransferWord::TransferWord(string const &src, string const &tgt, int queue)
+{
+  init(src, tgt);
+  queue_length = queue;
+}
+
+TransferWord::~TransferWord()
+{
+  destroy();
+}
+
+TransferWord::TransferWord(TransferWord const &o)
+{
+  copy(o);
+}
+
+TransferWord &
+TransferWord::operator =(TransferWord const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+void
+TransferWord::init(string const &src, string const &tgt)
+{
+  s_str = src;
+  t_str = tgt;
+}
+
+string
+TransferWord::source(ApertiumRE const &part, bool with_queue)
+{
+  if(with_queue)
+  {
+    return part.match(s_str);
+  }
+  else
+  {
+    return part.match(s_str.substr(0, s_str.size() - queue_length));
+  }
+}
+
+string
+TransferWord::target(ApertiumRE const &part, bool with_queue)
+{
+  if(with_queue)
+  {
+    return part.match(t_str);
+  }
+  else
+  {
+    return part.match(t_str.substr(0, t_str.size() - queue_length));
+  }
+}
+
+void
+TransferWord::setSource(ApertiumRE const &part, string const &value, 
+			bool with_queue)
+{
+  if(with_queue)
+  {
+    part.replace(s_str, value);
+  }
+  else
+  {
+    string mystring = s_str.substr(0, s_str.size() - queue_length);
+    part.replace(mystring, value);
+    s_str = mystring + s_str.substr(s_str.size() - queue_length);
+  }
+}
+
+void
+TransferWord::setTarget(ApertiumRE const &part, string const &value, 
+			bool with_queue)
+{
+  if(with_queue)
+  {
+    part.replace(t_str, value);
+  }
+  else
+  {
+    string mystring = t_str.substr(0, t_str.size() - queue_length);
+    part.replace(mystring, value);
+    t_str = mystring + t_str.substr(t_str.size() - queue_length);
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/trx_reader.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/trx_reader.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/trx_reader.h	(revision 70339)
@@ -0,0 +1,83 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRXREADER_
+#define _TRXREADER_
+
+#include <apertium/transfer_data.h>
+#include <lttoolbox/ltstr.h>
+
+#include <libxml/xmlreader.h>
+#include <map>
+#include <string>
+
+using namespace std;
+
+class TRXReader
+{
+private:
+  struct LemmaTags
+  {
+    wstring lemma;
+    wstring tags;
+  };
+
+  xmlTextReaderPtr reader;  
+
+  int type;
+  wstring name;
+
+  multimap<wstring, LemmaTags, Ltstr> cat_items;
+  TransferData td;
+
+  wstring attrib(wstring const &name);
+
+  void parseError(wstring const &message);
+  void destroy();
+  void clearTagIndex();
+  
+  void step();
+  void procTransfer();
+  void procDefCats();
+  void procDefAttrs();
+  void procDefVars();
+  void procDefLists();
+  void procDefMacros();
+  void procRules();
+
+  void insertCatItem(wstring const &name, wstring const &lemma, 
+		     wstring const &tags);
+  void insertAttrItem(wstring const &name, wstring const &tags);
+  void createVar(wstring const &name, wstring const &initial_value);
+  void insertListItem(wstring const &name, wstring const &value);
+  void createMacro(wstring const &name, int const val);
+
+  int insertLemma(int const base, wstring const &lemma);
+  int insertTags(int const base, wstring const &tags);
+  
+public:
+  static wstring const ANY_TAG;
+  static wstring const ANY_CHAR;
+
+
+  TRXReader();
+  ~TRXReader();
+
+  void read(string const &filename);
+  void write(string const &filename);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tsx_reader.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tsx_reader.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tsx_reader.h	(revision 70339)
@@ -0,0 +1,82 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TSXREADER_
+#define _TSXREADER_
+
+#include <apertium/constant_manager.h>
+#include <apertium/tagger_data.h>
+#include <apertium/ttag.h>
+#include <lttoolbox/pattern_list.h>
+#include <lttoolbox/ltstr.h>
+
+#include <libxml/xmlreader.h>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+class TSXReader
+{
+private:
+  xmlTextReaderPtr reader;  
+  set<TTag> *open_class;
+  vector<TForbidRule> *forbid_rules;
+  map<wstring, TTag, Ltstr> *tag_index;
+  vector<wstring> *array_tags;
+  vector<TEnforceAfterRule> *enforce_rules;
+  vector<wstring> *prefer_rules;
+  PatternList *plist;
+  ConstantManager *constants;
+  TaggerData tdata;
+
+  int type;
+  wstring name;
+
+  wstring attrib(wstring const &name);
+
+  void parseError(wstring const &message);
+  void newTagIndex(wstring const &tag);
+  void newDefTag(wstring const &tag);
+  void newConstant(wstring const &constant);
+  void procDefLabel();
+  void procDefMult();
+  void procDiscardOnAmbiguity();
+  void procTagset();
+  void procForbid();
+  void procLabelSequence();
+  void procEnforce();
+  void procPreferences();
+  void destroy();
+  void clearTagIndex();
+
+  void step();
+public:
+  TSXReader();
+  ~TSXReader();
+
+  void read(string const &filename);
+  TaggerData & getTaggerData();
+
+private:
+  void copy(TSXReader const &o);
+  TSXReader(TSXReader const &o);
+  TSXReader & operator =(TSXReader const &o);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium.1	(revision 70339)
@@ -0,0 +1,115 @@
+.TH apertium 1 2006-03-08 "" ""
+.SH NAME
+apertium \- This application is part of (
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.sf.net\fR.
+.SH SYNOPSIS
+.B apertium
+[\-d datadir] [\-f format] [\-u] [\-a] {language-pair} [infile [outfile]]
+.SH DESCRIPTION
+.BR apertium 
+is the application that most people will be using as it simplifies the
+use of apertium/lt-toolbox tools for machine translation
+purposes. 
+.PP
+This tool tries to ease the use of \fIlt-toolbox\fR (which contains
+all the lexical processing modules and tools) and \fIapertium\fR
+(which contains the rest of the engine) by providing a unique
+front-end to the end-user.
+.PP
+The different modules behind the apertium machine translation
+architecture are in order:
+.RS
+\(bu \fIde-formatter:\fR Separates the text to be translated from the
+format information.
+.PP
+\(bu \fImorphological-analyser:\fR Tokenizes the text in surface forms.
+.PP
+\(bu \fIpart-of-speech tagger:\fR Chooses one surface forms among
+homographs.
+.PP
+\(bu \fIlexical transfer module:\fR Reads each source-language lexical
+form and delivers a corresponding target-language lexical form.
+.PP
+\(bu \fIstructural transfer module:\fR Detects fixed-length patterns
+of lexical forms (chunks or phrases) needing special processing due to
+grammatical divergences between the two languages and performs the
+corresponding transformations.
+.PP
+\(bu \fImorphological generator:\fR Delivers a target-language surface
+form for each target-language lexical form, by suitably inflecting it.
+.PP
+\(bu \fIpost-generator:\fR Performs orthographical operations such as
+contractions and apostrophations.
+.PP
+\(bu \fIre-formatter:\fR Restores the format information encapsulated
+by the de-formatter into the translated text and removes the
+encapsulation sequences used to protect certain characters in the
+source text.
+.RE
+.SH OPTIONS
+.PP
+.B -d datadir
+The directory holding the linguistic data.  By default it will use the
+expected installation path.
+.PP
+.B language-pair
+The language pair: LANG1-LANG2 (for instance \fIes-ca\fR or \fIca-es\fR).
+.PP
+.B -f format
+Specifies the format of the input and output files which can have
+these values:
+.RS
+\(bu \fItxt\fR \fB(default value)\fR Input and output files are in
+text format.
+.PP
+\(bu \fIhtml\fR Input and output files are in "html" format. This
+"html" is the one accepted by the vast majority of web browsers.
+.PP
+\(bu \fIhtml-noent\fR Input and output files are in "html" format, but
+preserving native encoding characters rather than using HTML text
+entities.
+.PP
+\(bu \fIrtf\fR Input and output files are in "rtf" format. The
+accepted "rtf" is the one generated by \fBMicrosoft WordPad (C)\fR and
+\fBMicrosoft Office (C)\fR up to and including \fBOffice-97\fR.
+.RE
+.PP
+.B -u
+Disable marking of unknown words with the '*' character.
+.PP
+.B -a
+Enable marking of disambiguated words with the '=' character.
+.RS
+.SH FILES
+These are the two files that can be used with this command:
+.PP
+.B -m memory.tmx
+use a translation memory to recycle translations
+.PP
+.B -o direction 
+translation direction using the translation memory, by default 'direction' is used instead
+.PP
+.B -l
+lists the available translation directions and exits direction        
+typically, LANG1-LANG2, but see modes.xml in language data
+.PP
+.B infile
+Input file (stdin by default).
+.PP
+.B outfile
+Output file (stdout by default).
+.PP
+.SH SEE ALSO
+.I lt-proc\fR(1),
+.I lt-comp\fR(1),
+.I lt-expand\fR(1),
+.I apertium-tagger\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-multiple-translations.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-multiple-translations.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-multiple-translations.cc	(revision 70339)
@@ -0,0 +1,97 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer_mult.h>
+#include <lttoolbox/lt_locale.h>
+#include <apertium/apertium_config.h>
+
+#include <cstdlib>
+#include <iostream>
+#include <libgen.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+#ifdef WIN32
+#if defined(__MINGW32__)
+#define __MSVCRT_VERSION__  0x0800
+#endif
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace std;
+
+void message(char *progname)
+{
+  cerr << "USAGE: " << basename(progname) << " preproc biltrans [input [output]]" << endl;
+  cerr << "  preproc    result of preprocess trules file" << endl;
+  cerr << "  biltrans   bilingual letter transducer file" << endl;
+  cerr << "  input      input file, standard input by default" << endl;
+  cerr << "  output     output file, standard output by default" << endl;
+  exit(EXIT_FAILURE);
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  
+  if(argc > 5 || argc <3)
+  {
+    message(argv[0]);
+  }
+
+  for(unsigned int i = 1; i < 3; i++)
+  {
+    struct stat mybuf;
+    if(stat(argv[i], &mybuf) == -1)
+    {
+      cerr << "Error: can't stat file '";
+      cerr << argv[i] << "'." << endl;
+      exit(EXIT_FAILURE);
+    }
+  }
+  
+  FILE *input = stdin, *output = stdout;
+  if(argc >= 4)
+  {
+    input = fopen(argv[3], "r");
+    if(!input)
+    {
+      cerr << "Error: can't open input file '" << argv[3] << "'." << endl;
+      exit(EXIT_FAILURE);
+    }
+    if(argc == 5)
+    {
+      output = fopen(argv[4], "w");
+      if(!output)
+      {
+	cerr << "Error: can't open output file '";
+	cerr << argv[4] << "'." << endl;
+	exit(EXIT_FAILURE);
+      }
+    }
+  }
+#ifdef WIN32
+  _setmode(_fileno(input), _O_U8TEXT);
+  _setmode(_fileno(output), _O_U8TEXT);
+#endif 
+
+  TransferMult t;
+  t.read(argv[1], argv[2]);
+
+  t.transfer(input, output);
+  return EXIT_SUCCESS;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_re.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_re.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_re.h	(revision 70339)
@@ -0,0 +1,42 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _APERTIUM_RE_
+#define _APERTIUM_RE_
+
+#include <pcre.h>
+#include <cstdio>
+#include <string>
+
+using namespace std;
+
+class ApertiumRE
+{
+private:
+  bool empty;
+  pcre *re;
+public:
+  ApertiumRE();
+  ~ApertiumRE();
+  void read(FILE *);
+  void write(FILE *) const;
+  string match(string const &str) const;
+  void replace(string &str, string const &value) const;
+  void compile(string const &str);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/collection.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/collection.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/collection.cc	(revision 70339)
@@ -0,0 +1,91 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <lttoolbox/compression.h>
+#include <apertium/collection.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+int
+Collection::size()
+{
+  return element.size();
+}
+
+bool 
+Collection::has_not(const set<int> &t)
+{
+  return index.find(t) == index.end();
+}
+
+const set<int> &
+Collection::operator[](int n)
+{
+  return *element[n];
+}
+
+int &
+Collection::operator[](const set<int> &t)
+{
+  if(has_not(t))
+  {
+    index[t] = index.size()-1;
+    element.push_back(&(index.find(t)->first));
+  }
+  return index[t];
+}
+
+int &
+Collection::add(const set<int> &t)
+{
+  index[t] = index.size()-1;
+  element.push_back(&(index.find(t)->first));
+  return index[t];
+}
+
+void
+Collection::write(FILE *output)
+{
+  Compression::multibyte_write(element.size(), output);
+
+  for(int i = 0, limit = element.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(element[i]->size(), output);
+    for(set<int>::const_iterator it = element[i]->begin(), 
+	  limit2 = element[i]->end(); it != limit2; it++)
+    {
+      Compression::multibyte_write(*it, output);
+    }
+  }
+}
+
+void
+Collection::read(FILE *input)
+{
+  int size = Compression::multibyte_read(input);
+
+  for(; size != 0; size--)
+  {
+    set<int> myset;
+    int set_size = Compression::multibyte_read(input);
+    for(; set_size != 0; set_size--)
+    {
+      myset.insert(Compression::multibyte_read(input));
+    }
+    add(myset);
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/collection.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/collection.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/collection.h	(revision 70339)
@@ -0,0 +1,76 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __COLLECTION_H
+#define __COLLECTION_H
+
+#include <cstdio>
+#include <map>
+#include <set>
+#include <vector>
+
+using namespace std;
+
+/** Collection
+ *  Is an indexed set.
+ */ 
+class Collection {
+  map <set<int>, int> index;
+  vector <const set<int> *> element;
+public:
+  /** Returns the collection's size. 
+   */
+  int size (void);
+
+  /** Checks whether or not the collection has the element received as
+   *  a parameter.  
+   *  @param t element @return true if t is not in the
+   *  collection
+   */
+  bool has_not (const set<int>& t);
+
+  /** @param n position in the collection
+   *  @return the element at the n-th position
+   */
+  const set<int>& operator[] (int n);
+
+  /** If the element received as a parameter does not appear in the
+   *  collection, it is added at the end.  
+   *  @param t an element @return
+   *  the position in which t appears in the collection.
+   */
+  int& operator[] (const set<int>& t);
+
+  /** Adds an element to the collection
+   *  @param t the element to be added
+   */  
+  int& add(const set<int>& t);
+
+  /** 
+   *  Write the collection contents to an output stream
+   *  @param output the output stream
+   */
+  void write(FILE *output);
+
+  /**
+   *  Reads the collection contents from an input stream
+   *  @param input the input stream
+   */
+  void read(FILE *input);
+};
+
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/constant_manager.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/constant_manager.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/constant_manager.cc	(revision 70339)
@@ -0,0 +1,92 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/constant_manager.h>
+#include <lttoolbox/compression.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+void
+ConstantManager::copy(ConstantManager const &o)
+{
+  constants = o.constants;
+}
+
+void
+ConstantManager::destroy()
+{
+}
+
+ConstantManager::ConstantManager()
+{
+}
+
+ConstantManager::~ConstantManager()
+{
+  destroy();
+}
+
+ConstantManager::ConstantManager(ConstantManager const &o)
+{
+  copy(o);
+}
+
+ConstantManager &
+ConstantManager::operator =(ConstantManager const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+void 
+ConstantManager::setConstant(wstring const &constant, int const value)
+{
+  constants[constant] = value;
+}
+
+int 
+ConstantManager::getConstant(wstring const &constant)
+{
+  return constants[constant];
+}  
+
+void
+ConstantManager::write(FILE *output)
+{
+  Compression::multibyte_write(constants.size(), output);
+
+  for(map<wstring, int>::const_iterator it = constants.begin(), limit = constants.end();
+      it != limit; it++)
+  {
+    Compression::wstring_write(it->first, output);
+    Compression::multibyte_write(it->second, output);
+  }
+}
+
+void
+ConstantManager::read(FILE *input)
+{
+  constants.clear();
+  int size = Compression::multibyte_read(input);
+  for(int i = 0; i != size; i++)
+  {
+    wstring mystr = Compression::wstring_read(input);
+    constants[mystr] = Compression::multibyte_read(input);
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/constant_manager.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/constant_manager.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/constant_manager.h	(revision 70339)
@@ -0,0 +1,45 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _CONSTANTMANAGER_
+#define _CONSTANTMANAGER_
+
+#include <cstdio>
+#include <map>
+#include <string>
+
+using namespace std;
+
+class ConstantManager
+{
+private:
+  map<wstring, int> constants; 
+
+  void copy(ConstantManager const &o);
+  void destroy();
+public:
+  ConstantManager();
+  ~ConstantManager();
+  ConstantManager(ConstantManager const &o);
+  ConstantManager & operator =(ConstantManager const &o);
+  
+  void setConstant(wstring const &constant, int const value);
+  int getConstant(wstring const &constant);
+  void write(FILE *output);
+  void read(FILE *input);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/endian_double_util.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/endian_double_util.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/endian_double_util.cc	(revision 70339)
@@ -0,0 +1,93 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <cstdio>
+#include <iostream>
+#include <apertium/endian_double_util.h>
+#include <apertium/apertium_config.h>
+#include <apertium/unlocked_cstdio.h>
+
+using namespace std;
+
+double 
+EndianDoubleUtil::read(FILE *input)
+{
+  double retval;
+#ifdef WORDS_BIGENDIAN
+  fread_unlocked(&retval, sizeof(double), 1, input);
+#else
+  char *s = reinterpret_cast<char *>(&retval);
+
+  for(int i = sizeof(double)-1; i != -1; i--)
+  {
+    if(fread_unlocked(&(s[i]), 1, 1, input)==0)
+    {
+      return 0;
+    }
+  } 
+#endif
+  return retval;
+}
+
+double
+EndianDoubleUtil::read(istream &is)
+{
+  double retval;
+#ifdef WORDS_BIGENDIAN
+  is.read((char *) &retval, sizeof(double));
+#else
+  char *s = reinterpret_cast<char *>(&retval);
+
+  for(int i = sizeof(double)-1; i != -1; i--)
+  {
+    is.read(&(s[i]), sizeof(char));
+  } 
+#endif
+  return retval;    
+}
+  
+void 
+EndianDoubleUtil::write(FILE *output, double const &val)
+{
+  double val2 = val;
+#ifdef WORDS_BIGENDIAN
+  fwrite(&val2, sizeof(double), 1, output);
+#else
+  char *s = reinterpret_cast<char *>(&val2);
+    
+  for(int i = sizeof(double)-1; i != -1; i--)
+  {
+    fwrite(&(s[i]), 1, 1, output);
+  }
+#endif
+}
+
+void 
+EndianDoubleUtil::write(ostream &os, double const &val)
+{
+  double val2 = val;
+#ifdef WORDS_BIGENDIAN
+  os.write(reinterpret_cast<char *>(&val2), sizeof(double));
+#else
+  char *s = reinterpret_cast<char *>(&val2);
+    
+  for(int i = sizeof(double)-1; i != -1; i--)
+  {
+    os.write(&(s[i]), sizeof(char));
+  }
+#endif
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/endian_double_util.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/endian_double_util.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/endian_double_util.h	(revision 70339)
@@ -0,0 +1,61 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _ENDIANDOUBLEUTIL_
+#define _ENDIANDOUBLEUTIL_
+
+#include <cctype>
+#include <cstdio>
+#include <iostream>
+
+using namespace std;
+
+/**
+ * Generic class to process correctly endian-enabled I/O operations
+ */
+class EndianDoubleUtil
+{
+public:
+  /**
+   * Read procedure.
+   * @param input the stream to read from.
+   * @returns the first element readed from the current position of the stream
+   */
+  static double read(FILE *input);
+
+  /**
+   * Read procedure, C++ I/O version.
+   * @param is the stream to read from.
+   * @returns the first element readed from the current position of the stream
+   */
+  static double read(istream &is);
+  
+  /**
+   * Write procedure.
+   * @param output the stream to write to
+   * @param val the value of the generic object to write to the stream
+   */
+  static void write(FILE *output, double const &val);
+  
+  /**
+   * Write procedure, C++ I/O version.
+   * @param output the stream to write to
+   * @param val the value of the generic object to write to the stream
+   */
+  static void write(ostream &os, double const &val);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/format.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/format.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/format.dtd	(revision 70339)
@@ -0,0 +1,141 @@
+<!--
+   Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+      DTD for the format specification files
+      Sergio Ortiz  2005.05.13
+-->
+
+
+<!ELEMENT format (options,rules)> 
+<!ATTLIST format name CDATA #REQUIRED> 
+<!--
+      'format' is the root element containing the whole format specification
+      file.  The attribute 'name' specifies the name of the format
+-->
+
+<!ELEMENT options (largeblocks,input,output, tag-name, escape-chars,space-chars,case-sensitive)>
+<!--
+      General options of the format 
+-->
+		
+<!ELEMENT largeblocks EMPTY>
+<!ATTLIST largeblocks size CDATA #REQUIRED>
+<!-- 
+      The attribute size is used to define the maximal size in bytes of
+      inline format blocks
+-->
+		
+<!ELEMENT input EMPTY>
+<!ATTLIST input zip-path CDATA #IMPLIED>
+<!ATTLIST input encoding CDATA #REQUIRED>
+<!--  
+      Reserved for future extensions
+-->
+		
+<!ELEMENT output EMPTY>
+<!ATTLIST output zip-path CDATA #IMPLIED>
+<!ATTLIST output encoding CDATA #REQUIRED>
+<!--
+      Reserved for future extensions
+-->
+
+<!ELEMENT tag-name EMPTY>
+<!ATTLIST tag-name regexp CDATA #REQUIRED>
+<!--
+      The attribute regexp defines (whith a _flex_ regular expression) how 
+      take a tag name from a whole tag. '\'
+-->
+
+<!ELEMENT escape-chars EMPTY>
+<!ATTLIST escape-chars regexp CDATA #REQUIRED>
+<!--
+      The attribute regexp defines (whith a _flex_ regular expression) the
+      set of characters to be escaped with preceding a backslash '\'
+-->
+
+<!ELEMENT space-chars EMPTY>
+<!ATTLIST space-chars regexp CDATA #REQUIRED>
+<!--
+      Define the space characters (in regexp) with a _flex_ regular 
+      expression
+-->
+
+<!ELEMENT case-sensitive EMPTY>
+<!ATTLIST case-sensitive value (yes|no) #REQUIRED>
+<!--
+      The attribute 'value' is set to 'yes' if the case is relevant in the 
+      specification of the format.  Otherwise is set to 'no'
+-->
+
+		
+<!ELEMENT rules (format-rule|replacement-rule)+>
+<!--
+      Group the rules of processing format and the rules of substitute 
+      expressions by characters that are part of the text
+-->
+
+<!ELEMENT format-rule (tag|(begin,end))>
+<!ATTLIST format-rule type (comment|empty|open|close) #IMPLIED>
+<!ATTLIST format-rule eos (yes|no) #IMPLIED>
+<!ATTLIST format-rule priority CDATA #REQUIRED>
+<!--
+      Format rule parent element.  It may include a 'tag' element or
+      a couple of elements 'begin', 'end'.  In the first case, this element is 
+      considered to be part of the format.  In the second case, the begin and 
+      the end element are considered to enclosing format.  The attribute
+      'eos' (end of sentence) is set to 'yes' if that rule defines a dot in
+      the text being processed (is no by default).  The attribute 'priority' 
+      marks the order of precedence of the rule
+-->
+      
+<!ELEMENT tag EMPTY>
+<!ATTLIST tag regexp CDATA #REQUIRED>
+<!--
+      Define an element that is part of the format by the pattern specified
+      as a value for the regexp attribute
+-->
+
+<!ELEMENT begin EMPTY>
+<!ATTLIST begin regexp CDATA #REQUIRED>
+<!--
+      The attribute 'regexp' is the regular expression that detects the
+      begining delimiter of a block of format
+-->
+
+<!ELEMENT end EMPTY>
+<!ATTLIST end regexp CDATA #REQUIRED>
+<!--
+      The attribute 'regexp' is the regular expression that detects the
+      ending delimiter of a block of format
+-->
+
+<!ELEMENT replacement-rule (replace+)>
+<!ATTLIST replacement-rule regexp CDATA #REQUIRED>
+<!-- 
+      Root element for a replacement rule.  The attribute 'regexp' is the
+      general expression to detect the elements to replace
+-->
+
+<!ELEMENT replace EMPTY>
+<!ATTLIST replace source CDATA #REQUIRED>
+<!ATTLIST replace target CDATA #REQUIRED>
+<!ATTLIST replace prefer (yes|no) #IMPLIED>
+<!--  
+      Replacement rule.  The 'source' is a string of one or more characters.
+      The 'target' MUST be a single character.  The 'prefer' attribute, when 
+      set to 'yes' defines the preferred reverse translation of the 
+      replacement.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk.dtd	(revision 70339)
@@ -0,0 +1,442 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!-- 
+   Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+    Draft of DTD for the structural transfer rule files 
+     
+    Sergio Ortiz, Gema Ram�rez-S�nchez, Mireia Ginest�, Mikel L. Forcada, 
+    2005.07.29. 
+-->    
+
+<!ENTITY % condition "(and|or|not|equal|begins-with|begins-with-list|ends-with|ends-with-list|contains-substring|in)">
+<!ENTITY % container "(var|clip)">
+<!ENTITY % sentence "(let|out|choose|modify-case|call-macro|append)">
+<!ENTITY % value "(b|clip|lit|lit-tag|var|get-case-from|case-of|concat|chunk)">
+<!ENTITY % stringvalue "(clip|lit|var|get-case-from|case-of)">
+
+<!ELEMENT interchunk (section-def-cats, section-def-attrs, section-def-vars, section-def-lists?, section-def-macros?, section-rules)>
+<!-- 
+     'interchunk' is the root element containing the whole structural
+     interchunk rule file.  
+-->
+
+<!ELEMENT section-def-cats (def-cat+)>
+<!-- 
+     The 'def-cats' section defines the categories used to build the
+patterns used in rules
+ -->
+
+<!ELEMENT def-cat (cat-item+)>
+<!ATTLIST def-cat  n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!-- 
+     Each 'def-cat' defines one category in terms of a list of
+     category items and has a unique name 'n', which is mandatory
+-->
+
+<!ELEMENT cat-item EMPTY>
+<!ATTLIST cat-item lemma CDATA #IMPLIED 
+                   tags CDATA #REQUIRED 
+                   c CDATA #IMPLIED> 
+<!-- 
+          Each 'cat-item' (category item) represents a set of lexical forms
+     and has a mandatory attribute 'tags' whose value is a sequence of
+     dot-separated tag names; this sequence is a subsequence of the
+     tag sequence defining each possible lexical form. For example,
+     tags="n.f" would match all lexical forms containing this tag
+     sequence, such as "^casa<n><f><pl>$".
+
+     In addition, an optional attribute, "lemma", may be used to
+     define lexical forms having a particular substring in their lemma
+-->
+ 
+<!ELEMENT section-def-attrs (def-attr+)>
+
+<!-- 
+     The 'def-attrs' section defines the attributes that will be
+     identified in matched lexical forms 
+-->
+
+<!ELEMENT def-attr (attr-item+)>
+<!ATTLIST def-attr n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!-- 
+     Each def-attr defines one attribute in terms of a list of
+     attribute items and has a mandatory unique name n 
+-->
+
+<!ELEMENT attr-item EMPTY>
+<!ATTLIST attr-item tags CDATA #IMPLIED
+                    c CDATA #IMPLIED>
+<!-- 
+     Each 'attr-item' specifies a subsequence of the tags in
+     that lexical form (attribute 'tags')
+-->
+
+<!ELEMENT section-def-vars (def-var+)>
+<!-- 
+     The 'def-vars' section defines the global variables
+     that will be used to transfer information between rules
+-->
+
+<!ELEMENT def-var EMPTY>
+<!ATTLIST def-var n ID #REQUIRED
+                  v CDATA #IMPLIED
+                  c CDATA #IMPLIED>
+<!-- 
+     The definition of a global variable has a mandatory unique name 'n' that
+     will be used to refer to it. A value of initialization can also be specified
+     by means the 'v' attribute.  The default value of the initialization is the
+     empty string.
+-->
+
+<!ELEMENT section-def-lists (def-list)+>
+<!--
+     Element 'section-def-lists' encloses a set of list definitions
+-->
+
+<!ELEMENT def-list (list-item+)>
+<!ATTLIST def-list n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!--
+     The 'def-list' element defines a named list to search with the 'in' 
+     element.  Attribute 'n' sets the name of the list
+-->
+
+<!ELEMENT list-item EMPTY>
+<!ATTLIST list-item v CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+<!--
+     Attribute 'v' of 'list-item' element contains the value to be added to 
+     the list being defined     
+-->
+
+<!ELEMENT section-def-macros (def-macro)+>
+<!-- 
+
+     The 'def-macros' section defines macros containing portions of
+     code frequently used in the action part of rules
+
+-->
+
+<!ELEMENT def-macro (%sentence;)+>
+<!ATTLIST def-macro n ID #REQUIRED>
+<!ATTLIST def-macro npar CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+<!-- 
+     Macro definition:
+     
+     A macro has a mandatory name (the value of 'n'), a number of parameters
+     (the value of 'npar') and a body containing arguments and statements.  
+-->
+
+<!ELEMENT section-rules (rule+)>
+<!-- 
+     The rules section contains a sequence of one or more rules
+-->
+
+<!ELEMENT rule (pattern, action)>
+<!ATTLIST rule comment CDATA #IMPLIED>
+<!-- 
+      Each rule has a pattern and an action 
+      * attribute 'comment' allows to put in comments about the purpose of
+        the rule being defined
+-->
+
+<!ELEMENT pattern (pattern-item+)>
+<!-- 
+The pattern is specified in terms of pattern items, each one
+representing a lexical form in the matched pattern 
+-->
+
+<!ELEMENT pattern-item EMPTY>
+<!ATTLIST pattern-item n IDREF #REQUIRED>
+<!-- 
+       Each attribute to be activated is referred to by its name in the def-cats section 
+-->
+
+<!ELEMENT action (%sentence;)*>
+<!ATTLIST action c CDATA #IMPLIED>
+<!-- 
+       Encloses the procedural part of a rule
+-->
+
+<!ELEMENT choose (when+,otherwise?)>
+<!ATTLIST choose c CDATA #IMPLIED>
+<!-- 
+     The choose statement is a selection statement (similar to a case
+     statement) composed of one or more tested cases and an optional
+     otherwise 
+-->
+
+<!ELEMENT when (test,(%sentence;)*)>
+<!ATTLIST when c CDATA #IMPLIED>
+<!-- 
+     Each tested case is a block of zero or more statements 
+-->
+
+<!ELEMENT otherwise (%sentence;)+>
+<!ATTLIST otherwise c CDATA #IMPLIED>
+<!-- 
+     The otherwise case is also a block of one or more statements 
+-->
+
+<!ELEMENT test (%condition;)>
+<!ATTLIST test c CDATA #IMPLIED>
+<!-- 
+     The test in a tested case may be a conjunction, a disjunction, or
+     a negation of simpler tests, as well as a simple equality test
+-->
+
+<!ELEMENT and ((%condition;),(%condition;)+)>
+<!--  
+     Each conjuntion test contains two or more simpler tests 
+-->
+
+<!ELEMENT or ((%condition;),(%condition;)+)>
+<!-- 
+     Each disjunction test contains two or more simpler tests 
+-->
+
+<!ELEMENT not (%condition;)>
+<!-- 
+     The negation of a simpler test is a test itself 
+-->
+
+<!ELEMENT equal (%value;,%value;)> 
+<!ATTLIST equal caseless (no|yes) #IMPLIED>
+<!-- 
+      The simplest test is an equality test. The right part and the
+      left part of the equality may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT begins-with (%value;,%value;)> 
+<!ATTLIST begins-with caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the beginning.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT ends-with (%value;,%value;)> 
+<!ATTLIST ends-with caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the end.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT begins-with-list (%value;,list)> 
+<!ATTLIST begins-with-list caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the beginning.
+      First parts of the test may be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section. The second part
+      must be always a list.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+<!ELEMENT ends-with-list (%value;,list)> 
+<!ATTLIST ends-with-list caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the end.
+      First parts of the test may be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section. The second part
+      must be always a list.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+<!ELEMENT contains-substring (%value;,%value;)> 
+<!ATTLIST contains-substring caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+
+
+<!ELEMENT in (%value;, list)>
+<!ATTLIST in caseless (no|yes) #IMPLIED>
+<!--
+    'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+    this search is performed without attending to the case
+-->
+
+<!ELEMENT list EMPTY>
+<!ATTLIST list n IDREF #REQUIRED>
+<!--
+    'list' refers, with the name in attribute 'n', a list defined before in
+    the 'section-def-list' section
+-->
+
+<!ELEMENT let (%container;, %value;)>
+<!-- 
+      An assignment statement ('let') assigns the value of a clip (see
+      below), a literal string ('lit'), a literal tag('lit-tag') or the 
+      value of a global variable ('var') to either a global variable ('var') 
+      or a clip
+-->
+
+<!ELEMENT append (%value;)+>
+<!ATTLIST append n IDREF #REQUIRED>
+<!-- 
+      This instruction appends the value of a clip (see
+      below), a literal string ('lit'), a literal tag('lit-tag') or the 
+      value of a global variable ('var') to either a global variable ('var') 
+      or a clip, identified by the "n" attribute
+-->
+
+
+<!ELEMENT out (b|chunk|var)+>
+<!ATTLIST out c CDATA #IMPLIED>
+<!-- 
+      'out' is an output statement; it may output blanks or chunks
+-->
+
+<!ELEMENT modify-case (%container;, %stringvalue;)>
+<!--
+      The first argument of 'modify-case' copy the case of the second 
+      argument.
+--> 
+
+<!ELEMENT call-macro (with-param)*>
+<!ATTLIST call-macro n IDREF #REQUIRED>
+<!-- 
+      A macro may be called anywhere by name with one or more
+      arguments
+-->
+
+<!ELEMENT with-param EMPTY>
+<!ATTLIST with-param pos CDATA #REQUIRED>
+<!-- 
+      The attribute pos in each argument is used to refer to a lexical
+      form in the current rule. For example, if a 2-parameter macro
+      has been defined to perform noun-adjective agreement operations,
+      it may be used with arguments 1 and 2 in a noun-adjective rule,
+      with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+      arguments 1 and 3 in a noun-adverb-adjective rule, and with
+      arguments 2 and 1 in an adjective-noun rule 
+-->
+
+<!ELEMENT clip EMPTY>
+<!ATTLIST clip pos CDATA #REQUIRED
+               part CDATA #REQUIRED
+               c CDATA #IMPLIED>
+<!-- 
+      A 'clip' is a substring of a source-language or target-language
+      lexical form, extracted according to an attribute:
+
+      * 'pos' is an index (1, 2, 3...) used to select a lexical form
+         inside the rule;
+   
+      * the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+
+-->
+
+<!ELEMENT lit EMPTY>
+<!ATTLIST lit v CDATA #REQUIRED>
+<!-- 
+      A literal string value: the value of the literal is the value of
+      the 'v' attribute
+-->
+
+<!ELEMENT lit-tag EMPTY>
+<!ATTLIST lit-tag v CDATA #REQUIRED>
+<!-- 
+      A literal string value: the value of the literal is the value of
+      the 'v' attribute
+-->
+
+
+<!ELEMENT var EMPTY>
+<!ATTLIST var n IDREF #REQUIRED>
+<!-- 
+     Each 'var' is a variable identifier: the attribute n is the name
+     of the variable. When it is in an 'out', a 'test', or the right
+     part of a 'let', it represents the value of the variable; when in
+     the left part of a 'let' it represents the reference of the
+     variable. 
+-->
+
+<!ELEMENT get-case-from (clip|lit|var)> 
+<!ATTLIST get-case-from pos CDATA #REQUIRED>
+<!-- Atenci�n, falta modificar todos los comentarios donde intervenga
+get-case-from -->
+
+<!ELEMENT case-of EMPTY>
+<!ATTLIST case-of pos CDATA #REQUIRED
+               part CDATA #REQUIRED>
+<!--
+      A 'case-of' is a value representing the case of a "clip".  This value 
+      will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+      (all uppercase).
+
+      * 'pos' is an index (1, 2, 3...) used to select a lexical form
+         inside the rule;
+   
+      * the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+-->
+
+
+<!ELEMENT concat (%value;)+>
+<!-- Concatenates a sequence of values -->
+
+<!ELEMENT chunk (%value;)+>
+<!-- 
+     Encloses a chunk      
+-->
+
+<!ELEMENT pseudolemma (%value;)>
+
+<!ELEMENT b EMPTY>
+<!ATTLIST b pos CDATA #IMPLIED>
+<!-- 
+     'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+     with pos="2" refers to the [super]blanks (including format data
+     encapsulated by the de-formatter) between lexical form 2 and
+     lexical form 3. Managing [super]blanks explicitly allows for the
+     correct placement of format when the result of structural
+     transfer has more or less lexical items than the original or has
+     been reordered in some way.  If attribute "pos" is not specified, then
+     a single blank (ASCII 32) is generated.
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk_word.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk_word.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk_word.cc	(revision 70339)
@@ -0,0 +1,115 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/interchunk_word.h>
+#include <iostream>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+void
+InterchunkWord::copy(InterchunkWord const &o)
+{
+  this->chunk = o.chunk;
+}
+
+void
+InterchunkWord::destroy()
+{
+}
+
+InterchunkWord::InterchunkWord()
+{
+}
+
+InterchunkWord::InterchunkWord(string const &chunk)
+{
+  init(chunk);
+}
+
+InterchunkWord::~InterchunkWord()
+{
+  destroy();
+}
+
+InterchunkWord::InterchunkWord(InterchunkWord const &o)
+{
+  copy(o);
+}
+
+InterchunkWord &
+InterchunkWord::operator =(InterchunkWord const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+void
+InterchunkWord::init(string const &chunk)
+{
+  for(size_t i = 0; i < chunk.size(); i++)
+  {
+    if(chunk[i] == '\\')
+    {
+      i++;
+    }
+    else if(chunk[i] == '{')
+    {
+      this->chunk = chunk.substr(0, i);
+      this->queue = chunk.substr(i);
+      return;
+    }
+  }
+  this->chunk = chunk;
+  this->queue = "";
+}
+
+string
+InterchunkWord::chunkPart(ApertiumRE const &part)
+{
+  string result = part.match(chunk);
+  if(result.size() == 0)
+  {
+    result = part.match(queue);
+    if(result.size() != queue.size())
+    {
+      return "";
+    }
+    else
+    {
+      return result;
+    }
+  }
+  else if(result.size() == chunk.size())
+  {
+    return part.match(chunk+queue);
+  }
+  else
+  {
+    return result;
+  }
+}
+
+void
+InterchunkWord::setChunkPart(ApertiumRE const &part, string const &value)
+{
+  part.replace(chunk, value);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk_word.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk_word.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/interchunk_word.h	(revision 70339)
@@ -0,0 +1,105 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _INTERCHUNKWORD_
+#define _INTERCHUNKWORD_
+
+#include <apertium/apertium_re.h>
+#include <map>
+#include <string>
+
+using namespace std;
+
+/**
+ * Word type for transfer modules
+ */
+class InterchunkWord
+{
+private:
+  /**
+   * Target language chunk name and tags
+   */
+  string chunk;
+  
+  /**
+   * Target language chunk content
+   */
+  string queue;   
+     
+  /**
+   * Copy method
+   * @param o the object to be copied
+   */
+  void copy(InterchunkWord const &o);
+  
+  /**
+   * Destroy method
+   */
+  void destroy();
+  
+public:
+  /**
+   * Non-parametric constructor
+   */
+  InterchunkWord();
+  /**
+   * Destructor
+   */
+  ~InterchunkWord();
+  
+  /**
+   * Copy constructor
+   * @param o the object to be copied
+   */
+  InterchunkWord(InterchunkWord const &o);
+  
+  /**
+   * Parametric constructor calling init()
+   * @param chunk the chunk
+   */
+  InterchunkWord(string const &chunk);
+  
+  /**
+   * Assignment operator
+   * @param o the object to be assigned
+   * @return reference to left part of assignment
+   */
+  InterchunkWord & operator =(InterchunkWord const &o);
+
+  /**
+   * Sets a chunk
+   * @param chunk the chunk
+   */
+  void init(string const &chunk);
+  
+  /**
+   * Reference a chunk part
+   * @param part regular expression to match
+   * @returns reference to the part of string matched
+   */ 
+  string chunkPart(ApertiumRE const &part);
+
+  /**
+   * Sets a value for a chunk part
+   * @param part regular expression to match
+   * @param value the new value for the given part
+   */
+  void setChunkPart(ApertiumRE const &part, string const &value);
+
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/latex_accentsmap.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/latex_accentsmap.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/latex_accentsmap.cc	(revision 70339)
@@ -0,0 +1,212 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/latex_accentsmap.h>
+
+using namespace std;
+
+
+AccentsMap::AccentsMap(bool char2latex) {
+	if(char2latex)
+		init_camap();
+	else
+		init_acmap();
+}
+
+AccentsMap::~AccentsMap(){
+}
+
+void AccentsMap::init_acmap() {
+	init_camap();
+	for (acmap::iterator i = map.begin(); 
+		i != map.end(); 
+		++i)
+	{
+		map[i->second] = i->first;
+	}
+}
+
+void AccentsMap::init_camap() {
+
+	map[L"à"] = L"`a"; // Grave accent
+	map[L"è"] = L"`e";
+	map[L"ì"] = L"`\\i";
+	map[L"ò"] = L"`o";
+	map[L"ù"] = L"`u";
+	map[L"ỳ"] = L"`y";
+	map[L"À"] = L"`A";
+	map[L"È"] = L"`E";
+	map[L"Ì"] = L"`I";
+	map[L"Ò"] = L"`O";
+	map[L"Ù"] = L"`U";
+	map[L"Ỳ"] = L"`Y";
+	map[L"á"] = L"'a"; // Acute accent
+	map[L"é"] = L"'e";
+	map[L"í"] = L"'\\i";
+	map[L"ó"] = L"'o";
+	map[L"ú"] = L"'u";
+	map[L"ý"] = L"'y";
+	map[L"Á"] = L"'A";
+	map[L"É"] = L"'E";
+	map[L"Í"] = L"'I";
+	map[L"Ó"] = L"'O";
+	map[L"Ú"] = L"'U";
+	map[L"Ý"] = L"'Y";
+	map[L"â"] = L"^a"; // Circumflex
+	map[L"ê"] = L"^e";
+	map[L"î"] = L"^\\i";
+	map[L"ô"] = L"^o";
+	map[L"û"] = L"^u";
+	map[L"ŷ"] = L"^y";
+	map[L"Â"] = L"^A";
+	map[L"Ê"] = L"^E";
+	map[L"Î"] = L"^I";
+	map[L"Ô"] = L"^O";
+	map[L"Û"] = L"^U";
+	map[L"Ŷ"] = L"^Y";
+	map[L"ä"] = L"\"a";    // Umlaut or dieresis
+	map[L"ë"] = L"\"e";
+	map[L"ï"] = L"\"\\i";
+	map[L"ö"] = L"\"o";
+	map[L"ü"] = L"\"u";
+	map[L"ÿ"] = L"\"y";
+	map[L"Ä"] = L"\"A";
+	map[L"Ë"] = L"\"E";
+	map[L"Ï"] = L"\"I";
+	map[L"Ö"] = L"\"O";
+	map[L"Ü"] = L"\"U";
+	map[L"Ÿ"] = L"\"Y";
+
+	map[L"ñ"] = L"~n";
+	map[L"Ñ"] = L"~N";
+  
+	map[L"ç"] = L"cc";   // Cedilla
+	map[L"Ç"] = L"cC";
+
+
+}
+
+wstring AccentsMap::get(wstring input){
+	it = map.find(input);
+	if(it == map.end())
+		return L"";
+	else
+		return (*it).second;
+}
+
+//Optionally:
+void AccentsMap::init_locale(){ 
+	char *locale = setlocale(LC_ALL, "");
+	std::locale lollocale(locale);
+	wcout.imbue(lollocale);
+}
+
+
+
+/*latexAccents = [
+	map[L"à"] = L"\\`a"; # Grave accent
+	map[L"è"] = L"\\`e";
+	map[L"ì"] = L"\\`\\i";
+	map[L"ò"] = L"\\`o";
+	map[L"ù"] = L"\\`u";
+	map[L"ỳ"] = L"\\`y";
+	map[L"À"] = L"\\`A";
+	map[L"È"] = L"\\`E";
+	map[L"Ì"] = L"\\`\\I";
+	map[L"Ò"] = L"\\`O";
+	map[L"Ù"] = L"\\`U";
+	map[L"Ỳ"] = L"\\`Y";
+	map[L"á"] = L"\\'a"; # Acute accent
+	map[L"é"] = L"\\'e";
+	map[L"í"] = L"\\'\\i";
+	map[L"ó"] = L"\\'o";
+	map[L"ú"] = L"\\'u";
+	map[L"ý"] = L"\\'y";
+	map[L"Á"] = L"\\'A";
+	map[L"É"] = L"\\'E";
+	map[L"Í"] = L"\\'\\I";
+	map[L"Ó"] = L"\\'O";
+	map[L"Ú"] = L"\\'U";
+	map[L"Ý"] = L"\\'Y";
+	map[L"â"] = L"\\^a"; # Circumflex
+	map[L"ê"] = L"\\^e";
+	map[L"î"] = L"\\^\\i";
+	map[L"ô"] = L"\\^o";
+	map[L"û"] = L"\\^u";
+	map[L"ŷ"] = L"\\^y";
+	map[L"Â"] = L"\\^A";
+	map[L"Ê"] = L"\\^E";
+	map[L"Î"] = L"\\^\\I";
+	map[L"Ô"] = L"\\^O";
+	map[L"Û"] = L"\\^U";
+	map[L"Ŷ"] = L"\\^Y";
+	map[L"ä"] = L"\\\"a";    # Umlaut or dieresis
+	map[L"ë"] = L"\\\"e";
+	map[L"ï"] = L"\\\"\\i";
+	map[L"ö"] = L"\\\"o";
+	map[L"ü"] = L"\\\"u";
+	map[L"ÿ"] = L"\\\"y";
+	map[L"Ä"] = L"\\\"A";
+	map[L"Ë"] = L"\\\"E";
+	map[L"Ï"] = L"\\\"\\I";
+	map[L"Ö"] = L"\\\"O";
+	map[L"Ü"] = L"\\\"U";
+	map[L"Ÿ"] = L"\\\"Y";
+	map[L"ç"] = L"\\c{c}";   # Cedilla
+	map[L"Ç"] = L"\\c{C}";
+	map[L"œ"] = L"{\\oe}";   # Ligatures
+	map[L"Œ"] = L"{\\OE}";
+	map[L"æ"] = L"{\\ae}";
+	map[L"Æ"] = L"{\\AE}";
+	map[L"å"] = L"{\\aa}";
+	map[L"Å"] = L"{\\AA}";
+	map[L"–"] = L"--";   # Dashes
+	map[L"—"] = L"---";
+	map[L"ø"] = L"{\\o}";    # Misc latin-1 letters
+	map[L"Ø"] = L"{\\O}";
+	map[L"ß"] = L"{\\ss}";
+	map[L"¡"] = L"{!`}";
+	map[L"¿"] = L"{?`}";
+	map[L"\\"] = L"\\\\";    # Characters that should be quoted
+	map[L"~"] = L"\\~";
+	map[L"&"] = L"\\&";
+	map[L"$"] = L"\\$";
+	map[L"{"] = L"\\{";
+	map[L"}"] = L"\\}";
+	map[L"%"] = L"\\%";
+	map[L"#"] = L"\\#";
+	map[L"_"] = L"\\_";
+	map[L"≥"] = L"$\\ge$";   # Math operators
+	map[L"≤"] = L"$\\le$";
+	map[L"≠"] = L"$\\neq$";
+	map[L"©"] = L"\copyright"; # Misc
+	map[L"ı"] = L"{\\i}";
+	map[L"µ"] = L"$\\mu$";
+	map[L"°"] = L"$\\deg$";
+	map[L"‘"] = L"`";    #Quotes
+	map[L"’"] = L"'";
+	map[L"“"] = L"``";
+	map[L"”"] = L"''";
+	map[L"‚"] = L",";
+	map[L"„"] = L",,";
+]*/
+
+
+
+
+
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/latex_accentsmap.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/latex_accentsmap.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/latex_accentsmap.h	(revision 70339)
@@ -0,0 +1,55 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <map>
+#include <iostream>
+#include <cwchar>
+#include <string>
+#include <cstring>
+#include <locale>
+#include <lttoolbox/ltstr.h>
+
+using namespace std;
+
+/*struct Ltstr // Already in lttoolbox/ltstr.h
+{
+  bool operator()(wstring const &s1, wstring const &s2) const
+  {
+    return wcscmp(s1.c_str(), s2.c_str()) < 0;
+  }
+};
+*/
+
+class AccentsMap {
+	typedef std::map<wstring, wstring, Ltstr> acmap;
+	private:
+		acmap           map; // Accent to character
+		acmap::iterator it;  // Iterator for searching
+
+		void init_acmap();
+		void init_camap();
+	public:
+		AccentsMap(bool char2accent); // the direction
+		~AccentsMap();
+
+		// Optionally
+		void init_locale(); 
+
+		// The getter for both directions depending on init.
+		wstring get(wstring input);
+};
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lexchoice.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lexchoice.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lexchoice.xsl	(revision 70339)
@@ -0,0 +1,172 @@
+<?xml version="1.0" encoding="ISO-8859-1"?> <!-- -*- nxml -*- -->
+<!--
+ Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+  <xsl:output method="xml" encoding="ISO-8859-1"/>
+<xsl:param name="r2l"/>
+
+<xsl:template match="s">
+  <s n="{./@n}"/>
+</xsl:template>
+
+<xsl:template match="b">
+  <b />
+</xsl:template>
+
+<xsl:template match="g">
+  <g><xsl:apply-templates/></g>
+</xsl:template>
+
+<xsl:template match="a">
+  <a/>
+</xsl:template>
+
+<xsl:template match="j">
+  <j/>
+</xsl:template>
+
+<xsl:template match="l">
+  <xsl:apply-templates select="./*|text()"/>
+</xsl:template>
+
+<xsl:template match="r">
+  <xsl:apply-templates select="./*|text()"/>
+</xsl:template>
+
+<xsl:template match="par">
+  <par n="{./@n}"/>
+</xsl:template>
+
+<xsl:template match="re">
+  <re><xsl:apply-templates/></re>
+</xsl:template>
+
+<xsl:template match="p">
+  <p>
+  <xsl:choose>
+    <xsl:when test="not($r2l=string('yes'))">
+      <l><xsl:apply-templates select="./r/*|./r/text()"/></l>
+      <xsl:choose>
+	<xsl:when test="not($r2l=string('yes')) and not(count(../@srl)=0)">
+	  <r><xsl:apply-templates select="./r/text()|./r/*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@srl"/><xsl:apply-templates select="./r/*[name(.)=string('s')]"/></r>
+	</xsl:when>
+	<xsl:otherwise>
+	  <r><xsl:apply-templates select="./r/*|./r/text()"/></r>
+	</xsl:otherwise>
+      </xsl:choose>
+    </xsl:when>
+    <xsl:otherwise>
+      <l><xsl:apply-templates select="./l/*|./l/text()"/></l>
+      <xsl:choose>
+      <xsl:when test="$r2l=string('yes') and not(count(../@slr)=0)">
+	<r><xsl:apply-templates select="./l/text()|./l/*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@slr"/><xsl:apply-templates select="./l/*[name(.)=string('s')]"/></r>
+      </xsl:when>
+      <xsl:otherwise>
+	<r><xsl:apply-templates select="./l/*|./l/text()"/></r>
+      </xsl:otherwise>
+    </xsl:choose>
+
+    </xsl:otherwise>
+  </xsl:choose>
+  </p>
+</xsl:template>
+
+<xsl:template match="i">
+ <!-- <i><xsl:apply-templates/></i> -->
+
+  <p>
+    <xsl:choose>
+    <xsl:when test="not($r2l=string('yes'))">
+      <l><xsl:apply-templates select="*|text()"/></l>
+      <xsl:choose>
+	<xsl:when test="not($r2l=string('yes')) and not(count(../@srl)=0)">
+	  <r><xsl:apply-templates select="text()|*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@srl"/><xsl:apply-templates select="*[name(.)=string('s')]"/></r>
+	</xsl:when>
+	<xsl:otherwise>
+	  <r><xsl:apply-templates select="*|text()"/></r>
+	</xsl:otherwise>
+      </xsl:choose>
+    </xsl:when>
+    <xsl:otherwise>
+      <l><xsl:apply-templates select="*|text()"/></l>
+      <xsl:choose>
+      <xsl:when test="$r2l=string('yes') and not(count(../@slr)=0)">
+	<r><xsl:apply-templates select="text()|*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@slr"/><xsl:apply-templates select="*[name(.)=string('s')]"/></r>
+      </xsl:when>
+      <xsl:otherwise>
+	<r><xsl:apply-templates select="*|text()"/></r>
+      </xsl:otherwise>
+    </xsl:choose>
+
+    </xsl:otherwise>
+  </xsl:choose> 
+  </p> 
+</xsl:template>
+
+
+<!-- TO DO: support for i tags -->
+
+<xsl:template match="e">
+  <xsl:choose>
+    <xsl:when test="not($r2l=string('yes'))">
+      <xsl:if test="not(./@r=string('LR'))">
+        <e><xsl:apply-templates select="./*"/></e>
+      </xsl:if>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:if test="not(./@r=string('RL'))">
+        <e><xsl:apply-templates select="./*"/></e>
+      </xsl:if>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+
+<xsl:template match="dictionary">
+<dictionary>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:copy-of select="./alphabet"/>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:copy-of select="./sdefs"/>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:if test="not(count(./pardefs/pardef)=0)">
+    <pardefs>
+  <xsl:value-of select="string('&#xA;')"/>
+
+      <xsl:for-each select="./pardefs/pardef">
+  <xsl:value-of select="string('&#xA;')"/>
+
+	<pardef n="{./@n}">
+	  <xsl:apply-templates/>
+	</pardef>
+      </xsl:for-each>
+  <xsl:value-of select="string('&#xA;')"/>
+
+    </pardefs>
+  </xsl:if>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:for-each select="./section">
+    <section id="{./@id}" type="{./@type}">
+      <xsl:apply-templates/>
+    </section>
+  </xsl:for-each>
+</dictionary>
+
+</xsl:template>
+
+
+</xsl:stylesheet>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lexchoicebil.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lexchoicebil.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lexchoicebil.xsl	(revision 70339)
@@ -0,0 +1,169 @@
+<?xml version="1.0" encoding="ISO-8859-1"?> <!-- -*- nxml -*- -->
+<!--
+ Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+  <xsl:output method="xml" encoding="ISO-8859-1"/>
+<xsl:param name="r2l"/>
+
+<xsl:template match="s">
+  <s n="{./@n}"/>
+</xsl:template>
+
+<xsl:template match="b">
+  <b />
+</xsl:template>
+
+<xsl:template match="g">
+  <g><xsl:apply-templates/></g>
+</xsl:template>
+
+<xsl:template match="a">
+  <a/>
+</xsl:template>
+
+<xsl:template match="j">
+  <j/>
+</xsl:template>
+
+<xsl:template match="l">
+  <xsl:apply-templates select="./*|text()"/>
+</xsl:template>
+
+<xsl:template match="r">
+  <xsl:apply-templates select="./*|text()"/>
+</xsl:template>
+
+<xsl:template match="par">
+  <par n="{./@n}"/>
+</xsl:template>
+
+<xsl:template match="re">
+  <re><xsl:apply-templates/></re>
+</xsl:template>
+
+<xsl:template match="p">
+  <p>
+  <xsl:choose>
+    <xsl:when test="not($r2l=string('yes'))">
+      <xsl:choose>
+	<xsl:when test="not($r2l=string('yes')) and not(count(../@srl)=0)">
+	  <l><xsl:apply-templates select="./r/text()|./r/*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@srl"/><xsl:apply-templates select="./r/*[name(.)=string('s')]"/></l>
+	</xsl:when>
+	<xsl:otherwise>
+	  <l><xsl:apply-templates select="./r/*|./r/text()"/></l>
+	</xsl:otherwise>
+      </xsl:choose>
+      <r><xsl:apply-templates select="./l/*|./l/text()"/></r>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:choose>
+        <xsl:when test="($r2l=string('yes')) and not(count(../@slr)=0)">
+          <l><xsl:apply-templates select="./l/text()|./l/*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@slr"/><xsl:apply-templates select="./l/*[name(.)=string('s')]"/></l>
+        </xsl:when>
+        <xsl:otherwise>
+	  <l><xsl:apply-templates select="./l/*|./l/text()"/></l>
+        </xsl:otherwise>
+      </xsl:choose>
+      <r><xsl:apply-templates select="./r/*|./r/text()"/></r>
+    </xsl:otherwise>
+  </xsl:choose>
+  </p>
+</xsl:template>
+
+
+<xsl:template match="i">
+  <p>
+  <xsl:choose>
+    <xsl:when test="not($r2l=string('yes'))">
+      <xsl:choose>
+	<xsl:when test="not($r2l=string('yes')) and not(count(../@srl)=0)">
+	  <l><xsl:apply-templates select="text()|*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@srl"/><xsl:apply-templates select="*[name(.)=string('s')]"/></l>
+	</xsl:when>
+	<xsl:otherwise>
+	  <l><xsl:apply-templates select="*|text()"/></l>
+	</xsl:otherwise>
+      </xsl:choose>
+      <r><xsl:apply-templates select="*|text()"/></r>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:choose>
+        <xsl:when test="($r2l=string('yes')) and not(count(../@slr)=0)">
+          <l><xsl:apply-templates select="text()|*[not(name(.)=string('s'))]"/>__<xsl:apply-templates select="../@slr"/><xsl:apply-templates select="*[name(.)=string('s')]"/></l>
+        </xsl:when>
+        <xsl:otherwise>
+	  <l><xsl:apply-templates select="*|text()"/></l>
+        </xsl:otherwise>
+      </xsl:choose>
+      <r><xsl:apply-templates select="*|text()"/></r>
+    </xsl:otherwise>
+  </xsl:choose>
+  </p>
+</xsl:template>
+
+
+<xsl:template match="e">
+  <xsl:choose>
+    <xsl:when test="./@i=string('yes')">
+    </xsl:when>
+    <xsl:when test="not($r2l=string('yes'))">
+      <xsl:if test="not(./@r=string('LR'))">
+        <e><xsl:apply-templates select="./*"/></e>
+      </xsl:if>
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:if test="not(./@r=string('RL'))">
+        <e><xsl:apply-templates select="./*"/></e>
+      </xsl:if>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+
+<xsl:template match="dictionary">
+<dictionary>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:copy-of select="./alphabet"/>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:copy-of select="./sdefs"/>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:if test="not(count(./pardefs/pardef)=0)">
+    <pardefs>
+  <xsl:value-of select="string('&#xA;')"/>
+
+      <xsl:for-each select="./pardefs/pardef">
+  <xsl:value-of select="string('&#xA;')"/>
+
+	<pardef n="{./@n}">
+	  <xsl:apply-templates/>
+	</pardef>
+      </xsl:for-each>
+  <xsl:value-of select="string('&#xA;')"/>
+
+    </pardefs>
+  </xsl:if>
+  <xsl:value-of select="string('&#xA;')"/>
+  <xsl:for-each select="./section">
+    <section id="{./@id}" type="{./@type}">
+      <xsl:apply-templates/>
+    </section>
+  </xsl:for-each>
+</dictionary>
+
+</xsl:template>
+
+
+</xsl:stylesheet>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor.h	(revision 70339)
@@ -0,0 +1,102 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __LEXTOR_H
+#define __LEXTOR_H
+
+#include <iostream>
+#include <fstream>
+#include <string>
+#include <deque>
+
+#include <apertium/lextor_data.h>
+#include <apertium/lextor_word.h>
+#include <apertium/lextor_eval.h>
+
+using namespace std;
+
+/** Class LexTor (Lexical Selector class)
+ */  
+
+class LexTor {
+private:
+  LexTorData *lextor_data;
+
+  //For usew when tl information is used to perform lexical selection
+  LexTorData *tlmodel;
+  FSTProcessor *fstpbil;
+
+  int estimate_winner_lch(deque<LexTorWord>& window, int word_index,  double weigth_exponent);
+  int estimate_winner_lch_voting(deque<LexTorWord>& window, int word_index,  double weigth_exponent);
+  int estimate_winner_lch_cosine(deque<LexTorWord>& window, int word_index,  double weigth_exponent);
+  int estimate_winner_lch_mostprob(deque<LexTorWord>& window, int word_index,  double weigth_exponent);
+  int estimate_winner_lch_votingtl(deque<LexTorWord>& window, int word_index,  double weigth_exponent);
+
+  double cosine(map<wstring, double>& vcontext, const wstring& reduced_lexchoice);
+public:
+
+  static bool debug;
+  static double angleth;
+
+  LexTor();
+  
+  LexTor(const LexTor& lt);
+  
+  ~LexTor();
+
+  void set_lextor_data(LexTorData* ltd);
+
+  //Use to set the tlmodel to be used when tl information is used to
+  //perform lexical selection
+  void set_tlmodel(LexTorData* tlm);
+  void set_bildic(FSTProcessor *fstp);
+
+  void trainwrd(wistream& wis, int left, int right, double weigth_exponent=0);
+
+  void trainlch(wistream& wis, int left, int right, LexTorData& wordmodel, 
+                FSTProcessor& dic, FSTProcessor& bildic, double weigth_exponent=0);
+
+  void lexical_selector(wistream& wis, FSTProcessor &fstp, int left, int right, 
+                        double weigth_exponent=0, LexTorEval* lteval=NULL);
+
+  /** NOTE on the weigth_exponent parameter: This parameter is used to
+      change the influence of surrounding words on the decision to
+      take on an ambiguous word (word with more than one lexical
+      choice). For example, if a decision is being take on word w_i,
+      the the weigth of the surrounding words is: 
+      Score(w_i-2) = count(w_i-2)/pow(2,weigth_exponent), 
+      Score(w_i-1) = count(w_i-1)/pow(1,weigth_exponent), 
+      Score(w_i+1) = count(w_i+1)/pow(1,weigth_exponent), 
+      Score(w_i+2) = count(w_i+2)/pow(2,weigth_exponent).
+  */
+};
+
+class PairStringCountComparer {
+public:
+  bool operator()(const pair<wstring, COUNT_DATA_TYPE>& e1, const pair<wstring, COUNT_DATA_TYPE>& e2)  const {
+    //True if e1>e2
+
+    if (e1.second > e2.second)
+      return true;
+    else if (e1.second == e2.second)
+      return (e1.first>e2.first);
+    else
+      return false;
+  }
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_data.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_data.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_data.h	(revision 70339)
@@ -0,0 +1,137 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __LEXTORDATA_H
+#define __LEXTORDATA_H
+
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+#include <cmath>
+#include <cstdio>
+
+#include <lttoolbox/fst_processor.h>
+
+#define WORD_DATA_TYPE unsigned short
+#define MAX_WORD_INDEX (pow(2.0,(double)(sizeof(WORD_DATA_TYPE)*8))-1)
+
+#define COUNT_DATA_TYPE double
+
+#define NULLWORD L"NULLWORD"
+
+using namespace std;
+
+/** Class LexTorData. (Lexical Selector Data class)
+ */  
+
+class LexTorData{
+private:
+
+  WORD_DATA_TYPE n_stopwords;
+  WORD_DATA_TYPE n_words;
+  WORD_DATA_TYPE n_words_per_set;
+  WORD_DATA_TYPE n_set;
+
+  //For a give word (or lexical choice) its index is returned and vice versa
+  map<wstring, WORD_DATA_TYPE> word2index;
+  vector<wstring> index2word;
+
+  map<WORD_DATA_TYPE, COUNT_DATA_TYPE> wordcount;
+
+  //For a given lexical choice it contains the set of words it appears
+  //with, and for each co-appearing word, the number of times they
+  //co-appear
+  map<WORD_DATA_TYPE, map<WORD_DATA_TYPE, COUNT_DATA_TYPE> > lexchoice_set;
+
+  //For a given lexical choice it contains the sum of all co-appearing words
+  map<WORD_DATA_TYPE, COUNT_DATA_TYPE> lexchoice_sum;
+
+  //For a given lexical choice it contains its probability  
+  //map<WORD_DATA_TYPE, double> lexchoice_prob;
+
+  //Set of stopwords
+  set<wstring> stopwords;
+
+  //Set of words to work with
+  set<wstring> words;
+
+  //For a given word it contains its set of lexical-choices (when available)
+  map<wstring, set<wstring> > lexical_choices;
+  
+  set<wstring> reduced_lexical_choices;
+
+  void new_word_register(const wstring& w);
+public:
+
+  LexTorData();
+  
+  LexTorData(const LexTorData& ltd);
+  
+  ~LexTorData();
+
+  COUNT_DATA_TYPE vote_from_word(const wstring& lexical_choice, const wstring& word);
+
+  //double get_lexchoice_prob(const string& lexical_choice);
+
+  COUNT_DATA_TYPE get_lexchoice_sum(const wstring& lexical_choice);
+
+  void set_wordcount(const wstring& word, COUNT_DATA_TYPE c);
+  COUNT_DATA_TYPE get_wordcount(const wstring& word);
+
+  void set_lexchoice_sum(const wstring& lexical_choice, COUNT_DATA_TYPE sum);
+
+  bool is_stopword(const wstring& word);
+
+  void read(FILE *is);
+
+  void write(FILE *os);
+
+  void read_stopwords(wistream& is);
+
+  void read_words(wistream& is);
+
+  void read_lexical_choices(FSTProcessor& fstp);
+
+  void set_nwords_per_set(int i);
+
+  void set_cooccurrence_context(const wstring& lexical_choice, 
+                                const vector<pair<wstring, COUNT_DATA_TYPE> >& context);
+
+  //vector<pair<WORD_DATA_TYPE, double> >
+  //get_cooccurrence_vector(const string& lexical_choice);
+  double get_module_lexchoice_vector(const wstring& lexical_choice);
+
+  double cosine(const wstring& reduced_lexch1, const wstring& reduced_lexch2);
+
+  set<wstring> get_words();
+
+  set<wstring> get_lexical_choices(const wstring& word);
+
+  //Used to ensure that none of the stopwords are in the set 
+  //of words from which co-occurrence models are being estimated
+  void ensure_stopwords_ok();
+
+  //Given a word in the apertium format  the lemma and the fisrt tag
+  //are returned (both in lower case) if possible
+  wstring reduce(const wstring& s);
+
+  wstring reduce_lexical_choice(const wstring& s);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_eval.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_eval.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_eval.h	(revision 70339)
@@ -0,0 +1,63 @@
+/*
+ * Copyright (C) 2004-2006 Felipe S�nchez-Mart�nez
+ * Copyright (C) 2006 Universitat d'Alacant
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef __LEXTOR_EVAL_H
+#define __LEXTOR_EVAL_H
+
+#include <string>
+#include <vector>
+#include <set>
+#include <map>
+#include <istream>
+#include <apertium/lextor_data.h>
+#include <apertium/lextor_word.h>
+
+using namespace std;
+
+class LexTorEval {
+private:
+
+  double nwords;
+  //double nunknown;
+  double nignored;
+  double npol;
+  //double nerrors_nopol;
+  double nerrors_pol;
+  //double nerrors_unk;
+
+  double ndefault;
+
+  map<wstring, double> nwords_per_word;
+  map<wstring, double> nerrors_per_word;
+  map<wstring, double> ndefault_per_word;
+
+  wistream* refer;
+
+  set<wstring> words2ignore;
+public:  
+ 
+  LexTorEval(wistream *iref);
+
+  ~LexTorEval();
+
+  void evalword(LexTorWord& ltword, int winner, LexTorData* lextor_data);
+
+  void print_evaluation();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_word.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_word.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/lextor_word.h	(revision 70339)
@@ -0,0 +1,75 @@
+/*
+ * Copyright (C) 2006 Universitat d'Alacant / Universidad de Alicante
+ * author: Felipe S�nchez-Mart�nez
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __LEXTORWORD_H
+#define __LEXTORWORD_H
+
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+#include <lttoolbox/fst_processor.h>
+#include <apertium/lextor_data.h>
+
+using namespace std;
+
+/** Class LexTorWord. (Lexical Selector Word)
+ */  
+
+class LexTorWord{
+private:
+  wstring word;
+  wstring ignored_string;
+  vector<wstring> lexical_choices;
+  int default_choice;
+  
+  void extract_lexical_choices(FSTProcessor *fstp);
+public:
+
+  LexTorWord();
+  
+  LexTorWord(const LexTorWord& ltw);
+
+  LexTorWord(const wstring& str, FSTProcessor *fstp);
+  
+  ~LexTorWord();
+
+  /** Return the lexical choice at position 'choice', if 'choice' is not
+   *  given the default one is returned
+   */
+  wstring get_lexical_choice(int choice=-1, bool include_ignored=true);
+
+  /** Returns the number of lexical choices for this word 
+   */
+  int n_lexical_choices();
+
+  wstring get_word_string();
+
+  wstring translate(FSTProcessor& bildic, int choice=-1);
+
+
+  /** When calling this method the set of lexical choice for each word
+   *  will be extracted from the FSTProcessor object if present.
+   *  Moreover the input stream (is) is supossed to be in the
+   *  intermediate format used by the apertium MT system.
+   */
+  static LexTorWord* next_word(wistream& is, FSTProcessor *fstp=NULL);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/morpho_stream.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/morpho_stream.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/morpho_stream.cc	(revision 70339)
@@ -0,0 +1,402 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+/** 
+ *  Word class and MorphoStream class definitions
+ *
+ *  @author	Felipe S�nchez-Mart�nez 
+ */
+
+#include <apertium/morpho_stream.h>
+#include <apertium/constant_manager.h>
+#include <vector>
+#include <apertium/string_utils.h>
+#include "apertium_config.h"
+#include <apertium/unlocked_cstdio.h>
+
+using namespace Apertium;
+MorphoStream::MorphoStream(FILE *ftxt, bool d, TaggerData *t)
+{
+  foundEOF = false;
+  debug=d;
+  td = t;
+  me = td->getPatternList().newMatchExe();
+  alphabet = td->getPatternList().getAlphabet();
+  input = ftxt;
+  ca_any_char = alphabet(PatternList::ANY_CHAR);
+  ca_any_tag = alphabet(PatternList::ANY_TAG);
+  
+  ConstantManager &constants = td->getConstants();
+  ca_kignorar = constants.getConstant(L"kIGNORAR");
+  ca_kbarra = constants.getConstant(L"kBARRA");
+  ca_kdollar = constants.getConstant(L"kDOLLAR");
+  ca_kbegin = constants.getConstant(L"kBEGIN");
+  ca_kmot = constants.getConstant(L"kMOT");
+  ca_kmas = constants.getConstant(L"kMAS");
+  ca_kunknown = constants.getConstant(L"kUNKNOWN");
+  
+  map<wstring, int, Ltstr> &tag_index = td->getTagIndex();
+  ca_tag_keof = tag_index[L"TAG_kEOF"];  
+  ca_tag_kundef = tag_index[L"TAG_kUNDEF"]; 
+
+  end_of_file = false;
+  null_flush = false;
+}
+
+MorphoStream::~MorphoStream() 
+{
+  delete me;
+}
+
+TaggerWord *
+MorphoStream::get_next_word()
+{
+  if(vwords.size() != 0)
+  {
+    TaggerWord* word=vwords.front();
+    vwords.erase(vwords.begin());
+    
+    if(word->isAmbiguous())
+    {
+      vector<wstring> &ref = td->getDiscardRules();
+      for(unsigned int i = 0; i < ref.size(); i++)
+      {
+        word->discardOnAmbiguity(ref[i]);
+      }
+    }
+//    cout << *word << endl;
+    return word;
+  }
+
+  if(feof(input))
+  {
+    return NULL;
+  }
+  
+  int ivwords = 0;
+  vwords.push_back(new TaggerWord());
+
+  while(true)
+  {
+    int symbol = fgetwc_unlocked(input);
+    if(feof(input) || (null_flush && symbol == L'\0'))
+    {
+      end_of_file = true;
+      vwords[ivwords]->add_tag(ca_tag_keof, L"", td->getPreferRules());
+      return get_next_word();
+    }
+    if(symbol == L'^')
+    {
+      readRestOfWord(ivwords);
+      return get_next_word();
+    }
+    else
+    {
+      wstring str = L"";
+      if(symbol == L'\\')
+      {
+        symbol = fgetwc_unlocked(input);
+        str += L'\\';
+        str += static_cast<wchar_t>(symbol);
+        symbol = L'\\';
+      }
+      else
+      {
+        str += static_cast<wchar_t>(symbol);
+      }
+      
+      while(symbol != L'^')
+      {
+	symbol = fgetwc_unlocked(input);
+	if(feof(input) || (null_flush && symbol == L'\0'))
+	{
+	  end_of_file = true;
+	  vwords[ivwords]->add_ignored_string(str);
+          vwords[ivwords]->add_tag(ca_tag_keof, L"", td->getPreferRules());
+	  return get_next_word();
+	}
+	else if(symbol == L'\\')
+	{
+	  str += L'\\';
+          symbol = fgetwc_unlocked(input);
+	  if(feof(input) || (null_flush && symbol == L'\0'))
+	  {
+	    end_of_file = true;
+	    vwords[ivwords]->add_ignored_string(str);
+            vwords[ivwords]->add_tag(ca_tag_keof, L"", td->getPreferRules());
+	    return get_next_word();
+	  }
+	  str += static_cast<wchar_t>(symbol);
+	  symbol = L'\\';
+	}
+	else if(symbol == L'^')
+	{
+	  if(str.size() > 0)
+	  {
+	    vwords[ivwords]->add_ignored_string(str);
+          }
+	  readRestOfWord(ivwords);
+	  return get_next_word();
+	}
+        else
+	{
+	  str += static_cast<wchar_t>(symbol);
+	}
+      }
+    }
+  }
+}
+
+void
+MorphoStream::lrlmClassify(wstring const &str, int &ivwords)
+{
+  int floor = 0;
+  int last_type = -1;
+  int last_pos = 0;
+
+  ms.init(me->getInitial());
+  for(int i = 0, limit = str.size(); i != limit; i++)
+  {
+    if(str[i] != L'<')
+    {
+      if(str[i] == L'+')
+      {
+        int val = ms.classifyFinals(me->getFinals());
+        if(val != -1)
+        {
+          last_pos = i-1;
+          last_type = val;
+        }
+      }
+      ms.step(towlower(str[i]), ca_any_char);
+    }
+    else
+    {
+      wstring tag = L"";
+      for(int j = i+1; j != limit; j++)
+      {
+        if(str[j] == L'\\')
+        {
+ 	  j++;
+        }
+        else if(str[j] == L'>')
+        {
+ 	  tag = str.substr(i, j-i+1);
+	  i = j;
+          break;
+        }
+      }
+
+      int symbol = alphabet(tag);
+      if(symbol)
+      {
+        ms.step(symbol, ca_any_tag);
+      }
+      else
+      {
+        ms.step(ca_any_tag);
+      }
+    }
+
+    if(ms.size() == 0)
+    {
+      if(last_pos != floor)
+      {
+        vwords[ivwords]->add_tag(last_type, 
+                                 str.substr(floor, last_pos - floor + 1),
+                                 td->getPreferRules());
+	if(str[last_pos+1] == L'+' && last_pos+1 < limit )
+	{	
+	  floor = last_pos + 1;
+	  last_pos = floor;
+          vwords[ivwords]->set_plus_cut(true); 
+          if (((int)vwords.size())<=((int)(ivwords+1)))
+            vwords.push_back(new TaggerWord(true));
+          ivwords++;
+	  ms.init(me->getInitial());
+	}
+	i = floor++;
+      }
+      else
+      {
+        if (debug)
+        {
+	  wcerr<<L"Warning: There is not coarse tag for the fine tag '"<< str.substr(floor) <<L"'\n";
+          wcerr<<L"         This is because of an incomplete tagset definition or a dictionary error\n";
+	}
+        vwords[ivwords]->add_tag(ca_tag_kundef, str.substr(floor) , td->getPreferRules());
+	return;
+      }
+    }
+    else if(i == limit - 1)
+    {
+      if(ms.classifyFinals(me->getFinals()) == -1)
+      {
+	if(last_pos != floor)
+	{
+	  vwords[ivwords]->add_tag(last_type, 
+                                   str.substr(floor, last_pos - floor + 1),
+                                   td->getPreferRules());
+          if(str[last_pos+1] == L'+' && last_pos+1 < limit )
+          {	
+            floor = last_pos + 1;
+	    last_pos = floor;
+            vwords[ivwords]->set_plus_cut(true); 
+            if (((int)vwords.size())<=((int)(ivwords+1)))
+              vwords.push_back(new TaggerWord(true));
+            ivwords++;
+            ms.init(me->getInitial());
+	  }
+	  i = floor++;
+        }
+        else
+        {
+          if (debug)
+          {
+	    wcerr<<L"Warning: There is not coarse tag for the fine tag '"<< str.substr(floor) <<L"'\n";
+            wcerr<<L"         This is because of an incomplete tagset definition or a dictionary error\n";
+	  }
+          vwords[ivwords]->add_tag(ca_tag_kundef, str.substr(floor) , td->getPreferRules());
+	  return;
+        }
+      }
+    }
+  }
+  
+  int val = ms.classifyFinals(me->getFinals());
+  if(val == -1)
+  {
+    val = ca_tag_kundef;
+    if (debug)
+    {
+      wcerr<<L"Warning: There is not coarse tag for the fine tag '"<< str.substr(floor) <<L"'\n";
+      wcerr<<L"         This is because of an incomplete tagset definition or a dictionary error\n";
+    }
+
+  }    
+  vwords[ivwords]->add_tag(val, str.substr(floor), td->getPreferRules());
+}
+
+void
+MorphoStream::readRestOfWord(int &ivwords)
+{
+  // first we have the superficial form
+  wstring  str = L"";
+  
+  while(true)
+  {
+    int symbol = fgetwc_unlocked(input);
+    if(feof(input) || (null_flush && symbol == L'\0'))
+    {
+      end_of_file = true;
+      if(str.size() > 0)
+      {
+        vwords[ivwords]->add_ignored_string(str);
+        wcerr<<L"Warning (internal): kIGNORE was returned while reading a word\n";
+        wcerr<<L"Word being read: "<<vwords[ivwords]->get_superficial_form()<<L"\n";
+        wcerr<<L"Debug: "<< str <<L"\n";
+      }
+      vwords[ivwords]->add_tag(ca_tag_keof, L"", td->getPreferRules());
+      return;
+    }
+    else if(symbol == L'\\')
+    {
+      symbol = fgetwc_unlocked(input);
+      str += L'\\';
+      str += static_cast<wchar_t>(symbol);
+    }
+    else if(symbol == L'/')
+    {
+      vwords[ivwords]->set_superficial_form(str); 
+      str = L"";
+      break;
+    }
+    else if(symbol == L'$')
+    {
+      vwords[ivwords]->set_superficial_form(str);
+      vwords[ivwords]->add_ignored_string(L"$");
+      break;
+    }
+    else
+    {
+      str += static_cast<wchar_t>(symbol);
+    }
+  }
+
+  // then we read the acceptions
+
+  while(true)
+  {
+    int symbol = fgetwc_unlocked(input);
+    if(feof(input) || (null_flush && symbol == L'\0'))
+    {
+      end_of_file = true;
+      if(str.size() > 0)
+      {
+        vwords[ivwords]->add_ignored_string(str);
+        wcerr<<L"Warning (internal): kIGNORE was returned while reading a word\n";
+        wcerr<<L"Word being read: "<<vwords[ivwords]->get_superficial_form()<<L"\n";
+        wcerr<<L"Debug: "<< str <<L"\n";
+      }
+      vwords[ivwords]->add_tag(ca_tag_keof, L"", td->getPreferRules());
+      return;
+    }
+    else if(symbol == L'\\')
+    {
+      symbol = fgetwc_unlocked(input);
+      str += L'\\';
+      str += static_cast<wchar_t>(symbol);
+      symbol = L'\\';  // to prevent exiting with '\$'
+    }
+    else if(symbol == L'/')
+    {
+      lrlmClassify(str, ivwords);
+      str = L"";
+      ivwords = 0;
+      continue;
+    }
+    else if(symbol == L'$')
+    {
+      if(str[0] != L'*')// do nothing with unknown words 
+      {
+	lrlmClassify(str, ivwords);
+      }
+      return;
+    }
+    else
+    {
+      str += static_cast<wchar_t>(symbol);
+    }    
+  }
+}
+
+void
+MorphoStream::setNullFlush(bool nf)
+{
+  null_flush = nf;
+}
+
+bool
+MorphoStream::getEndOfFile(void)
+{
+  return end_of_file;
+}
+
+void
+MorphoStream::setEndOfFile(bool eof)
+{
+  end_of_file = eof;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/morpho_stream.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/morpho_stream.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/morpho_stream.h	(revision 70339)
@@ -0,0 +1,114 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+/** 
+ *  Word class and MorphoStream class definitions
+ *
+ *  @author	Felipe S�nchez-Mart�nez 
+ */
+
+#ifndef __MORPHOSTREAM_H
+#define __MORPHOSTREAM_H
+
+#include <apertium/constant_manager.h>
+#include <lttoolbox/match_exe.h>
+#include <lttoolbox/match_state.h>
+#include <apertium/tagger_data.h>
+#include <apertium/tagger_word.h>
+
+#include <cstdio>
+#include <deque>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+/** Class MorphoStream.  
+ *  This class processes the output of class  yyFlexLexer (lex.yy.cc), and 
+ *  builds the TaggerWord objects managed by the tagger 
+ */
+class MorphoStream {
+private:
+  bool foundEOF;
+  wstring last_string_tag;
+  bool debug;
+  FILE *input;
+  int ca_any_char;
+  int ca_any_tag;
+  int ca_kignorar;
+  int ca_kbarra;
+  int ca_kdollar;
+  int ca_kbegin;
+  int ca_kmot;
+  int ca_kmas;
+  int ca_kunknown;
+  int ca_tag_keof;
+  int ca_tag_kundef;
+
+  vector<TaggerWord *> vwords; //Vector used to implement a buffer
+                             //to treat ambiguous multiword units
+
+  MatchExe *me;
+  TaggerData *td;
+  Alphabet alphabet;
+  MatchState ms;
+
+  bool null_flush;
+  bool end_of_file;
+
+  void readRestOfWord(int &ivwords);
+  void lrlmClassify(wstring const &str, int &ivwords);
+public:
+
+   /** Constructor 
+    *  @param is the input stream.
+    */
+   MorphoStream(FILE *ftxt, bool d, TaggerData *t);
+  
+   /** 
+    *  Destructor 
+    */
+   ~MorphoStream();
+  
+   /** Get next word in the input stream
+    *  @return  A pointer to the next word in the input stream 
+    */
+   TaggerWord* get_next_word();  
+   
+   /** 
+    * Set up the flag to detect '\0' characters
+    * @param nf the null_flush value
+    */
+   void setNullFlush(bool nf);
+   
+   /**
+    * Return true if the last reading is end of file of '\0' when null_flush 
+    * is true
+    * @returns the value of end_of_file
+    */
+   bool getEndOfFile(void);
+   
+   /**
+    * Sets a new value for the end_of_file_flag
+    * @param eof the new value for end_of_file
+    */
+   void setEndOfFile(bool eof);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/new2old.xsl
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/new2old.xsl	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/new2old.xsl	(revision 70339)
@@ -0,0 +1,151 @@
+<?xml version="1.0" encoding="ISO-8859-1"?><!-- -*- xml-*- -->
+<!--
+ Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License as
+ published by the Free Software Foundation; either version 2 of the
+ License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, see <http://www.gnu.org/licenses/>.
+-->
+<!--
+==========================================================================
+| File..........: convert.xsl
+| Author........: Marco A. Montava
+| Date..........: 29-Jul-2006
+| Description...: Conversor de diccionaris amb polisemia a tractament simple
+==========================================================================
+-->
+
+<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
+<xsl:output method="xml" encoding="ISO-8859-1" indent="no"/>
+
+<xsl:template match="/">
+  <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <xsl:apply-templates select="dictionary"/>
+</xsl:template>
+
+<xsl:template match="dictionary">
+  <dictionary><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <xsl:copy-of select="alphabet"/> <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <xsl:copy-of select="sdefs"/> <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <xsl:copy-of select="pardefs"/> <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <xsl:apply-templates select="section"/>
+  </dictionary><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+</xsl:template>
+
+<xsl:template match="section">
+  <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <section id='{@id}' type='{@type}'><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+  <xsl:apply-templates />
+  </section><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+</xsl:template>
+
+
+
+
+<xsl:template match="e[@slr|@srl]"> <!-- si te problemes de polisemia -->
+  <xsl:choose>
+     <!-- si te conflicte L-R y R-L -->
+     <xsl:when test="./@slr!='' and ./@srl!='' ">
+         <xsl:choose>
+         <!-- si es per Defecte R-L i L-R-->
+         <xsl:when test="substring(./@srl,(string-length(./@srl)-1),2)=' D' and substring(./@slr,(string-length(./@slr)-1),2)=' D' ">
+            <e><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+         <!-- si es per Defecte L-R -->
+         <xsl:when test="substring(./@slr,(string-length(./@slr)-1),2)=' D'">
+            <e r="LR"><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+         <!-- si es per Defecte R-L -->
+         <xsl:when test="substring(./@srl,(string-length(./@srl)-1),2)=' D'">
+            <e r="RL"><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+         <!-- **** si no es per defecte cap, llavors s'elimina, s'ignora **** -->
+          </xsl:choose>
+      </xsl:when>
+      <!-- si sols te conflicte R-L -->
+      <xsl:when test="./@srl!='' ">
+         <xsl:choose>
+         <!-- si es la solucio per Defecte R-L i te restriccio RL-->
+         <xsl:when test="substring(./@srl,(string-length(./@srl)-1),2)=' D' and ./@r='RL'">
+            <e r="RL"><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+        <!-- si es la solucio per Defecte R-L -->
+         <xsl:when test="substring(./@srl,(string-length(./@srl)-1),2)=' D' ">
+            <e><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+         <!-- si no es la solucio per Defecte R-L i te restriccio RL-->
+         <xsl:when test="@r='RL' ">
+            <!-- L'ELIMINEM -->
+         </xsl:when>
+         <!-- si no es la solucio per Defecte R-L -->
+         <xsl:otherwise>
+            <e r="LR"><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:otherwise>
+         </xsl:choose>
+      </xsl:when>
+      <!-- si sols te conflicte L-R -->
+      <xsl:when test="./@slr!=''">
+         <xsl:choose>
+         <!-- si es la solucio per Defecte L-R i te restriccio LR-->
+         <xsl:when test="substring(./@slr,(string-length(./@slr)-1),2)=' D' and ./@r='LR'">
+            <e r="LR"><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+        <!-- si es la solucio per Defecte L-R -->
+         <xsl:when test="substring(./@slr,(string-length(./@slr)-1),2)=' D' ">
+            <e><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:when>
+         <!-- si no es la solucio per Defecte L-R i te restriccio LR-->
+         <xsl:when test="@r='LR' ">
+            <!-- L'ELIMINEM -->
+         </xsl:when>
+         <!-- si no es la solucio per Defecte L-R -->
+         <xsl:otherwise>
+            <e r="RL"><xsl:value-of select="string('&#xa;')"/><!-- \n -->
+               <xsl:copy-of select="*"/>
+            <xsl:value-of select="string('&#xa;')"/><!-- \n -->
+            </e>
+         </xsl:otherwise>
+         </xsl:choose>
+      </xsl:when>
+  </xsl:choose>    
+</xsl:template>
+
+<xsl:template match="e[not(@slr|@srl)]">  <!-- elements sense polisemia -->
+  <xsl:copy-of select ="."/>
+</xsl:template>
+
+
+</xsl:stylesheet>
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/postchunk.dtd	(revision 70339)
@@ -0,0 +1,434 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<!-- 
+   Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+    Draft of DTD for the structural transfer rule files 
+     
+    Sergio Ortiz, Gema Ram�rez-S�nchez, Mireia Ginest�, Mikel L. Forcada, 
+    2005.07.29. 
+-->    
+
+<!ENTITY % condition "(and|or|not|equal|begins-with|begins-with-list|ends-with|ends-with-list|contains-substring|in)">
+<!ENTITY % container "(var|clip)">
+<!ENTITY % sentence "(let|out|choose|modify-case|call-macro|append)">
+<!ENTITY % value "(b|clip|lit|lit-tag|var|get-case-from|case-of|concat|lu-count|lu|mlu)">
+<!ENTITY % stringvalue "(clip|lit|var|get-case-from|case-of|lu-count)">
+
+<!ELEMENT postchunk (section-def-cats, section-def-attrs, section-def-vars, section-def-lists?, section-def-macros?, section-rules)>
+<!-- 
+     'postchunk' is the root element containing the whole structural
+     postchunk rule file.  
+-->
+
+<!ELEMENT section-def-cats (def-cat+)>
+<!-- 
+     The 'def-cats' section defines the categories used to build the
+patterns used in rules
+ -->
+
+<!ELEMENT def-cat (cat-item+)>
+<!ATTLIST def-cat  n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!-- 
+     Each 'def-cat' defines one category in terms of a list of
+     category items and has a unique name 'n', which is mandatory
+-->
+
+<!ELEMENT cat-item EMPTY>
+<!ATTLIST cat-item name CDATA #REQUIRED> 
+<!-- 
+     In addition, a required attribute, "name", is used to specify 
+     wich chunk name is detected by this cat-item
+-->
+ 
+<!ELEMENT section-def-attrs (def-attr+)>
+
+<!-- 
+     The 'def-attrs' section defines the attributes that will be
+     identified in matched lexical forms 
+-->
+
+<!ELEMENT def-attr (attr-item+)>
+<!ATTLIST def-attr n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!-- 
+     Each def-attr defines one attribute in terms of a list of
+     attribute items and has a mandatory unique name n 
+-->
+
+<!ELEMENT attr-item EMPTY>
+<!ATTLIST attr-item tags CDATA #IMPLIED
+                    c CDATA #IMPLIED>
+<!-- 
+     Each 'attr-item' specifies a subsequence of the tags in
+     that lexical form (attribute 'tags')
+-->
+
+<!ELEMENT section-def-vars (def-var+)>
+<!-- 
+     The 'def-vars' section defines the global variables
+     that will be used to transfer information between rules
+-->
+
+<!ELEMENT def-var EMPTY>
+<!ATTLIST def-var n ID #REQUIRED
+                  v CDATA #IMPLIED
+                  c CDATA #IMPLIED>
+<!-- 
+     The definition of a global variable has a mandatory unique name 'n' that
+     will be used to refer to it. A value of initialization can also be specified
+     by means the 'v' attribute.  The default value of the initialization is the
+     empty string.
+-->
+
+<!ELEMENT section-def-lists (def-list)+>
+<!--
+     Element 'section-def-lists' encloses a set of list definitions
+-->
+
+<!ELEMENT def-list (list-item+)>
+<!ATTLIST def-list n ID #REQUIRED
+                   c CDATA #IMPLIED>
+<!--
+     The 'def-list' element defines a named list to search with the 'in' 
+     element.  Attribute 'n' sets the name of the list
+-->
+
+<!ELEMENT list-item EMPTY>
+<!ATTLIST list-item v CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+<!--
+     Attribute 'v' of 'list-item' element contains the value to be added to 
+     the list being defined     
+-->
+
+<!ELEMENT section-def-macros (def-macro)+>
+<!-- 
+
+     The 'def-macros' section defines macros containing portions of
+     code frequently used in the action part of rules
+
+-->
+
+<!ELEMENT def-macro (%sentence;)+>
+<!ATTLIST def-macro n ID #REQUIRED>
+<!ATTLIST def-macro npar CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+<!-- 
+     Macro definition:
+     
+     A macro has a mandatory name (the value of 'n'), a number of parameters
+     (the value of 'npar') and a body containing arguments and statements.  
+-->
+
+<!ELEMENT section-rules (rule+)>
+<!-- 
+     The rules section contains a sequence of one or more rules
+-->
+
+<!ELEMENT rule (pattern, action)>
+<!ATTLIST rule comment CDATA #IMPLIED>
+<!-- 
+      Each rule has a pattern and an action 
+      * Attribute 'comment' allows to include a comment with the rule
+-->
+
+<!ELEMENT pattern (pattern-item)>
+<!-- 
+The pattern is specified in terms of pattern items, each one
+representing a lexical form in the matched pattern 
+-->
+
+<!ELEMENT pattern-item EMPTY>
+<!ATTLIST pattern-item n IDREF #REQUIRED>
+<!-- 
+       Each attribute to be activated is referred to by its name in the def-cats section 
+-->
+
+<!ELEMENT action (%sentence;)*>
+<!ATTLIST action c CDATA #IMPLIED>
+<!-- 
+       Encloses the procedural part of a rule
+-->
+
+<!ELEMENT choose (when+,otherwise?)>
+<!ATTLIST choose c CDATA #IMPLIED>
+<!-- 
+     The choose statement is a selection statement (similar to a case
+     statement) composed of one or more tested cases and an optional
+     otherwise 
+-->
+
+<!ELEMENT when (test,(%sentence;)*)>
+<!ATTLIST when c CDATA #IMPLIED>
+<!-- 
+     Each tested case is a block of zero or more statements 
+-->
+
+<!ELEMENT otherwise (%sentence;)+>
+<!ATTLIST otherwise c CDATA #IMPLIED>
+<!-- 
+     The otherwise case is also a block of one or more statements 
+-->
+
+<!ELEMENT test (%condition;)>
+<!ATTLIST test c CDATA #IMPLIED>
+<!-- 
+     The test in a tested case may be a conjunction, a disjunction, or
+     a negation of simpler tests, as well as a simple equality test
+-->
+
+<!ELEMENT and ((%condition;),(%condition;)+)>
+<!--  
+     Each conjuntion test contains two or more simpler tests 
+-->
+
+<!ELEMENT or ((%condition;),(%condition;)+)>
+<!-- 
+     Each disjunction test contains two or more simpler tests 
+-->
+
+<!ELEMENT not (%condition;)>
+<!-- 
+     The negation of a simpler test is a test itself 
+-->
+
+<!ELEMENT equal (%value;,%value;)> 
+<!ATTLIST equal caseless (no|yes) #IMPLIED>
+<!-- 
+      The simplest test is an equality test. The right part and the
+      left part of the equality may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT begins-with (%value;,%value;)> 
+<!ATTLIST begins-with caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the beginning.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT ends-with (%value;,%value;)> 
+<!ATTLIST ends-with caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the end.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT begins-with-list (%value;,list)> 
+<!ATTLIST begins-with-list caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the beginning.
+      First parts of the test may be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section. The second part
+      must be always a list.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT ends-with-list (%value;,list)> 
+<!ATTLIST ends-with-list caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part at the end.
+      First parts of the test may be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section. The second part
+      must be always a list.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+<!ELEMENT contains-substring (%value;,%value;)> 
+<!ATTLIST contains-substring caseless (no|yes) #IMPLIED>
+<!-- 
+      Tests if the left part contains the right part.
+      Both parts of the test may both be a clip (see below), a
+      literal string ('lit'), a literal tag ('lit-tag') or the value of 
+      a variable ('var') defined in the def-vars section.  When the attribute
+      'caseless' is set to 'yes', the comparison is made without attending
+      to the case.
+-->
+
+
+
+
+<!ELEMENT in (%value;, list)>
+<!ATTLIST in caseless (no|yes) #IMPLIED>
+<!--
+    'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+    this search is performed without attending to the case
+-->
+
+<!ELEMENT list EMPTY>
+<!ATTLIST list n IDREF #REQUIRED>
+<!--
+    'list' refers, with the name in attribute 'n', a list defined before in
+    the 'section-def-list' section
+-->
+
+<!ELEMENT let (%container;, %value;)>
+<!-- 
+      An assignment statement ('let') assigns the value of a clip (see
+      below), a literal string ('lit'), a literal tag('lit-tag') or the 
+      value of a global variable ('var') to either a global variable ('var') 
+      or a clip
+-->
+
+<!ELEMENT append (%value;)+>
+<!ATTLIST append n IDREF #REQUIRED>
+<!-- 
+      This instruction appends the value of a clip (see
+      below), a literal string ('lit'), a literal tag('lit-tag') or the 
+      value of a global variable ('var') to either a global variable ('var') 
+      or a clip, identified by the "n" attribute
+-->
+
+
+<!ELEMENT out (b|lu|mlu|var)+>
+<!ATTLIST out c CDATA #IMPLIED>
+<!-- 
+      'out' is an output statement; it may output blanks or chunks
+-->
+
+<!ELEMENT modify-case (%container;, %stringvalue;)>
+<!--
+      The first argument of 'modify-case' copy the case of the second 
+      argument.
+--> 
+
+<!ELEMENT call-macro (with-param)*>
+<!ATTLIST call-macro n IDREF #REQUIRED>
+<!-- 
+      A macro may be called anywhere by name with one or more
+      arguments
+-->
+
+<!ELEMENT with-param EMPTY>
+<!ATTLIST with-param pos CDATA #REQUIRED>
+<!-- 
+      The attribute pos in each argument is used to refer to a lexical
+      form in the current rule. For example, if a 2-parameter macro
+      has been defined to perform noun-adjective agreement operations,
+      it may be used with arguments 1 and 2 in a noun-adjective rule,
+      with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+      arguments 1 and 3 in a noun-adverb-adjective rule, and with
+      arguments 2 and 1 in an adjective-noun rule 
+-->
+
+<!ELEMENT clip EMPTY>
+<!ATTLIST clip pos CDATA #REQUIRED
+               part CDATA #REQUIRED
+               c CDATA #IMPLIED>
+<!-- 
+      A 'clip' is a substring of a source-language or target-language
+      lexical form, extracted according to an attribute:
+
+      * 'pos' is an index (1, 2, 3...) used to select a lexical form
+         inside the rule;
+   
+      * the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+
+-->
+
+<!ELEMENT lit EMPTY>
+<!ATTLIST lit v CDATA #REQUIRED>
+<!-- 
+      A literal string value: the value of the literal is the value of
+      the 'v' attribute
+-->
+
+<!ELEMENT lit-tag EMPTY>
+<!ATTLIST lit-tag v CDATA #REQUIRED>
+<!-- 
+      A literal string value: the value of the literal is the value of
+      the 'v' attribute
+-->
+
+
+<!ELEMENT var EMPTY>
+<!ATTLIST var n IDREF #REQUIRED>
+<!-- 
+     Each 'var' is a variable identifier: the attribute n is the name
+     of the variable. When it is in an 'out', a 'test', or the right
+     part of a 'let', it represents the value of the variable; when in
+     the left part of a 'let' it represents the reference of the
+     variable. 
+-->
+
+<!ELEMENT get-case-from (clip|lit|var)> 
+<!ATTLIST get-case-from pos CDATA #REQUIRED>
+<!-- Atenci�n, falta modificar todos los comentarios donde intervenga
+get-case-from -->
+
+<!ELEMENT case-of EMPTY>
+<!ATTLIST case-of pos CDATA #REQUIRED
+               part CDATA #REQUIRED>
+<!--
+      A 'case-of' is a value representing the case of a "clip".  This value 
+      will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+      (all uppercase).
+
+      * 'pos' is an index (1, 2, 3...) used to select a lexical form
+         inside the rule;
+   
+      * the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+-->
+
+
+<!ELEMENT concat (%value;)+>
+<!-- Concatenates a sequence of values -->
+
+<!ELEMENT mlu (lu+)>
+<!-- Encloses a multiword -->
+
+<!ELEMENT lu (%value;)+>
+<!-- Encloses a word -->
+
+<!ELEMENT b EMPTY>
+<!ATTLIST b pos CDATA #IMPLIED>
+<!-- 
+     'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+     with pos="2" refers to the [super]blanks (including format data
+     encapsulated by the de-formatter) between lexical form 2 and
+     lexical form 3. Managing [super]blanks explicitly allows for the
+     correct placement of format when the result of structural
+     transfer has more or less lexical items than the original or has
+     been reordered in some way.  If attribute "pos" is not specified, then
+     a single blank (ASCII 32) is generated.
+-->
+
+<!ELEMENT lu-count EMPTY>
+<!--
+     Number of lexical units (words inside the chunk) in the rule
+--> 
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.dtd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.dtd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger.dtd	(revision 70339)
@@ -0,0 +1,157 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+
+<!-- 
+   Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+  
+   This program is free software; you can redistribute it and/or
+   modify it under the terms of the GNU General Public License as
+   published by the Free Software Foundation; either version 2 of the
+   License, or (at your option) any later version.
+  
+   This program is distributed in the hope that it will be useful, but
+   WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+   General Public License for more details.
+  
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+     DTD for the tagset and the rules to enforce the state to state
+     transition probabilities used by the part-of-speech tagger. 
+     2005.07.29.
+-->
+
+<!ELEMENT tagger (tagset,forbid?,enforce-rules?,preferences?,discard-on-ambiguity?)>
+<!ATTLIST tagger name CDATA #REQUIRED>
+<!--
+	'tagger' is the root element containing the whole tagset for a given
+    language specified through the mandatory attribute 'name'
+-->
+
+<!ELEMENT tagset (def-label+,def-mult*)>
+
+<!-- 
+	The 'tagset' section defines the correspondance between simple 
+    or multiple morphological categories defining a lexical form and the coarser 
+    ones with which the part-of-speech tagger works
+-->
+
+<!ELEMENT def-label (tags-item+)>
+<!ATTLIST def-label name CDATA #REQUIRED
+                    c CDATA #IMPLIED
+                    closed CDATA #IMPLIED>
+
+<!-- 
+	Each 'def-label' defines one coarse tag in terms of a list of fine tags 
+    and has a mandatory unique name. The optional attribute 'closed="true"' may be used
+    to specify if the defined fine tags belong to a closed list.
+    c is for comments and is ignored
+-->
+
+<!ELEMENT tags-item EMPTY>
+<!ATTLIST tags-item tags CDATA #REQUIRED
+	            lemma CDATA #IMPLIED>
+
+<!--
+	Each 'tags-item' may be a dot-separated subsequence of the morphological tags
+    corresponding to a coarse tag optionally in association with a given lemma 
+-->
+<!ELEMENT def-mult (sequence+)>
+<!ATTLIST def-mult name CDATA #REQUIRED
+                    c CDATA #IMPLIED
+                   closed CDATA #IMPLIED>
+
+<!--
+	Each 'def-mult' defines one coarse tag in terms of a sequence of coarse
+    tags previously defined as 'def-labels' or a sequence of fine tags. A mandatory 
+    name is required for each 'def-mult' which may also has an optional attribute 
+    'closed="true"' if it belongs to a closed list
+    c is for comments and is ignored
+-->
+
+<!ELEMENT sequence ((tags-item|label-item)+)>
+
+<!--
+	Element 'sequence' encloses a set of tags or labels which defines 
+    a unit with more than one label
+-->
+
+<!ELEMENT label-item EMPTY>
+<!ATTLIST label-item label CDATA #REQUIRED
+                    c CDATA #IMPLIED>
+
+<!--
+	Each 'label' of the 'label-item' correspond to a coarse tag previously 
+    defined as a 'def-label' by a name.
+    c is for comments and is ignored
+-->
+
+<!ELEMENT forbid (label-sequence+)>
+
+<!--   
+	Element 'forbid' contains sequences of morphological categories that are not 
+    allowed in a given language
+-->
+
+<!ELEMENT label-sequence (label-item+)>
+<!ATTLIST label-sequence c CDATA #IMPLIED>
+
+<!--	
+	Each 'label-sequence' is restricted to two 'label-items' 
+    c is for comments and is ignored
+-->
+
+<!ELEMENT enforce-rules (enforce-after+)>
+
+<!--
+        Element 'enforce-rules' defines sets of coarse tags that must follow specified ones
+-->
+
+<!ELEMENT enforce-after (label-set)>
+<!ATTLIST enforce-after label CDATA #REQUIRED
+                        c CDATA #IMPLIED>
+
+<!-- 
+	Each 'enforce-after' encloses the set of coarse tags ('label-set') that must follow 
+    the one defined in 'label', as a mandatory attribute
+    c is for comments and is ignored
+-->
+
+<!ELEMENT label-set (label-item+)>
+<!ATTLIST label-set c CDATA #IMPLIED>
+<!--
+	The set of 'label-items' enforced after a 'label' are enclosed inside element 'label-set'  
+    c is for comments and is ignored
+-->
+
+<!ELEMENT preferences (prefer+)>
+
+<!-- 	
+	Element 'preferences' allows to decide amongst two or more fine tag sequences 
+    which are grouped in the same coarse tag. 
+-->
+
+<!ELEMENT prefer EMPTY>
+<!ATTLIST prefer tags CDATA #REQUIRED
+                 c CDATA #IMPLIED>
+
+<!-- 
+	Each 'prefer' element has a mandatory attribute 'tags' made of a sequence of fine tags 
+    c is for comments and is ignored
+-->
+
+<!ELEMENT discard-on-ambiguity (discard+)>
+
+<!--
+        List of label-item or tags-item to be discarded when an ambiguity
+	occurs inside a word
+-->
+
+<!ELEMENT discard EMPTY>
+<!ATTLIST discard tags CDATA #REQUIRED
+                  c CDATA #IMPLIED>
+
+<!-- 
+	Each 'discard' element has a mandatory attribute 'tags' made of a sequence of fine tags 
+    c is for comments and is ignored
+-->
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data.cc	(revision 70339)
@@ -0,0 +1,185 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/tagger_data.h>
+#include <lttoolbox/compression.h>
+#include <apertium/endian_double_util.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+void
+TaggerData::copy(TaggerData const &o)
+{
+  open_class = o.open_class;
+  forbid_rules = o.forbid_rules;
+  tag_index = o.tag_index;
+  array_tags = o.array_tags;
+  enforce_rules = o.enforce_rules;
+  prefer_rules = o.prefer_rules;
+  constants = o.constants;
+  output = o.output;  
+  plist = o.plist;
+}
+
+TaggerData::TaggerData()
+{
+}
+
+TaggerData::~TaggerData()
+{
+}
+
+TaggerData::TaggerData(TaggerData const &o)
+{
+  copy(o);
+}
+
+TaggerData &
+TaggerData::operator =(TaggerData const &o)
+{
+  if(this != &o)
+  {
+    copy(o);
+  }
+  return *this;
+}
+
+set<TTag> &
+TaggerData::getOpenClass()
+{
+  return open_class;
+}
+
+void
+TaggerData::setOpenClass(set<TTag> const &oc)
+{
+  open_class = oc;
+}
+
+vector<TForbidRule> &
+TaggerData::getForbidRules()
+{
+  return forbid_rules;
+}
+
+void
+TaggerData::setForbidRules(vector<TForbidRule> &fr)
+{
+  forbid_rules = fr;
+}  
+
+map<wstring, TTag, Ltstr> &
+TaggerData::getTagIndex()
+{
+  return tag_index;
+}
+
+void
+TaggerData::setTagIndex(map<wstring, TTag, Ltstr> const &ti)
+{
+  tag_index = ti;
+}
+  
+vector<wstring> &
+TaggerData::getArrayTags()
+{
+  return array_tags;
+}
+
+void
+TaggerData::setArrayTags(vector<wstring> const &at)
+{
+  array_tags = at;
+}
+
+vector<TEnforceAfterRule> &
+TaggerData::getEnforceRules()
+{
+  return enforce_rules;
+}
+
+void
+TaggerData::setEnforceRules(vector<TEnforceAfterRule> const &tear)
+{
+  enforce_rules = tear;
+}
+
+vector<wstring> &
+TaggerData::getPreferRules()
+{
+  return prefer_rules;
+}
+
+void
+TaggerData::setPreferRules(vector<wstring> const &pr)
+{
+  prefer_rules = pr;
+}
+
+vector<wstring> &
+TaggerData::getDiscardRules()
+{
+  return discard;
+}
+
+void
+TaggerData::setDiscardRules(vector<wstring> const &v)
+{
+  discard = v;
+}
+
+ConstantManager &
+TaggerData::getConstants()
+{
+  return constants;
+}
+
+void
+TaggerData::setConstants(ConstantManager const &c)
+{  
+  constants = c;
+}
+
+Collection &
+TaggerData::getOutput()
+{
+  return output;
+}
+
+void
+TaggerData::setOutput(Collection const &c)
+{
+  output = c;
+}
+
+PatternList &
+TaggerData::getPatternList()
+{
+  return plist;
+}
+
+void
+TaggerData::setPatternList(PatternList const &pl)
+{
+  plist = pl;
+}
+
+void
+TaggerData::addDiscard(wstring const &tags)
+{
+  discard.push_back(tags);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data.h	(revision 70339)
@@ -0,0 +1,87 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TAGGERDATA_
+#define _TAGGERDATA_
+
+#include <apertium/constant_manager.h>
+#include <apertium/ttag.h>
+#include <apertium/collection.h>
+#include <lttoolbox/pattern_list.h>
+#include <lttoolbox/ltstr.h>
+
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+using namespace std;
+
+class TaggerData
+{
+protected:
+  set<TTag> open_class;
+  vector<TForbidRule> forbid_rules;
+  map<wstring, TTag, Ltstr> tag_index;
+  vector<wstring> array_tags;
+  vector<TEnforceAfterRule> enforce_rules;
+  vector<wstring> prefer_rules;
+  ConstantManager constants;
+  Collection output;
+  PatternList plist;
+
+  vector<wstring> discard;
+  
+  void copy(TaggerData const &o);
+public:
+  TaggerData();
+  virtual ~TaggerData();
+  TaggerData(TaggerData const &o);
+  TaggerData & operator =(TaggerData const &o);
+  
+  set<TTag> & getOpenClass();
+  void setOpenClass(set<TTag> const &oc);
+
+  vector<TForbidRule> & getForbidRules();
+  void setForbidRules(vector<TForbidRule> &fr);
+  
+  map<wstring, TTag, Ltstr> & getTagIndex();
+  void setTagIndex(map<wstring, TTag, Ltstr> const &ti);
+  
+  vector<wstring> & getArrayTags();
+  void setArrayTags(vector<wstring> const &at);
+
+  vector<TEnforceAfterRule> & getEnforceRules();
+  void setEnforceRules(vector<TEnforceAfterRule> const &tear);
+
+  vector<wstring> & getPreferRules();
+  void setPreferRules(vector<wstring> const &pr);
+  
+  vector<wstring> & getDiscardRules();
+  void setDiscardRules(vector<wstring> const &dr);
+
+  ConstantManager & getConstants();
+  void setConstants(ConstantManager const &c);
+  
+  virtual Collection & getOutput();
+  void setOutput(Collection const &c);
+ 
+  void setPatternList(PatternList const &pl);
+  void addDiscard(wstring const &tags);
+  PatternList & getPatternList();
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_hmm.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_hmm.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_hmm.h	(revision 70339)
@@ -0,0 +1,50 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TAGGERDATAHMM_
+#define _TAGGERDATAHMM_
+
+#include <apertium/tagger_data.h>
+
+class TaggerDataHMM : public TaggerData
+{
+private:
+  int N;
+  int M;
+  double **a;
+  double **b;
+
+  void destroy();
+public:
+  TaggerDataHMM();
+  virtual ~TaggerDataHMM();
+  TaggerDataHMM(TaggerDataHMM const &o);
+  TaggerDataHMM(TaggerData const &o);
+  TaggerDataHMM & operator =(TaggerDataHMM const &o);
+ 
+  virtual void setProbabilities(int const myN, int const myM, 
+                        double **myA = NULL, double **myB = NULL);
+
+  virtual double ** getA();
+  virtual double ** getB();
+  virtual int getN();
+  virtual int getM();
+  
+  virtual void read(FILE *in);
+  virtual void write(FILE *out);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_lsw.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_lsw.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_lsw.cc	(revision 70339)
@@ -0,0 +1,324 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/lswpost.h>
+#include <apertium/tagger_data_lsw.h>
+#include <lttoolbox/compression.h>
+#include <apertium/endian_double_util.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+void
+TaggerDataLSW::destroy()
+{
+  if (d != NULL) {
+    for (int i = 0; i < N; ++i) {
+      for (int j = 0; j < N; ++j) {
+        delete [] d[i][j];
+      }
+      delete [] d[i];
+    }
+  delete [] d;
+  }
+  d = NULL;
+  
+  N = 0;
+}
+
+TaggerDataLSW::TaggerDataLSW()
+{
+  d = NULL;
+  N = 0;
+}
+
+TaggerDataLSW::~TaggerDataLSW()
+{
+  destroy();
+}
+
+TaggerDataLSW::TaggerDataLSW(TaggerDataLSW const &o)
+{
+  d = NULL;
+  N = 0;
+  TaggerData::copy(o);
+  this->setProbabilities(o.N, o.d);
+}
+
+TaggerDataLSW::TaggerDataLSW(TaggerData const &o)
+{
+  d = NULL;
+  N = 0;
+  TaggerData::copy(o);
+}
+
+TaggerDataLSW &
+TaggerDataLSW::operator =(TaggerDataLSW const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    TaggerData::copy(o);
+    this->setProbabilities(o.N, o.d);
+  }
+  return *this;
+}
+
+void
+TaggerDataLSW::setProbabilities(int const myN, double ***myD) {
+   this->destroy();
+   N = myN;
+   if(N != 0) {
+     d = new double ** [N];
+     for (int i = 0; i < N; ++i) {
+       d[i] = new double * [N];
+       for (int j = 0; j < N; ++j) {
+           d[i][j] = new double [N];
+           if (myD != NULL) {
+              for (int k = 0; k < N; ++k) {
+                d[i][j][k] = myD[i][j][k];
+              }
+           }
+       }
+     }
+   } else {
+     d = NULL;
+   }
+}
+
+double ***
+TaggerDataLSW::getD() {
+  return d;
+}
+
+int 
+TaggerDataLSW::getN()
+{  
+  return N;
+}
+
+void
+TaggerDataLSW::read(FILE *in)
+{
+  destroy();
+
+  // open_class
+  int val = 0;
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    val += Compression::multibyte_read(in);
+    open_class.insert(val);
+  }
+  
+  // forbid_rules
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    TForbidRule aux;
+    aux.tagi = Compression::multibyte_read(in);
+    aux.tagj = Compression::multibyte_read(in);
+    forbid_rules.push_back(aux);
+  }
+
+  
+  // array_tags
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    array_tags.push_back(Compression::wstring_read(in));
+  }
+  
+  // tag_index
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    wstring tmp = Compression::wstring_read(in);    
+    tag_index[tmp] = Compression::multibyte_read(in);
+  }
+
+  // enforce_rules  
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    TEnforceAfterRule aux;
+    aux.tagi = Compression::multibyte_read(in);
+    for(int j = Compression::multibyte_read(in); j != 0; j--)
+    {
+      aux.tagsj.push_back(Compression::multibyte_read(in));
+    }
+    enforce_rules.push_back(aux);
+  }
+
+  // prefer_rules
+  for(int i = Compression::multibyte_read(in); i != 0; i--)
+  {
+    prefer_rules.push_back(Compression::wstring_read(in));
+  }
+
+  // constants
+  constants.read(in);
+
+  // output
+  output.read(in); 
+
+  // dimensions
+  N = Compression::multibyte_read(in);
+
+  d = new double ** [N];
+  for ( int i = 0; i < N; ++i) {
+    d[i] = new double * [N];
+    for (int j = 0; j < N; ++j) {
+      d[i][j] = new double [N];
+    }
+  }
+
+  // initializing d matrix
+  for (int i = 0; i < N; ++i) {
+    for (int j = 0; j < N; ++j) {
+      for (int k = 0; k < N; ++k) {
+        d[i][j][k] = 0;
+      }
+    }
+  }
+
+  int nval = Compression::multibyte_read(in);
+  for(; nval != 0; nval--) {
+    int i = Compression::multibyte_read(in);
+    int j = Compression::multibyte_read(in);
+    int k = Compression::multibyte_read(in);
+    d[i][j][k] = EndianDoubleUtil::read(in);
+  }
+   
+  // read pattern list
+  plist.read(in);
+    
+  // read discards on ambiguity
+  discard.clear();
+
+  int limit = Compression::multibyte_read(in);  
+  if(feof(in))
+  {
+    return;
+  }
+  
+  for(int i = 0; i < limit; i++)
+  {
+    discard.push_back(Compression::wstring_read(in));
+  }
+}
+
+void
+TaggerDataLSW::write(FILE *out)
+{
+  
+  // open_class
+  Compression::multibyte_write(open_class.size(), out);  
+  int val = 0;
+  for(set<TTag>::const_iterator it = open_class.begin(), limit = open_class.end();
+      it != limit; it++)
+  {
+    Compression::multibyte_write(*it-val, out);    
+    val = *it;
+  }
+  
+  // forbid_rules
+  Compression::multibyte_write(forbid_rules.size(), out);
+  for(unsigned int i = 0, limit = forbid_rules.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(forbid_rules[i].tagi, out);
+    Compression::multibyte_write(forbid_rules[i].tagj, out);
+  }
+  
+  // array_tags
+  Compression::multibyte_write(array_tags.size(), out);
+  for(unsigned int i = 0, limit = array_tags.size(); i != limit; i++)
+  {
+    Compression::wstring_write(array_tags[i], out);
+  }
+
+  // tag_index
+  Compression::multibyte_write(tag_index.size(), out);
+  for(map<wstring, int, Ltstr>::iterator it = tag_index.begin(), limit = tag_index.end();
+      it != limit; it++)
+  {
+    Compression::wstring_write(it->first, out);
+    Compression::multibyte_write(it->second, out);
+  }
+  
+  // enforce_rules
+  Compression::multibyte_write(enforce_rules.size(), out);
+  for(unsigned int i = 0, limit = enforce_rules.size(); i != limit; i++)
+  {
+    Compression::multibyte_write(enforce_rules[i].tagi, out);
+    Compression::multibyte_write(enforce_rules[i].tagsj.size(), out);
+    for(unsigned int j = 0, limit2 = enforce_rules[i].tagsj.size(); j != limit2; j++)
+    {
+      Compression::multibyte_write(enforce_rules[i].tagsj[j], out);
+    }
+  }
+
+  // prefer_rules
+  Compression::multibyte_write(prefer_rules.size(), out);
+  for(unsigned int i = 0, limit = prefer_rules.size(); i != limit; i++)
+  {
+    Compression::wstring_write(prefer_rules[i], out);
+  }
+  
+  // constants
+  constants.write(out);  
+
+  // output
+  output.write(out);
+
+  // d matrix
+  Compression::multibyte_write(N, out);
+
+  int nval = 0;
+  for (int i = 0; i < N; ++i) {
+    for (int j = 0; j < N; ++j) {
+      for (int k = 0; k < N; ++k) {
+        if (d[i][j][k] > ZERO) {
+          ++nval;
+        }
+      }
+    }
+  }
+  Compression::multibyte_write(nval, out);
+
+  for (int i = 0; i < N; ++i) {
+    for (int j = 0; j < N; ++j) {
+      for (int k = 0; k < N; ++k) {
+        if (d[i][j][k] > ZERO) {
+          Compression::multibyte_write(i, out);
+          Compression::multibyte_write(j, out);
+          Compression::multibyte_write(k, out);
+          EndianDoubleUtil::write(out, d[i][j][k]);
+        }
+      }
+    }
+  }
+  
+  // write pattern list
+  plist.write(out);
+  
+  // write discard list
+  
+  if(discard.size() != 0)
+  {
+    Compression::multibyte_write(discard.size(), out);
+    for(unsigned int i = 0, limit = discard.size(); i != limit; i++)
+    {
+      Compression::wstring_write(discard[i], out);
+    }
+  }  
+}
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_lsw.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_lsw.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_data_lsw.h	(revision 70339)
@@ -0,0 +1,46 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TAGGERDATALSW_
+#define _TAGGERDATALSW_
+
+#include <apertium/tagger_data.h>
+
+class TaggerDataLSW : public TaggerData
+{
+private:
+  int N;
+  double ***d;
+  
+  void destroy();
+
+public:
+  TaggerDataLSW();
+  virtual ~TaggerDataLSW();
+  TaggerDataLSW(TaggerDataLSW const &o);
+  TaggerDataLSW(TaggerData const &o);
+  TaggerDataLSW & operator =(TaggerDataLSW const &o);
+  
+  void setProbabilities(int const myN, double ***myD = NULL);
+
+  virtual double *** getD();
+  virtual int getN();
+  
+  void read(FILE *in);
+  void write(FILE *out);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_word.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_word.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tagger_word.h	(revision 70339)
@@ -0,0 +1,152 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef __TAGGERWORD_H
+#define __TAGGERWORD_H
+
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+
+#include <lttoolbox/ltstr.h>
+#include <apertium/ttag.h>
+#include <apertium/apertium_re.h>
+
+using namespace std;
+
+/** Class TaggerWord.
+ *  It stores the superficial form and all possible tags that it can receive.
+ *  It has the fine tags delivered by the morphological analyzer and the coarse
+ *  ones used by the PoS tagger.
+ */  
+class TaggerWord{
+private:
+  wstring superficial_form; 
+  
+  set<TTag> tags;  //Set of all possible tags
+  map<TTag, wstring> lexical_forms;  //For a given coarse tag it stores the fine tag 
+                                    //delevered by the morphological analyzer
+  wstring ignored_string;
+  
+  bool plus_cut; //Flag to distinguish the way in which the word was ended.
+                  //If it was done by '$' its value should be false
+                  //If it was done by '+' its value should be true
+  bool previous_plus_cut; //Flag to distinguish the way in which the
+			  //previous word was ended. It has the same
+			  //plus_cut meaning
+  bool show_sf; // Show the superficial form in the output
+  static map<wstring, ApertiumRE, Ltstr> patterns;
+
+  bool match(wstring const &s, wstring const &pattern);
+public:
+  static bool generate_marks;
+  static vector<wstring> array_tags;
+
+  static bool show_ignored_string;
+
+   /** 
+    * Constructor 
+    */
+   TaggerWord(bool prev_plus_cut=false);
+  
+   /** 
+    * Copy constructor
+    */
+   TaggerWord(const TaggerWord &w);
+  
+   /** 
+    * Destructor 
+    */
+   virtual ~TaggerWord();
+  
+   /** Set the superficial form of the word.
+    *  @param s the superficial form
+    */
+   void set_superficial_form(const wstring &s);
+  
+   /** Get the superficial form of the word
+    *
+    */
+   wstring& get_superficial_form();
+  
+   /** Add a new tag to the set of all possible tags of the word.
+    *  @param t the coarse tag
+    *  @param lf the lexical form (fine tag)
+    */
+   virtual void add_tag(TTag &t, const wstring &lf, vector<wstring> const &prefer_rules);
+
+   /** Get the set of tags of this word.
+    *  @return  set of tags.
+    */  
+   virtual set<TTag>& get_tags();
+  
+   /** Get a wstring with the set of tags
+    */
+   virtual wstring get_string_tags();
+   
+  /** Get the lexical form (fine tag) for a given tag (coarse one)
+   *  @param  t the tag
+   *  @return the lexical form of tag t
+   */
+  virtual wstring get_lexical_form(TTag &t, int const TAG_kEOF); 
+
+  wstring get_all_chosen_tag_first(TTag &t, int const TAG_kEOF);
+  
+  /** Get the lexical form (fine tag) for a given tag (coarse one)
+   *  @param  t the tag
+   *  @return the lexical form of tag t without other text that
+   *          is ignored.
+   */  
+  wstring get_lexical_form_without_ignored_string(TTag &t, int const TAG_kEOF); 
+  
+  /** Add text to the ignored string
+   *
+   */   
+  void add_ignored_string(wstring const &s);
+  
+  /** Set the flag plus_cut to a certain value. If this flag is set to true means
+   *  that there were a '+' between this word and the next one 
+   */
+   void set_plus_cut(const bool &c);
+
+  /**
+   * Get and set the "show superficial form" flag
+   */
+  void set_show_sf(bool sf);
+  bool get_show_sf();
+
+  /** Get the value of the plus_cut flag */
+  bool get_plus_cut();
+   
+  /** Output operator
+   */
+  friend wostream& operator<< (wostream& os, TaggerWord &w);
+  
+  static void setArrayTags(vector<wstring> const &at);
+
+  void print();
+  
+  void outputOriginal(FILE *output);
+  
+  bool isAmbiguous() const;  // CAUTION: unknown words are not considered to 
+                             // be ambiguous by this method
+  
+  void discardOnAmbiguity(wstring const &tags);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_builder.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_builder.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_builder.h	(revision 70339)
@@ -0,0 +1,84 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TMXBUILDER_
+#define _TMXBUILDER_
+
+#include <apertium/transfer_data.h>
+#include <string>
+#include <cstdio>
+
+using namespace std;
+
+class TMXBuilder
+{
+private:
+  wstring lang1;
+  wstring lang2;
+  unsigned int max_edit;
+  unsigned int diagonal_width;
+  unsigned int window_size;
+  unsigned int step;
+  double percent;
+  double edit_distance_percent;
+  unsigned int low_limit;
+  FILE *freference;
+
+  static wstring nextTU(FILE *input);
+  static wstring restOfBlank(FILE *input);
+  static wstring nextBlank(FILE *input);
+  static wstring xmlize(wstring const &str);
+  static bool compatible(FILE *input, FILE *output, bool lazy = false);
+  void generateTMX(FILE *f1, FILE *f2, FILE *output);
+  void outputTU(FILE *f1, FILE *f2, FILE *output);
+  static vector<wstring> reverseList(vector<wstring> const &v);
+  static vector<wstring> sentenceList(FILE *file);
+  static int argmin(int nw, int n, int w);
+  static int * levenshteinTable(vector<wstring> &l1, vector<wstring> &l2, 
+				unsigned int diagonal_width, unsigned int max_edit);
+  void printTU(FILE *output, wstring const &tu1, wstring const &tu2) const;
+  static wstring filter(wstring const &s);
+  static int weight(wstring const &s);  
+  static void printTable(int *table, unsigned int nrows, unsigned int ncols);
+  static int editDistance(wstring const &s1, wstring const &s2, unsigned int max_edit);
+  static int min3(int i1, int i2, int i3);
+  static int min2(int i1, int i2);
+  void printTUCond(FILE *output, wstring const &s1, wstring const &s2, bool secure_zone);
+  static vector<wstring> extractFragment(vector<wstring> const &text, unsigned int base, 
+					 unsigned int width);
+
+  static bool isRemovablePunct(wchar_t const &c);
+  bool similar(wstring const &s1, wstring const &s2);
+
+  void splitAndMove(FILE *file, string const &filename);
+public:
+  TMXBuilder(wstring const &l1, wstring const &l2);
+  ~TMXBuilder();
+  static bool check(string const &file1, string const &file2, bool lazy = false);
+  void generate(string const &file1, string const &file2, 
+                string const &outfile="");
+                
+  void setMaxEdit(int me);
+  void setDiagonalWidth(int dw);
+  void setWindowSize(int ws);
+  void setStep(int s);
+  void setPercent(double p);
+  void setLowLimit(int l);
+  void setEditDistancePercent(double e);
+  void setTranslation(string const &filename);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_data.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_data.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_data.cc	(revision 70339)
@@ -0,0 +1,192 @@
+/*
+ * Copyright (C) 2005--2015 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <apertium/transfer_data.h>
+#include <lttoolbox/compression.h>
+#include <apertium/utf_converter.h>
+#include <apertium/apertium_re.h>
+#include <iostream>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+using namespace std;
+
+void
+TransferData::copy(TransferData const &o)
+{
+  alphabet = o.alphabet;
+  transducer = o.transducer;
+  finals = o.finals;
+  attr_items = o.attr_items;
+  macros = o.macros;
+  lists = o.lists;
+  variables = o.variables;
+}
+
+void
+TransferData::destroy()
+{
+}
+
+TransferData::TransferData()
+{
+  // adding fixed attr_items
+  attr_items[L"lem"] = L"(([^<]|\"\\<\")+)";
+  attr_items[L"lemq"] = L"\\#[- _][^<]+";
+  attr_items[L"lemh"] = L"(([^<#]|\"\\<\"|\"\\#\")+)";
+  attr_items[L"whole"] = L"(.+)";
+  attr_items[L"tags"] = L"((<[^>]+>)+)";
+  attr_items[L"chname"] = L"({([^/]+)\\/)"; // includes delimiters { and / !!!
+  attr_items[L"chcontent"] = L"(\\{.+)";
+  attr_items[L"content"] = L"(\\{.+)";
+}
+
+TransferData::~TransferData()
+{
+  destroy();
+}
+
+TransferData::TransferData(TransferData const &o)
+{
+  copy(o);
+}
+
+TransferData &
+TransferData::operator =(TransferData const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+Alphabet &
+TransferData::getAlphabet()
+{
+  return alphabet;
+}
+
+Transducer &
+TransferData::getTransducer()
+{
+  return transducer;
+}
+
+map<int, int> &
+TransferData::getFinals()
+{
+  return finals;
+}
+
+map<wstring, wstring, Ltstr> &
+TransferData::getAttrItems()
+{
+  return attr_items;
+}
+
+map<wstring, int, Ltstr> &
+TransferData::getMacros()
+{
+  return macros;
+}
+
+map<wstring, set<wstring, Ltstr>, Ltstr> &
+TransferData::getLists()
+{
+  return lists;
+}
+
+map<wstring, wstring, Ltstr> &
+TransferData::getVariables()
+{
+  return variables;
+}
+
+void
+TransferData::write(FILE *output)
+{
+  alphabet.write(output);
+  transducer.write(output, alphabet.size());
+
+  // finals
+
+  Compression::multibyte_write(finals.size(), output);
+  for(map<int, int>::const_iterator it = finals.begin(), limit = finals.end();
+      it != limit; it++)
+  {
+    Compression::multibyte_write(it->first, output);
+    Compression::multibyte_write(it->second, output);
+  }
+
+  // attr_items
+
+  // precompiled regexps
+  writeRegexps(output);
+
+  // variables
+  Compression::multibyte_write(variables.size(), output);
+  for(map<wstring, wstring, Ltstr>::const_iterator it = variables.begin(), limit = variables.end();
+      it != limit; it++)
+  {
+    Compression::wstring_write(it->first, output);
+    Compression::wstring_write(it->second, output);
+  }
+
+  // macros
+  Compression::multibyte_write(macros.size(), output);
+  for(map<wstring, int, Ltstr>::const_iterator it = macros.begin(), limit = macros.end();
+      it != limit; it++)
+  {
+    Compression::wstring_write(it->first, output);
+    Compression::multibyte_write(it->second, output);
+  }
+
+  // lists
+  Compression::multibyte_write(lists.size(), output);
+  for(map<wstring, set<wstring, Ltstr>, Ltstr>::const_iterator it = lists.begin(), limit = lists.end();
+      it != limit; it++)
+  {
+    Compression::wstring_write(it->first, output);
+    Compression::multibyte_write(it->second.size(), output);
+
+    for(set<wstring, Ltstr>::const_iterator it2 = it->second.begin(), limit2 = it->second.end();
+	it2 != limit2; it2++)
+    {
+      Compression::wstring_write(*it2, output);
+    }
+  }
+
+}
+
+void
+TransferData::writeRegexps(FILE *output)
+{
+  Compression::string_write(string(pcre_version()), output);
+  Compression::multibyte_write(attr_items.size(), output);
+
+  map<wstring, wstring, Ltstr>::iterator it, limit;
+  for(it = attr_items.begin(), limit = attr_items.end(); it != limit; it++)
+  {
+    Compression::wstring_write(it->first, output);
+    ApertiumRE my_re;
+    my_re.compile(UtfConverter::toUtf8(it->second));
+    my_re.write(output);
+    Compression::wstring_write(it->second, output);
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_data.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_data.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_data.h	(revision 70339)
@@ -0,0 +1,63 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSFERDATA_
+#define _TRANSFERDATA_
+
+#include <lttoolbox/alphabet.h>
+#include <lttoolbox/ltstr.h>
+#include <lttoolbox/transducer.h>
+
+#include <map>
+#include <set>
+
+using namespace std;
+
+class TransferData
+{
+private:
+  void copy(TransferData const &o);
+  void destroy();
+  
+  map<wstring, wstring, Ltstr> attr_items;
+  map<wstring, int, Ltstr> macros;
+  map<wstring, set<wstring, Ltstr>, Ltstr> lists;
+  map<wstring, wstring, Ltstr> variables;
+  
+  Alphabet alphabet;
+  Transducer transducer;
+  map<int, int> finals;
+
+  void writeRegexps(FILE *output);
+ public:
+  TransferData();
+  ~TransferData();
+  TransferData(TransferData const &o);
+  TransferData & operator =(TransferData const &o);
+  
+  Alphabet & getAlphabet();
+  Transducer & getTransducer();
+  map<int, int> & getFinals();
+  map<wstring, wstring, Ltstr> & getAttrItems();  
+
+  map<wstring, int, Ltstr> & getMacros();
+  map<wstring, set<wstring, Ltstr>, Ltstr> & getLists();
+  map<wstring, wstring, Ltstr> & getVariables();
+  
+  void write(FILE *output);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_instr.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_instr.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_instr.cc	(revision 70339)
@@ -0,0 +1,95 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer_instr.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+void
+TransferInstr::copy(TransferInstr const &o)
+{
+  type = o.type;
+  content = o.content;
+  pos = o.pos;
+  pointer = o.pointer;
+  condition = o.condition;
+}
+
+void
+TransferInstr::destroy()
+{
+}
+
+TransferInstr::TransferInstr(TransferInstrType t, string const &c, 
+                             int const p, void *ptr, bool cond)
+{
+  type = t;
+  content = c;
+  pos = p;
+  pointer = ptr;
+  condition = cond;
+}
+
+TransferInstr::~TransferInstr()
+{
+  destroy();
+}
+
+TransferInstr::TransferInstr(TransferInstr const &o)
+{
+  copy(o);
+}
+
+TransferInstr &
+TransferInstr::operator =(TransferInstr const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+TransferInstrType
+TransferInstr::getType()
+{
+  return type;
+}
+
+string const &
+TransferInstr::getContent()
+{
+  return content;
+}
+
+int
+TransferInstr::getPos()
+{
+  return pos;
+}
+
+void *
+TransferInstr::getPointer()
+{
+  return pointer;
+}
+
+bool
+TransferInstr::getCondition()
+{
+  return condition;
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_token.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_token.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_token.h	(revision 70339)
@@ -0,0 +1,52 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSFERTOKEN_
+#define _TRANSFERTOKEN_
+
+#include <string>
+
+using namespace std;
+
+enum TransferTokenType
+{
+  tt_eof,
+  tt_word,
+  tt_blank
+};
+
+
+class TransferToken
+{
+private:
+  TransferTokenType type;
+  wstring content;
+
+  void copy(TransferToken const &o);
+  void destroy();
+public:
+  TransferToken();
+  TransferToken(wstring const &content, TransferTokenType type);
+  ~TransferToken();
+  TransferToken(TransferToken const &o);
+  TransferToken & operator =(TransferToken const &o);
+  TransferTokenType getType();
+  wstring & getContent();
+  void setType(TransferTokenType type);
+  void setContent(wstring const &content);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word.h	(revision 70339)
@@ -0,0 +1,151 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+
+#ifndef _TRANSFERWORD_
+#define _TRANSFERWORD_
+
+#include <map>
+#include <apertium/apertium_re.h>
+#include <string>
+#include <cstdlib>
+
+using namespace std;
+
+/**
+ * Word type for transfer modules
+ */
+class TransferWord
+{
+private:
+  /**
+   * Source language word
+   */
+  string s_str;
+  
+  /**
+   * Target language word
+   */
+  string t_str;
+  
+  /**
+   * Queue length
+   */
+  int queue_length;
+
+  /**
+   * Copy method
+   * @param o the object to be copied
+   */
+  void copy(TransferWord const &o);
+  
+  /**
+   * Destroy method
+   */
+  void destroy();
+  
+  /**
+   * Accesses the source/target side of a word using the specified part
+   * @param str tipically s_str or t_str
+   * @param part regular expression to match/access
+   * @return reference to matched/accessed string
+   */
+  string access(string const &str, ApertiumRE const &part);
+
+  /**
+   * Assings a value to the source/target side of a word using the
+   * specified part 
+   * @param str tipically s_str or t_str 
+   * @param part regular expression to match/access 
+   * @param value the string to be assigned
+   */
+  void assign(string &str, ApertiumRE const &part, string const &value);
+
+public:
+  /**
+   * Non-parametric constructor
+   */
+  TransferWord();
+  /**
+   * Destructor
+   */
+  ~TransferWord();
+  
+  /**
+   * Copy constructor
+   * @param o the object to be copied
+   */
+  TransferWord(TransferWord const &o);
+  
+  /**
+   * Parametric constructor calling init()
+   * @param src source word
+   * @param tgt target word
+   * @param queue queue lenght
+   */
+  TransferWord(string const &src, string const &tgt, int queue = 0);
+  
+  /**
+   * Assignment operator
+   * @param o the object to be assigned
+   * @return reference to left part of assignment
+   */
+  TransferWord & operator =(TransferWord const &o);
+
+  /**
+   * Sets a bi-word (a source language word and its counterpart in target
+   * language
+   * @param src source word
+   * @param tgt target word
+   */
+  void init(string const &src, string const &tgt);
+  
+  /**
+   * Reference a source language word part
+   * @param part regular expression to match
+   * @param with_queue access taking into account the queue
+   * @returns reference to the part of string matched
+   */ 
+  string source(ApertiumRE const &part, bool with_queue = true);
+
+  /**
+   * Reference a target language word part
+   * @param part regular expression to match
+   * @param with_queue access taking into account the queue
+   * @returns reference to the part of string matched
+   */ 
+  string target(ApertiumRE const &part, bool with_queue = true);
+
+  /**
+   * Sets a value for a source language word part
+   * @param part regular expression to match
+   * @param value the new value for the given part
+   * @param with_queue access taking or not into account the queue
+   */
+  void setSource(ApertiumRE const &part, string const &value, 
+		 bool with_queue = true);
+
+  /**
+   * Sets a value for a target language word part
+   * @param part regular expression to match
+   * @param value the new value for the given part
+   * @param with_queue access taking or not into account the queue
+   */
+  void setTarget(ApertiumRE const &part, string const &value, 
+		 bool with_queue = true);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word_list.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word_list.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word_list.cc	(revision 70339)
@@ -0,0 +1,76 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/transfer_word_list.h>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+void
+TransferWordList::copy(TransferWordList const &o)
+{
+  casefull_set = o.casefull_set;
+  caseless_set = o.caseless_set;
+}
+
+void
+TransferWordList::destroy()
+{
+}
+
+TransferWordList::TransferWordList()
+{
+}
+
+TransferWordList::~TransferWordList()
+{
+  destroy();
+}
+
+TransferWordList::TransferWordList(TransferWordList const &o)
+{
+  copy(o);
+}
+
+TransferWordList &
+TransferWordList::operator =(TransferWordList const &o)
+{
+  if(this != &o)
+  {
+    destroy();
+    copy(o);
+  }
+  return *this;
+}
+
+bool
+TransferWordList::search(string const &cad, bool caseless)
+{
+  if(caseless)
+  {
+    return caseless_set.find(cad) != caseless_set.end();
+  }
+  else
+  {
+    return casefull_set.find(cad) != casefull_set.end();
+  }
+}
+
+void
+TransferWordList::addWord(string const &cad)
+{
+  casefull_set.insert(cad);
+  caseless_set.insert(cad);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word_list.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word_list.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transfer_word_list.h	(revision 70339)
@@ -0,0 +1,63 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TRANSFERWORDLIST_
+#define _TRANSFERWORDLIST_
+
+#include <cstring>
+#include <set>
+#include <string>
+#ifdef _MSC_VER
+#define strcasecmp _stricmp
+#endif
+
+using namespace std;
+
+struct ltstr
+{
+  bool operator()(string const &s1, string const &s2) const
+  {
+    return s1 < s2;
+  }
+};
+
+struct ltstri
+{
+  bool operator()(string const &s1, string const &s2) const
+  {
+    return strcasecmp(s1.c_str(), s2.c_str()) < 0;
+  }
+};
+
+class TransferWordList
+{
+private:
+  set<string, ltstr> casefull_set;
+  set<string, ltstri> caseless_set;
+
+  void copy(TransferWordList const &o);
+  void destroy();
+public:
+  TransferWordList();
+  ~TransferWordList();
+  TransferWordList(TransferWordList const &o);
+  TransferWordList & operator =(TransferWordList const &o);
+
+  bool search(string const &cad, bool caseless = false);
+  void addWord(string const &cad);
+};
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/ttag.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/ttag.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/ttag.h	(revision 70339)
@@ -0,0 +1,42 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _TTAG_
+#define _TTAG_
+
+#include <vector>
+
+using namespace std;
+
+typedef int TTag;
+
+struct TForbidRule
+{
+    TTag tagi;
+    TTag tagj;
+};
+
+class TEnforceAfterRule
+{
+public:
+    TTag tagi;
+    vector<TTag> tagsj;
+};
+
+
+
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/utf_converter.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/utf_converter.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/utf_converter.cc	(revision 70339)
@@ -0,0 +1,613 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#include <apertium/utf_converter.h>
+#include <iostream>
+#include <cstdlib>
+#include <apertium/string_utils.h>
+
+using namespace Apertium;
+
+#define UNI_REPLACEMENT_CHAR (UTF32)0x0000FFFD
+#define UNI_MAX_BMP (UTF32)0x0000FFFF
+#define UNI_MAX_UTF16 (UTF32)0x0010FFFF
+#define UNI_MAX_UTF32 (UTF32)0x7FFFFFFF
+#define UNI_MAX_LEGAL_UTF32 (UTF32)0x0010FFFF
+#define UNI_SUR_HIGH_START  (UTF32)0xD800
+#define UNI_SUR_HIGH_END    (UTF32)0xDBFF
+#define UNI_SUR_LOW_START   (UTF32)0xDC00
+#define UNI_SUR_LOW_END     (UTF32)0xDFFF
+
+using namespace std;
+
+namespace UtfConverter
+{
+
+  typedef unsigned int	 UTF32;	/* at least 32 bits */
+  typedef unsigned short UTF16;	/* at least 16 bits */
+  typedef unsigned char	 UTF8;	/* typically 8 bits */
+
+  /* Some fundamental constants */
+
+  typedef enum {
+    conversionOK, 	/* conversion successful */
+    sourceExhausted,	/* partial character in source, but hit end */
+    targetExhausted,	/* insuff. room in target for conversion */
+    sourceIllegal	/* source sequence is illegal/malformed */
+  } ConversionResult;
+
+  typedef enum {
+    strictConversion = 0,
+    lenientConversion
+  } ConversionFlags;
+
+  static const int halfShift  = 10; /* used for shifting by 10 bits */
+
+  static const UTF32 halfBase = 0x0010000UL;
+  static const UTF32 halfMask = 0x3FFUL;
+
+  
+  void conversionError()
+  {
+    wcerr << L"Error: conversion error" << endl;
+    exit(EXIT_FAILURE);
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  ConversionResult ConvertUTF32toUTF16 (
+					const UTF32** sourceStart, const UTF32* sourceEnd, 
+					UTF16** targetStart, UTF16* targetEnd, ConversionFlags flags) {
+    ConversionResult result = conversionOK;
+    const UTF32* source = *sourceStart;
+    UTF16* target = *targetStart;
+    while (source < sourceEnd) {
+      UTF32 ch;
+      if (target >= targetEnd) {
+	result = targetExhausted; break;
+      }
+      ch = *source++;
+      if (ch <= UNI_MAX_BMP) { /* Target is a character <= 0xFFFF */
+	/* UTF-16 surrogate values are illegal in UTF-32; 0xffff or 0xfffe are both reserved values */
+	if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_LOW_END) {
+	  if (flags == strictConversion) {
+	    --source; /* return to the illegal value itself */
+	    result = sourceIllegal;
+	    break;
+	  } else {
+	    *target++ = UNI_REPLACEMENT_CHAR;
+	  }
+	} else {
+	  *target++ = (UTF16)ch; /* normal case */
+	}
+      } else if (ch > UNI_MAX_LEGAL_UTF32) {
+	if (flags == strictConversion) {
+	  result = sourceIllegal;
+	} else {
+	  *target++ = UNI_REPLACEMENT_CHAR;
+	}
+      } else {
+	/* target is a character in range 0xFFFF - 0x10FFFF. */
+	if (target + 1 >= targetEnd) {
+	  --source; /* Back up source pointer! */
+	  result = targetExhausted; break;
+	}
+	ch -= halfBase;
+	*target++ = (UTF16)((ch >> halfShift) + UNI_SUR_HIGH_START);
+	*target++ = (UTF16)((ch & halfMask) + UNI_SUR_LOW_START);
+      }
+    }
+    *sourceStart = source;
+    *targetStart = target;
+    return result;
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  ConversionResult ConvertUTF16toUTF32 (
+					const UTF16** sourceStart, const UTF16* sourceEnd, 
+					UTF32** targetStart, UTF32* targetEnd, ConversionFlags flags) {
+    ConversionResult result = conversionOK;
+    const UTF16* source = *sourceStart;
+    UTF32* target = *targetStart;
+    UTF32 ch, ch2;
+    while (source < sourceEnd) {
+      const UTF16* oldSource = source; /*  In case we have to back up because of target overflow. */
+      ch = *source++;
+      /* If we have a surrogate pair, convert to UTF32 first. */
+      if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_HIGH_END) {
+	/* If the 16 bits following the high surrogate are in the source buffer... */
+	if (source < sourceEnd) {
+	  ch2 = *source;
+	  /* If it's a low surrogate, convert to UTF32. */
+	  if (ch2 >= UNI_SUR_LOW_START && ch2 <= UNI_SUR_LOW_END) {
+	    ch = ((ch - UNI_SUR_HIGH_START) << halfShift)
+	      + (ch2 - UNI_SUR_LOW_START) + halfBase;
+	    ++source;
+	  } else if (flags == strictConversion) { /* it's an unpaired high surrogate */
+	    --source; /* return to the illegal value itself */
+	    result = sourceIllegal;
+	    break;
+	  }
+	} else { /* We don't have the 16 bits following the high surrogate. */
+	  --source; /* return to the high surrogate */
+	  result = sourceExhausted;
+	  break;
+	}
+      } else if (flags == strictConversion) {
+	/* UTF-16 surrogate values are illegal in UTF-32 */
+	if (ch >= UNI_SUR_LOW_START && ch <= UNI_SUR_LOW_END) {
+	  --source; /* return to the illegal value itself */
+	  result = sourceIllegal;
+	  break;
+	}
+      }
+      if (target >= targetEnd) {
+	source = oldSource; /* Back up source pointer! */
+	result = targetExhausted; break;
+      }
+      *target++ = ch;
+    }
+    *sourceStart = source;
+    *targetStart = target;
+
+    return result;
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  /*
+   * Index into the table below with the first byte of a UTF-8 sequence to
+   * get the number of trailing bytes that are supposed to follow it.
+   * Note that *legal* UTF-8 values can't have 4 or 5-bytes. The table is
+   * left as-is for anyone who may want to do such conversion, which was
+   * allowed in earlier algorithms.
+   */
+  static const char trailingBytesForUTF8[256] = {
+    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+    0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+    1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
+    2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5
+  };
+
+  /*
+   * Magic values subtracted from a buffer value during UTF8 conversion.
+   * This table contains as many values as there might be trailing bytes
+   * in a UTF-8 sequence.
+   */
+  static const UTF32 offsetsFromUTF8[6] = { 0x00000000UL, 0x00003080UL, 0x000E2080UL, 
+					    0x03C82080UL, 0xFA082080UL, 0x82082080UL };
+
+  /*
+   * Once the bits are split out into bytes of UTF-8, this is a mask OR-ed
+   * into the first byte, depending on how many bytes follow.  There are
+   * as many entries in this table as there are UTF-8 sequence types.
+   * (I.e., one byte sequence, two byte... etc.). Remember that sequencs
+   * for *legal* UTF-8 will be 4 or fewer bytes total.
+   */
+  static const UTF8 firstByteMark[7] = { 0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC };
+
+  /* --------------------------------------------------------------------- */
+
+  /* The interface converts a whole buffer to avoid function-call overhead.
+   * Constants have been gathered. Loops & conditionals have been removed as
+   * much as possible for efficiency, in favor of drop-through switches.
+   * (See "Note A" at the bottom of the file for equivalent code.)
+   * If your compiler supports it, the "isLegalUTF8" call can be turned
+   * into an inline function.
+   */
+
+  /* --------------------------------------------------------------------- */
+
+  ConversionResult ConvertUTF16toUTF8 (
+				       const UTF16** sourceStart, const UTF16* sourceEnd, 
+				       UTF8** targetStart, UTF8* targetEnd, ConversionFlags flags) {
+    ConversionResult result = conversionOK;
+    const UTF16* source = *sourceStart;
+    UTF8* target = *targetStart;
+    while (source < sourceEnd) {
+      UTF32 ch;
+      unsigned short bytesToWrite = 0;
+      const UTF32 byteMask = 0xBF;
+      const UTF32 byteMark = 0x80; 
+      const UTF16* oldSource = source; /* In case we have to back up because of target overflow. */
+      ch = *source++;
+      /* If we have a surrogate pair, convert to UTF32 first. */
+      if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_HIGH_END) {
+	/* If the 16 bits following the high surrogate are in the source buffer... */
+	if (source < sourceEnd) {
+	  UTF32 ch2 = *source;
+	  /* If it's a low surrogate, convert to UTF32. */
+	  if (ch2 >= UNI_SUR_LOW_START && ch2 <= UNI_SUR_LOW_END) {
+	    ch = ((ch - UNI_SUR_HIGH_START) << halfShift)
+	      + (ch2 - UNI_SUR_LOW_START) + halfBase;
+	    ++source;
+	  } else if (flags == strictConversion) { /* it's an unpaired high surrogate */
+	    --source; /* return to the illegal value itself */
+	    result = sourceIllegal;
+	    break;
+	  }
+	} else { /* We don't have the 16 bits following the high surrogate. */
+	  --source; /* return to the high surrogate */
+	  result = sourceExhausted;
+	  break;
+	}
+      } else if (flags == strictConversion) {
+	/* UTF-16 surrogate values are illegal in UTF-32 */
+	if (ch >= UNI_SUR_LOW_START && ch <= UNI_SUR_LOW_END) {
+	  --source; /* return to the illegal value itself */
+	  result = sourceIllegal;
+	  break;
+	}
+      }
+      /* Figure out how many bytes the result will require */
+      if (ch < (UTF32)0x80) {	     bytesToWrite = 1;
+      } else if (ch < (UTF32)0x800) {     bytesToWrite = 2;
+      } else if (ch < (UTF32)0x10000) {   bytesToWrite = 3;
+      } else if (ch < (UTF32)0x110000) {  bytesToWrite = 4;
+      } else {			    bytesToWrite = 3;
+      ch = UNI_REPLACEMENT_CHAR;
+      }
+
+      target += bytesToWrite;
+      if (target > targetEnd) {
+	source = oldSource; /* Back up source pointer! */
+	target -= bytesToWrite; result = targetExhausted; break;
+      }
+      switch (bytesToWrite) { /* note: everything falls through. */
+      case 4: *--target = (UTF8)((ch | byteMark) & byteMask); ch >>= 6;
+      case 3: *--target = (UTF8)((ch | byteMark) & byteMask); ch >>= 6;
+      case 2: *--target = (UTF8)((ch | byteMark) & byteMask); ch >>= 6;
+      case 1: *--target =  (UTF8)(ch | firstByteMark[bytesToWrite]);
+      }
+      target += bytesToWrite;
+    }
+    *sourceStart = source;
+    *targetStart = target;
+    return result;
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  /*
+   * Utility routine to tell whether a sequence of bytes is legal UTF-8.
+   * This must be called with the length pre-determined by the first byte.
+   * If not calling this from ConvertUTF8to*, then the length can be set by:
+   *  length = trailingBytesForUTF8[*source]+1;
+   * and the sequence is illegal right away if there aren't that many bytes
+   * available.
+   * If presented with a length > 4, this returns false.  The Unicode
+   * definition of UTF-8 goes up to 4-byte sequences.
+   */
+
+  static bool isLegalUTF8(const UTF8 *source, int length) {
+    UTF8 a;
+    const UTF8 *srcptr = source+length;
+    switch (length) {
+    default: return false;
+      /* Everything else falls through when "true"... */
+    case 4: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return false;
+    case 3: if ((a = (*--srcptr)) < 0x80 || a > 0xBF) return false;
+    case 2: if ((a = (*--srcptr)) > 0xBF) return false;
+
+      switch (*source) {
+	/* no fall-through in this inner switch */
+      case 0xE0: if (a < 0xA0) return false; break;
+      case 0xED: if (a > 0x9F) return false; break;
+      case 0xF0: if (a < 0x90) return false; break;
+      case 0xF4: if (a > 0x8F) return false; break;
+      default:   if (a < 0x80) return false;
+      }
+
+    case 1: if (*source >= 0x80 && *source < 0xC2) return false;
+    }
+    if (*source > 0xF4) return false;
+    return true;
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  /*
+   * Exported function to return whether a UTF-8 sequence is legal or not.
+   * This is not used here; it's just exported.
+   */
+  bool isLegalUTF8Sequence(const UTF8 *source, const UTF8 *sourceEnd) {
+    int length = trailingBytesForUTF8[*source]+1;
+    if (source+length > sourceEnd) {
+      return false;
+    }
+    return isLegalUTF8(source, length);
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  ConversionResult ConvertUTF8toUTF16 (
+				       const UTF8** sourceStart, const UTF8* sourceEnd, 
+				       UTF16** targetStart, UTF16* targetEnd, ConversionFlags flags) {
+    ConversionResult result = conversionOK;
+    const UTF8* source = *sourceStart;
+    UTF16* target = *targetStart;
+    while (source < sourceEnd) {
+      UTF32 ch = 0;
+      unsigned short extraBytesToRead = trailingBytesForUTF8[*source];
+      if (source + extraBytesToRead >= sourceEnd) {
+	result = sourceExhausted; break;
+      }
+      /* Do this check whether lenient or strict */
+      if (! isLegalUTF8(source, extraBytesToRead+1)) {
+	result = sourceIllegal;
+	break;
+      }
+      /*
+       * The cases all fall through. See "Note A" below.
+       */
+      switch (extraBytesToRead) {
+      case 5: ch += *source++; ch <<= 6; /* remember, illegal UTF-8 */
+      case 4: ch += *source++; ch <<= 6; /* remember, illegal UTF-8 */
+      case 3: ch += *source++; ch <<= 6;
+      case 2: ch += *source++; ch <<= 6;
+      case 1: ch += *source++; ch <<= 6;
+      case 0: ch += *source++;
+      }
+      ch -= offsetsFromUTF8[extraBytesToRead];
+
+      if (target >= targetEnd) {
+	source -= (extraBytesToRead+1); /* Back up source pointer! */
+	result = targetExhausted; break;
+      }
+      if (ch <= UNI_MAX_BMP) { /* Target is a character <= 0xFFFF */
+	/* UTF-16 surrogate values are illegal in UTF-32 */
+	if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_LOW_END) {
+	  if (flags == strictConversion) {
+	    source -= (extraBytesToRead+1); /* return to the illegal value itself */
+	    result = sourceIllegal;
+	    break;
+	  } else {
+	    *target++ = UNI_REPLACEMENT_CHAR;
+	  }
+	} else {
+	  *target++ = (UTF16)ch; /* normal case */
+	}
+      } else if (ch > UNI_MAX_UTF16) {
+	if (flags == strictConversion) {
+	  result = sourceIllegal;
+	  source -= (extraBytesToRead+1); /* return to the start */
+	  break; /* Bail out; shouldn't continue */
+	} else {
+	  *target++ = UNI_REPLACEMENT_CHAR;
+	}
+      } else {
+	/* target is a character in range 0xFFFF - 0x10FFFF. */
+	if (target + 1 >= targetEnd) {
+	  source -= (extraBytesToRead+1); /* Back up source pointer! */
+	  result = targetExhausted; break;
+	}
+	ch -= halfBase;
+	*target++ = (UTF16)((ch >> halfShift) + UNI_SUR_HIGH_START);
+	*target++ = (UTF16)((ch & halfMask) + UNI_SUR_LOW_START);
+      }
+    }
+    *sourceStart = source;
+    *targetStart = target;
+    return result;
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  ConversionResult ConvertUTF32toUTF8 (
+				       const UTF32** sourceStart, const UTF32* sourceEnd, 
+				       UTF8** targetStart, UTF8* targetEnd, ConversionFlags flags) {
+    ConversionResult result = conversionOK;
+    const UTF32* source = *sourceStart;
+    UTF8* target = *targetStart;
+    while (source < sourceEnd) {
+      UTF32 ch;
+      unsigned short bytesToWrite = 0;
+      const UTF32 byteMask = 0xBF;
+      const UTF32 byteMark = 0x80; 
+      ch = *source++;
+      if (flags == strictConversion ) {
+	/* UTF-16 surrogate values are illegal in UTF-32 */
+	if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_LOW_END) {
+	  --source; /* return to the illegal value itself */
+	  result = sourceIllegal;
+	  break;
+	}
+      }
+      /*
+       * Figure out how many bytes the result will require. Turn any
+       * illegally large UTF32 things (> Plane 17) into replacement chars.
+       */
+      if (ch < (UTF32)0x80) {	     bytesToWrite = 1;
+      } else if (ch < (UTF32)0x800) {     bytesToWrite = 2;
+      } else if (ch < (UTF32)0x10000) {   bytesToWrite = 3;
+      } else if (ch <= UNI_MAX_LEGAL_UTF32) {  bytesToWrite = 4;
+      } else {			    bytesToWrite = 3;
+      ch = UNI_REPLACEMENT_CHAR;
+      result = sourceIllegal;
+      }
+	
+      target += bytesToWrite;
+      if (target > targetEnd) {
+	--source; /* Back up source pointer! */
+	target -= bytesToWrite; result = targetExhausted; break;
+      }
+      switch (bytesToWrite) { /* note: everything falls through. */
+      case 4: *--target = (UTF8)((ch | byteMark) & byteMask); ch >>= 6;
+      case 3: *--target = (UTF8)((ch | byteMark) & byteMask); ch >>= 6;
+      case 2: *--target = (UTF8)((ch | byteMark) & byteMask); ch >>= 6;
+      case 1: *--target = (UTF8) (ch | firstByteMark[bytesToWrite]);
+      }
+      target += bytesToWrite;
+    }
+    *sourceStart = source;
+    *targetStart = target;
+    return result;
+  }
+
+  /* --------------------------------------------------------------------- */
+
+  ConversionResult ConvertUTF8toUTF32 (
+				       const UTF8** sourceStart, const UTF8* sourceEnd, 
+				       UTF32** targetStart, UTF32* targetEnd, ConversionFlags flags) {
+    ConversionResult result = conversionOK;
+    const UTF8* source = *sourceStart;
+    UTF32* target = *targetStart;
+    while (source < sourceEnd) {
+      UTF32 ch = 0;
+      unsigned short extraBytesToRead = trailingBytesForUTF8[*source];
+      if (source + extraBytesToRead >= sourceEnd) {
+	result = sourceExhausted; break;
+      }
+      /* Do this check whether lenient or strict */
+      if (! isLegalUTF8(source, extraBytesToRead+1)) {
+	result = sourceIllegal;
+	break;
+      }
+      /*
+       * The cases all fall through. See "Note A" below.
+       */
+      switch (extraBytesToRead) {
+      case 5: ch += *source++; ch <<= 6;
+      case 4: ch += *source++; ch <<= 6;
+      case 3: ch += *source++; ch <<= 6;
+      case 2: ch += *source++; ch <<= 6;
+      case 1: ch += *source++; ch <<= 6;
+      case 0: ch += *source++;
+      }
+      ch -= offsetsFromUTF8[extraBytesToRead];
+
+      if (target >= targetEnd) {
+	source -= (extraBytesToRead+1); /* Back up the source pointer! */
+	result = targetExhausted; break;
+      }
+      if (ch <= UNI_MAX_LEGAL_UTF32) {
+	/*
+	 * UTF-16 surrogate values are illegal in UTF-32, and anything
+	 * over Plane 17 (> 0x10FFFF) is illegal.
+	 */
+	if (ch >= UNI_SUR_HIGH_START && ch <= UNI_SUR_LOW_END) {
+	  if (flags == strictConversion) {
+	    source -= (extraBytesToRead+1); /* return to the illegal value itself */
+	    result = sourceIllegal;
+	    break;
+	  } else {
+	    *target++ = UNI_REPLACEMENT_CHAR;
+	  }
+	} else {
+	  *target++ = ch;
+	}
+      } else { /* i.e., ch > UNI_MAX_LEGAL_UTF32 */
+	result = sourceIllegal;
+	*target++ = UNI_REPLACEMENT_CHAR;
+      }
+    }
+    *sourceStart = source;
+    *targetStart = target;
+    return result;
+  }
+
+  wstring fromUtf8(string const & utf8string)
+  {
+    size_t widesize = utf8string.length();
+    if (sizeof(wchar_t) == 2)
+      {
+	wstring resultstring;
+	resultstring.resize(widesize+1, L'\0');
+	const UTF8* sourcestart = reinterpret_cast<const UTF8*>(utf8string.c_str());
+	const UTF8* sourceend = sourcestart + widesize;
+	UTF16* targetstart = reinterpret_cast<UTF16*>(&resultstring[0]);
+	UTF16* targetend = targetstart + widesize;
+	ConversionResult res = ConvertUTF8toUTF16(&sourcestart, sourceend, &targetstart, targetend, strictConversion);
+	if (res != conversionOK)
+	  {
+	    conversionError();
+	  }
+	*targetstart = 0;
+	return resultstring.substr(0, wcslen(resultstring.c_str()));
+      }
+    else if (sizeof(wchar_t) == 4)
+      {
+	wstring resultstring;
+	resultstring.resize(widesize+1, L'\0');
+	const UTF8* sourcestart = reinterpret_cast<const UTF8*>(utf8string.c_str());
+	const UTF8* sourceend = sourcestart + widesize;
+	UTF32* targetstart = reinterpret_cast<UTF32*>(&resultstring[0]);
+	UTF32* targetend = targetstart + widesize;
+	ConversionResult res = ConvertUTF8toUTF32(&sourcestart, sourceend, &targetstart, targetend, strictConversion);
+	if (res != conversionOK)
+	  {
+	    conversionError();
+	  }
+	*targetstart = 0;
+	return resultstring.substr(0,wcslen(resultstring.c_str()));
+      }
+    else
+      {
+	conversionError();
+      }
+    return L"";
+  }
+
+  string toUtf8(wstring const &widestring)
+  {
+    size_t widesize = widestring.length();
+
+    if (sizeof(wchar_t) == 2)
+      {
+	size_t utf8size = 3 * widesize + 1;
+	string resultstring;
+	resultstring.resize(utf8size, '\0');
+	const UTF16* sourcestart = reinterpret_cast<const UTF16*>(widestring.c_str());
+	const UTF16* sourceend = sourcestart + widesize;
+	UTF8* targetstart = reinterpret_cast<UTF8*>(&resultstring[0]);
+	UTF8* targetend = targetstart + utf8size;
+	ConversionResult res = ConvertUTF16toUTF8(&sourcestart, sourceend, &targetstart, targetend, strictConversion);
+	if (res != conversionOK)
+	  {
+	    conversionError();
+	  }
+	*targetstart = 0;
+	return resultstring.substr(0, strlen(resultstring.c_str()));
+      }
+    else if (sizeof(wchar_t) == 4)
+      {
+	size_t utf8size = 4 * widesize + 1;
+	string resultstring;
+	resultstring.resize(utf8size, '\0');
+	const UTF32* sourcestart = reinterpret_cast<const UTF32*>(widestring.c_str());
+	const UTF32* sourceend = reinterpret_cast<const UTF32*>(widestring.c_str() + widesize);
+	UTF8* targetstart = reinterpret_cast<UTF8*>(&resultstring[0]);
+	UTF8* targetend = targetstart + utf8size;
+	ConversionResult res = ConvertUTF32toUTF8(&sourcestart, sourceend, &targetstart, targetend, strictConversion);
+	if (res != conversionOK)
+	  {
+	    conversionError();
+	  }
+	*targetstart = 0;
+	return resultstring.substr(0, strlen(resultstring.c_str()));
+      }
+    else
+      {
+	conversionError();
+      }
+    return "";
+  }
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/utf_converter.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/utf_converter.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/utf_converter.h	(revision 70339)
@@ -0,0 +1,30 @@
+/*
+ * Copyright (C) 2005 Universitat d'Alacant / Universidad de Alicante
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License as
+ * published by the Free Software Foundation; either version 2 of the
+ * License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, see <http://www.gnu.org/licenses/>.
+ */
+#ifndef _UTFCONVERTER_
+#define _UTFCONVERTER_
+
+#include <string>
+
+using namespace std;
+
+namespace UtfConverter
+{
+    wstring fromUtf8(string const &utf8string);
+    string toUtf8(wstring const &widestring);
+}
+
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-unformat.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-unformat.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-unformat.1	(revision 70339)
@@ -0,0 +1,45 @@
+.TH apertium 1 2006-03-08 "" ""
+.SH NAME
+apertium-unformat \- This application is part of (
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.sf.net\fR.
+.SH SYNOPSIS
+.B apertium-unformat
+[\-f format] [infile [outfile]]
+.SH DESCRIPTION
+.BR apertium 
+is the application that extract unformatted text from documents.
+.RE
+.SH OPTIONS
+.PP
+.B -f format
+Specifies the format of the input and output files which can have
+these values:
+.RS
+\(bu \fItxt\fR \fB(default value)\fR Input and output files are in
+text format.
+.PP
+\(bu \fIhtml\fR Input and output files are in "html" format. This
+"html" is the one acceptd by the vast majority of web browsers.
+.PP
+\(bu \fIrtf\fR Input and output files are in "rtf" format. The
+accepted "rtf" is the one generated by \fBMicrosoft WordPad (C)\fR and
+\fBMicrosoft Office (C)\fR up to and including \fBOffice-97\fR.
+.RE
+.PP
+.B infile
+Input file (stdin by default).
+.PP
+.B outfile
+Output file (stdout by default).
+.PP
+.SH SEE ALSO
+.I apertium\fR(1),
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deshtml.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deshtml.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deshtml.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-deshtml 1 2006-03-21 "" ""
+.SH NAME
+apertium-deshtml \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-deshtml
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-deshtml 
+is an HTML format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an HTML document and produces output suitable for
+processing with lt-proc. HTML tags and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "<b>gener</b>" | apertium-deshtml | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deslatex.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deslatex.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deslatex.1	(revision 70339)
@@ -0,0 +1,50 @@
+.TH apertium-deslatex 1 2012-02-29 "" ""
+.SH NAME
+apertium-deslatex \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-deslatex
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-deslatex
+This filter preprocess apertium-prelatex output to a deformatted 'XMLish'
+LaTeX custom format. The output suitable for
+processing with lt-proc. Format information (newlines, tabs, etc.) is enclosed in brackets so that lt-proc treats it as whitespace between words.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "<textit/><CONTENTS>gener</CONTENTS>" | apertium-deslatex | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-prelatex\fR(1),
+.I apertium-postlatex\fR(1),
+.I apertium-relatex\fR(1),
+.I apertium-postlatex-raw\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated constructions in LaTeX (i.e. custom defined tags) are not (yet)
+supported.
+.PP
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desodt.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desodt.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desodt.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-desodt 1 2006-03-21 "" ""
+.SH NAME
+apertium-desodt \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-desodt
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-desodt 
+is an ODT format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an ODT document and produces output suitable for
+processing with lt-proc. ODT tags and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "<b>gener</b>" | apertium-desodt | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-despptx.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-despptx.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-despptx.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-despptx 1 2006-03-21 "" ""
+.SH NAME
+apertium-despptx \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-despptx
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-despptx 
+is an PPTX format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an PPTX document and produces output suitable for
+processing with lt-proc. PPTX tags and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "<b>gener</b>" | apertium-despptx | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf.1	(revision 70339)
@@ -0,0 +1,47 @@
+.TH apertium-desrtf 1 2006-03-21 "" ""
+.SH NAME
+apertium-desrtf \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-desrtf
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-desrtf 
+is an RTF format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an RTF document and produces output suitable for 
+processing with lt-proc. RTF commands  and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the input document  is analysed: 
+.TP
+cat <input.rtf> | apertium-desrtf | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-deshtml\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-destxt.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-destxt.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-destxt.1	(revision 70339)
@@ -0,0 +1,46 @@
+.TH apertium-destxt 1 2006-03-21 "" ""
+.SH NAME
+apertium-destxt \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-destxt
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-destxt 
+is an text format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of a text file and produces output suitable for
+processing with lt-proc. Format information (newlines, tabs, etc.) is enclosed in brackets so that lt-proc treats it as whitespace between words.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "gener" | apertium-destxt | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-deshtml\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deswxml.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deswxml.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-deswxml.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-deswxml 1 2006-03-21 "" ""
+.SH NAME
+apertium-deswxml \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-deswxml
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-deswxml 
+is an WXML format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an WXML document and produces output suitable for
+processing with lt-proc. WXML tags and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "<b>gener</b>" | apertium-deswxml | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desxlsx.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desxlsx.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desxlsx.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-desxlsx 1 2006-03-21 "" ""
+.SH NAME
+apertium-desxlsx \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-desxlsx
+[ \-h ] [ \-i ] [ \-n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-desxlsx 
+is an XLSX format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an XLSX document and produces output suitable for
+processing with lt-proc. XLSX tags and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the word "gener" is analysed: 
+.TP
+echo "<b>gener</b>" | apertium-desxlsx | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-desrtf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-pretransfer.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-pretransfer.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-pretransfer.1	(revision 70339)
@@ -0,0 +1,40 @@
+.TH apertium-pretransfer 1 2006-03-21 "" ""
+.SH NAME
+apertium-pretransfer \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-pretransfer
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-pretransfer 
+module applies some changes to multiwords (such as moving the lemma queue of 
+a multiword with inner inflection just after the lemma head). If 
+the input is not a multiword, it does not affect the output.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the expression "trobant-lo a faltar" is analysed: 
+.TP
+echo "trobant-lo a faltar" | apertium-destxt | lt-proc ca-es.automorf.bin |./ca-es.tagger \-\-tagger ca-es | apertium-pretransfer
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-transfer\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-tagger-apply-new-rules.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-tagger-apply-new-rules.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-tagger-apply-new-rules.1	(revision 70339)
@@ -0,0 +1,40 @@
+.TH apertium-tagger-apply-new-rules 1 2007-03-24 "" ""
+.SH NAME
+apertium-tagger-apply-new-rules \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-tagger-apply-new-rules 
+\-\-filein [ <input file> ] \-\-fileout [ <output file> ] \-\-tsxfile [ <rule file> ]
+
+.PP
+.SH DESCRIPTION
+.BR apertium-tagger-apply-new-rules
+is used to forbid and enforce rules which are applied to the given HMM parameters.
+
+Note that the TSX file provided with \-\-tsxfile *must* be equal, in terms of label definitions, to the one used when training the HMM parameters that are to be modified.
+
+.SH OPTIONS
+.TP
+.B \-i, \-\-filein
+Specify the file with the HMM parameter to process
+.TP
+.B \-o, \-\-fileout
+To specify the file to which the HMM will be written
+.TP
+.B \-x, \-\-tsxfile 
+File containing the rules to apply
+.PP
+.SH SEE ALSO
+.I apertium-tagger\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005 -- 2007, Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-tagger.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-tagger.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-tagger.1	(revision 70339)
@@ -0,0 +1,103 @@
+.TH apertium-tagger 1 2006-08-30 "" ""
+.SH NAME
+apertium-tagger \- This application is part of  (
+.B apertium
+)
+.PP
+This tool is part of the apertium open-source machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-tagger \-\-train|\-t 
+{n} DIC CRP TSX PROB [\-\-debug|\-d]\fR 
+.PP
+.B apertium-tagger \-\-supervised|\-s 
+{n} DIC CRP TSX PROB HTAG UNTAG [\-\-debug|\-d]\fR 
+.PP
+.B apertium-tagger \-\-retrain|\-r 
+{n} CRP PROB [\-\-debug|\-d] \fR
+.PP
+.B apertium-tagger \-\-tagger|\-g 
+[\-\-first|\-f] PROB [\-\-debug|\-d] [INPUT [OUTPUT]] \fR
+.PP
+.SH DESCRIPTION
+.BR apertium-tagger 
+is the application responsible for the apertium part-of-speech tagger
+training or tagging, depending on the calling options.  This command
+only reads from the standard input if the option \fB\-\-tagger\fR or
+\fB\-g\fR is used.
+.SH OPTIONS
+.TP
+.B \-t {n}, \-\-train {n}
+Initializes parameters through Kupiec's method (unsupervised),
+then performs \fBn\fR iterations of the Baum-Welch training algorithm
+(unsupervised).
+.TP
+.B \-s {n}, \-\-supervised {n}
+Initializes parameters against a hand-tagged text (supervised) through
+the maximum likelihood estimate method, then performs \fBn\fR
+iterations of the Baum-Welch training algorithm (unsupervised)
+.TP
+.B \-r {n}, \-\-retrain {n}
+Retrains the model with \fBn\fR additional Baum-Welch iterations
+(unsupervised).
+.TP
+.B \-g, \-\-tagger
+Tags input text by means of Viterbi algorithm.
+.TP
+.B \-p, \-\-show\-superficial
+Prints the superficial form of the word along side the lexical form
+in the output stream.
+.TP
+.B \-f, \-\-first
+Used in conjuntion with \-g (\-\-tagger) makes the tagger
+give all lexical forms of each word, with the chosen
+one in the first place (after the lemma)
+.TP
+.B \-d, \-\-debug
+Print error (if any) or debug messages while operating.
+.TP
+.B \-m, \-\-mark
+Mark disambiguated words.
+.TP
+.B \-h, \-\-help
+Display a help message.
+.SH FILES
+These are the kinds of files used with each option:
+.PP
+.B DIC
+Full expanded dictionary file
+.PP
+.B CRP
+Training text corpus file
+.PP
+.B TSX
+Tagger specification file, in XML format
+.PP
+.B PROB 
+Tagger data file, built in the training and used while tagging
+.PP
+.B  HTAG        
+Hand-tagged text corpus
+.PP
+.B UNTAG       
+Untagged text corpus, morphological analysis of HTAG corpus to use
+both jointly with \-s option
+.PP
+.B INPUT       
+Input file, stdin by default
+.PP
+.B OUTPUT      
+Output file, stdout by default
+.PP
+.SH SEE ALSO
+.I lt-proc\fR(1),
+.I lt-comp\fR(1),
+.I lt-expand\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf-cp1250.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf-cp1250.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf-cp1250.1	(revision 70339)
@@ -0,0 +1,47 @@
+.TH apertium-desrtf 1 2006-03-21 "" ""
+.SH NAME
+apertium-desrtf \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://apertium.sf.net\fR.
+.SH SYNOPSIS
+.B apertium-desrtf
+[ -h ] [ -i ] [ -n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-desrtf 
+is an RTF format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an RTF document and produces output suitable for 
+processing with lt-proc. RTF commands  and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the input document  is analysed: 
+.TP
+cat <input.rtf> | apertium-desrtf | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-deshtml\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf-cp1251.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf-cp1251.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-desrtf-cp1251.1	(revision 70339)
@@ -0,0 +1,47 @@
+.TH apertium-desrtf 1 2006-03-21 "" ""
+.SH NAME
+apertium-desrtf \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://apertium.sf.net\fR.
+.SH SYNOPSIS
+.B apertium-desrtf
+[ -h ] [ -i ] [ -n ]
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-desrtf 
+is an RTF format processor. Data should be passed through this 
+processor before being piped to lt-proc. The program takes input
+in the form of an RTF document and produces output suitable for 
+processing with lt-proc. RTF commands  and other format information are  enclosed in brackets so that lt-proc treats them as whitespace between words.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.B \-i
+Makes the addition of trailing sentence terminator (".") unconditional, often
+leading to duplicates.
+.B \-n
+Suppresses the addition of a trailing sentence terminator.
+.PP
+.SH EXAMPLE
+.TP
+You could write the following to show how the input document  is analysed: 
+.TP
+cat <input.rtf> | apertium-desrtf | lt-proc ca-es.automorf.bin
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-deshtml\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex-raw.l
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex-raw.l	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex-raw.l	(revision 70339)
@@ -0,0 +1,306 @@
+
+
+%{
+
+
+
+#include <cstdlib>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+#include <apertium/latex_accentsmap.h>
+
+extern "C" {
+#if !defined(__STDC__)
+# define __STDC__ 1
+#endif
+#include <regex.h>
+}
+
+#include <string>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/ltstr.h>
+#ifndef GENFORMAT
+#include "apertium_config.h"
+#endif
+#include <apertium/unlocked_cstdio.h>
+#ifdef _WIN32
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace std;
+
+AccentsMap accentsMap(true);
+wstring closesym = L"";
+string memconv = "";
+
+wstring convertir(string const &multibyte, int const length)
+{
+  memconv.append(multibyte.c_str(), length);
+  int tam = memconv.size();
+  wchar_t *retval = new wchar_t[tam+1];
+  size_t l = mbstowcs(retval, memconv.c_str(), tam);
+
+  if(l == ((size_t) -1))
+  {
+    delete[] retval;
+    if(memconv.size() >= 4)
+    {
+      wcerr << L"Warning: wrong encoding" << endl;
+    }
+    return L"";
+  }
+  else
+  {
+    memconv = "";
+    retval[l] = 0;
+    wstring ret = retval;
+    delete[] retval;
+    return ret;
+  }
+}
+
+
+
+
+%}
+
+
+%option nounput
+%option noyywrap
+%option stack
+
+%x mathenv
+%x readbrackets
+
+%%
+
+
+
+&quot;	{
+	fputws(L"\"",yyout);
+}
+&apos;	{
+	fputws(L"\'",yyout);
+}
+&lt;	{
+	fputws(L"<",yyout);
+}
+&gt;	{
+	fputws(L">",yyout);
+}
+&amp;	{
+	fputws(L"\\&",yyout);
+}
+\<AMP\/\>	{
+	fputws(L"&",yyout);
+}
+
+\<LEFTESCAPEDBRACE\/\>	{
+        fputws(L"\\{", yyout);
+}
+
+\<RIGHTESCAPEDBRACE\/\>	{
+        fputws(L"\\}", yyout);
+}
+
+\<ESCAPEDPERCENT\/\>	{
+        fputws(L"\\%", yyout);
+}
+
+
+
+¿	{
+	fputws(L"?`",yyout);
+}
+
+¡	{
+	fputws(L"!`",yyout);
+}
+
+
+
+\<MATH_DOLLARS\>	{
+	BEGIN(mathenv);
+	fputws(L"$$",yyout);
+}
+
+<mathenv>\<\/MATH_DOLLARS\>	{
+	fputws(L"$$",yyout);
+	BEGIN(0);
+}
+
+
+\<MATH_DOLLAR\>	{
+	BEGIN(mathenv);
+	fputws(L"$",yyout);
+}
+
+<mathenv>\<\/MATH_DOLLAR\>	{
+	fputws(L"$",yyout);
+	BEGIN(0);
+}
+
+\<MATH_PAR\>	{
+	fputws(L"\\(",yyout);
+}
+
+\<\/MATH_PAR\>	{
+	fputws(L"\\)",yyout);
+}
+
+\<MATH_BRA\>	{
+	fputws(L"\\[",yyout);
+}
+
+\<\/MATH_BRA\>	{
+	fputws(L"\\]",yyout);
+}
+
+
+\<CONTENTS\>	{
+	fputws(L"{",yyout);
+}
+
+\<\/CONTENTS\>	{
+	fputws(L"}",yyout);
+}
+
+&NBSP;	{
+	fputws(L"~",yyout);
+}
+
+
+
+\<BR\/\>	{
+	fputws(L"\\\\",yyout);
+}
+
+\<COMMENT\>[^\<]*	{
+	fputws((wstring(L"\%")+convertir(yytext+9,yyleng-9)).c_str(),yyout);
+}
+
+\<\/COMMENT\>	{
+}
+
+
+\<PARAM\>[^\<]*	{
+	fputws((wstring(L"[")+convertir(yytext+7,yyleng-7)).c_str(),yyout);
+}
+\<\/PARAM\>	{
+	fputws(L"]", yyout);
+}
+
+\<VERB\>	{
+        fputws(L"\\verb", yyout);
+}
+
+\<\/VERB\>	{
+        ;
+}
+
+
+\<[a-zA-Z0-9]+\>	{
+	fputws((wstring(L"\\begin{")+convertir(yytext+1,yyleng-2)+wstring(L"}")).c_str(),yyout);
+}
+
+\<[a-zA-Z0-9]+_STAR\>	{
+	fputws((wstring(L"\\begin{")+convertir(yytext+1,yyleng-7)+wstring(L"*}")).c_str(),yyout);
+}
+
+\<\/[a-zA-Z0-9]+\>	{
+	fputws((wstring(L"\\end{")+convertir(yytext+2,yyleng-3)+wstring(L"}")).c_str(),yyout);
+}
+
+\<\/[a-zA-Z0-9]+_STAR\>	{
+	fputws((wstring(L"\\end{")+convertir(yytext+2,yyleng-8)+wstring(L"*}")).c_str(),yyout);
+}
+
+\<[a-zA-Z0-9]+\/\>	{
+	fputws((wstring(L"\\")+convertir(yytext+1,yyleng-3)).c_str(),yyout);
+}
+
+\<[a-zA-Z0-9]+_STAR\/\>	{
+	fputws((wstring(L"\\")+convertir(yytext+1,yyleng-8)+wstring(L"*")).c_str(),yyout);
+}
+
+\#	{
+        fputws(L"\\#", yyout);
+}
+
+
+(.|\n)	{
+	fputws(convertir(yytext,yyleng).c_str(),yyout);
+}
+
+<mathenv>(.|\n)	{
+	fputws(convertir(yytext,yyleng).c_str(),yyout);
+}
+
+
+<<EOF>>	{
+	return 0;
+}
+%%
+
+
+
+void usage(string const &progname)
+{
+
+  cerr << "USAGE: " << progname << " [input_file [output_file]" << ']' << endl;
+
+  cerr << "LaTeX format postprocessor " << endl;
+  exit(EXIT_SUCCESS);
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  size_t base = 0;
+
+  if(argc >= 2 && !strcmp(argv[1],"-i"))
+  {
+    base++;
+  }
+
+ if((argc-base) > 4)
+  {
+    usage(argv[0]);
+  }
+
+  switch(argc-base)
+  {
+    case 3:
+      yyout = fopen(argv[2+base], "w");
+      if(!yyout)
+      {
+        usage(argv[0]);
+      }
+    case 2:
+      yyin = fopen(argv[1+base], "r");
+      if(!yyin)
+      {
+        usage(argv[0]);
+      }
+      break;
+    default:
+      break;
+  }
+
+#ifdef _WIN32
+  _setmode(_fileno(yyin), _O_U8TEXT);
+  _setmode(_fileno(yyout), _O_U8TEXT);
+#endif
+  // prevent warning message
+  yy_push_state(1);
+  yy_top_state();
+  yy_pop_state();
+
+  yylex();
+
+  fclose(yyin);
+  fclose(yyout);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex.l
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex.l	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex.l	(revision 70339)
@@ -0,0 +1,364 @@
+
+
+%{
+
+
+
+#include <cstdlib>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+#include <apertium/latex_accentsmap.h>
+
+extern "C" {
+#if !defined(__STDC__)
+# define __STDC__ 1
+#endif
+#include <regex.h>
+}
+
+#include <string>
+#include <lttoolbox/lt_locale.h>
+#include <lttoolbox/ltstr.h>
+#ifndef GENFORMAT
+#include "apertium_config.h"
+#endif
+#include <apertium/unlocked_cstdio.h>
+#ifdef _WIN32
+#include <io.h>
+#include <fcntl.h>
+#endif
+
+using namespace std;
+
+AccentsMap accentsMap(true);
+wstring closesym = L"";
+string memconv = "";
+
+wstring convertir(string const &multibyte, int const length)
+{
+  memconv.append(multibyte.c_str(), length);
+  int tam = memconv.size();
+  wchar_t *retval = new wchar_t[tam+1];
+  size_t l = mbstowcs(retval, memconv.c_str(), tam);
+
+  if(l == ((size_t) -1))
+  {
+    delete[] retval;
+    if(memconv.size() >= 4)
+    {
+      wcerr << L"Warning: wrong encoding" << endl;
+    }
+    return L"";
+  }
+  else
+  {
+    memconv = "";
+    retval[l] = 0;
+    wstring ret = retval;
+    delete[] retval;
+    return ret;
+  }
+}
+
+
+
+
+%}
+
+
+%option nounput
+%option noyywrap
+%option stack
+
+%x mathenv
+%x readbrackets
+
+%%
+
+
+
+&quot;	{
+	fputws(L"\"",yyout);
+}
+&apos;	{
+	fputws(L"\'",yyout);
+}
+&lt;	{
+	fputws(L"<",yyout);
+}
+&gt;	{
+	fputws(L">",yyout);
+}
+&amp;	{
+	fputws(L"\\&",yyout);
+}
+\<AMP\/\>	{
+	fputws(L"&",yyout);
+}
+
+\<LEFTESCAPEDBRACE\/\>	{
+        fputws(L"\\{", yyout);
+}
+
+\<RIGHTESCAPEDBRACE\/\>	{
+        fputws(L"\\}", yyout);
+}
+
+\<ESCAPEDPERCENT\/\>	{
+        fputws(L"\\%", yyout);
+}
+
+¿	{
+	fputws(L"?`",yyout);
+}
+
+¡	{
+	fputws(L"!`",yyout);
+}
+
+
+
+\<MATH_DOLLARS\>	{
+	BEGIN(mathenv);
+	fputws(L"$$",yyout);
+}
+
+<mathenv>\<\/MATH_DOLLARS\>	{
+	fputws(L"$$",yyout);
+	BEGIN(0);
+}
+
+
+\<MATH_DOLLAR\>	{
+	BEGIN(mathenv);
+	fputws(L"$",yyout);
+}
+
+<mathenv>\<\/MATH_DOLLAR\>	{
+	fputws(L"$",yyout);
+	BEGIN(0);
+}
+
+\<MATH_PAR\>	{
+	fputws(L"\\(",yyout);
+}
+
+\<\/MATH_PAR\>	{
+	fputws(L"\\)",yyout);
+}
+
+\<MATH_BRA\>	{
+	fputws(L"\\[",yyout);
+}
+
+\<\/MATH_BRA\>	{
+	fputws(L"\\]",yyout);
+}
+
+
+\<CONTENTS\>	{
+	fputws(L"{",yyout);
+}
+
+\<\/CONTENTS\>	{
+	fputws(L"}",yyout);
+}
+
+&NBSP;	{
+	fputws(L"~",yyout);
+}
+
+
+
+\<BR\/\>	{
+	fputws(L"\\\\",yyout);
+}
+
+\<COMMENT\>[^\<]*	{
+	fputws((wstring(L"\%")+convertir(yytext+9,yyleng-9)).c_str(),yyout);
+}
+
+\<\/COMMENT\>	{
+}
+
+
+\<PARAM\>[^\<]*	{
+	fputws((wstring(L"[")+convertir(yytext+7,yyleng-7)).c_str(),yyout);
+}
+\<\/PARAM\>	{
+	fputws(L"]", yyout);
+}
+
+\<VERB\>	{
+        fputws(L"\\verb", yyout);
+}
+
+\<\/VERB\>	{
+        ;
+}
+
+
+
+ł	{
+	fputws(L"\\l", yyout);
+}
+
+
+œ	{
+	fputws(L"{\\oe}",yyout);
+}
+
+Œ	{
+	fputws(L"{\\OE}",yyout);
+}
+
+æ	{
+	fputws(L"{\\ae}",yyout);
+}
+
+Æ	{
+	fputws(L"{\\AE}",yyout);
+}
+
+å	{
+	fputws(L"{\\aa}",yyout);
+}
+
+Å	{
+	fputws(L"{\\AA}",yyout);
+}
+
+ø	{
+	fputws(L"{\\o}",yyout);
+}
+
+Ø	{
+	fputws(L"{\\O}",yyout);
+}
+
+ß	{
+	fputws(L"{\\ss}",yyout);
+}
+
+\<[a-zA-Z0-9]+\>	{
+	fputws((wstring(L"\\begin{")+convertir(yytext+1,yyleng-2)+wstring(L"}")).c_str(),yyout);
+}
+
+\<HASH_[0-9]+\/\>	{
+	fputws((wstring(L"\\#")+convertir(yytext+6,yyleng-8)).c_str(),yyout);
+}
+
+\<HASH\/\>		{
+        fputws(L"\\#", yyout);
+}
+
+\<[a-zA-Z0-9]+_STAR\>	{
+	fputws((wstring(L"\\begin{")+convertir(yytext+1,yyleng-7)+wstring(L"*}")).c_str(),yyout);
+}
+
+\<\/[a-zA-Z0-9]+\>	{
+	fputws((wstring(L"\\end{")+convertir(yytext+2,yyleng-3)+wstring(L"}")).c_str(),yyout);
+}
+
+\<\/[a-zA-Z0-9]+_STAR\>	{
+	fputws((wstring(L"\\end{")+convertir(yytext+2,yyleng-8)+wstring(L"*}")).c_str(),yyout);
+}
+
+\<[a-zA-Z0-9]+\/\>	{
+	fputws((wstring(L"\\")+convertir(yytext+1,yyleng-3)).c_str(),yyout);
+}
+
+\<[a-zA-Z0-9]+_STAR\/\>	{
+	fputws((wstring(L"\\")+convertir(yytext+1,yyleng-8)+wstring(L"*")).c_str(),yyout);
+}
+ /*NO ENTIENDO ESTA REGLA
+ \#	{
+        fputws(L"\\#", yyout);
+ }*/
+
+
+[^A-Za-z\n]	{
+	wstring wt = convertir(yytext,yyleng);
+	wstring wa = accentsMap.get(wt);
+	if( wa == L"" )
+		fputws(wt.c_str(),yyout);
+ 	else
+		fputws(wstring(L"\\"+wa.substr(0,1)+L"{"+wa.substr(1)+L"}").c_str(),yyout);
+}
+
+
+(.|\n)	{
+	fputws(convertir(yytext,yyleng).c_str(),yyout);
+}
+
+<mathenv>(.|\n)	{
+	fputws(convertir(yytext,yyleng).c_str(),yyout);
+}
+
+
+<<EOF>>	{
+	return 0;
+}
+%%
+
+
+
+void usage(string const &progname)
+{
+
+  cerr << "USAGE: " << progname << " [input_file [output_file]" << ']' << endl;
+
+  cerr << "LaTeX format postprocessor " << endl;
+  exit(EXIT_SUCCESS);
+}
+
+int main(int argc, char *argv[])
+{
+  LtLocale::tryToSetLocale();
+  size_t base = 0;
+
+  if(argc >= 2 && !strcmp(argv[1],"-i"))
+  {
+    base++;
+  }
+
+ if((argc-base) > 4)
+  {
+    usage(argv[0]);
+  }
+
+  switch(argc-base)
+  {
+    case 3:
+      yyout = fopen(argv[2+base], "w");
+      if(!yyout)
+      {
+        usage(argv[0]);
+      }
+    case 2:
+      yyin = fopen(argv[1+base], "r");
+      if(!yyin)
+      {
+        usage(argv[0]);
+      }
+      break;
+    default:
+      break;
+  }
+
+#ifdef _WIN32
+  _setmode(_fileno(yyin), _O_U8TEXT);
+  _setmode(_fileno(yyout), _O_U8TEXT);
+#endif
+  // prevent warning message
+  yy_push_state(1);
+  yy_top_state();
+  yy_pop_state();
+
+  yylex();
+
+  fclose(yyin);
+  fclose(yyout);
+}
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/xsd/transfer.xsd
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/xsd/transfer.xsd	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/xsd/transfer.xsd	(revision 70339)
@@ -0,0 +1,1049 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<xs:schema xmlns:xs="http://www.w3.org/2001/XMLSchema">
+
+  <!-- Elements grouped by their "supertype" -->
+  <xs:group name="condition">
+    <xs:choice>
+      <xs:element ref="and"/>
+      <xs:element ref="or"/>
+      <xs:element ref="not"/>
+      <xs:element ref="equal"/>
+      <xs:element ref="begins-with"/>
+      <xs:element ref="begins-with-list"/>
+      <xs:element ref="ends-with"/>
+      <xs:element ref="ends-with-list"/>
+      <xs:element ref="contains-substring"/>
+      <xs:element ref="in"/>
+    </xs:choice>
+  </xs:group>
+  <xs:group name="container">
+    <xs:choice>
+      <xs:element ref="var"/>
+      <xs:element ref="clip"/>
+    </xs:choice>
+  </xs:group>
+  <xs:group name="sentence">
+    <xs:choice>
+      <xs:element ref="let"/>
+      <xs:element ref="out"/>
+      <xs:element ref="choose"/>
+      <xs:element ref="modify-case"/>
+      <xs:element ref="call-macro"/>
+      <xs:element ref="append"/>
+    </xs:choice>
+  </xs:group>
+  <xs:group name="value">
+    <xs:choice>
+      <xs:element ref="b"/>
+      <xs:element ref="clip"/>
+      <xs:element ref="lit"/>
+      <xs:element ref="lit-tag"/>
+      <xs:element ref="var"/>
+      <xs:element ref="get-case-from"/>
+      <xs:element ref="case-of"/>
+      <xs:element ref="concat"/>
+      <xs:element ref="lu"/>
+      <xs:element ref="mlu"/>
+      <xs:element ref="chunk"/>
+    </xs:choice>
+  </xs:group>
+  <xs:group name="stringvalue">
+    <xs:choice>
+      <xs:element ref="clip"/>
+      <xs:element ref="lit"/>
+      <xs:element ref="var"/>
+      <xs:element ref="get-case-from"/>
+      <xs:element ref="case-of"/>
+    </xs:choice>
+  </xs:group>
+  <xs:group name="outputable">
+    <xs:choice>
+      <xs:element ref="mlu"/>
+      <xs:element ref="lu"/>
+      <xs:element ref="b"/>
+      <xs:element ref="chunk"/>
+      <xs:element ref="var"/>
+    </xs:choice>
+  </xs:group>
+
+  <xs:element name="transfer" type="transfer_t"> <!-- the transfer_t is added for XSD code generation -->
+    <xs:keyref name="category_name_reference" refer="category_name">
+      <xs:selector xpath=".//pattern-item" />
+      <xs:field xpath="@n" />
+    </xs:keyref>
+    <xs:keyref name="list_name_reference" refer="list_name">
+      <xs:selector xpath=".//list" />
+      <xs:field xpath="@n" />
+    </xs:keyref>
+    <xs:keyref name="macro_name_reference" refer="macro_name">
+      <xs:selector xpath=".//call-macro" />
+      <xs:field xpath="@n" />
+    </xs:keyref>
+    <!--
+	TODO: So far cant' think of a way to express this constraint, since in
+	addition to a reference to an section-def-attrs/def-attr/@n the attribute can also be
+	"lemma","lemh","lemq","whole".
+    -->   
+    <!--xs:keyref name="attribute_name_reference" refer="attribute_name">
+      <xs:selector xpath=".//clip" />
+      <xs:field xpath="@part" />
+    </xs:keyref-->
+    <xs:keyref name="variable_name_reference" refer="variable_name">
+      <xs:selector xpath=".//var" />
+      <xs:field xpath="@n" />
+    </xs:keyref>
+  </xs:element>
+  <xs:annotation>
+    <xs:documentation>
+      'transfer' is the root element containing the whole structural
+      transfer rule file.  Attribute 'default' specifies if
+      unmatched words have to be written as lexical units ("lu", this is
+      the default value) or as chunks ("chunk").
+    </xs:documentation>
+  </xs:annotation>    
+  <xs:complexType name="transfer_t">
+    <xs:sequence>
+      <xs:element ref="section-def-cats"/>
+      <xs:element ref="section-def-attrs" minOccurs="0" />
+      <xs:element ref="section-def-vars" minOccurs="0" />
+      <xs:element ref="section-def-lists" minOccurs="0" />
+      <xs:element ref="section-def-macros" minOccurs="0" />
+      <xs:element ref="section-rules"/>
+    </xs:sequence>
+    <xs:attribute name="default" use="optional">
+      <xs:simpleType>
+        <xs:restriction base="xs:string">
+          <xs:enumeration value="lu"/>
+          <xs:enumeration value="chunk"/>
+        </xs:restriction>
+      </xs:simpleType>
+    </xs:attribute>
+  </xs:complexType>
+  
+
+  <xs:element name="section-def-cats">
+    <xs:annotation>
+      <xs:documentation>
+	The 'def-cats' section defines the categories used to build the
+	patterns used in rules
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="def-cat" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:unique name="category_name">
+      <xs:selector xpath="def-cat" />
+      <xs:field xpath="@n" />
+    </xs:unique>
+  </xs:element>
+
+  <xs:element name="def-cat">
+    <xs:annotation>
+      <xs:documentation>
+	Each 'def-cat' defines one category in terms of a list of
+	category items and has a unique name 'n', which is mandatory
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="cat-item" maxOccurs="unbounded"/>
+      </xs:sequence>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="cat-item">
+    <xs:annotation>
+      <xs:documentation>
+	Each 'cat-item' (category item) represents a set of lexical forms
+	and has a mandatory attribute 'tags' whose value is a sequence of
+	dot-separated tag names; this sequence is a subsequence of the
+	tag sequence defining each possible lexical form. For example,
+	tags="n.f" would match all lexical forms containing this tag
+	sequence, such as "^casa&lt;n&gt;&lt;f&gt;&lt;pl&gt;$".
+	
+	In addition, an optional attribute, "lemma", may be used to
+	define lexical forms having a particular substring in their lemma	
+      </xs:documentation>      
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="lemma" type="xs:string" use="optional"/>
+      <xs:attribute name="tags" type="xs:string" use="required"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="section-def-attrs">
+    <xs:annotation>
+      <xs:documentation>
+	The 'def-attrs' section defines the attributes that will be
+	identified in matched lexical forms 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="def-attr" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:unique name="attribute_name">
+      <xs:selector xpath="def-attr" />
+      <xs:field xpath="@n" />
+    </xs:unique>
+  </xs:element>
+  
+  <xs:element name="def-attr">
+    <xs:annotation>
+      <xs:documentation>
+	Each def-attr defines one attribute in terms of a list of
+	attribute items and has a mandatory unique name n 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="attr-item" maxOccurs="unbounded"/>
+      </xs:sequence>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="attr-item">
+    <xs:annotation>
+      <xs:documentation>
+	Each 'attr-item' specifies a subsequence of the tags in
+	that lexical form (attribute 'tags')
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="tags" type="xs:string" use="optional"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="section-def-vars">
+    <xs:annotation>
+      <xs:documentation>
+	The 'def-vars' section defines the global variables
+	that will be used to transfer information between rules
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="def-var" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:unique name="variable_name">
+      <xs:selector xpath="def-var" />
+      <xs:field xpath="@n" />    
+    </xs:unique>
+  </xs:element>
+
+  <xs:element name="def-var">
+    <xs:annotation>
+      <xs:documentation>
+	The definition of a global variable has a mandatory unique name 'n' that
+	will be used to refer to it. A value of initialization can also be specified
+	by means the 'v' attribute.  The default value of the initialization is the
+	empty string.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+      <xs:attribute name="v" type="xs:string" use="optional"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="section-def-lists">
+    <xs:annotation>
+      <xs:documentation>
+	Element 'section-def-lists' encloses a set of list definitions
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence maxOccurs="unbounded">
+        <xs:element ref="def-list"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:unique name="list_name">
+      <xs:selector xpath="def-list" />
+      <xs:field xpath="@n" />    
+    </xs:unique>
+  </xs:element>
+
+  <xs:element name="def-list">
+    <xs:annotation>
+      <xs:documentation>
+	The 'def-list' element defines a named list to search with the 'in' 
+	element.  Attribute 'n' sets the name of the list
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="list-item" maxOccurs="unbounded"/>
+      </xs:sequence>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="list-item">
+    <xs:annotation>
+      <xs:documentation>
+	Attribute 'v' of 'list-item' element contains the value to be added to 
+	the list being defined     
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="v" type="xs:string" use="required"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="section-def-macros">
+    <xs:annotation>
+      <xs:documentation>
+	The 'def-macros' section defines macros containing portions of
+	code frequently used in the action part of rules
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence maxOccurs="unbounded">
+        <xs:element ref="def-macro"/>
+      </xs:sequence>
+    </xs:complexType>
+    <xs:unique name="macro_name">
+      <xs:selector xpath="def-macro" />
+      <xs:field xpath="@n" />    
+    </xs:unique>
+  </xs:element>
+
+  <xs:element name="def-macro">
+    <xs:annotation>
+      <xs:documentation>
+	Macro definition:
+	
+	A macro has a mandatory name (the value of 'n'), a number of parameters
+	(the value of 'npar') and a body containing arguments and statements.  
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence minOccurs="1" maxOccurs="unbounded">
+        <xs:group ref="sentence"/>
+      </xs:sequence>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+      <xs:attribute name="npar" type="xs:string" use="required"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="section-rules">
+    <xs:annotation>
+      <xs:documentation>
+	The rules section contains a sequence of one or more rules
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="rule" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="rule">
+    <xs:annotation>
+      <xs:documentation>
+	Each rule has a pattern and an action 
+	* attribute 'comment' allows to put in comments about the purpose of
+        the rule being defined
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="pattern"/>
+        <xs:element ref="action"/>
+      </xs:sequence>
+      <xs:attribute name="comment" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="pattern">
+    <xs:annotation>
+      <xs:documentation>
+	The pattern is specified in terms of pattern items, each one
+	representing a lexical form in the matched pattern 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="pattern-item" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="pattern-item">
+    <xs:annotation>
+      <xs:documentation>
+	Each attribute to be activated is referred to by its name in the def-cats section 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="action">
+    <xs:annotation>
+      <xs:documentation>
+	Encloses the procedural part of a rule
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence minOccurs="0" maxOccurs="unbounded">
+        <xs:group ref="sentence"/>
+      </xs:sequence>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="choose">
+    <xs:annotation>
+      <xs:documentation>
+	The choose statement is a selection statement (similar to a case
+	statement) composed of one or more tested cases and an optional
+	otherwise 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="when" maxOccurs="unbounded"/>
+        <xs:element ref="otherwise" minOccurs="0" maxOccurs="1"/>
+      </xs:sequence>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="when">
+    <xs:annotation>
+      <xs:documentation>
+	Each tested case is a block of zero or more statements 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="test"/>
+        <xs:sequence minOccurs="0" maxOccurs="unbounded">
+          <xs:group ref="sentence"/>
+        </xs:sequence>
+      </xs:sequence>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="otherwise">
+    <xs:annotation>
+      <xs:documentation>
+	The otherwise case is also a block of one or more statements 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence minOccurs="1" maxOccurs="unbounded">
+        <xs:group ref="sentence"/>        
+      </xs:sequence>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="test">
+    <xs:annotation>
+      <xs:documentation>
+	The test in a tested case may be a conjunction, a disjunction, or
+	a negation of simpler tests, as well as a simple equality test
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:group ref="condition"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="and">
+    <xs:annotation>
+      <xs:documentation>
+	Each conjuntion test contains two or more simpler tests 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+	<xs:group ref="condition"/>
+	<xs:group ref="condition" minOccurs="1" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="or">
+    <xs:annotation>
+      <xs:documentation>
+	Each disjunction test contains two or more simpler tests 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+	<xs:group ref="condition"/>
+	<xs:group ref="condition" minOccurs="1" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="not">
+    <xs:annotation>
+      <xs:documentation>
+	The negation of a simpler test is a test itself 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:group ref="condition"/>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="equal">
+    <xs:annotation>
+      <xs:documentation>
+	The simplest test is an equality test. The right part and the
+	left part of the equality may both be a clip (see below), a
+	literal string ('lit'), a literal tag ('lit-tag') or the value of 
+	a variable ('var') defined in the def-vars section.  When the attribute
+	'caseless' is set to 'yes', the comparison is made without attending
+	to the case.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:group ref="value"/>
+      </xs:sequence>
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="begins-with">
+    <xs:annotation>
+      <xs:documentation>
+	Tests if the left part contains the right part at the beginning.
+	Both parts of the test may both be a clip (see below), a
+	literal string ('lit'), a literal tag ('lit-tag') or the value of 
+	a variable ('var') defined in the def-vars section.  When the attribute
+	'caseless' is set to 'yes', the comparison is made without attending
+	to the case.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:group ref="value"/>
+      </xs:sequence>
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="ends-with">
+    <xs:annotation>
+      <xs:documentation>
+	Tests if the left part contains the right part at the end.
+	Both parts of the test may both be a clip (see below), a
+	literal string ('lit'), a literal tag ('lit-tag') or the value of 
+	a variable ('var') defined in the def-vars section.  When the attribute
+	'caseless' is set to 'yes', the comparison is made without attending
+	to the case.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:group ref="value"/>
+      </xs:sequence>
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="begins-with-list">
+    <xs:annotation>
+      <xs:documentation>
+	Tests if the left part contains the right part at the beginning.
+	First parts of the test may be a clip (see below), a
+	literal string ('lit'), a literal tag ('lit-tag') or the value of 
+	a variable ('var') defined in the def-vars section. The second part
+	must be always a list.  When the attribute
+	'caseless' is set to 'yes', the comparison is made without attending
+	to the case.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:element ref="list"/>
+      </xs:sequence>
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="ends-with-list">
+    <xs:annotation>
+      <xs:documentation>
+	Tests if the left part contains the right part at the end.
+	First parts of the test may be a clip (see below), a
+	literal string ('lit'), a literal tag ('lit-tag') or the value of 
+	a variable ('var') defined in the def-vars section. The second part
+	must be always a list.  When the attribute
+	'caseless' is set to 'yes', the comparison is made without attending
+	to the case.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:element ref="list"/>
+      </xs:sequence>      
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="contains-substring">
+    <xs:annotation>
+      <xs:documentation>
+	Tests if the left part contains the right part.
+	Both parts of the test may both be a clip (see below), a
+	literal string ('lit'), a literal tag ('lit-tag') or the value of 
+	a variable ('var') defined in the def-vars section.  When the attribute
+	'caseless' is set to 'yes', the comparison is made without attending
+	to the case.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:group ref="value"/>
+      </xs:sequence>        
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="in">
+    <xs:annotation>
+      <xs:documentation>
+	'in' performs a search of a value in a list.  If 'caseless' is set to yes,
+	this search is performed without attending to the case
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>    
+      <xs:sequence>
+        <xs:group ref="value"/>
+        <xs:element ref="list"/>      
+      </xs:sequence>
+      <xs:attribute name="caseless" use="optional">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="no"/>
+            <xs:enumeration value="yes"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+    </xs:complexType>
+  </xs:element>
+
+  <xs:element name="list">
+    <xs:annotation>
+      <xs:documentation>
+	'list' refers, with the name in attribute 'n', a list defined before in
+	the 'section-def-list' section
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="let">
+    <xs:annotation>
+      <xs:documentation>
+	An assignment statement ('let') assigns the value of a clip (see
+	below), a literal string ('lit'), a literal tag('lit-tag') or the 
+	value of a global variable ('var') to either a global variable ('var') 
+	or a clip
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="container"/>
+        <xs:group ref="value"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="append">
+    <xs:annotation>
+      <xs:documentation>
+	This instruction appends the value of a clip (see
+	below), a literal string ('lit'), a literal tag('lit-tag') or the 
+	value of a global variable ('var') to either a global variable ('var') 
+	or a clip, identified by the "n" attribute
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="value" minOccurs="1" maxOccurs="unbounded"/>
+      </xs:sequence>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="out">
+    <xs:annotation>
+      <xs:documentation>
+	'out' is an output statement; it may output any sequence of
+	clips, literal strings, literal tags, variables, and whitespace items 
+	(see below) 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence minOccurs="1" maxOccurs="unbounded">
+	<xs:group ref="outputable"/>
+      </xs:sequence>
+      <xs:attribute name="c" type="xs:string" use="optional"/>      
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="modify-case">
+    <xs:annotation>
+      <xs:documentation>
+	The first argument of 'modify-case' copy the case of the second 
+	argument.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:group ref="container"/>
+        <xs:group ref="stringvalue"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="call-macro">
+    <xs:annotation>
+      <xs:documentation>
+	A macro may be called anywhere by name with one or more
+	arguments
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence minOccurs="0" maxOccurs="unbounded">
+        <xs:element ref="with-param"/>
+      </xs:sequence>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="with-param">
+    <xs:annotation>
+      <xs:documentation>
+	The attribute pos in each argument is used to refer to a lexical
+	form in the current rule. For example, if a 2-parameter macro
+	has been defined to perform noun-adjective agreement operations,
+	it may be used with arguments 1 and 2 in a noun-adjective rule,
+	with arguments 2, 3 and 1 in a determiner-noun-adjective rule, with
+	arguments 1 and 3 in a noun-adverb-adjective rule, and with
+	arguments 2 and 1 in an adjective-noun rule 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="pos" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="clip">
+    <xs:annotation>
+      <xs:documentation>
+	A 'clip' is a substring of a source-language or target-language
+	lexical form, extracted according to an attribute:
+	
+	* 'pos' is an index (1, 2, 3...) used to select a lexical form
+        inside the rule;
+	
+	* 'side' is used to select a source-language ('sl') or a
+        target-language ('tl') clip
+	
+	* the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+	
+	* the value of 'queue' may be 'no' or 'yes'.  'yes' is assumed  by 
+        default.
+	
+	* 'link-to' causes the other attributes to be ignored in clip evaluation
+        when using 'clip' as a right hand side element (as value), and 
+        returns its value.  When using as a left hand side (as reference), 
+        the value of the 'as' attribute is ignored.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="pos" type="xs:string" use="required"/>
+      <xs:attribute name="side" use="required">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="sl"/>
+            <xs:enumeration value="tl"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+      <xs:attribute name="part" type="xs:string" use="optional"/>
+      <xs:attribute name="queue" type="xs:string" use="optional"/>
+      <xs:attribute name="link-to" type="xs:string" use="optional"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="lit">
+    <xs:annotation>
+      <xs:documentation>
+	A literal string value: the value of the literal is the value of
+	the 'v' attribute
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="v" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="lit-tag">
+    <xs:annotation>
+      <xs:documentation>
+	A literal string value: the value of the literal is the value of
+	the 'v' attribute
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="v" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="var">
+    <xs:annotation>
+      <xs:documentation>
+	Each 'var' is a variable identifier: the attribute n is the name
+	of the variable. When it is in an 'out', a 'test', or the right
+	part of a 'let', it represents the value of the variable; when in
+	the left part of a 'let' it represents the reference of the
+	variable. 
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="n" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="get-case-from">
+    <xs:annotation>
+      <xs:documentation>
+	TODO:
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:choice>
+        <xs:element ref="clip"/>
+        <xs:element ref="lit"/>
+        <xs:element ref="var"/>
+      </xs:choice>
+      <xs:attribute name="pos" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="case-of">
+    <xs:annotation>
+      <xs:documentation>
+	A 'case-of' is a value representing the case of a "clip".  This value 
+	will be "aa" (all lowercase), "Aa" (first uppercase) and "AA",
+	(all uppercase).
+
+	* 'pos' is an index (1, 2, 3...) used to select a lexical form
+        inside the rule;
+	
+	* 'side' is used to select a source-language ('sl') or a
+        target-language ('tl') clip
+	
+	* the value of 'part' is the name of an attribute defined in
+        def-attrs, but may take also the values 'lem' (referring to
+        the lemma of the lexical form), 'lemh' (lemma head), 'lemq'
+        (lemma queue) and 'whole' (referring to the whole lexical form).
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="pos" type="xs:string" use="required"/>
+      <xs:attribute name="side" use="required">
+        <xs:simpleType>
+          <xs:restriction base="xs:string">
+            <xs:enumeration value="sl"/>
+            <xs:enumeration value="tl"/>
+          </xs:restriction>
+        </xs:simpleType>
+      </xs:attribute>
+      <xs:attribute name="part" type="xs:string" use="required"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="concat">
+    <xs:annotation>
+      <xs:documentation>
+	Concatenates a sequence of values.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+	<xs:group ref="value" minOccurs="1" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="mlu">
+    <xs:annotation>
+      <xs:documentation>
+	Encloses a multiword.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="lu" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="lu">
+    <xs:annotation>
+      <xs:documentation>
+	Encloses a word inside an 'out' element.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+	<xs:group ref="value" minOccurs="1" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="chunk">
+    <xs:annotation>
+      <xs:documentation>
+	Encloses a chunk inside an 'out' element.      
+	* 'name' the pseudolemma of the chunk.
+	* 'namefrom' get the name from a variable.
+	* 'case' the variable to get the uppercase/lowercase policy
+        to apply it to the chunk name
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="tags"/>
+        <xs:choice maxOccurs="unbounded">
+          <xs:element ref="mlu"/>
+          <xs:element ref="lu"/>
+          <xs:element ref="b"/>
+          <xs:element ref="var"/>
+        </xs:choice>
+      </xs:sequence>
+      <xs:attribute name="name" type="xs:string" use="optional"/>
+      <xs:attribute name="namefrom" type="xs:string" use="optional"/>
+      <xs:attribute name="case" type="xs:string" use="optional"/>
+      <xs:attribute name="c" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="tags">
+    <xs:annotation>
+      <xs:documentation>
+	A sequence of tags for a lexical unit.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+        <xs:element ref="tag" maxOccurs="unbounded"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="tag">
+    <xs:annotation>
+      <xs:documentation>
+	A lexical unit tag.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:sequence>
+	<xs:group ref="value"/>
+      </xs:sequence>
+    </xs:complexType>
+  </xs:element>
+  
+  <xs:element name="b">
+    <xs:annotation>
+      <xs:documentation>
+	'b' is a [super]blanks item, indexed by pos; for example, a 'b'
+	with pos="2" refers to the [super]blanks (including format data
+	encapsulated by the de-formatter) between lexical form 2 and
+	lexical form 3. Managing [super]blanks explicitly allows for the
+	correct placement of format when the result of structural
+	transfer has more or less lexical items than the original or has
+	been reordered in some way.  If attribute "pos" is not specified, then
+	a single blank (ASCII 32) is generated.
+      </xs:documentation>
+    </xs:annotation>
+    <xs:complexType>
+      <xs:attribute name="pos" type="xs:string" use="optional"/>
+    </xs:complexType>
+  </xs:element>
+  
+</xs:schema>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.h	(revision 70339)
@@ -0,0 +1,41 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef _ALIGNER_TOOL_H_
+#define _ALIGNER_TOOL_C_
+
+#include <apertium/tmx_alignment.h>
+
+#include <apertium/tmx_words.h>
+#include <apertium/tmx_book_to_matrix.h>
+#include <apertium/tmx_translate.h>
+#include <apertium/tmx_trail_postprocessors.h>
+
+#include <apertium/tmx_arguments_parser.h>
+#include <apertium/tmx_strings_and_streams.h>
+#include <apertium/tmx_serialize_impl.h>
+#include <apertium/tmx_align_parameters.h>
+
+
+#include <fstream>
+#include <iostream>
+
+#include <cmath>
+
+namespace TMXAligner{
+
+void alignerToolWithFilenames(const DictionaryItems& dictionary,
+			      const std::string& huFilename, 
+			      const std::string& enFilename,
+			      const AlignParameters& alignParameters,
+			      const std::string& outputFilename = "" );
+}
+#endif

Property changes on: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_aligner_tool.h
___________________________________________________________________
Added: svn:mergeinfo
## -0,0 +0,0 ##
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_alignment.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_alignment.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_alignment.h	(revision 70339)
@@ -0,0 +1,115 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_ALIGNMENT_H
+#define __TMXALIGNER_ALIGNMENT_ALIGNMENT_H
+
+#include <apertium/tmx_quasi_diagonal.h>
+
+#include <string>
+#include <set>
+
+namespace TMXAligner
+{
+
+// Simply double values for each sentence. Right now we store sentence lengths in them.
+typedef std::vector<double> SentenceValues;
+
+// See quasiDiagonal.h
+typedef QuasiDiagonal<double> AlignMatrix;
+
+// Contains directions, a bit like a force field.
+typedef QuasiDiagonal<unsigned char> TrelliMatrix;
+
+// A Rundle (x,y) cuts the bitext into two sub-bitexts:
+// [0,x)+[0,y) and [x,huSize)+[y,enSize).
+typedef std::pair<int,int> Rundle;
+
+// A Trail is a strictly ordered list of Rundles.
+// It cuts the bitext into small bitexts.
+// Such a small bitext is called a hole or segmentum.
+// A hole can contion zero Hungarian sentence,
+// it can contain zero English sentences, but not both.
+// A Trail is sometimes referred to as a Ladder.
+typedef std::vector<Rundle> Trail;
+
+// A BisentenceList is formally identical to a Trail, but semantically very different.
+// It represents an ordered list of bisentences.
+// There are some functions which utilize the formal identity,
+// manipulating both structures.
+typedef std::vector< std::pair<int,int> > BisentenceList;
+
+// OBSOLETE:
+// TrailValues gives scores to the Rundles of a Trail (of the same size).
+// Conceptually TrailValues should be attached to Trails.
+// A TrailValues structure always accompanies a Trails list,
+// but their consistency must be maintained by hand, pre-OO-style. (TODO)
+// typedef std::vector<double> TrailValues;
+
+// OBSOLETE:
+// Has the exactly same relation to BisentenceList as
+// a TrailValues has to a Trail. But note that these 
+// scores mark the confidence in a bisentence. This is
+// very different from the confidence in a rundle.
+// typedef std::vector<double> BisentenceValues;
+
+double closeness( double twoSentenceLength, double oneSentenceLength );
+
+const double skipScore = -0.3;
+
+
+// The main align function,
+// Gets a confidence value for every sentence-pair,
+// and sentence lengths for each sentence (for a a Gale-Church-like scoring).
+// Returns a trail with the best total score, and the computed dynMatrix matrix:
+// dynMatrix[huPos][enPos] gives the similarity of the [0,huPos) and [0,enPos) intervals.
+void align( const AlignMatrix& w, const SentenceValues& huLength, const SentenceValues& enLength,
+            Trail& bestTrail, AlignMatrix& dynMatrix );
+
+
+bool oneToOne( const Trail& bestTrail, int pos );
+
+// Collect bisentences.
+void trailToBisentenceList( const Trail& bestTrail,
+                            BisentenceList& bisentenceList );
+
+// Score precision-recall of a BisentenceList according to a hand-aligned bicorpus.
+// For best results, zero-to-many holes of the hand-alignment should be subdivided to zero-to-ones.
+// Builds the manual bisentencelist. The compared sets consist of Bisentences.
+double scoreBisentenceList( const BisentenceList& bisentenceList, const Trail& trailHand );
+
+// The same precision-recall calculation for Trails. The compared sets consist of Rundles.
+double scoreTrail         ( const Trail&          trailAuto,      const Trail& trailHand );
+
+
+const int outsideOfRadiusValue = -1000000;
+const int insideOfRadiusValue  = 0;
+
+// Fills the complement of the radius of the trail with minus infties.
+// The return value true means success. Failure means that during the fill,
+// we intersected the outside of the quasidiagonal area.
+// In this case, the operation is not finished.
+bool borderDetailedAlignMatrix( AlignMatrix& m, const Trail& trail, int radius );
+
+// What the name implies.
+void dumpAlignMatrix( const AlignMatrix& m, bool graphical );
+
+template <class T>
+void dumpAlignMatrix( const QuasiDiagonal<T>& alignMatrix );
+
+void dumpAlignMatrix( const QuasiDiagonal<int>& alignMatrix, bool graphical );
+
+void dumpTrelliMatrix( const TrelliMatrix& trellis );
+
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_ALIGNMENT_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_arguments_parser.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_arguments_parser.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_arguments_parser.h	(revision 70339)
@@ -0,0 +1,72 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __ARGUMENTSPARSER_H
+#define __ARGUMENTSPARSER_H
+
+#include <string>
+#include <map>
+#include <vector>
+
+// Current usage and limitations:
+// Every argument starts with a '-'.
+// It is a key/value pair. The delimiter
+// is either the first '=' (erased), or the
+// first nonalphabetic character (not erased).
+
+class AnyData
+{
+public:
+  enum Kind { Int, String, Float, Set };
+
+public:
+  AnyData() : kind(String), dInt(-1) {}
+  AnyData( const int& d ) : kind(Int), dInt(d) {}
+  AnyData( const std::string& d ) : kind(String), dInt(-1), dString(d) {}
+
+public:
+  Kind kind;
+  int dInt;
+  std::string dString;
+};
+
+typedef std::string ArgName;
+typedef std::map< ArgName, AnyData > ArgumentMap;
+
+class Arguments : public ArgumentMap
+{
+public:
+  // Very important note: When read finds a numeric/set argument,
+  // it sets anyData.kind to Int. But STILL, it fills anyData.dString,
+  // just in case. So if the ArgumentMap was built by Arguments::read,
+  // the dString fields are all filled.
+  bool read( int argc, char **argv );
+
+  // remains is filled with the arguments not starting with '-'.
+  bool read( int argc, char **argv, std::vector<const char*>& remains );
+
+  // const if fails, erases arg if succeeds.
+  bool getNumericParam( const ArgName& name, int& num );
+
+  // sw is true if the switch is present. The function
+  // returns false if the argument value is not empty.
+  bool getSwitch( const ArgName& name, bool& sw );
+
+  bool getSwitchConst( const ArgName& name, bool& sw ) const;
+
+  // Returns true if the switch is present. Throws an error message if
+  // if the argument value is not empty.
+  bool getSwitchCompact( const ArgName& name );
+
+  void checkEmptyArgs() const;
+};
+
+#endif // #define __ARGUMENTSPARSER_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_book_to_matrix.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_book_to_matrix.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_book_to_matrix.h	(revision 70339)
@@ -0,0 +1,64 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_BOOKTOMATRIX_H
+#define __TMXALIGNER_ALIGNMENT_BOOKTOMATRIX_H
+
+#include <apertium/tmx_words.h>
+#include <apertium/tmx_alignment.h>
+
+namespace TMXAligner
+{
+
+const double scoreOfParagraphMatch = 0.31;
+
+const double scoreOfParagraphMisMatch = -1.0;
+
+bool isParagraph( const Phrase& phrase );
+
+// (!!!) We assert that sx and sy are ordered sets of Word-s!
+int intersectionSize( const WordList& sx, const WordList& sy );
+
+void sentenceListsToAlignMatrixIdentity( const SentenceList& huSentenceList, const SentenceList& enSentenceList, AlignMatrix& alignMatrix );
+
+class TransLex;
+
+double scoreByIdentity( const Phrase& hu, const Phrase& en );
+
+double scoreByTranslation( const Phrase& hu, const Phrase& en, const TransLex& transLex );
+
+// This is much-much slower, but instead of identity, uses a many-to-many dictionary.
+// For performance reasons, by convention does not calculate the similarity if the 
+// alignMatrix element contains outsideOfRadiusValue, a big negative number.
+void sentenceListsToAlignMatrixTranslation(
+                                           const SentenceList& huSentenceListPretty, const SentenceList& enSentenceList,
+                                           const TransLex& transLex,
+                                           AlignMatrix& alignMatrixDetailed );
+
+class IBMModelOne;
+
+void sentenceListsToAlignMatrixIBMModelOne(
+                                           const SentenceList& huSentenceList, const SentenceList& enSentenceList,
+                                           const IBMModelOne& modelOne,
+                                           AlignMatrix& alignMatrix );
+
+int characterLength( const Word& words, bool utfCharCountingMode=false );
+
+double characterLength( const Phrase& words, bool utfCharCountingMode=false );
+
+
+double characterLength( int start, int end, const SentenceList& sentenceList, bool utfCharCountingMode=false );
+
+void setSentenceValues( const SentenceList& sentences, SentenceValues& lengths, bool utfCharCountingMode );
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_BOOKTOMATRIX_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dictionary.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dictionary.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_dictionary.h	(revision 70339)
@@ -0,0 +1,131 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_DICTIONARY_H
+#define __TMXALIGNER_ALIGNMENT_DICTIONARY_H
+
+#include <apertium/tmx_words.h>
+
+#include <string>
+#include <vector>
+#include <map>
+#include <iosfwd>
+
+
+namespace TMXAligner
+{
+
+typedef std::pair<Phrase,Phrase> DictionaryItem;
+
+class DictionaryItems : public std::vector<DictionaryItem>
+{
+public:
+  void read( std::istream& is );
+};
+
+class HalfDictionary : public std::vector<WordList>
+{
+public:
+  void read( std::istream& is );
+};
+
+
+// After reading, this dictionary cannot be altered.
+// Also, this is a strictly one-directional dictionary.
+// If the other direction is needed, reverse( const Dictionary& dic ) another dictionary.
+class Dictionary
+{
+public:
+  void read( const char* dictionaryFile );
+  void reverse( const Dictionary& dic );
+  void build( const DictionaryItems& dictionaryItems );
+
+  bool lookupWord( const Word& word, DictionaryItems& results ) const;
+  bool lookupWordSet( const WordList& words, DictionaryItems& results ) const;
+
+private:
+  void buildWordLookupTable();
+
+private:
+  DictionaryItems dictionaryItems;
+
+  typedef std::map<Word,int> wordLookupTable;
+};
+
+class FrequencyMap : public std::map<Word,int>
+{
+public:
+  void add( const Word& word );
+  void remove( const Word& word );
+  void build( const WordList& wordList );
+  void remove( const WordList& wordList );
+  void build( const SentenceList& sentenceList ); // Just for convenience.
+  int  total() const;
+  void dump( std::ostream& os, int itemNum ) const;
+  void lowPassFilter( WordList& allowedWords, double ratio ) const;
+  void highPassFilter( WordList& allowedWords, double ratio ) const;
+
+private:
+  typedef std::multimap<int,Word> ReFrequencyMap;
+  void reverseMap( ReFrequencyMap& reFrequencyMap ) const;
+};
+
+
+void filterSentences( SentenceList& sentenceList, const WordList& words );
+
+void removeHungarianStopwords( SentenceList& huSentenceList );
+void removeEnglishStopwords  ( SentenceList& enSentenceList );
+void removeStopwords  ( SentenceList& huSentenceList, SentenceList& enSentenceList );
+
+
+typedef std::pair<Word,Word> WordPair;
+
+class TransLex
+{
+public:
+
+  typedef std::multimap<Word,Word> WordMultimap;
+  typedef WordMultimap::const_iterator WordMultimapIt;
+  typedef std::pair<WordMultimapIt,WordMultimapIt> DictInterval;
+
+  void add( const Word& huWord, const Word& enWord );
+  void build( const DictionaryItems& dictionaryItems );
+
+  DictInterval lookupLeftWord ( const Word& huWord ) const;
+  DictInterval lookupRightWord( const Word& enWord ) const;
+  bool isPresent( const Word& huWord, const Word& enWord ) const;
+
+private:
+  WordMultimap forward;
+  WordMultimap backward;
+};
+
+class IBMModelOne
+{
+public:
+  double lookup( const Word& hu, const Word& en ) const;
+
+  double distance( const Phrase& hu, const Phrase& en ) const;
+
+  void build( const SentenceList& huSentenceList, const SentenceList& enSentenceList );
+
+  void reestimate( const SentenceList& huSentenceList, const SentenceList& enSentenceList );
+
+public:
+  typedef std::pair<Word,Word> WordPair;
+  typedef std::map<WordPair,double> TransProbs;
+
+  TransProbs transProbs;
+};
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_DICTIONARY_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_quasi_diagonal.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_quasi_diagonal.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_quasi_diagonal.h	(revision 70339)
@@ -0,0 +1,171 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_QUASIDIAGONAL_H
+#define __TMXALIGNER_ALIGNMENT_QUASIDIAGONAL_H
+
+#include <vector>
+
+namespace TMXAligner
+{
+
+template <class T>
+class QuasiDiagonal
+{
+public:
+
+  // Quite slow, because of the many bounds checks.
+  class QuasiDiagonalRow
+  {
+  public:
+
+    // QuasiDiagonalRow is similar to a vector of size size_. The difference is
+    // that only the [offset_,offset_+thickness) subinterval can be written.
+    // Reading from outside this interval yields the default T().
+    // Reading from outside the [0,size) interval yields a throw.
+    // It is NOT asserted that [offset_,offset_+thickness)
+    // should be a subset of [0,size).
+    //
+    QuasiDiagonalRow( int size_=0, int offset_=0, int thickness=0, T outsideDefault_=T() )
+      : offset(offset_), size(size_), data(thickness,T()), outsideDefault(outsideDefault_) {}
+
+    enum ZoneType
+    {
+      DiagZone    = 1,
+      MatrixZone  = 2,
+      OutsideZone = 3
+    };
+
+    ZoneType zone(int k) const
+    {
+      if ( ! ((k>=0) && (k<size)) )
+      {
+        return OutsideZone;
+      }
+      int d = k-offset;
+      if ( (d>=0) && (d<(int)data.size()) )
+      {
+        return DiagZone;
+      }
+      else
+      {
+        return MatrixZone;
+      }
+    }
+
+    const T& operator[](int k) const
+    {
+      if ( ! ((k>=0) && (k<size)) )
+      {
+        throw "out of matrix";
+      }
+      int d = k-offset;
+      if ( (d>=0) && (d<(int)data.size()) )
+      {
+        return data[k-offset];
+      }
+      else
+      {
+        return outsideDefault;
+      }
+    }
+
+    T& cell(int k)
+    {
+      if ( ! ((k>=0) && (k<size)) )
+      {
+        throw "out of matrix";
+      }
+      int d = k-offset;
+      if ( (d>=0) && (d<(int)data.size()) )
+      {
+        return data[k-offset];
+      }
+      else
+      {
+        throw "out of quasidiagonal";
+      }
+    }
+
+  private:
+    int offset;
+    int size;
+    std::vector<T> data;
+    T   outsideDefault;
+  };
+
+  QuasiDiagonal( int height_, int width_, int thickness_, T outsideDefault_=T() )
+    : height(height_), width(width_), thicknes(thickness_)
+  {
+    for ( int i=0; i<height; ++i )
+    {
+      // Too much copying, but we don't care.
+      QuasiDiagonalRow row( width, offset(i), thicknes, outsideDefault_ );
+      rows.push_back(row);
+    }
+  }
+
+  int offset( int row ) const
+  {
+    return (row*width/height-thicknes/2);
+  }
+
+  int rowStart( int row ) const
+  {
+    int s=offset(row);
+    return ( s>0 ? s : 0 );
+  }
+
+  int rowEnd( int row ) const
+  {
+    int e=offset(row)+thicknes;
+    return ( e<width ? e : width );
+  }
+
+  // The first coordinate is (somewhat atypically) the row.
+  const QuasiDiagonalRow& operator[]( int y ) const
+  {
+    return rows[y];
+  }
+  
+  T& cell( int y, int x )
+  {
+    if ((y<0)||(y>=height))
+    {
+      throw "out of matrix";
+    }
+
+    return rows[y].cell(x);
+  }
+
+  bool setCell( int y, int x, const T& t )
+  {
+    cell(y,x) = t;
+    return true;
+  }
+
+  int size() const { return height; }
+  // Yes, I know it's a stupid name. The reason is, I don't want to
+  // put width/height on the interface, because usually
+  // the first coord is the columns, but not here.
+  // This could lead to confusion.
+  int otherSize() const { return width; }
+
+  int thickness() const { return thicknes; }
+
+private:
+  std::vector<QuasiDiagonalRow> rows;
+  int height,width,thicknes;
+};
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_QUASIDIAGONAL_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_serialize_impl.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_serialize_impl.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_serialize_impl.h	(revision 70339)
@@ -0,0 +1,52 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_INCLUDE_SERIALIZEIMPL_H
+#define __TMXALIGNER_INCLUDE_SERIALIZEIMPL_H
+
+#include <iostream>
+#include <vector>
+#include <set>
+
+template <class T>
+std::ostream& operator<<( std::ostream& os, const std::vector<T>& v )
+{
+  for ( typename std::vector<T>::const_iterator it=v.begin(); it!=v.end(); ++it )
+  {
+    os << *it ;
+    if (it+1!=v.end())
+      os << " ";
+  }
+  return os;
+}
+
+template <class T>
+std::ostream& operator<<( std::ostream& os, const std::set<T>& v )
+{
+  typename std::set<T>::const_iterator it=v.begin();
+  while (true)
+  {
+    os << *it ;
+
+    typename std::set<T>::const_iterator itplus = it;
+    ++itplus;
+
+    if (itplus == v.end())
+      break;
+    else
+      os << " ";
+
+    it = itplus;
+  }
+  return os;
+}
+
+#endif // #define __TMXALIGNER_INCLUDE_SERIALIZEIMPL_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_strings_and_streams.cc
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_strings_and_streams.cc	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_strings_and_streams.cc	(revision 70339)
@@ -0,0 +1,38 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#include <apertium/tmx_strings_and_streams.h>
+
+namespace TMXAligner
+{
+
+void split( const std::string line, std::vector<std::string>& words, char delim /*='\t'*/ )
+{
+  words.clear();
+
+  std::string current;
+
+  for (size_t i=0; i<line.size(); ++i )
+  {
+    if (line[i]==delim)
+    {
+      words.push_back(current);
+      current = "";
+    }
+    else
+    {
+      current += line[i];
+    }
+  }
+  words.push_back(current);
+}
+
+} // namespace TMXAligner
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_strings_and_streams.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_strings_and_streams.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_strings_and_streams.h	(revision 70339)
@@ -0,0 +1,25 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_INCLUDE_STRINGSANDSTREAMS_H
+#define __TMXALIGNER_INCLUDE_STRINGSANDSTREAMS_H
+
+#include <string>
+#include <vector>
+
+namespace TMXAligner
+{
+
+void split( const std::string line, std::vector<std::string>& words, char delim='\t' );
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_INCLUDE_STRINGSANDSTREAMS_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_trail_postprocessors.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_trail_postprocessors.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_trail_postprocessors.h	(revision 70339)
@@ -0,0 +1,142 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_TRAILPOSTPROCESSORS_H
+#define __TMXALIGNER_ALIGNMENT_TRAILPOSTPROCESSORS_H
+
+#include <apertium/tmx_alignment.h>
+
+namespace TMXAligner
+{
+
+// Helper class that calculates scores of holes.
+class TrailScores
+{
+public:
+  TrailScores( const Trail& trail_, const AlignMatrix& dynMatrix_ );
+  // The score of the jth segmentum. The bigger the better.
+  double operator()( int j ) const;
+
+private:
+  const Trail& trail;
+  const AlignMatrix& dynMatrix;
+};
+
+
+class SentenceList;
+
+
+// Helper class that calculates scores of segmentums.
+class TrailScoresInterval
+{
+public:
+  TrailScoresInterval( const Trail& trail_, const AlignMatrix& dynMatrix_,
+    const SentenceList& huSentenceList_, const SentenceList& enSentenceList_ );
+
+  // The average score of the jth segmentum. The bigger the better.
+  // Division is by the maximum of the Hungarian and English intervals.
+  // This is a somewhat arbritary decision, and goes very badly with the
+  // scoring of the knight's moves. But we really have no better choice.
+  // 
+  // Also, the method applies some very ugly hacks to avoid the effect of
+  // paragraph-delimiters. It strips both intervals of <p>s, and
+  // modifies the dynMatrix-based score assuming that all <p>s got paired.
+  // except surplus <p>s.
+  double scoreSegmentum( const Rundle& start, const Rundle& end ) const;
+
+  // The score of a segment identified by its index.
+  double operator()( int j ) const;
+  // The score of a union of segments identified by its start and end rundles' index.
+  // Both these methods rely on scoreSegmentum():
+  // This means an important thing: the score only depends
+  // on the start and end rundle, not the rundles in between.
+  double operator()( int j, int k ) const;
+
+private:
+  const Trail& trail;
+  const AlignMatrix& dynMatrix;
+  const SentenceList& huSentenceList;
+  const SentenceList& enSentenceList;
+};
+
+// Helper class that calculates scores of one-to-one holes.
+class BisentenceListScores
+{
+public:
+  BisentenceListScores( const BisentenceList& bisentenceList_, const AlignMatrix& dynMatrix_ );
+  // The score of the jth bisentence. The bigger the better.
+  double operator()( int j ) const;
+
+private:
+  const BisentenceList& bisentenceList;
+  const AlignMatrix& dynMatrix;
+};
+
+void removeRundles( Trail& trail, const std::set<int>& rundlesToKill );
+
+// In cautious mode, auto-aligned rundles are thrown away if
+// their left or right neighbour holes are not one-to-one.
+// From the point of view of the resultant bisentences:
+// In cautious mode, one-to-one bisentences are thrown away if
+// they have left or right neighbours which are not one-to-one.
+// This of course dramatically improves precision while slightly degrading recall.
+void cautiouslyFilterTrail( Trail& bestTrail );
+
+void spaceOutBySentenceLength( Trail& bestTrail, 
+                 const SentenceList& huSentenceListPretty,
+                 const SentenceList& enSentenceList,
+		 bool utfCharCountingMode );
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrailStart( Trail& bestTrail,
+                            const TrailScoresInterval& trailScoresInterval,
+                            const double& qualityThreshold );
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrailStartAndEnd( Trail& bestTrail,
+                                  const TrailScoresInterval& trailScoresInterval,
+                                  double qualityThreshold );
+
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void postprocessTrail( Trail& bestTrail, 
+                       const TrailScoresInterval& trailScoresInterval, 
+                       double qualityThreshold );
+
+
+// Throws away rundles which are predominantly surrounded by not-one-to-one holes.
+void postprocessTrailByTopology( Trail& bestTrail, double qualityThreshold );
+
+
+// Only collect bisentences with score at least qualityThreshold.
+void trailToBisentenceList( const Trail& bestTrail, const TrailScores& trailScores, double qualityThreshold,
+                            BisentenceList& bisentenceList );
+
+// This is basically incorrect.
+// Here we use the score of the right-hand segment to decide about the rundle.
+//
+// The function gets a nonconst reference to bestTrail.
+// On the other hand, it gets a const reference to bestTrail, through trailScoresInterval.
+// Therefore, the function may only modify bestTrail after it finished reading trailScoresInterval.
+void filterTrailByQuality( Trail& trail, const TrailScoresInterval& trailScoresInterval,
+                           const double& qualityThreshold );
+
+void filterBisentenceListByQuality( BisentenceList& bisentenceList, const AlignMatrix& dynMatrix,
+                                    const double& qualityThreshold );
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_TRAILPOSTPROCESSORS_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_translate.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_translate.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_translate.h	(revision 70339)
@@ -0,0 +1,76 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_TRANSLATE_H
+#define __TMXALIGNER_ALIGNMENT_TRANSLATE_H
+
+#include <apertium/tmx_words.h>
+#include <apertium/tmx_dictionary.h>
+
+namespace TMXAligner
+{
+
+typedef std::map< std::string, Phrase > DumbDictionary;
+
+// This will become a class, with dictionary initialization, and a translate method.
+// It will have various implementations.
+
+void buildDumbDictionary( const DictionaryItems& dictionary, DumbDictionary& dumbDictionary );
+
+void buildDumbDictionaryUsingFrequencies( 
+       const DictionaryItems& dictionary, 
+       FrequencyMap& enFreq, 
+       DumbDictionary& dumbDictionary );
+
+void buildDumbDictionary( TMXAligner::DumbDictionary& dumbDictionary,
+                          const std::string& dictionaryFilename,
+                          const TMXAligner::SentenceList& enSentenceList = TMXAligner::SentenceList()
+                        );
+
+void trivialTranslateWord(
+                     const DumbDictionary& dumbDictionary,
+                     const Word& originalWord,
+                     Phrase& words
+                     );
+
+void trivialTranslate(
+                     const DumbDictionary& dumbDictionary,
+                     const Sentence& sentence,
+                           Sentence& translatedSentence
+                     );
+
+void trivialTranslateSentenceList(
+                     const DumbDictionary& dumbDictionary,
+                     const SentenceList& sentenceList,
+                           SentenceList& translatedSentenceList
+                     );
+
+void naiveTranslate(
+                     const DictionaryItems& dictionary,
+                     const SentenceList& sentenceList,
+                           SentenceList& translatedSentenceList
+                     );
+
+typedef std::multimap< std::string, Phrase > DumbMultiDictionary;
+
+void buildDumbMultiDictionary( const DictionaryItems& dictionary, DumbMultiDictionary& dumbMultiDictionary, bool reverse );
+
+void sortNormalizeSentences( TMXAligner::SentenceList& sentenceList );
+
+// This function preprocesses the sentences so that sentenceListsToAlignMatrixIdentity can be applied to them.
+// It does a rough translation and an alphabetic sort of words.
+void normalizeTextsForIdentity( const DictionaryItems& dictionary,
+                                const SentenceList& huSentenceListPretty,  const SentenceList& enSentenceListPretty,
+                                      SentenceList& huSentenceListGarbled,       SentenceList& enSentenceListGarbled );
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_TRANSLATE_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_words.h
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_words.h	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/tmx_words.h	(revision 70339)
@@ -0,0 +1,55 @@
+/*************************************************************************
+*                                                                        *
+*  (C) Copyright 2004. Media Research Centre at the                      *
+*  Sociology and Communications Department of the                        *
+*  Budapest University of Technology and Economics.                      *
+*                                                                        *
+*  Developed by Daniel Varga.                                            *
+*                                                                        *
+*  From hunalign; for license see ../AUTHORS and ../COPYING.hunalign     *
+*                                                                        *
+*************************************************************************/
+#ifndef __TMXALIGNER_ALIGNMENT_WORDS_H
+#define __TMXALIGNER_ALIGNMENT_WORDS_H
+
+#include <string>
+#include <vector>
+#include <iosfwd>
+
+namespace TMXAligner
+{
+
+typedef std::string String;
+
+typedef String Word;
+
+typedef std::vector<Word> WordList;
+
+typedef WordList Phrase;
+
+typedef std::vector<Phrase> Book;
+
+struct Sentence
+{
+  WordList words;
+  String   sentence;
+  String   id;
+};
+
+// Implemented in dictionary.cpp
+class SentenceList : public std::vector<Sentence>
+{
+public:
+  void read ( std::istream& is );
+  void readNoIds( std::istream& is );
+  void write( std::ostream& os ) const;
+  void writeNoIds( std::ostream& os ) const;
+};
+
+// Implemented in dictionary.cpp
+void readBicorpus( std::istream& is, SentenceList& huSentenceList, SentenceList& enSentenceList);
+void writeBicorpus( std::ostream& os, const SentenceList& huSentenceList, const SentenceList& enSentenceList);
+
+} // namespace TMXAligner
+
+#endif // #define __TMXALIGNER_ALIGNMENT_WORDS_H
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/html-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/html-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/html-format.xml	(revision 70339)
@@ -0,0 +1,378 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/${}]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;script"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/script"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;apertium-notrans"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/apertium-notrans&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;style"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/style"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3">
+      <tag regexp='"&lt;br"(" "[^&gt;]*)?"&gt;"|"&lt;hr"(" "[^&gt;]*)?"&gt;"|"&lt;p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;li"(" "[^&gt;]*)?"&gt;"|"&lt;ul"(" "[^&gt;]*)?"&gt;"|"&lt;ol"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;tr"(" "[^&gt;]*)?"&gt;"|"&lt;td"(" "[^&gt;]*)?"&gt;"|"&lt;th"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3">
+      <tag regexp='"&lt;/br"(" "[^&gt;]*)?"&gt;"|"&lt;/hr"(" "[^&gt;]*)?"&gt;"|"&lt;/p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/li"(" "[^&gt;]*)?"&gt;"|"&lt;/ul"(" "[^&gt;]*)?"&gt;"|"&lt;/ol"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/tr"(" "[^&gt;]*)?"&gt;"|"&lt;/td"(" "[^&gt;]*)?"&gt;"|"&lt;/th"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+<!-- Faltan algunas etiquetas de final de frase. -->
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;title"(" "[^&gt;]*)?"&gt;"|"&lt;div"(" "[^&gt;]*)?"&gt;"|"&lt;option"(" "[^&gt;]*)?"&gt;"|"&lt;h"[1-6](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/title"(" "[^&gt;]*)?"&gt;"|"&lt;/div"(" "[^&gt;]*)?"&gt;"|"&lt;/option"(" "[^&gt;]*)?"&gt;"|"&lt;/h"[1-6](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+<!-- La etiqueta DOCTYPE no la reconoce -->
+
+    <format-rule type="empty" eos="no" priority="4">
+      <tag regexp='"&lt;"("img"|"link")(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="5">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+<!-- End (Cambios hechos por Gorka L.)-->
+
+    <format-rule type="open" eos="no" priority="5">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="5">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <replacement-rule regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8});'>
+      <replace source="&amp;Agrave;" target="À" prefer="yes"/>
+      <replace source="&amp;#192;" target="À"/>
+      <replace source="&amp;#xC0;" target="À"/>
+      <replace source="&amp;#xc0;" target="À"/>
+      <replace source="&amp;Aacute;" target="Á" prefer="yes"/>
+      <replace source="&amp;#193;" target="Á"/>
+      <replace source="&amp;#xC1;" target="Á"/>
+      <replace source="&amp;#xc1;" target="Á"/>
+      <replace source="&amp;Acirc;" target="Â" prefer="yes"/>
+      <replace source="&amp;#194;" target="Â"/>
+      <replace source="&amp;#xC2;" target="Â"/>
+      <replace source="&amp;#xc2;" target="Â"/>
+      <replace source="&amp;Atilde;" target="Ã" prefer="yes"/>
+      <replace source="&amp;#195;" target="Ã"/>
+      <replace source="&amp;#xC3;" target="Ã"/>
+      <replace source="&amp;#xc3;" target="Ã"/>
+      <replace source="&amp;Auml;" target="Ä" prefer="yes"/>
+      <replace source="&amp;#196;" target="Ä"/>
+      <replace source="&amp;#xC4;" target="Ä"/>
+      <replace source="&amp;#xc4;" target="Ä"/>
+      <replace source="&amp;Aring;" target="Å" prefer="yes"/>
+      <replace source="&amp;#197;" target="Å"/>
+      <replace source="&amp;#xC5;" target="Å"/>
+      <replace source="&amp;#xc5;" target="Å"/>
+      <replace source="&amp;AElig;" target="Æ" prefer="yes"/>
+      <replace source="&amp;#198;" target="Æ"/>
+      <replace source="&amp;#xC6;" target="Æ"/>
+      <replace source="&amp;#xc6;" target="Æ"/>
+      <replace source="&amp;Ccedil;" target="Ç" prefer="yes"/>
+      <replace source="&amp;#199;" target="Ç"/>
+      <replace source="&amp;#xC7;" target="Ç"/>
+      <replace source="&amp;#xc7;" target="Ç"/>
+      <replace source="&amp;Egrave;" target="È" prefer="yes"/>
+      <replace source="&amp;#200;" target="È"/>
+      <replace source="&amp;#xC8;" target="È"/>
+      <replace source="&amp;#xc8;" target="È"/>
+      <replace source="&amp;Eacute;" target="É" prefer="yes"/>
+      <replace source="&amp;#201;" target="É"/>
+      <replace source="&amp;#xC9;" target="É"/>
+      <replace source="&amp;#xc9;" target="É"/>
+      <replace source="&amp;Ecirc;" target="Ê" prefer="yes"/>
+      <replace source="&amp;#202;" target="Ê"/>
+      <replace source="&amp;#xCA;" target="Ê"/>
+      <replace source="&amp;#xca;" target="Ê"/>
+      <replace source="&amp;Euml;" target="Ë" prefer="yes"/>
+      <replace source="&amp;#203;" target="Ë"/>
+      <replace source="&amp;#xCB;" target="Ë"/>
+      <replace source="&amp;#xcb;" target="Ë"/>
+      <replace source="&amp;Igrave;" target="Ì" prefer="yes"/>
+      <replace source="&amp;#204;" target="Ì"/>
+      <replace source="&amp;#xCC;" target="Ì"/>
+      <replace source="&amp;#xcc;" target="Ì"/>
+      <replace source="&amp;Iacute;" target="Í" prefer="yes"/>
+      <replace source="&amp;#205;" target="Í"/>
+      <replace source="&amp;#xCD;" target="Í"/>
+      <replace source="&amp;#xcd;" target="Í"/>
+      <replace source="&amp;Icirc;" target="Î" prefer="yes"/>
+      <replace source="&amp;#206;" target="Î"/>
+      <replace source="&amp;#xCE;" target="Î"/>
+      <replace source="&amp;#xce;" target="Î"/>
+      <replace source="&amp;Iuml;" target="Ï" prefer="yes"/>
+      <replace source="&amp;#207;" target="Ï"/>
+      <replace source="&amp;#xCF;" target="Ï"/>
+      <replace source="&amp;#xcf;" target="Ï"/>
+      <replace source="&amp;ETH;" target="Ð" prefer="yes"/>
+      <replace source="&amp;#208;" target="Ð"/>
+      <replace source="&amp;#xD0;" target="Ð"/>
+      <replace source="&amp;#xd0;" target="Ð"/>
+      <replace source="&amp;Ntilde;" target="Ñ" prefer="yes"/>
+      <replace source="&amp;#209;" target="Ñ"/>
+      <replace source="&amp;#xD1;" target="Ñ"/>
+      <replace source="&amp;#xd1;" target="Ñ"/>
+      <replace source="&amp;Ograve;" target="Ò" prefer="yes"/>
+      <replace source="&amp;#210;" target="Ò"/>
+      <replace source="&amp;#xD2;" target="Ò"/>
+      <replace source="&amp;#xd2;" target="Ò"/>
+      <replace source="&amp;Oacute;" target="Ó" prefer="yes"/>
+      <replace source="&amp;#211;" target="Ó"/>
+      <replace source="&amp;#xD3;" target="Ó"/>
+      <replace source="&amp;#xd3;" target="Ó"/>
+      <replace source="&amp;Ocirc;" target="Ô" prefer="yes"/>
+      <replace source="&amp;#212;" target="Ô"/>
+      <replace source="&amp;#xD4;" target="Ô"/>
+      <replace source="&amp;#xd4;" target="Ô"/>
+      <replace source="&amp;Otilde;" target="Õ" prefer="yes"/>
+      <replace source="&amp;#213;" target="Õ"/>
+      <replace source="&amp;#xD5;" target="Õ"/>
+      <replace source="&amp;#xd5;" target="Õ"/>
+      <replace source="&amp;Ouml;" target="Ö" prefer="yes"/>
+      <replace source="&amp;#214;" target="Ö"/>
+      <replace source="&amp;#xD6;" target="Ö"/>
+      <replace source="&amp;#xd6;" target="Ö"/>
+      <replace source="&amp;Oslash;" target="Ø" prefer="yes"/>
+      <replace source="&amp;#216;" target="Ø"/>
+      <replace source="&amp;#xD8;" target="Ø"/>
+      <replace source="&amp;#xd8;" target="Ø"/>
+      <replace source="&amp;Ugrave;" target="Ù" prefer="yes"/>
+      <replace source="&amp;#217;" target="Ù"/>
+      <replace source="&amp;#xD9;" target="Ù"/>
+      <replace source="&amp;#xd9;" target="Ù"/>
+      <replace source="&amp;Uacute;" target="Ú" prefer="yes"/>
+      <replace source="&amp;#218;" target="Ú"/>
+      <replace source="&amp;#xDA;" target="Ú"/>
+      <replace source="&amp;#xda;" target="Ú"/>
+      <replace source="&amp;Ucirc;" target="Û" prefer="yes"/>
+      <replace source="&amp;#219;" target="Û"/>
+      <replace source="&amp;#xDB;" target="Û"/>
+      <replace source="&amp;#xdb;" target="Û"/>
+      <replace source="&amp;Uuml;" target="Ü" prefer="yes"/>
+      <replace source="&amp;#220;" target="Ü"/>
+      <replace source="&amp;#xDC;" target="Ü"/>
+      <replace source="&amp;#xdc;" target="Ü"/>
+      <replace source="&amp;Yacute;" target="Ý" prefer="yes"/>
+      <replace source="&amp;#221;" target="Ý"/>
+      <replace source="&amp;#xDD;" target="Ý"/>
+      <replace source="&amp;#xdd;" target="Ý"/>
+      <replace source="&amp;THORN;" target="Þ" prefer="yes"/>
+      <replace source="&amp;#222;" target="Þ"/>
+      <replace source="&amp;#xDE;" target="Þ"/>
+      <replace source="&amp;#xde;" target="Þ"/>
+      <replace source="&amp;szlig;" target="ß" prefer="yes"/>
+      <replace source="&amp;#223;" target="ß"/>
+      <replace source="&amp;#xDF;" target="ß"/>
+      <replace source="&amp;#xdf;" target="ß"/>
+      <replace source="&amp;agrave;" target="à" prefer="yes"/>
+      <replace source="&amp;#224;" target="à"/>
+      <replace source="&amp;#xE0;" target="à"/>
+      <replace source="&amp;#xe0;" target="à"/>
+      <replace source="&amp;aacute;" target="á" prefer="yes"/>
+      <replace source="&amp;#225;" target="á"/>
+      <replace source="&amp;#xE1;" target="á"/>
+      <replace source="&amp;#xe1;" target="á"/>
+      <replace source="&amp;acirc;" target="â" prefer="yes"/>
+      <replace source="&amp;#226;" target="â"/>
+      <replace source="&amp;#xE2;" target="â"/>
+      <replace source="&amp;#xe2;" target="â"/>
+      <replace source="&amp;atilde;" target="ã" prefer="yes"/>
+      <replace source="&amp;#227;" target="ã"/>
+      <replace source="&amp;#xE3;" target="ã"/>
+      <replace source="&amp;#xe3;" target="ã"/>
+      <replace source="&amp;auml;" target="ä" prefer="yes"/>
+      <replace source="&amp;#228;" target="ä"/>
+      <replace source="&amp;#xE4;" target="ä"/>
+      <replace source="&amp;#xe4;" target="ä"/>
+      <replace source="&amp;aring;" target="å" prefer="yes"/>
+      <replace source="&amp;#229;" target="å"/>
+      <replace source="&amp;#xE5;" target="å"/>
+      <replace source="&amp;#xe5;" target="å"/>
+      <replace source="&amp;aelig;" target="æ" prefer="yes"/>
+      <replace source="&amp;#230;" target="æ"/>
+      <replace source="&amp;#xE6;" target="æ"/>
+      <replace source="&amp;#xe6;" target="æ"/>
+      <replace source="&amp;ccedil;" target="ç" prefer="yes"/>
+      <replace source="&amp;#231;" target="ç"/>
+      <replace source="&amp;#xE7;" target="ç"/>
+      <replace source="&amp;#xe7;" target="ç"/>
+      <replace source="&amp;egrave;" target="è" prefer="yes"/>
+      <replace source="&amp;#232;" target="è"/>
+      <replace source="&amp;#xE8;" target="è"/>
+      <replace source="&amp;#xe8;" target="è"/>
+      <replace source="&amp;eacute;" target="é" prefer="yes"/>
+      <replace source="&amp;#233;" target="é"/>
+      <replace source="&amp;#xE9;" target="é"/>
+      <replace source="&amp;#xe9;" target="é"/>
+      <replace source="&amp;ecirc;" target="ê" prefer="yes"/>
+      <replace source="&amp;#234;" target="ê"/>
+      <replace source="&amp;#xEA;" target="ê"/>
+      <replace source="&amp;#xea;" target="ê"/>
+      <replace source="&amp;euml;" target="ë" prefer="yes"/>
+      <replace source="&amp;#235;" target="ë"/>
+      <replace source="&amp;#xEB;" target="ë"/>
+      <replace source="&amp;#xeb;" target="ë"/>
+      <replace source="&amp;igrave;" target="ì" prefer="yes"/>
+      <replace source="&amp;#236;" target="ì"/>
+      <replace source="&amp;#xEC;" target="ì"/>
+      <replace source="&amp;#xec;" target="ì"/>
+      <replace source="&amp;iacute;" target="í" prefer="yes"/>
+      <replace source="&amp;#237;" target="í"/>
+      <replace source="&amp;#xED;" target="í"/>
+      <replace source="&amp;#xed;" target="í"/>
+      <replace source="&amp;icirc;" target="î" prefer="yes"/>
+      <replace source="&amp;#238;" target="î"/>
+      <replace source="&amp;#xEE;" target="î"/>
+      <replace source="&amp;#xee;" target="î"/>
+      <replace source="&amp;iuml;" target="ï" prefer="yes"/>
+      <replace source="&amp;#239;" target="ï"/>
+      <replace source="&amp;#xEF;" target="ï"/>
+      <replace source="&amp;#xef;" target="ï"/>
+      <replace source="&amp;eth;" target="ð" prefer="yes"/>
+      <replace source="&amp;#240;" target="ð"/>
+      <replace source="&amp;#xF0;" target="ð"/>
+      <replace source="&amp;#xf0;" target="ð"/>
+      <replace source="&amp;ntilde;" target="ñ" prefer="yes"/>
+      <replace source="&amp;#241;" target="ñ"/>
+      <replace source="&amp;#xF1;" target="ñ"/>
+      <replace source="&amp;#xf1;" target="ñ"/>
+      <replace source="&amp;ograve;" target="ò" prefer="yes"/>
+      <replace source="&amp;#242;" target="ò"/>
+      <replace source="&amp;#xF2;" target="ò"/>
+      <replace source="&amp;#xf2;" target="ò"/>
+      <replace source="&amp;oacute;" target="ó" prefer="yes"/>
+      <replace source="&amp;#243;" target="ó"/>
+      <replace source="&amp;#xF3;" target="ó"/>
+      <replace source="&amp;#xf3;" target="ó"/>
+      <replace source="&amp;ocirc;" target="ô" prefer="yes"/>
+      <replace source="&amp;#244;" target="ô"/>
+      <replace source="&amp;#xF4;" target="ô"/>
+      <replace source="&amp;#xf4;" target="ô"/>
+      <replace source="&amp;otilde;" target="õ" prefer="yes"/>
+      <replace source="&amp;#245;" target="õ"/>
+      <replace source="&amp;#xF5;" target="õ"/>
+      <replace source="&amp;#xf5;" target="õ"/>
+      <replace source="&amp;ouml;" target="ö" prefer="yes"/>
+      <replace source="&amp;#246;" target="ö"/>
+      <replace source="&amp;#xF6;" target="ö"/>
+      <replace source="&amp;#xf6;" target="ö"/>
+      <replace source="&amp;oslash;" target="ø" prefer="yes"/>
+      <replace source="&amp;#248;" target="ø"/>
+      <replace source="&amp;#xF8;" target="ø"/>
+      <replace source="&amp;#xf8;" target="ø"/>
+      <replace source="&amp;ugrave;" target="ù" prefer="yes"/>
+      <replace source="&amp;#249;" target="ù"/>
+      <replace source="&amp;#xF9;" target="ù"/>
+      <replace source="&amp;#xf9;" target="ù"/>
+      <replace source="&amp;uacute;" target="ú" prefer="yes"/>
+      <replace source="&amp;#250;" target="ú"/>
+      <replace source="&amp;#xFA;" target="ú"/>
+      <replace source="&amp;#xfa;" target="ú"/>
+      <replace source="&amp;ucirc;" target="û" prefer="yes"/>
+      <replace source="&amp;#251;" target="û"/>
+      <replace source="&amp;#xFB;" target="û"/>
+      <replace source="&amp;#xfb;" target="û"/>
+      <replace source="&amp;uuml;" target="ü" prefer="yes"/>
+      <replace source="&amp;#252;" target="ü"/>
+      <replace source="&amp;#xFC;" target="ü"/>
+      <replace source="&amp;#xfc;" target="ü"/>
+      <replace source="&amp;yacute;" target="ý" prefer="yes"/>
+      <replace source="&amp;#253;" target="ý"/>
+      <replace source="&amp;#xFD;" target="ý"/>
+      <replace source="&amp;#xfd;" target="ý"/>
+      <replace source="&amp;thorn;" target="þ" prefer="yes"/>
+      <replace source="&amp;#254;" target="þ"/>
+      <replace source="&amp;#xFE;" target="þ"/>
+      <replace source="&amp;#xfe;" target="þ"/>
+      <replace source="&amp;yuml;" target="ÿ" prefer="yes"/>
+      <replace source="&amp;#255;" target="ÿ"/>
+      <replace source="&amp;#xFF;" target="ÿ"/>
+      <replace source="&amp;#xff;" target="ÿ"/>
+      <replace source="&amp;middot;" target="·" prefer="yes"/>
+      <replace source="&amp;#183;" target="·"/>
+      <replace source="&amp;#xB7;" target="·"/>
+      <replace source="&amp;#xb7;" target="·"/>
+      <replace source="&amp;laquo;" target="«" prefer="yes"/>
+      <replace source="&amp;#171;" target="«"/>
+      <replace source="&amp;#xAB;" target="«"/>
+      <replace source="&amp;#xab;" target="«"/>
+      <replace source="&amp;raquo;" target="»" prefer="yes"/>
+      <replace source="&amp;#187;" target="»"/>
+      <replace source="&amp;#xBB;" target="»"/>
+      <replace source="&amp;#xbb;" target="»"/>
+
+      <replace source="&amp;rsquo;" target="'"/>
+
+
+      <!-- For Esperanto characters. Named entities like &circ; doesent work in browsers, so follow scheme of http://bertilow.com/html/esperantaj/html_uni.html -->
+      <replace source="&amp;#264;" target="Ĉ" prefer="yes"/>
+      <replace source="&amp;#265;" target="ĉ" prefer="yes"/>
+      <replace source="&amp;#284;" target="Ĝ" prefer="yes"/>
+      <replace source="&amp;#285;" target="ĝ" prefer="yes"/>
+      <replace source="&amp;#292;" target="Ĥ" prefer="yes"/>
+      <replace source="&amp;#293;" target="ĥ" prefer="yes"/>
+      <replace source="&amp;#308;" target="Ĵ" prefer="yes"/>
+      <replace source="&amp;#309;" target="ĵ" prefer="yes"/>
+      <replace source="&amp;#348;" target="Ŝ" prefer="yes"/>
+      <replace source="&amp;#349;" target="ŝ" prefer="yes"/>
+      <replace source="&amp;#364;" target="Ŭ" prefer="yes"/>
+      <replace source="&amp;#365;" target="ŭ" prefer="yes"/>
+
+      <!-- replace &#39; with ' in input (this will make i.a. English genitive work). -->
+      <replace source="&amp;#39;" target="'"/>
+      <replace source="'" target="'" prefer="yes"/>
+
+
+      
+<!--      <replace source="&amp;apos;" target="'"/>
+      <replace source="&amp;quot;" target="\&quot;"/> -->
+    </replacement-rule>  
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/html-noent-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/html-noent-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/html-noent-format.xml	(revision 70339)
@@ -0,0 +1,90 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/${}]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;script"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/script"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;apertium-notrans"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/apertium-notrans&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;style"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/style"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3">
+      <tag regexp='"&lt;br"(" "[^&gt;]*)?"&gt;"|"&lt;hr"(" "[^&gt;]*)?"&gt;"|"&lt;p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;li"(" "[^&gt;]*)?"&gt;"|"&lt;ul"(" "[^&gt;]*)?"&gt;"|"&lt;ol"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;tr"(" "[^&gt;]*)?"&gt;"|"&lt;td"(" "[^&gt;]*)?"&gt;"|"&lt;th"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3">
+      <tag regexp='"&lt;/br"(" "[^&gt;]*)?"&gt;"|"&lt;/hr"(" "[^&gt;]*)?"&gt;"|"&lt;/p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/li"(" "[^&gt;]*)?"&gt;"|"&lt;/ul"(" "[^&gt;]*)?"&gt;"|"&lt;/ol"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/tr"(" "[^&gt;]*)?"&gt;"|"&lt;/td"(" "[^&gt;]*)?"&gt;"|"&lt;/th"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+<!-- Faltan algunas etiquetas de final de frase. -->
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;title"(" "[^&gt;]*)?"&gt;"|"&lt;div"(" "[^&gt;]*)?"&gt;"|"&lt;option"(" "[^&gt;]*)?"&gt;"|"&lt;h"[1-6](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/title"(" "[^&gt;]*)?"&gt;"|"&lt;/div"(" "[^&gt;]*)?"&gt;"|"&lt;/option"(" "[^&gt;]*)?"&gt;"|"&lt;/h"[1-6](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+<!-- La etiqueta DOCTYPE no la reconoce -->
+
+    <format-rule type="empty" eos="no" priority="4">
+      <tag regexp='"&lt;"("img"|"link")(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="5">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+<!-- End (Cambios hechos por Gorka L.)-->
+
+    <format-rule type="open" eos="no" priority="5">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="5">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/mediawiki-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/mediawiki-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/mediawiki-format.xml	(revision 70339)
@@ -0,0 +1,161 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="UTF-8"/>
+    <output encoding="UTF-8"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/$]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;{}~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&amp;lt;!--"'/>
+      <end regexp='"--&amp;gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;script"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/script"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;apertium-notrans"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/apertium-notrans&gt;"'/>
+    </format-rule>
+
+    <!-- Mediawiki XML export -->
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;siteinfo&gt;"'/>
+      <end regexp='"&lt;/siteinfo&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;comment&gt;"'/>
+      <end regexp='"&lt;/comment&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;id&gt;"'/>
+      <end regexp='"&lt;/id&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;contributor&gt;"'/>
+      <end regexp='"&lt;/contributor&gt;"'/>
+    </format-rule>
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;timestamp&gt;"'/>
+      <end regexp='"&lt;/timestamp&gt;"'/>
+    </format-rule>
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"{{"'/>
+      <end regexp='"}}"'/>
+    </format-rule>
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&amp;lt;math&amp;gt;"'/>
+      <end regexp='"&amp;lt;/math&amp;gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;style"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/style"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3">
+      <tag regexp='"&lt;br"(" "[^&gt;]*)?"&gt;"|"&lt;hr"(" "[^&gt;]*)?"&gt;"|"&lt;p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;li"(" "[^&gt;]*)?"&gt;"|"&lt;ul"(" "[^&gt;]*)?"&gt;"|"&lt;ol"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;tr"(" "[^&gt;]*)?"&gt;"|"&lt;td"(" "[^&gt;]*)?"&gt;"|"&lt;th"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3">
+      <tag regexp='"&lt;/br"(" "[^&gt;]*)?"&gt;"|"&lt;/hr"(" "[^&gt;]*)?"&gt;"|"&lt;/p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/li"(" "[^&gt;]*)?"&gt;"|"&lt;/ul"(" "[^&gt;]*)?"&gt;"|"&lt;/ol"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/tr"(" "[^&gt;]*)?"&gt;"|"&lt;/td"(" "[^&gt;]*)?"&gt;"|"&lt;/th"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="1">
+      <tag regexp='"["'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="1">
+      <tag regexp='"]"'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="1">
+      <tag regexp='"&apos;"([&apos;]+)'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="1">
+      <tag regexp='^([\*=:;#]+)'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="yes" priority="1">
+      <tag regexp='"="([=]+)'/>
+    </format-rule>
+
+
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp='"[["([a-z][a-z]|[a-z][a-z][a-z]|"image"|"file")":"([^\]]*)"]]"'/>
+    </format-rule>
+
+<!-- Faltan algunas etiquetas de final de frase. -->
+
+    <format-rule type="open" eos="yes" priority="3"> 
+      <tag regexp='"&lt;title"(" "[^&gt;]*)?"&gt;"|"&lt;div"(" "[^&gt;]*)?"&gt;"|"&lt;option"(" "[^&gt;]*)?"&gt;"|"&lt;h"[1-6](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3"> 
+      <tag regexp='"&lt;/title"(" "[^&gt;]*)?"&gt;"|"&lt;/div"(" "[^&gt;]*)?"&gt;"|"&lt;/option"(" "[^&gt;]*)?"&gt;"|"&lt;/h"[1-6](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+<!-- La etiqueta DOCTYPE no la reconoce -->
+
+    <format-rule type="empty" eos="no" priority="4">
+      <tag regexp='"&lt;"("img"|"link")(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="no" priority="5">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+<!-- End (Cambios hechos por Gorka L.)-->
+
+    <format-rule type="open" eos="no" priority="5">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="5">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="open" eos="no" priority="5">
+      <tag regexp='"&amp;lt;"[a-zA-Z][^&amp;]*"&amp;gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="5">
+      <tag regexp='"&amp;lt;/"[a-zA-Z][^&amp;]*"&amp;gt;"'/>
+    </format-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/odt-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/odt-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/odt-format.xml	(revision 70339)
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/$]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;{}~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;math:"[a-zA-Z]+(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/math:"[a-zA-Z]+(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule> 
+    
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;math"(" xmlns="[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/math&gt;"'/>
+    </format-rule> 
+    
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&amp;lt;apertium-notrans"(" "[^&gt;]*)?"&amp;gt;"'/>
+      <end regexp='"&amp;lt;/apertium-notrans&amp;gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3">
+      <tag regexp='"&lt;text:"[hp](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3">
+      <tag regexp='"&lt;/text:"[hp](" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="empty" eos="no" priority="4">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="open" eos="no" priority="4">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="4">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    <replacement-rule regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8});'>
+      <replace source="&amp;apos;" target="'"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/pptx-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/pptx-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/pptx-format.xml	(revision 70339)
@@ -0,0 +1,60 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/$]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;{}~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="2">
+      <begin regexp='"&lt;pkg:binaryData"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/pkg:binaryData"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule> 
+    
+    <format-rule type="comment" eos="yes" priority="2">
+      <begin regexp='"&lt;p:timing"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/p:timing"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="3">
+      <tag regexp='"&lt;a:p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3">
+      <tag regexp='"&lt;/a:p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&amp;lt;apertium-notrans"(" "[^&gt;]*)?"&amp;gt;"'/>
+      <end regexp='"&amp;lt;/apertium-notrans&amp;gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="empty" eos="no" priority="4">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="open" eos="no" priority="4">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="4">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    <replacement-rule regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8});'>
+      <replace source="&amp;apos;" target="'"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/wxml-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/wxml-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/wxml-format.xml	(revision 70339)
@@ -0,0 +1,72 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/${}]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;Properties"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/Properties"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="3">
+      <begin regexp='"&lt;pkg:binaryData"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/pkg:binaryData"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule> 
+    
+    <format-rule type="comment" eos="yes" priority="3">
+      <begin regexp='"&lt;w:instrText"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/w:instrText"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>    
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&amp;lt;apertium-notrans"(" "[^&gt;]*)?"&amp;gt;"'/>
+      <end regexp='"&amp;lt;/apertium-notrans&amp;gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="comment" eos="yes" priority="3">
+      <begin regexp='"&lt;w:drawing"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/w:drawing"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>    
+
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;w:p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="4">
+      <tag regexp='"&lt;/w:p"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="empty" eos="no" priority="5">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="open" eos="no" priority="5">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="5">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    <replacement-rule regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8});'>
+      <replace source="&amp;apos;" target="'"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/xlsx-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/xlsx-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/xlsx-format.xml	(revision 70339)
@@ -0,0 +1,56 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="html">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/${}]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="2">
+      <begin regexp='"&lt;f"(" "[^&gt;]*)?"&gt;"'/>
+      <end regexp='"&lt;/f"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule> 
+
+
+    <format-rule type="open" eos="yes" priority="3">
+      <tag regexp='"&lt;si"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="3">
+      <tag regexp='"&lt;/si"(" "[^&gt;]*)?"&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="empty" eos="no" priority="4">
+      <tag regexp='("&lt;!"|"&lt;?")[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&amp;lt;apertium-notrans"(" "[^&gt;]*)?"&amp;gt;"'/>
+      <end regexp='"&amp;lt;/apertium-notrans&amp;gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="open" eos="no" priority="4">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="4">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    <replacement-rule regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8});'>
+      <replace source="&amp;apos;" target="'"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/latex-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/latex-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/latex-format.xml	(revision 70339)
@@ -0,0 +1,268 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="latex">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/${}]'/>
+    <space-chars regexp='[ \n\t\r&lt;&gt;~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;!--"'/>
+      <end regexp='"--&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;COMMENT&gt;"'/>
+      <end regexp='"&lt;/COMMENT&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp='"&lt;VERB&gt;"'/>
+      <end regexp='"&lt;/VERB&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;cite"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>      
+      <end regexp='"&lt;/CONTENTS&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="no" priority="2">
+      <begin regexp='"&lt;ref"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>      
+      <end regexp='"&lt;/CONTENTS&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;part"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;part"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;chapter"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;chapter"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;section"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;section"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;title"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;title"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;mline"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;thanks"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;paragraph"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>   
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsubsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsubsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsubsubsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;subsubsubsubsubsection"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;frametitle"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;frametitle"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;PARAM&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;block&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;caption"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;footnote"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;framebox"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+     
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;parbox"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"[^\&lt;]+"&lt;/CONTENTS&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="2">
+      <tag regexp='"&lt;item"(_STAR)?"/&gt;&lt;PARAM&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="no" priority="2">
+      <tag regexp='"&lt;textit"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="close" eos="no" priority="2">
+      <tag regexp='"&lt;/CONTENTS-noeos&gt;"'/>  
+    </format-rule>
+    
+    <format-rule type="open" eos="no" priority="2">
+      <tag regexp='"&lt;emph"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="no" priority="2">
+      <tag regexp='"&lt;textbf"(_STAR)?"/&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;CONTENTS&gt;"[ \t\n\r]*"&lt;sf/&gt;"'/>      
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;CONTENTS&gt;"[ \t\n\r]*"&lt;bf/&gt;"'/>      
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;CONTENTS&gt;"[ \t\n\r]*"&lt;em/&gt;"'/>      
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;CONTENTS&gt;"[ \t\n\r]*"&lt;sc/&gt;"'/>      
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="4">
+      <begin regexp='"&lt;CONTENTS&gt;"'/>      
+      <end regexp='"&lt;/CONTENTS&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="4">
+      <tag regexp='"&lt;/CONTENTS&gt;"'/>
+    </format-rule>
+        
+    <format-rule type="comment" eos="yes" priority="4">
+      <begin regexp='"&lt;PARAM&gt;"'/>
+      <end regexp='"&lt;/PARAM&gt;"'/>
+    </format-rule>
+
+    <format-rule type="close" eos="yes" priority="4">
+      <tag regexp='"&lt;/PARAM&gt;"'/>
+    </format-rule>
+
+
+    <format-rule type="comment" eos="no" priority="4">
+      <begin regexp='"&lt;MATH_DOLLAR&gt;"'/>
+      <end regexp='"&lt;/MATH_DOLLAR&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="4">
+      <begin regexp='"&lt;MATH_DOLLARS&gt;"'/>
+      <end regexp='"&lt;/MATH_DOLLARS&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="4">
+      <begin regexp='"&lt;equation"(_STAR)?"&gt;"'/>
+      <end regexp='"&lt;/equation"(_STAR)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="4">
+      <begin regexp='"&lt;thebibliography"(_STAR)?"&gt;"'/>
+      <end regexp='"&lt;/thebibliography"(_STAR)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="comment" eos="yes" priority="4">
+      <begin regexp='"&lt;eqnarray"(_STAR)?"&gt;"'/>
+      <end regexp='"&lt;/eqnarray"(_STAR)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;itemize"(_STAR)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="open" eos="yes" priority="4">
+      <tag regexp='"&lt;/itemize"(_STAR)?"&gt;"'/>
+    </format-rule>
+
+    <format-rule type="empty" eos="yes" priority="4">
+      <tag regexp='"&lt;item/&gt;"'/>
+    </format-rule>
+    
+    
+
+    <format-rule type="open" eos="no" priority="5">
+      <tag regexp='"&lt;"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+    <format-rule type="close" eos="no" priority="5">
+      <tag regexp='"&lt;/"[a-zA-Z][^&gt;]*"&gt;"'/>
+    </format-rule>
+    
+<!--    <format-rule type="empty" eos="no" priority="5">
+      <tag regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8})";"'/>
+    </format-rule> -->
+
+    <format-rule type="empty" eos="yes" priority="6">
+      <tag regexp='"&lt;/PARAM&gt;"[ \t\n\r]*"&lt;CONTENTS&gt;"'/>  
+    </format-rule>
+
+
+    <replacement-rule regexp='"&amp;"([a-zA-Z]+|"#x"[0-9a-fA-F]{1,4}|"#"[0-9]{1,8});'>
+      <replace source="&amp;apos;" target="'"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format.xml	(revision 70339)
@@ -0,0 +1,473 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<format name="rtf"> <!-- version 1.0 -->
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="''"/>
+    <escape-chars regexp='(\\|[][&lt;&gt;@^$/{}])'/> 
+<!--    <escape-chars regexp='[]]^@&lt;&gt;/]'/>  -->
+
+    <space-chars regexp='[ \n\t\r$*~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    
+    <!-- Exceptions with priority 1  -->
+    <!-- Style Sheet names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\snext&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\keycode&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- Font names are also format: -->
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fcharset&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule>
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fnil&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\froman&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fswiss&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fmodern&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fscript&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fdecor&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\ftech&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fbidi&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\falt&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fontfile&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fn&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sbasedon&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\additive&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- File names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\file&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- List Table names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\listname&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\leveltext&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\levelnumbers&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- Pictures are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\pict&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sn&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sv&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;{\\\*\\blipuid  &quot;[^ \n\r]+&quot;}&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Objects are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\object&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Document Variables are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\docvar&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Bookmarks are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\bkmkstart&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\bkmkend&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Index Entries are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\rxe&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Fields are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fldinst&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fldrslt&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Other format tags which contain #CDATA: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\pntxt&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\colortbl&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Hexadecimal Data -->
+    <format-rule type="empty" eos="yes" priority="1">
+      <tag regexp="[a-f0-9]{20,}" />
+    </format-rule>
+    
+    
+    
+    
+
+    <!-- End of sentence tags: par, row, cell -->
+    <format-rule type="empty" eos="yes" priority="2">
+      <tag regexp="&quot;\\par&quot;|&quot;\\row&quot;|&quot;\\cell&quot;" />
+    </format-rule>
+    
+
+    <format-rule type="open" eos="no" priority="3">
+      <tag regexp="&quot;{&quot;[ \n\r]*\\[^'][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+
+    <!-- General Tags Specification -->
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\[^r'][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\r[^q][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\rq[^u][^ \n\r\\]*[ \n\r]*"/>      
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\rqu[^o][^ \n\r\\]*[ \n\r]*"/>      
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\rquo[^t][^ \n\r\\]*[ \n\r]*"/>      
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\rquot[^e][^ \n\r\\]*[ \n\r]*"/>      
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\rquote[^ \n\r\\]+[ \n\r]*"/>      
+    </format-rule>
+
+    <format-rule type="close" eos="no" priority="4">
+      <tag regexp="&quot;}&quot;"/>
+    </format-rule>
+    <format-rule type="open" eos="no" priority="4">
+      <tag regexp="&quot;{&quot;"/>
+    </format-rule>
+
+    <replacement-rule regexp="&quot;\\rquote &quot;">
+      <replace source="\\rquote " target="'"/>
+      <replace source="'" target="'" preferred="yes"/>
+    </replacement-rule>
+    
+    <replacement-rule regexp="&quot;\\'&quot;[0-9a-fA-F][0-9a-fA-F](\r|\n|&quot;\r\n&quot;)?"> 
+      <replace source="\\'c0" target="�" prefer="yes"/>
+      <replace source="\\'c1" target="�" prefer="yes"/>
+      <replace source="\\'c2" target="�" prefer="yes"/>
+      <replace source="\\'c3" target="�" prefer="yes"/>
+      <replace source="\\'c4" target="�" prefer="yes"/>
+      <replace source="\\'c5" target="�" prefer="yes"/>
+      <replace source="\\'c6" target="�" prefer="yes"/>
+      <replace source="\\'c7" target="�" prefer="yes"/>
+      <replace source="\\'c8" target="�" prefer="yes"/>
+      <replace source="\\'c9" target="�" prefer="yes"/>
+      <replace source="\\'ca" target="�" prefer="yes"/>
+      <replace source="\\'cb" target="�" prefer="yes"/>
+      <replace source="\\'cc" target="�" prefer="yes"/>
+      <replace source="\\'cd" target="�" prefer="yes"/>
+      <replace source="\\'ce" target="�" prefer="yes"/>
+      <replace source="\\'cf" target="�" prefer="yes"/>
+      <replace source="\\'d0" target="�" prefer="yes"/>
+      <replace source="\\'d1" target="�" prefer="yes"/>
+      <replace source="\\'d2" target="�" prefer="yes"/>
+      <replace source="\\'d3" target="�" prefer="yes"/>
+      <replace source="\\'d4" target="�" prefer="yes"/>
+      <replace source="\\'d5" target="�" prefer="yes"/>
+      <replace source="\\'d6" target="�" prefer="yes"/>
+      <replace source="\\'d8" target="�" prefer="yes"/>
+      <replace source="\\'d9" target="�" prefer="yes"/>
+      <replace source="\\'da" target="�" prefer="yes"/>
+      <replace source="\\'db" target="�" prefer="yes"/>
+      <replace source="\\'dc" target="�" prefer="yes"/>
+      <replace source="\\'dd" target="�" prefer="yes"/>
+      <replace source="\\'de" target="�" prefer="yes"/>
+      <replace source="\\'df" target="�" prefer="yes"/>
+      <replace source="\\'e0" target="�" prefer="yes"/>
+      <replace source="\\'e1" target="�" prefer="yes"/>
+      <replace source="\\'e2" target="�" prefer="yes"/>
+      <replace source="\\'e3" target="�" prefer="yes"/>
+      <replace source="\\'e4" target="�" prefer="yes"/>
+      <replace source="\\'e5" target="�" prefer="yes"/>
+      <replace source="\\'e6" target="�" prefer="yes"/>
+      <replace source="\\'e7" target="�" prefer="yes"/>
+      <replace source="\\'e8" target="�" prefer="yes"/>
+      <replace source="\\'e9" target="�" prefer="yes"/>
+      <replace source="\\'ea" target="�" prefer="yes"/>
+      <replace source="\\'eb" target="�" prefer="yes"/>
+      <replace source="\\'ec" target="�" prefer="yes"/>
+      <replace source="\\'ed" target="�" prefer="yes"/>
+      <replace source="\\'ee" target="�" prefer="yes"/>
+      <replace source="\\'ef" target="�" prefer="yes"/>
+      <replace source="\\'f0" target="�" prefer="yes"/>
+      <replace source="\\'f1" target="�" prefer="yes"/>
+      <replace source="\\'f2" target="�" prefer="yes"/>
+      <replace source="\\'f3" target="�" prefer="yes"/>
+      <replace source="\\'f4" target="�" prefer="yes"/>
+      <replace source="\\'f5" target="�" prefer="yes"/>
+      <replace source="\\'f6" target="�" prefer="yes"/>
+      <replace source="\\'f8" target="�" prefer="yes"/>
+      <replace source="\\'f9" target="�" prefer="yes"/>
+      <replace source="\\'fa" target="�" prefer="yes"/>
+      <replace source="\\'fb" target="�" prefer="yes"/>
+      <replace source="\\'fc" target="�" prefer="yes"/>
+      <replace source="\\'fd" target="�" prefer="yes"/>
+      <replace source="\\'fe" target="�" prefer="yes"/>
+      <replace source="\\'ff" target="�" prefer="yes"/>
+      <!-- The same characters followed by a \r\n: -->
+      <replace source="\\'c0\r\n" target="�"/>
+      <replace source="\\'c1\r\n" target="�"/>
+      <replace source="\\'c2\r\n" target="�"/>
+      <replace source="\\'c3\r\n" target="�"/>
+      <replace source="\\'c4\r\n" target="�"/>
+      <replace source="\\'c5\r\n" target="�"/>
+      <replace source="\\'c6\r\n" target="�"/>
+      <replace source="\\'c7\r\n" target="�"/>
+      <replace source="\\'c8\r\n" target="�"/>
+      <replace source="\\'c9\r\n" target="�"/>
+      <replace source="\\'ca\r\n" target="�"/>
+      <replace source="\\'cb\r\n" target="�"/>
+      <replace source="\\'cc\r\n" target="�"/>
+      <replace source="\\'cd\r\n" target="�"/>
+      <replace source="\\'ce\r\n" target="�"/>
+      <replace source="\\'cf\r\n" target="�"/>
+      <replace source="\\'d0\r\n" target="�"/>
+      <replace source="\\'d1\r\n" target="�"/>
+      <replace source="\\'d2\r\n" target="�"/>
+      <replace source="\\'d3\r\n" target="�"/>
+      <replace source="\\'d4\r\n" target="�"/>
+      <replace source="\\'d5\r\n" target="�"/>
+      <replace source="\\'d6\r\n" target="�"/>
+      <replace source="\\'d8\r\n" target="�"/>
+      <replace source="\\'d9\r\n" target="�"/>
+      <replace source="\\'da\r\n" target="�"/>
+      <replace source="\\'db\r\n" target="�"/>
+      <replace source="\\'dc\r\n" target="�"/>
+      <replace source="\\'dd\r\n" target="�"/>
+      <replace source="\\'de\r\n" target="�"/>
+      <replace source="\\'df\r\n" target="�"/>
+      <replace source="\\'e0\r\n" target="�"/>
+      <replace source="\\'e1\r\n" target="�"/>
+      <replace source="\\'e2\r\n" target="�"/>
+      <replace source="\\'e3\r\n" target="�"/>
+      <replace source="\\'e4\r\n" target="�"/>
+      <replace source="\\'e5\r\n" target="�"/>
+      <replace source="\\'e6\r\n" target="�"/>
+      <replace source="\\'e7\r\n" target="�"/>
+      <replace source="\\'e8\r\n" target="�"/>
+      <replace source="\\'e9\r\n" target="�"/>
+      <replace source="\\'ea\r\n" target="�"/>
+      <replace source="\\'eb\r\n" target="�"/>
+      <replace source="\\'ec\r\n" target="�"/>
+      <replace source="\\'ed\r\n" target="�"/>
+      <replace source="\\'ee\r\n" target="�"/>
+      <replace source="\\'ef\r\n" target="�"/>
+      <replace source="\\'f0\r\n" target="�"/>
+      <replace source="\\'f1\r\n" target="�"/>
+      <replace source="\\'f2\r\n" target="�"/>
+      <replace source="\\'f3\r\n" target="�"/>
+      <replace source="\\'f4\r\n" target="�"/>
+      <replace source="\\'f5\r\n" target="�"/>
+      <replace source="\\'f6\r\n" target="�"/>
+      <replace source="\\'f8\r\n" target="�"/>
+      <replace source="\\'f9\r\n" target="�"/>
+      <replace source="\\'fa\r\n" target="�"/>
+      <replace source="\\'fb\r\n" target="�"/>
+      <replace source="\\'fc\r\n" target="�"/>
+      <replace source="\\'fd\r\n" target="�"/>
+      <replace source="\\'fe\r\n" target="�"/>
+      <replace source="\\'ff\r\n" target="�"/>
+      <!-- The same characters followed by a \n: -->
+      <replace source="\\'c0\n" target="�"/>
+      <replace source="\\'c1\n" target="�"/>
+      <replace source="\\'c2\n" target="�"/>
+      <replace source="\\'c3\n" target="�"/>
+      <replace source="\\'c4\n" target="�"/>
+      <replace source="\\'c5\n" target="�"/>
+      <replace source="\\'c6\n" target="�"/>
+      <replace source="\\'c7\n" target="�"/>
+      <replace source="\\'c8\n" target="�"/>
+      <replace source="\\'c9\n" target="�"/>
+      <replace source="\\'ca\n" target="�"/>
+      <replace source="\\'cb\n" target="�"/>
+      <replace source="\\'cc\n" target="�"/>
+      <replace source="\\'cd\n" target="�"/>
+      <replace source="\\'ce\n" target="�"/>
+      <replace source="\\'cf\n" target="�"/>
+      <replace source="\\'d0\n" target="�"/>
+      <replace source="\\'d1\n" target="�"/>
+      <replace source="\\'d2\n" target="�"/>
+      <replace source="\\'d3\n" target="�"/>
+      <replace source="\\'d4\n" target="�"/>
+      <replace source="\\'d5\n" target="�"/>
+      <replace source="\\'d6\n" target="�"/>
+      <replace source="\\'d8\n" target="�"/>
+      <replace source="\\'d9\n" target="�"/>
+      <replace source="\\'da\n" target="�"/>
+      <replace source="\\'db\n" target="�"/>
+      <replace source="\\'dc\n" target="�"/>
+      <replace source="\\'dd\n" target="�"/>
+      <replace source="\\'de\n" target="�"/>
+      <replace source="\\'df\n" target="�"/>
+      <replace source="\\'e0\n" target="�"/>
+      <replace source="\\'e1\n" target="�"/>
+      <replace source="\\'e2\n" target="�"/>
+      <replace source="\\'e3\n" target="�"/>
+      <replace source="\\'e4\n" target="�"/>
+      <replace source="\\'e5\n" target="�"/>
+      <replace source="\\'e6\n" target="�"/>
+      <replace source="\\'e7\n" target="�"/>
+      <replace source="\\'e8\n" target="�"/>
+      <replace source="\\'e9\n" target="�"/>
+      <replace source="\\'ea\n" target="�"/>
+      <replace source="\\'eb\n" target="�"/>
+      <replace source="\\'ec\n" target="�"/>
+      <replace source="\\'ed\n" target="�"/>
+      <replace source="\\'ee\n" target="�"/>
+      <replace source="\\'ef\n" target="�"/>
+      <replace source="\\'f0\n" target="�"/>
+      <replace source="\\'f1\n" target="�"/>
+      <replace source="\\'f2\n" target="�"/>
+      <replace source="\\'f3\n" target="�"/>
+      <replace source="\\'f4\n" target="�"/>
+      <replace source="\\'f5\n" target="�"/>
+      <replace source="\\'f6\n" target="�"/>
+      <replace source="\\'f8\n" target="�"/>
+      <replace source="\\'f9\n" target="�"/>
+      <replace source="\\'fa\n" target="�"/>
+      <replace source="\\'fb\n" target="�"/>
+      <replace source="\\'fc\n" target="�"/>
+      <replace source="\\'fd\n" target="�"/>
+      <replace source="\\'fe\n" target="�"/>
+      <replace source="\\'ff\n" target="�"/>
+      <!-- The same characters followed by a \r: -->
+      <replace source="\\'c0\r" target="�"/>
+      <replace source="\\'c1\r" target="�"/>
+      <replace source="\\'c2\r" target="�"/>
+      <replace source="\\'c3\r" target="�"/>
+      <replace source="\\'c4\r" target="�"/>
+      <replace source="\\'c5\r" target="�"/>
+      <replace source="\\'c6\r" target="�"/>
+      <replace source="\\'c7\r" target="�"/>
+      <replace source="\\'c8\r" target="�"/>
+      <replace source="\\'c9\r" target="�"/>
+      <replace source="\\'ca\r" target="�"/>
+      <replace source="\\'cb\r" target="�"/>
+      <replace source="\\'cc\r" target="�"/>
+      <replace source="\\'cd\r" target="�"/>
+      <replace source="\\'ce\r" target="�"/>
+      <replace source="\\'cf\r" target="�"/>
+      <replace source="\\'d0\r" target="�"/>
+      <replace source="\\'d1\r" target="�"/>
+      <replace source="\\'d2\r" target="�"/>
+      <replace source="\\'d3\r" target="�"/>
+      <replace source="\\'d4\r" target="�"/>
+      <replace source="\\'d5\r" target="�"/>
+      <replace source="\\'d6\r" target="�"/>
+      <replace source="\\'d8\r" target="�"/>
+      <replace source="\\'d9\r" target="�"/>
+      <replace source="\\'da\r" target="�"/>
+      <replace source="\\'db\r" target="�"/>
+      <replace source="\\'dc\r" target="�"/>
+      <replace source="\\'dd\r" target="�"/>
+      <replace source="\\'de\r" target="�"/>
+      <replace source="\\'df\r" target="�"/>
+      <replace source="\\'e0\r" target="�"/>
+      <replace source="\\'e1\r" target="�"/>
+      <replace source="\\'e2\r" target="�"/>
+      <replace source="\\'e3\r" target="�"/>
+      <replace source="\\'e4\r" target="�"/>
+      <replace source="\\'e5\r" target="�"/>
+      <replace source="\\'e6\r" target="�"/>
+      <replace source="\\'e7\r" target="�"/>
+      <replace source="\\'e8\r" target="�"/>
+      <replace source="\\'e9\r" target="�"/>
+      <replace source="\\'ea\r" target="�"/>
+      <replace source="\\'eb\r" target="�"/>
+      <replace source="\\'ec\r" target="�"/>
+      <replace source="\\'ed\r" target="�"/>
+      <replace source="\\'ee\r" target="�"/>
+      <replace source="\\'ef\r" target="�"/>
+      <replace source="\\'f0\r" target="�"/>
+      <replace source="\\'f1\r" target="�"/>
+      <replace source="\\'f2\r" target="�"/>
+      <replace source="\\'f3\r" target="�"/>
+      <replace source="\\'f4\r" target="�"/>
+      <replace source="\\'f5\r" target="�"/>
+      <replace source="\\'f6\r" target="�"/>
+      <replace source="\\'f8\r" target="�"/>
+      <replace source="\\'f9\r" target="�"/>
+      <replace source="\\'fa\r" target="�"/>
+      <replace source="\\'fb\r" target="�"/>
+      <replace source="\\'fc\r" target="�"/>
+      <replace source="\\'fd\r" target="�"/>
+      <replace source="\\'fe\r" target="�"/>
+      <replace source="\\'ff\r" target="�"/>
+      <!-- With UTF-8 -->
+      <replace source="\\u237" target="�"/>
+      <replace source="\\u243" target="�"/>
+    </replacement-rule>  
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/txt-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/txt-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/txt-format.xml	(revision 70339)
@@ -0,0 +1,18 @@
+<?xml version="1.0" encoding="ISO-8859-1"?>
+<format name="txt">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="''"/>
+    <escape-chars regexp='[][\\/@&lt;&gt;^${}]'/>
+    <space-chars regexp='[ \n\t\r~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    <format-rule type="empty" eos="yes" priority="1">
+      <tag regexp='(("\n\n")|("\r\n\r\n"))+'/>
+    </format-rule>
+  </rules>
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/xpresstag-format.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/xpresstag-format.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/xpresstag-format.xml	(revision 70339)
@@ -0,0 +1,34 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="xpresstag">
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="ISO-8859-1"/>
+    <output encoding="ISO-8859-1"/>
+    <tag-name regexp="[a-zA-Z]+"/>
+    <escape-chars regexp='[][^@\\/${}]'/>
+    <space-chars regexp='[ \n\t\r*&lt;&gt;~]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+
+    <format-rule type="empty" eos="yes" priority="1">
+      <tag regexp="&quot;&lt;&quot;[^-&gt;]+&quot;-&gt;&quot;"/>
+    </format-rule>
+    <format-rule type="empty" eos="no" priority="2">
+      <tag regexp="&quot;&lt;&quot;[^&gt;]+&quot;&gt;&quot;"/>
+    </format-rule>
+    
+    <format-rule type="empty" eos="yes" priority="3">
+      <tag regexp="&quot;@&quot;[^&lt;:]+&quot;:&quot;"/>
+    </format-rule>
+    <format-rule type="empty" eos="yes" priority="3">
+      <tag regexp="&quot;@&quot;[^&lt;=]+&quot;=&quot;"/>
+    </format-rule>
+
+    <format-rule type="empty" eos="yes" priority="3">
+      <tag
+regexp="&quot;@&quot;[^&lt;=]+&quot;=[&quot;[^]]+&quot;]&quot;"/>
+    </format-rule>
+  </rules>
+</format>
\ No newline at end of file
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-filter-ambiguity.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-filter-ambiguity.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-filter-ambiguity.1	(revision 70339)
@@ -0,0 +1,26 @@
+.TH apertium-filter-ambiguity 1 2006-03-21 "" ""
+.SH NAME
+apertium-filter-ambiguity \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-filter-ambiguity
+[input_file [output_file]]
+.PP
+.SH DESCRIPTION
+.BR apertium-filter-ambiguity 
+takes input from STDIN or input_file, gets tagger data, filters ambiguity 
+classes and outputs on STDOUT or output_file, in each case.
+.PP
+.SH SEE ALSO
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-deformat.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-deformat.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-deformat.1	(revision 70339)
@@ -0,0 +1,49 @@
+.TH apertium-gen-deformat 1 2006-03-21 "" ""
+.SH NAME
+apertium-gen-deformat \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-gen-deformat
+[
+.B \-a \fR| 
+.B \-A \fR|
+.B \-m \fR|
+.B \-M \fR
+] <input file> <output file>
+.PP
+.SH DESCRIPTION
+.BR apertium-gen-deformat 
+is a script which generates a C++ deformatter for a particular format. The
+deformatter reads in a format specification file in XML and outputs a C++ deformatter 
+using flex. 
+.SH OPTIONS
+.TP
+.B \-a
+Runs in apertium standard mode.
+.TP
+.B \-A, 
+Runs in apertium optimised mode (default)
+.TP
+.B \-m 
+Runs in matxin standard mode  (matxin is another open-source machine translation system: \fBhttp://www.sourceforge.org/matxin\fR)
+.TP
+.B \-M
+Runs in matxin optimised mode
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-gen-reformat\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-reformat.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-reformat.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-reformat.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-gen-reformat 1 2006-03-21 "" ""
+.SH NAME
+apertium-gen-reformat \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+architecture: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-gen-reformat
+[
+.B \-O \fR
+] <input file> <output file>
+.PP
+.SH DESCRIPTION
+.BR apertium-gen-reformat 
+is a script which generates a C++ reformatter for a particular format. The
+reformatter reads in a format file in XML and outputs a C++ reformatter 
+using flex.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-gen-deformat\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-multiple-translations.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-multiple-translations.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-multiple-translations.1	(revision 70339)
@@ -0,0 +1,43 @@
+.TH apertium-multiple-translations 1 2006-03-08 "" ""
+.SH NAME
+apertium-multiple-translations \- This application is part of (
+.B apertium
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-multiple-translations
+preproc biltrans [input [output]]
+.SH DESCRIPTION
+.BR apertium-multiple-translations 
+is the program that outputs multiple translations of certain words in a text according to the
+different possible translations of the words in the bilingual dictionary (in a dictionary
+that supports it).  The place to put this program in the modes.xml file is 
+just after apertium-pretransfer.
+.PP
+.RE
+.SH FILES
+These are the four files that can be used with this command:
+.B preproc    
+Result of preprocess trules file
+.PP
+.B biltrans   
+Bilingual letter transducer file
+.PP
+.B infile
+Input file (stdin by default).
+.PP
+.B outfile
+Output file (stdout by default).
+.PP
+.SH SEE ALSO
+.I apertium-transfer\fR(1),
+.I apertium \fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005--2008 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex-raw.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex-raw.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex-raw.1	(revision 70339)
@@ -0,0 +1,37 @@
+.TH apertium-postlatex-raw 1 2012-02-29 "" ""
+.SH NAME
+apertium-postlatex \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-postlatex-raw
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-postlatex-raw
+This filter generates LaTeX code from the output of apertium-relatex
+command. Non-ASCII characters are generated into its native encoding,
+depending on the locale of the running environment.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-deslatex\fR(1),
+.I apertium-prelatex\fR(1),
+.I apertium-relatex\fR(1),
+.I apertium-postlatex-raw\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated constructions in LaTeX (i.e. custom defined tags) are not (yet)
+supported.
+.PP
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postlatex.1	(revision 70339)
@@ -0,0 +1,37 @@
+.TH apertium-postlatex 1 2012-02-29 "" ""
+.SH NAME
+apertium-postlatex \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-postlatex
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-postlatex
+This filter generates LaTeX code from the output of apertium-relatex
+command. Non-ASCII characters are transformed to ASCII-compatible LaTeX construction
+rather than natively-encoded characters.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-deslatex\fR(1),
+.I apertium-prelatex\fR(1),
+.I apertium-relatex\fR(1),
+.I apertium-postlatex\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated constructions in LaTeX (i.e. custom defined tags) are not (yet)
+supported.
+.PP
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-prelatex.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-prelatex.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-prelatex.1	(revision 70339)
@@ -0,0 +1,37 @@
+.TH apertium-prelatex 1 2012-02-29 "" ""
+.SH NAME
+apertium-prelatex \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-prelatex
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-prelatex
+This filter preprocess LaTeX as input transforming it into a deformatted 'XMLish'
+LaTeX custom format. The output suitable for preprocess with
+apertium-deslatex deformatter.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-deslatex\fR(1),
+.I apertium-postlatex\fR(1),
+.I apertium-relatex\fR(1),
+.I apertium-postlatex-raw\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated constructions in LaTeX (i.e. custom defined tags) are not (yet)
+supported.
+.PP
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-preprocess-transfer.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-preprocess-transfer.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-preprocess-transfer.1	(revision 70339)
@@ -0,0 +1,37 @@
+.TH apertium-preprocess-transfer 1 2006-03-08 "" ""
+.SH NAME
+apertium-preprocess-transfer \- This application is part of (
+.B apertium
+)
+.PP
+This tool is part of the open-source apertium machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-preprocess-transfer
+rules_file transfer_file
+.SH DESCRIPTION
+.BR apertium-preprocess-transfer 
+is a structural transfer preprocessor which reads in a structural transfer 
+rule file and generates a file with precompiled patterns and indexes to the 
+actions of the rules of the structural transfer module specification.
+.PP
+.RE
+.SH FILES
+These are the two files that can be used with this command:
+.PP
+.B rules_file
+File with structural transfer rules
+.PP
+.B transfer_file
+File with precompiled patterns
+.PP
+.SH SEE ALSO
+.I apertium\fR(1),
+.I apertium-transfer\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rehtml.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rehtml.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rehtml.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-rehtml 1 2006-03-21 "" ""
+.SH NAME
+apertium-rehtml \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-rehtml
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-rehtml 
+is an HTML format processor. It restores the original  HTML formatting
+the text had before being passed through the apertium-deshtml deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-relatex.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-relatex.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-relatex.1	(revision 70339)
@@ -0,0 +1,37 @@
+.TH apertium-relatex 1 2012-02-29 "" ""
+.SH NAME
+apertium-relatex \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-relatex
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-relatex
+This filter preprocess apertium generator output and removes superblanks
+marks to do subsequent processing in apertium pipeline.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-prelatex\fR(1),
+.I apertium-postlatex\fR(1),
+.I apertium-desatex\fR(1),
+.I apertium-postlatex-raw\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated constructions in LaTeX (i.e. custom defined tags) are not (yet)
+supported.
+.PP
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-remediawiki.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-remediawiki.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-remediawiki.1	(revision 70339)
@@ -0,0 +1,35 @@
+.TH apertium-retxt 1 2006-03-21 "" ""
+.SH NAME
+apertium-remediawiki \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-retxt
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-retxt 
+is a mediawiki format processor. It restores the original formatting
+the text had (newlines, tabs, etc.) before being passed through the apertium-desmediawiki deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rehtml\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-reodt.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-reodt.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-reodt.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-reodt 1 2006-03-21 "" ""
+.SH NAME
+apertium-reodt \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-reodt
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-reodt 
+is an ODT format processor. It restores the original  ODT formatting
+the text had before being passed through the apertium-desodt deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-repptx.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-repptx.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-repptx.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-repptx 1 2006-03-21 "" ""
+.SH NAME
+apertium-repptx \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-repptx
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-repptx 
+is an PPTXX format processor. It restores the original PPTX formatting
+the text had before being passed through the apertium-despptx deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf-cp1250.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf-cp1250.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf-cp1250.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-rertf 1 2006-03-21 "" ""
+.SH NAME
+apertium-rertf \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-rertf
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-rertf 
+is an RTF format processor. It restores the original RTF formatting
+the text had before being passed through the apertium-desrtf deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rehtml\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf-cp1251.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf-cp1251.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf-cp1251.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-rertf 1 2006-03-21 "" ""
+.SH NAME
+apertium-rertf \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-rertf
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-rertf 
+is an RTF format processor. It restores the original RTF formatting
+the text had before being passed through the apertium-desrtf deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rehtml\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rertf.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-rertf 1 2006-03-21 "" ""
+.SH NAME
+apertium-rertf \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-rertf
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-rertf 
+is an RTF format processor. It restores the original RTF formatting
+the text had before being passed through the apertium-desrtf deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rehtml\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-retxt.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-retxt.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-retxt.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-retxt 1 2006-03-21 "" ""
+.SH NAME
+apertium-retxt \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-retxt
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-retxt 
+is a text format processor. It restores the original formatting
+the text had (newlines, tabs, etc.) before being passed through the apertium-destxt deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-rehtml\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rewxml.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rewxml.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rewxml.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-rewxml 1 2006-03-21 "" ""
+.SH NAME
+apertium-rewxml \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-rewxml
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-rewxml 
+is an WXML format processor. It restores the original WXML formatting
+the text had before being passed through the apertium-deswxml deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rexlsx.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rexlsx.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-rexlsx.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium-rexlsx 1 2006-03-21 "" ""
+.SH NAME
+apertium-rexlsx \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-rexlsx
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-rexlsx 
+is an XLSX format processor. It restores the original XLSX formatting
+the text had before being passed through the apertium-desxlsx deformatter.
+
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-retxt\fR(1),
+.I apertium-rertf\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-utils-fixlatex.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-utils-fixlatex.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-utils-fixlatex.1	(revision 70339)
@@ -0,0 +1,38 @@
+.TH apertium-utils-fixlatex 1 2012-02-29 "" ""
+.SH NAME
+apertium-utils-fixlatex \- This application is part of (
+.B apertium 
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-utils-fixlatex
+[ <input file> [ <output file> ] ]
+.PP
+.SH DESCRIPTION
+.BR apertium-utils-fixlatex
+gawk-based script to fix some constructions in 'XMLish' apertium LaTeX
+format to get better translation results.
+.SH OPTIONS
+.TP
+.B \-h, \-\-help
+Display this help.
+.PP
+.SH SEE ALSO
+.I apertium-destxt\fR(1),
+.I apertium-prelatex\fR(1),
+.I apertium-relatex\fR(1),
+.I apertium-postlatex\fR(1),
+.I apertium-desatex\fR(1),
+.I apertium-postlatex-raw\fR(1),
+.I lt-proc\fR(1),
+.I apertium\fR(1).
+.SH BUGS
+Complicated constructions in LaTeX (i.e. custom defined tags) are not (yet)
+supported.
+.PP
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-unformat-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-unformat-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-unformat-header.sh	(revision 70339)
@@ -0,0 +1,229 @@
+PAIR=""
+INPUT_FILE="/dev/stdin"
+OUTPUT_FILE="/dev/stdout"
+
+[ -z "$TMPDIR" ] && TMPDIR=/tmp
+
+
+message ()
+{
+  echo "USAGE: $(basename $0) [-f format] [in [out]]"
+  echo " -f format        one of: txt (default), html, rtf, odt, docx, wxml, xlsx, pptx"
+  echo " in               input file (stdin by default)"
+  echo " out              output file (stdout by default)"
+  exit 1;
+}
+
+locale_utf8 ()
+{
+  export LC_CTYPE=$(locale -a|grep -i "utf[.]*8"|head -1);
+  if [ "$LC_CTYPE" = "" ]
+  then echo "Error: Install an UTF-8 locale in your system";
+       exit 1;
+  fi
+}
+
+test_zip ()
+{
+ if [ "$(which zip)" = "" ]
+  then echo "Error: Install 'zip' command in your system";
+       exit 1;
+  fi
+  
+  if [ "$(which unzip)" = "" ]
+  then echo "Error: Install 'unzip' command in your system";
+       exit 1;
+  fi 
+}
+
+test_gawk ()
+{
+  GAWK=$(which gawk)
+  if [ "$GAWK" = "" ]
+  then echo "Error: Install 'gawk' in your system"
+       exit 1
+  fi
+}
+
+
+unformat_latex()
+{
+  test_gawk
+  
+  if [ "$FICHERO" = "" ]
+  then FICHERO=$(mktemp $TMPDIR/apertium.XXXXXXXX)
+       cat > $FICHERO
+       BORRAFICHERO="true"
+  fi
+
+  $APERTIUM_PATH/apertium-prelatex $FICHERO | \
+  $APERTIUM_PATH/apertium-utils-fixlatex | \
+  $APERTIUM_PATH/apertium-deslatex  >$SALIDA
+  
+  if [ "$BORRAFICHERO" = "true" ]
+  then rm -Rf $FICHERO
+  fi
+}
+
+
+unformat_odt ()
+{
+  INPUT_TMPDIR=$(mktemp -d $TMPDIR/apertium.XXXXXXXX)
+
+  locale_utf8
+  test_zip
+  
+  unzip -q -o -d $INPUT_TMPDIR $FICHERO
+  find $INPUT_TMPDIR | grep content\\\.xml |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  $APERTIUM_PATH/apertium-desodt >$SALIDA
+  rm -Rf $INPUT_TMPDIR
+}
+
+unformat_docx ()
+{
+  INPUT_TMPDIR=$(mktemp -d $TMPDIR/apertium.XXXXXXXX)
+
+  locale_utf8
+  test_zip
+  
+  unzip -q -o -d $INPUT_TMPDIR $FICHERO
+  
+  for i in $(find $INPUT_TMPDIR|grep "xlsx$");
+  do LOCALTEMP=$(mktemp $TMPDIR/apertium.XXXXXXXX)
+     $APERTIUM_PATH/apertium -f xlsx -d $DIRECTORY $OPCIONU $PREFIJO <$i >$LOCALTEMP;
+     cp $LOCALTEMP $i;
+     rm $LOCALTEMP;
+  done;
+  
+  find $INPUT_TMPDIR | grep "xml" |\
+  grep -v -i \\\(settings\\\|theme\\\|styles\\\|font\\\|rels\\\|docProps\\\) |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  $APERTIUM_PATH/apertium-deswxml >$SALIDA
+  rm -Rf $INPUT_TMPDIR
+}
+
+unformat_pptx ()
+{
+  INPUT_TMPDIR=$(mktemp -d $TMPDIR/apertium.XXXXXXXX)
+
+  locale_utf8
+  test_zip
+    
+  unzip -q -o -d $INPUT_TMPDIR $FICHERO
+  
+  for i in $(find $INPUT_TMPDIR|grep "xlsx$");
+  do LOCALTEMP=$(mktemp $TMPDIR/apertium.XXXXXXXX)
+     $APERTIUM_PATH/apertium -f xlsx -d $DIRECTORY $OPCIONU $PREFIJO <$i >$LOCALTEMP
+     cp $LOCALTEMP $i
+     rm $LOCALTEMP
+  done;
+  
+  find $INPUT_TMPDIR | grep "xml$" |\
+  grep "slides\/slide" |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  $APERTIUM_PATH/apertium-despptx >$SALIDA
+  rm -Rf $INPUT_TMPDIR
+}
+
+
+unformat_xlsx ()
+{
+  INPUT_TMPDIR=$(mktemp -d $TMPDIR/apertium.XXXXXXXX)
+
+  locale_utf8
+  test_zip
+  
+  unzip -q -o -d $INPUT_TMPDIR $FICHERO
+  find $INPUT_TMPDIR | grep "sharedStrings.xml" |\
+  awk '{printf "<file name=\"" $0 "\"/>"; PART = $0; while(getline < PART) printf(" %s", $0); printf("\n");}' |\
+  $APERTIUM_PATH/apertium-desxlsx >$SALIDA
+  rm -Rf $INPUT_TMPDIR
+
+}
+
+
+ARGS=$(getopt "f:" $*)
+set -- $ARGS
+for i
+do
+  case "$i" in 
+    -f) shift; FORMAT=$1; shift;;
+    --) shift; break;;
+  esac
+done
+
+case "$#" in 
+     2)
+       OUTPUT_FILE=$2; 
+       INPUT_FILE=$1;
+       if [ ! -e $INPUT_FILE ];
+       then echo "Error: file '$INPUT_FILE' not found."
+            message;
+       fi
+       ;;
+     1)
+       INPUT_FILE=$1;
+       if [ ! -e $INPUT_FILE ];
+       then echo "Error: file '$INPUT_FILE' not found."
+            message;
+       fi
+       ;;
+     0)
+       ;;
+     *)
+       message 
+       ;;
+esac    
+
+if [ x$FORMAT = x ]; then FORMAT="txt"; fi
+
+FORMATADOR=$FORMAT;
+FICHERO=$INPUT_FILE;
+SALIDA=$OUTPUT_FILE;
+
+
+case "$FORMATADOR" in 
+        rtf)
+		MILOCALE=$(locale -a|grep -i -v "utf\|^C$\|^POSIX$"|head -1);
+		if [ "$MILOCALE" = "" ]
+		then echo "Error: Install a ISO-8859-1 compatible locale in your system";
+	             exit 1;
+	        fi
+	        export LC_CTYPE=$MILOCALE
+		;;
+        html-noent)
+        	FORMATADOR="html"
+        	;;
+        
+        latex)
+                unformat_latex
+                exit 0
+                ;;
+                
+        odt)
+		unformat_odt
+		exit 0
+		;;
+	docx)
+		unformat_docx
+		exit 0
+		;;
+	xlsx)
+		unformat_xlsx
+		exit 0
+		;;
+	pptx)
+		unformat_pptx
+		exit 0
+		;;
+		
+	wxml)
+	        locale_utf8
+	        ;;
+	*)
+	        ;;
+	        	
+esac
+
+$APERTIUM_PATH/apertium-des$FORMATADOR $FICHERO >$SALIDA
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/utils-fixlatex-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/utils-fixlatex-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/utils-fixlatex-header.sh	(revision 70339)
@@ -0,0 +1,52 @@
+INPUT_FILE=/dev/stdin
+OUTPUT_FILE=/dev/stdout
+
+cat $INPUT_FILE | \
+gawk '
+function is_inline_tag(str,                      aux, val)
+{
+  for(val in INLINETAGS)
+  {
+    aux = INLINETAGS[val] "<CONTENTS>";
+    if(gsub(aux, aux, str) == 1)
+    {
+      return 1;
+    }
+  }
+  
+  return 0;
+}
+
+BEGIN{
+  RS="</CONTENTS>";  
+  
+  INLINETAGS[1]="<textit/>";
+  INLINETAGS[2]="<textbf/>";
+  INLINETAGS[3]="<emph/>";
+}
+{
+  MYRECORD[++nline] = $0;  
+}
+END{
+  for(i=1; i < nline; i++)
+  {
+    if(gsub("<CONTENTS>", "<CONTENTS>", MYRECORD[i]) == 1)
+    {
+      if(is_inline_tag(MYRECORD[i]))
+      {
+        printf("%s</CONTENTS-noeos>", MYRECORD[i]);
+      }
+      else
+      {
+        printf("%s</CONTENTS>", MYRECORD[i]);
+      }
+    } 
+    else
+    {
+      printf("%s</CONTENTS>", MYRECORD[i]);
+    }
+  }
+  
+  printf("%s", MYRECORD[nline]);
+}' > $OUTPUT_FILE
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-interchunk.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-interchunk.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-interchunk.1	(revision 70339)
@@ -0,0 +1,54 @@
+.TH apertium\-interchunk 1 2007-03-11 "" ""
+.SH NAME
+apertium\-interchunk \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-interchunk 
+[\-tz] trules preproc [input [output]]
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It is the second transfer module of the Apertium level 2 transfer model after
+\fIapertium-transfer\fR and before \fIapertium-postchunk\fR.
+.PP
+It takes care of interchunk processing operations such as chunk
+reordering, changes in the morphosyntactical features of chunks
+according to the information in neighboring chunks, or generating new
+chunks.
+.SH OPTIONS
+  \-t         trace mode
+  \-z         flush buffer on the null character
+.SH FILES
+These are the kinds of files that can be used with this command:
+.PP
+.B trules
+A rules file with extension \fI.t2x\fR.
+.PP
+.B preproc
+A file with extension \fI.t2x.bin\fR that holds the result of
+preprocessing the \fItrules\fR file with
+\fIapertium-preprocess-transfer\fR.
+.PP
+.B input, output
+Represent the input and output files. By default they are the standard
+input and standard output.
+.SH SEE ALSO
+.I apertium\-gen\-modes\fR(1),
+.I apertium\-postchunk\fR(1),
+.I apertium\-transfer\fR(1),
+.I apertium\-validate\-interchunk\fR(1),
+.I apertium\-validate\-modes\fR(1),
+.I apertium\-validate\-postchunk\fR(1).
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005-2007 Universitat d'Alacant / Universidad de
+Alicante. This is free software.  You may
+redistribute copies of it under the terms of the GNU General Public
+License <http://www.gnu.org/licenses/gpl.html>.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postchunk.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postchunk.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-postchunk.1	(revision 70339)
@@ -0,0 +1,52 @@
+.TH apertium\-postchunk 1 2007-03-11 "" ""
+.SH NAME
+apertium\-postchunk \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-postchunk 
+[\-z] trules preproc [input [output]]
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It is the third transfer module of the Apertium level 2 transfer model
+after \fIapertium-transfer\fR and \fIapertium-interchunk\fR.
+.PP
+It generates lexical forms from the chunks generated by
+apertium-interchunk by effecting some finishing changes in their
+morphological information.
+.SH OPTIONS
+\-z         flush buffer on the null character
+.SH FILES
+These are the kinds of files that can be used with this command:
+.PP
+.B trules
+A rules file with extension \fI.t3x\fR.
+.PP
+.B preproc
+A file with extension \fI.t3x.bin\fR that holds the result of
+preprocessing the \fItrules\fR file with
+\fIapertium-preprocess-transfer\fR.
+.PP
+.B input, output
+Represent the input and output files. By default they are the standard
+input and standard output.
+.SH SEE ALSO
+.I apertium\-gen\-modes\fR(1),
+.I apertium\-interchunk\fR(1),
+.I apertium\-validate\-postchunk\fR(1),
+.I apertium\-validate\-interchunk\fR(1),
+.I apertium\-validate\-modes\fR(1),
+.I apertium\-transfer\fR(1).
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005-2007 Universitat d'Alacant / Universidad de
+Alicante. This is free software.  You may
+redistribute copies of it under the terms of the GNU General Public
+License <http://www.gnu.org/licenses/gpl.html>.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_config.h.cmake_in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_config.h.cmake_in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium_config.h.cmake_in	(revision 70339)
@@ -0,0 +1,57 @@
+/* Define to the address where bug reports for this package should be sent. */
+#define PACKAGE_BUGREPORT "${PACKAGE_BUGREPORT}"
+
+/* Define to the full name of this package. */
+#define PACKAGE_NAME "${PACKAGE_NAME}"
+
+/* Define to the full name and version of this package. */
+#define PACKAGE_STRING "${PACKAGE_STRING}"
+
+/* Define to the one symbol short name of this package. */
+#define PACKAGE_TARNAME "${PACKAGE_TARNAME}"
+
+/* Define to the version of this package. */
+#define PACKAGE_VERSION "${PACKAGE_VERSION}"
+
+#define HAVE_DECL_FPUTS_UNLOCKED   ${HAVE_DECL_FPUTS_UNLOCKED}
+#define HAVE_DECL_FGETC_UNLOCKED   ${HAVE_DECL_FGETC_UNLOCKED}
+#define HAVE_DECL_FPUTC_UNLOCKED   ${HAVE_DECL_FPUTC_UNLOCKED}
+#define HAVE_DECL_FWRITE_UNLOCKED  ${HAVE_DECL_FWRITE_UNLOCKED}
+#define HAVE_DECL_FREAD_UNLOCKED   ${HAVE_DECL_FREAD_UNLOCKED}
+#define HAVE_DECL_FGETWC_UNLOCKED  ${HAVE_DECL_FGETWC_UNLOCKED}
+#define HAVE_DECL_FPUTWC_UNLOCKED  ${HAVE_DECL_FPUTWC_UNLOCKED}
+#define HAVE_DECL_FPUTWS_UNLOCKED  ${HAVE_DECL_FPUTWS_UNLOCKED}
+
+#define HAVE_DECL_FPUTS_NOLOCK   ${HAVE_DECL_FPUTS_NOLOCK}
+#define HAVE_DECL_FGETC_NOLOCK   ${HAVE_DECL_FGETC_NOLOCK}
+#define HAVE_DECL_FPUTC_NOLOCK   ${HAVE_DECL_FPUTC_NOLOCK}
+#define HAVE_DECL_FWRITE_NOLOCK  ${HAVE_DECL_FWRITE_NOLOCK}
+#define HAVE_DECL_FREAD_NOLOCK   ${HAVE_DECL_FREAD_NOLOCK}
+#define HAVE_DECL_FGETWC_NOLOCK  ${HAVE_DECL_FGETWC_NOLOCK}
+#define HAVE_DECL_FPUTWC_NOLOCK  ${HAVE_DECL_FPUTWC_NOLOCK}
+#define HAVE_DECL_FPUTWS_NOLOCK  ${HAVE_DECL_FPUTWS_NOLOCK}
+
+#if !defined(HAVE_DECL_FPUTS_UNLOCKED) && defined (HAVE_DECL_FPUTS_NOLOCK)
+#define fputs_unlocked _fputs_nolock
+#endif
+#if !defined(HAVE_DECL_FGETC_UNLOCKED) && defined (HAVE_DECL_FGETC_NOLOCK)
+#define fgetc_unlocked _fgetc_nolock
+#endif
+#if !defined(HAVE_DECL_FPUTC_UNLOCKED) && defined (HAVE_DECL_FPUTC_NOLOCK)
+#define fputc_unlocked _fputc_nolock
+#endif
+#if !defined(HAVE_DECL_FWRITE_UNLOCKED) && defined (HAVE_DECL_FWRITE_NOLOCK)
+#define fwrite_unlocked _fwrite_nolock
+#endif
+#if !defined(HAVE_DECL_FREAD_UNLOCKED) && defined (HAVE_DECL_FREAD_NOLOCK)
+#define fread_unlocked _fread_nolock
+#endif
+#if !defined(HAVE_DECL_FPUTWS_UNLOCKED) && defined (HAVE_DECL_FPUTWS_NOLOCK)
+#define fputws_unlocked _fputws_nolock
+#endif
+#if !defined(HAVE_DECL_FGETWC_UNLOCKED) && defined (HAVE_DECL_FGETWC_NOLOCK)
+#define fgetwc_unlocked _fgetwc_nolock
+#endif
+#if !defined(HAVE_DECL_FPUTWC_UNLOCKED) && defined (HAVE_DECL_FPUTWC_NOLOCK)
+#define fputwc_unlocked _fputwc_nolock
+#endif
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format-cp1250.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format-cp1250.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format-cp1250.xml	(revision 70339)
@@ -0,0 +1,532 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="rtf"> <!-- version 1.0 -->
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="windows-1250"/>
+    <output encoding="UTF-8"/>
+    <tag-name regexp=""/>
+    <escape-chars regexp='\\|[][&lt;&gt;@^$/{}]'/> 
+<!--    <escape-chars regexp='[]]^@&lt;&gt;/]'/>  -->
+
+    <space-chars regexp='[ \n\t\r$*]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    
+    <!-- Exceptions with priority 1  -->
+    <!-- Style Sheet names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\snext&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\keycode&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- Font names are also format: -->
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fcharset&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule>
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fnil&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\froman&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fswiss&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fmodern&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fscript&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fdecor&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\ftech&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fbidi&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\falt&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fontfile&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fn&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sbasedon&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\additive&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- File names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\file&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- List Table names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\listname&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\leveltext&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\levelnumbers&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- Pictures are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\pict&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sn&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sv&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;{\\\*\\blipuid  &quot;[^ \n\r]+&quot;}&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Objects are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\object&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Document Variables are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\docvar&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Bookmarks are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\bkmkstart&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\bkmkend&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Index Entries are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\rxe&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Fields are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fldinst&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fldrslt&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Other format tags which contain #CDATA: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\pntxt&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\colortbl&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Hexadecimal Data -->
+    <format-rule type="empty" eos="yes" priority="1">
+      <tag regexp="[a-f0-9]{20,}" />
+    </format-rule>
+    
+    
+    
+    
+
+    <!-- End of sentence tags: par, row, cell -->
+    <format-rule type="empty" eos="yes" priority="2">
+      <tag regexp="&quot;\\par&quot;|&quot;\\row&quot;|&quot;\\cell&quot;" />
+    </format-rule>
+    
+
+    <format-rule type="open" eos="no" priority="3">
+      <tag regexp="&quot;{&quot;[ \n\r]*\\[^'][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+
+    <!-- General Tags Specification -->
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\[^'][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+    <format-rule type="close" eos="no" priority="4">
+      <tag regexp="&quot;}&quot;"/>
+    </format-rule>
+    <format-rule type="open" eos="no" priority="4">
+      <tag regexp="&quot;{&quot;"/>
+    </format-rule>
+
+
+    <replacement-rule regexp="&quot;\\'&quot;[0-9a-fA-F][0-9a-fA-F](\r|\n|&quot;\r\n&quot;)?"> 
+      <replace source="\\'8a" target="Š" prefer="yes"/>
+      <replace source="\\'8c" target="Ś" prefer="yes"/>
+      <replace source="\\'8d" target="Ť" prefer="yes"/>
+      <replace source="\\'8e" target="Ž" prefer="yes"/>
+      <replace source="\\'8f" target="Ź" prefer="yes"/>
+      <replace source="\\'9a" target="š" prefer="yes"/>
+      <replace source="\\'9c" target="ś" prefer="yes"/>
+      <replace source="\\'9d" target="ť" prefer="yes"/>
+      <replace source="\\'9e" target="ž" prefer="yes"/>
+      <replace source="\\'9f" target="ź" prefer="yes"/>
+      <replace source="\\'a3" target="Ł" prefer="yes"/>
+      <replace source="\\'a5" target="Ą" prefer="yes"/>
+      <replace source="\\'aa" target="Ş" prefer="yes"/>
+      <replace source="\\'af" target="Ż" prefer="yes"/>
+      <replace source="\\'b3" target="ł" prefer="yes"/>
+      <replace source="\\'b5" target="µ" prefer="yes"/>
+      <replace source="\\'b9" target="ą" prefer="yes"/>
+      <replace source="\\'ba" target="ş" prefer="yes"/>
+      <replace source="\\'bc" target="Ľ" prefer="yes"/>
+      <replace source="\\'be" target="ľ" prefer="yes"/>
+      <replace source="\\'bf" target="ż" prefer="yes"/>
+      <replace source="\\'c0" target="Ŕ" prefer="yes"/>
+      <replace source="\\'c1" target="Á" prefer="yes"/>
+      <replace source="\\'c2" target="Â" prefer="yes"/>
+      <replace source="\\'c3" target="Ă" prefer="yes"/>
+      <replace source="\\'c4" target="Ä" prefer="yes"/>
+      <replace source="\\'c5" target="Ĺ" prefer="yes"/>
+      <replace source="\\'c6" target="Ć" prefer="yes"/>
+      <replace source="\\'c7" target="Ç" prefer="yes"/>
+      <replace source="\\'c8" target="Č" prefer="yes"/>
+      <replace source="\\'c9" target="É" prefer="yes"/>
+      <replace source="\\'ca" target="Ę" prefer="yes"/>
+      <replace source="\\'cb" target="Ë" prefer="yes"/>
+      <replace source="\\'cc" target="Ě" prefer="yes"/>
+      <replace source="\\'cd" target="Í" prefer="yes"/>
+      <replace source="\\'ce" target="Î" prefer="yes"/>
+      <replace source="\\'cf" target="Ď" prefer="yes"/>
+      <replace source="\\'d0" target="Ð" prefer="yes"/>
+      <replace source="\\'d1" target="Ń" prefer="yes"/>
+      <replace source="\\'d2" target="Ň" prefer="yes"/>
+      <replace source="\\'d3" target="Ó" prefer="yes"/>
+      <replace source="\\'d4" target="Ô" prefer="yes"/>
+      <replace source="\\'d5" target="Ő" prefer="yes"/>
+      <replace source="\\'d6" target="Ö" prefer="yes"/>
+      <replace source="\\'d8" target="Ř" prefer="yes"/>
+      <replace source="\\'d9" target="Ů" prefer="yes"/>
+      <replace source="\\'da" target="Ú" prefer="yes"/>
+      <replace source="\\'db" target="Ű" prefer="yes"/>
+      <replace source="\\'dc" target="Ü" prefer="yes"/>
+      <replace source="\\'dd" target="Ý" prefer="yes"/>
+      <replace source="\\'de" target="Ţ" prefer="yes"/>
+      <replace source="\\'df" target="ß" prefer="yes"/>
+      <replace source="\\'e0" target="ŕ" prefer="yes"/>
+      <replace source="\\'e1" target="á" prefer="yes"/>
+      <replace source="\\'e2" target="â" prefer="yes"/>
+      <replace source="\\'e3" target="ă" prefer="yes"/>
+      <replace source="\\'e4" target="ä" prefer="yes"/>
+      <replace source="\\'e5" target="ĺ" prefer="yes"/>
+      <replace source="\\'e6" target="ć" prefer="yes"/>
+      <replace source="\\'e7" target="ç" prefer="yes"/>
+      <replace source="\\'e8" target="č" prefer="yes"/>
+      <replace source="\\'e9" target="é" prefer="yes"/>
+      <replace source="\\'ea" target="ę" prefer="yes"/>
+      <replace source="\\'eb" target="ë" prefer="yes"/>
+      <replace source="\\'ec" target="ě" prefer="yes"/>
+      <replace source="\\'ed" target="í" prefer="yes"/>
+      <replace source="\\'ee" target="î" prefer="yes"/>
+      <replace source="\\'ef" target="ď" prefer="yes"/>
+      <replace source="\\'f0" target="đ" prefer="yes"/>
+      <replace source="\\'f1" target="ń" prefer="yes"/>
+      <replace source="\\'f2" target="ň" prefer="yes"/>
+      <replace source="\\'f3" target="ó" prefer="yes"/>
+      <replace source="\\'f4" target="ô" prefer="yes"/>
+      <replace source="\\'f5" target="ő" prefer="yes"/>
+      <replace source="\\'f6" target="ö" prefer="yes"/>
+      <replace source="\\'f8" target="ř" prefer="yes"/>
+      <replace source="\\'f9" target="ů" prefer="yes"/>
+      <replace source="\\'fa" target="ú" prefer="yes"/>
+      <replace source="\\'fb" target="ű" prefer="yes"/>
+      <replace source="\\'fc" target="ü" prefer="yes"/>
+      <replace source="\\'fd" target="ý" prefer="yes"/>
+      <replace source="\\'fe" target="ţ" prefer="yes"/>
+      <replace source="\\'ff" target="˙" prefer="yes"/>
+      
+     <!-- The same characters followed by a \r\n: -->
+      <replace source="\\'8a\r\n" target="Š"/>
+      <replace source="\\'8c\r\n" target="Ś"/>
+      <replace source="\\'8d\r\n" target="Ť"/>
+      <replace source="\\'8e\r\n" target="Ž"/>
+      <replace source="\\'8f\r\n" target="Ź"/>
+      <replace source="\\'9a\r\n" target="š"/>
+      <replace source="\\'9c\r\n" target="ś"/>
+      <replace source="\\'9d\r\n" target="ť"/>
+      <replace source="\\'9e\r\n" target="ž"/>
+      <replace source="\\'9f\r\n" target="ź"/>
+      <replace source="\\'a3\r\n" target="Ł"/>
+      <replace source="\\'a5\r\n" target="Ą"/>
+      <replace source="\\'aa\r\n" target="Ş"/>
+      <replace source="\\'af\r\n" target="Ż"/>
+      <replace source="\\'b3\r\n" target="ł"/>
+      <replace source="\\'b5\r\n" target="µ"/>
+      <replace source="\\'b9\r\n" target="ą"/>
+      <replace source="\\'ba\r\n" target="ş"/>
+      <replace source="\\'bc\r\n" target="Ľ"/>
+      <replace source="\\'be\r\n" target="ľ"/>
+      <replace source="\\'bf\r\n" target="ż"/>
+      <replace source="\\'c0\r\n" target="Ŕ"/>
+      <replace source="\\'c1\r\n" target="Á"/>
+      <replace source="\\'c2\r\n" target="Â"/>
+      <replace source="\\'c3\r\n" target="Ă"/>
+      <replace source="\\'c4\r\n" target="Ä"/>
+      <replace source="\\'c5\r\n" target="Ĺ"/>
+      <replace source="\\'c6\r\n" target="Ć"/>
+      <replace source="\\'c7\r\n" target="Ç"/>
+      <replace source="\\'c8\r\n" target="Č"/>
+      <replace source="\\'c9\r\n" target="É"/>
+      <replace source="\\'ca\r\n" target="Ę"/>
+      <replace source="\\'cb\r\n" target="Ë"/>
+      <replace source="\\'cc\r\n" target="Ě"/>
+      <replace source="\\'cd\r\n" target="Í"/>
+      <replace source="\\'ce\r\n" target="Î"/>
+      <replace source="\\'cf\r\n" target="Ď"/>
+      <replace source="\\'d0\r\n" target="Ð"/>
+      <replace source="\\'d1\r\n" target="Ń"/>
+      <replace source="\\'d2\r\n" target="Ň"/>
+      <replace source="\\'d3\r\n" target="Ó"/>
+      <replace source="\\'d4\r\n" target="Ô"/>
+      <replace source="\\'d5\r\n" target="Ő"/>
+      <replace source="\\'d6\r\n" target="Ö"/>
+      <replace source="\\'d8\r\n" target="Ř"/>
+      <replace source="\\'d9\r\n" target="Ů"/>
+      <replace source="\\'da\r\n" target="Ú"/>
+      <replace source="\\'db\r\n" target="Ű"/>
+      <replace source="\\'dc\r\n" target="Ü"/>
+      <replace source="\\'dd\r\n" target="Ý"/>
+      <replace source="\\'de\r\n" target="Ţ"/>
+      <replace source="\\'df\r\n" target="ß"/>
+      <replace source="\\'e0\r\n" target="ŕ"/>
+      <replace source="\\'e1\r\n" target="á"/>
+      <replace source="\\'e2\r\n" target="â"/>
+      <replace source="\\'e3\r\n" target="ă"/>
+      <replace source="\\'e4\r\n" target="ä"/>
+      <replace source="\\'e5\r\n" target="ĺ"/>
+      <replace source="\\'e6\r\n" target="ć"/>
+      <replace source="\\'e7\r\n" target="ç"/>
+      <replace source="\\'e8\r\n" target="č"/>
+      <replace source="\\'e9\r\n" target="é"/>
+      <replace source="\\'ea\r\n" target="ę"/>
+      <replace source="\\'eb\r\n" target="ë"/>
+      <replace source="\\'ec\r\n" target="ě"/>
+      <replace source="\\'ed\r\n" target="í"/>
+      <replace source="\\'ee\r\n" target="î"/>
+      <replace source="\\'ef\r\n" target="ď"/>
+      <replace source="\\'f0\r\n" target="đ"/>
+      <replace source="\\'f1\r\n" target="ń"/>
+      <replace source="\\'f2\r\n" target="ň"/>
+      <replace source="\\'f3\r\n" target="ó"/>
+      <replace source="\\'f4\r\n" target="ô"/>
+      <replace source="\\'f5\r\n" target="ő"/>
+      <replace source="\\'f6\r\n" target="ö"/>
+      <replace source="\\'f8\r\n" target="ř"/>
+      <replace source="\\'f9\r\n" target="ů"/>
+      <replace source="\\'fa\r\n" target="ú"/>
+      <replace source="\\'fb\r\n" target="ű"/>
+      <replace source="\\'fc\r\n" target="ü"/>
+      <replace source="\\'fd\r\n" target="ý"/>
+      <replace source="\\'fe\r\n" target="ţ"/>
+      <replace source="\\'ff\r\n" target="˙"/>
+      <!-- The same characters followed by a \n: -->
+      <replace source="\\'8a\n" target="Š"/>
+      <replace source="\\'8c\n" target="Ś"/>
+      <replace source="\\'8d\n" target="Ť"/>
+      <replace source="\\'8e\n" target="Ž"/>
+      <replace source="\\'8f\n" target="Ź"/>
+      <replace source="\\'9a\n" target="š"/>
+      <replace source="\\'9c\n" target="ś"/>
+      <replace source="\\'9d\n" target="ť"/>
+      <replace source="\\'9e\n" target="ž"/>
+      <replace source="\\'9f\n" target="ź"/>
+      <replace source="\\'a3\n" target="Ł"/>
+      <replace source="\\'a5\n" target="Ą"/>
+      <replace source="\\'aa\n" target="Ş"/>
+      <replace source="\\'af\n" target="Ż"/>
+      <replace source="\\'b3\n" target="ł"/>
+      <replace source="\\'b5\n" target="µ"/>
+      <replace source="\\'b9\n" target="ą"/>
+      <replace source="\\'ba\n" target="ş"/>
+      <replace source="\\'bc\n" target="Ľ"/>
+      <replace source="\\'be\n" target="ľ"/>
+      <replace source="\\'bf\n" target="ż"/>
+      <replace source="\\'c0\n" target="Ŕ"/>
+      <replace source="\\'c1\n" target="Á"/>
+      <replace source="\\'c2\n" target="Â"/>
+      <replace source="\\'c3\n" target="Ă"/>
+      <replace source="\\'c4\n" target="Ä"/>
+      <replace source="\\'c5\n" target="Ĺ"/>
+      <replace source="\\'c6\n" target="Ć"/>
+      <replace source="\\'c7\n" target="Ç"/>
+      <replace source="\\'c8\n" target="Č"/>
+      <replace source="\\'c9\n" target="É"/>
+      <replace source="\\'ca\n" target="Ę"/>
+      <replace source="\\'cb\n" target="Ë"/>
+      <replace source="\\'cc\n" target="Ě"/>
+      <replace source="\\'cd\n" target="Í"/>
+      <replace source="\\'ce\n" target="Î"/>
+      <replace source="\\'cf\n" target="Ď"/>
+      <replace source="\\'d0\n" target="Ð"/>
+      <replace source="\\'d1\n" target="Ń"/>
+      <replace source="\\'d2\n" target="Ň"/>
+      <replace source="\\'d3\n" target="Ó"/>
+      <replace source="\\'d4\n" target="Ô"/>
+      <replace source="\\'d5\n" target="Ő"/>
+      <replace source="\\'d6\n" target="Ö"/>
+      <replace source="\\'d8\n" target="Ř"/>
+      <replace source="\\'d9\n" target="Ů"/>
+      <replace source="\\'da\n" target="Ú"/>
+      <replace source="\\'db\n" target="Ű"/>
+      <replace source="\\'dc\n" target="Ü"/>
+      <replace source="\\'dd\n" target="Ý"/>
+      <replace source="\\'de\n" target="Ţ"/>
+      <replace source="\\'df\n" target="ß"/>
+      <replace source="\\'e0\n" target="ŕ"/>
+      <replace source="\\'e1\n" target="á"/>
+      <replace source="\\'e2\n" target="â"/>
+      <replace source="\\'e3\n" target="ă"/>
+      <replace source="\\'e4\n" target="ä"/>
+      <replace source="\\'e5\n" target="ĺ"/>
+      <replace source="\\'e6\n" target="ć"/>
+      <replace source="\\'e7\n" target="ç"/>
+      <replace source="\\'e8\n" target="č"/>
+      <replace source="\\'e9\n" target="é"/>
+      <replace source="\\'ea\n" target="ę"/>
+      <replace source="\\'eb\n" target="ë"/>
+      <replace source="\\'ec\n" target="ě"/>
+      <replace source="\\'ed\n" target="í"/>
+      <replace source="\\'ee\n" target="î"/>
+      <replace source="\\'ef\n" target="ď"/>
+      <replace source="\\'f0\n" target="đ"/>
+      <replace source="\\'f1\n" target="ń"/>
+      <replace source="\\'f2\n" target="ň"/>
+      <replace source="\\'f3\n" target="ó"/>
+      <replace source="\\'f4\n" target="ô"/>
+      <replace source="\\'f5\n" target="ő"/>
+      <replace source="\\'f6\n" target="ö"/>
+      <replace source="\\'f8\n" target="ř"/>
+      <replace source="\\'f9\n" target="ů"/>
+      <replace source="\\'fa\n" target="ú"/>
+      <replace source="\\'fb\n" target="ű"/>
+      <replace source="\\'fc\n" target="ü"/>
+      <replace source="\\'fd\n" target="ý"/>
+      <replace source="\\'fe\n" target="ţ"/>
+      <replace source="\\'ff\n" target="˙"/>
+      <!-- The same characters followed by a \r: -->
+      <replace source="\\'8a\r" target="Š"/>
+      <replace source="\\'8c\r" target="Ś"/>
+      <replace source="\\'8d\r" target="Ť"/>
+      <replace source="\\'8e\r" target="Ž"/>
+      <replace source="\\'8f\r" target="Ź"/>
+      <replace source="\\'9a\r" target="š"/>
+      <replace source="\\'9c\r" target="ś"/>
+      <replace source="\\'9d\r" target="ť"/>
+      <replace source="\\'9e\r" target="ž"/>
+      <replace source="\\'9f\r" target="ź"/>
+      <replace source="\\'a3\r" target="Ł"/>
+      <replace source="\\'a5\r" target="Ą"/>
+      <replace source="\\'aa\r" target="Ş"/>
+      <replace source="\\'af\r" target="Ż"/>
+      <replace source="\\'b3\r" target="ł"/>
+      <replace source="\\'b5\r" target="µ"/>
+      <replace source="\\'b9\r" target="ą"/>
+      <replace source="\\'ba\r" target="ş"/>
+      <replace source="\\'bc\r" target="Ľ"/>
+      <replace source="\\'be\r" target="ľ"/>
+      <replace source="\\'bf\r" target="ż"/>
+      <replace source="\\'c0\r" target="Ŕ"/>
+      <replace source="\\'c1\r" target="Á"/>
+      <replace source="\\'c2\r" target="Â"/>
+      <replace source="\\'c3\r" target="Ă"/>
+      <replace source="\\'c4\r" target="Ä"/>
+      <replace source="\\'c5\r" target="Ĺ"/>
+      <replace source="\\'c6\r" target="Ć"/>
+      <replace source="\\'c7\r" target="Ç"/>
+      <replace source="\\'c8\r" target="Č"/>
+      <replace source="\\'c9\r" target="É"/>
+      <replace source="\\'ca\r" target="Ę"/>
+      <replace source="\\'cb\r" target="Ë"/>
+      <replace source="\\'cc\r" target="Ě"/>
+      <replace source="\\'cd\r" target="Í"/>
+      <replace source="\\'ce\r" target="Î"/>
+      <replace source="\\'cf\r" target="Ď"/>
+      <replace source="\\'d0\r" target="Ð"/>
+      <replace source="\\'d1\r" target="Ń"/>
+      <replace source="\\'d2\r" target="Ň"/>
+      <replace source="\\'d3\r" target="Ó"/>
+      <replace source="\\'d4\r" target="Ô"/>
+      <replace source="\\'d5\r" target="Ő"/>
+      <replace source="\\'d6\r" target="Ö"/>
+      <replace source="\\'d8\r" target="Ř"/>
+      <replace source="\\'d9\r" target="Ů"/>
+      <replace source="\\'da\r" target="Ú"/>
+      <replace source="\\'db\r" target="Ű"/>
+      <replace source="\\'dc\r" target="Ü"/>
+      <replace source="\\'dd\r" target="Ý"/>
+      <replace source="\\'de\r" target="Ţ"/>
+      <replace source="\\'df\r" target="ß"/>
+      <replace source="\\'e0\r" target="ŕ"/>
+      <replace source="\\'e1\r" target="á"/>
+      <replace source="\\'e2\r" target="â"/>
+      <replace source="\\'e3\r" target="ă"/>
+      <replace source="\\'e4\r" target="ä"/>
+      <replace source="\\'e5\r" target="ĺ"/>
+      <replace source="\\'e6\r" target="ć"/>
+      <replace source="\\'e7\r" target="ç"/>
+      <replace source="\\'e8\r" target="č"/>
+      <replace source="\\'e9\r" target="é"/>
+      <replace source="\\'ea\r" target="ę"/>
+      <replace source="\\'eb\r" target="ë"/>
+      <replace source="\\'ec\r" target="ě"/>
+      <replace source="\\'ed\r" target="í"/>
+      <replace source="\\'ee\r" target="î"/>
+      <replace source="\\'ef\r" target="ď"/>
+      <replace source="\\'f0\r" target="đ"/>
+      <replace source="\\'f1\r" target="ń"/>
+      <replace source="\\'f2\r" target="ň"/>
+      <replace source="\\'f3\r" target="ó"/>
+      <replace source="\\'f4\r" target="ô"/>
+      <replace source="\\'f5\r" target="ő"/>
+      <replace source="\\'f6\r" target="ö"/>
+      <replace source="\\'f8\r" target="ř"/>
+      <replace source="\\'f9\r" target="ů"/>
+      <replace source="\\'fa\r" target="ú"/>
+      <replace source="\\'fb\r" target="ű"/>
+      <replace source="\\'fc\r" target="ü"/>
+      <replace source="\\'fd\r" target="ý"/>
+      <replace source="\\'fe\r" target="ţ"/>
+      <replace source="\\'ff\r" target="˙"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format-cp1251.xml
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format-cp1251.xml	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/rtf-format-cp1251.xml	(revision 70339)
@@ -0,0 +1,576 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<format name="rtf"> <!-- version 1.0 -->
+  <options>
+    <largeblocks size="8192"/>
+    <input encoding="windows-1251"/>
+    <output encoding="UTF-8"/>
+    <tag-name regexp=""/>
+    <escape-chars regexp='\\|[][&lt;&gt;@^$/{}]'/> 
+<!--    <escape-chars regexp='[]]^@&lt;&gt;/]'/>  -->
+
+    <space-chars regexp='[ \n\t\r$*]'/>
+    <case-sensitive value="no"/>
+  </options>
+
+  <rules>
+    
+    <!-- Exceptions with priority 1  -->
+    <!-- Style Sheet names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\snext&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\keycode&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- Font names are also format: -->
+    <format-rule type="comment" eos="no" priority="1">
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fcharset&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule>
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fnil&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\froman&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fswiss&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fmodern&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fscript&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fdecor&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\ftech&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fbidi&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\falt&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fontfile&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fn&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sbasedon&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\additive&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- File names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\file&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- List Table names are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\listname&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\leveltext&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\levelnumbers&quot;"/>
+      <end   regexp="&quot;;&quot;"/>
+    </format-rule> 
+    <!-- Pictures are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\pict&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sn&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\sv&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;{\\\*\\blipuid  &quot;[^ \n\r]+&quot;}&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Objects are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\object&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Document Variables are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\docvar&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Bookmarks are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\bkmkstart&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\bkmkend&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Index Entries are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\rxe&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Fields are also format: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fldinst&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\fldrslt&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Other format tags which contain #CDATA: -->
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\pntxt&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <format-rule type="comment" eos="no" priority="1"> 
+      <begin regexp="&quot;{&quot;[ \n\r]*(\\[^'][^ \n\r\\]*[ \n\r]*)*&quot;\\colortbl&quot;"/>
+      <end   regexp="&quot;}&quot;"/>
+    </format-rule> 
+    <!-- Hexadecimal Data -->
+    <format-rule type="empty" eos="yes" priority="1">
+      <tag regexp="[a-f0-9]{20,}" />
+    </format-rule>
+    
+    
+    
+    
+
+    <!-- End of sentence tags: par, row, cell -->
+    <format-rule type="empty" eos="yes" priority="2">
+      <tag regexp="&quot;\\par&quot;|&quot;\\row&quot;|&quot;\\cell&quot;" />
+    </format-rule>
+    
+
+    <format-rule type="open" eos="no" priority="3">
+      <tag regexp="&quot;{&quot;[ \n\r]*\\[^'][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+
+    <!-- General Tags Specification -->
+    <format-rule type="empty" eos="no" priority="3">
+      <tag regexp="\\[^'][^ \n\r\\]*[ \n\r]*"/>
+    </format-rule>
+    <format-rule type="close" eos="no" priority="4">
+      <tag regexp="&quot;}&quot;"/>
+    </format-rule>
+    <format-rule type="open" eos="no" priority="4">
+      <tag regexp="&quot;{&quot;"/>
+    </format-rule>
+
+
+    <replacement-rule regexp="&quot;\\'&quot;[0-9a-fA-F][0-9a-fA-F](\r|\n|&quot;\r\n&quot;)?"> 
+      <replace source="\\'80" target="Ђ" prefer="yes"/>
+      <replace source="\\'81" target="Ѓ" prefer="yes"/>
+      <replace source="\\'83" target="ѓ" prefer="yes"/>
+      <replace source="\\'8a" target="Љ" prefer="yes"/>
+      <replace source="\\'8c" target="Њ" prefer="yes"/>
+      <replace source="\\'8d" target="Ќ" prefer="yes"/>
+      <replace source="\\'8e" target="Ћ" prefer="yes"/>
+      <replace source="\\'8f" target="Џ" prefer="yes"/>
+      <replace source="\\'90" target="ђ" prefer="yes"/>
+      <replace source="\\'9a" target="љ" prefer="yes"/>
+      <replace source="\\'9c" target="њ" prefer="yes"/>
+      <replace source="\\'9d" target="ќ" prefer="yes"/>
+      <replace source="\\'9e" target="ћ" prefer="yes"/>
+      <replace source="\\'9f" target="џ" prefer="yes"/>
+      <replace source="\\'a1" target="Ў" prefer="yes"/>
+      <replace source="\\'a2" target="ў" prefer="yes"/>
+      <replace source="\\'a3" target="Ј" prefer="yes"/>
+      <replace source="\\'a5" target="Ґ" prefer="yes"/>
+      <replace source="\\'a8" target="Ё" prefer="yes"/>
+      <replace source="\\'aa" target="Є" prefer="yes"/>
+      <replace source="\\'af" target="Ї" prefer="yes"/>
+      <replace source="\\'b3" target="і" prefer="yes"/>
+      <replace source="\\'b4" target="ґ" prefer="yes"/>
+      <replace source="\\'b5" target="µ" prefer="yes"/>
+      <replace source="\\'b8" target="ё" prefer="yes"/>
+      <replace source="\\'ba" target="є" prefer="yes"/>
+      <replace source="\\'bc" target="ј" prefer="yes"/>
+      <replace source="\\'bd" target="Ѕ" prefer="yes"/>
+      <replace source="\\'be" target="ѕ" prefer="yes"/>
+      <replace source="\\'bf" target="ї" prefer="yes"/>
+      <replace source="\\'c0" target="А" prefer="yes"/>
+      <replace source="\\'c1" target="Б" prefer="yes"/>
+      <replace source="\\'c2" target="В" prefer="yes"/>
+      <replace source="\\'c3" target="Г" prefer="yes"/>
+      <replace source="\\'c4" target="Д" prefer="yes"/>
+      <replace source="\\'c5" target="Е" prefer="yes"/>
+      <replace source="\\'c6" target="Ж" prefer="yes"/>
+      <replace source="\\'c7" target="З" prefer="yes"/>
+      <replace source="\\'c8" target="И" prefer="yes"/>
+      <replace source="\\'c9" target="Й" prefer="yes"/>
+      <replace source="\\'ca" target="К" prefer="yes"/>
+      <replace source="\\'cb" target="Л" prefer="yes"/>
+      <replace source="\\'cc" target="М" prefer="yes"/>
+      <replace source="\\'cd" target="Н" prefer="yes"/>
+      <replace source="\\'ce" target="О" prefer="yes"/>
+      <replace source="\\'cf" target="П" prefer="yes"/>
+      <replace source="\\'d0" target="Р" prefer="yes"/>
+      <replace source="\\'d1" target="С" prefer="yes"/>
+      <replace source="\\'d2" target="Т" prefer="yes"/>
+      <replace source="\\'d3" target="У" prefer="yes"/>
+      <replace source="\\'d4" target="Ф" prefer="yes"/>
+      <replace source="\\'d5" target="Х" prefer="yes"/>
+      <replace source="\\'d6" target="Ц" prefer="yes"/>
+      <replace source="\\'d7" target="Ч" prefer="yes"/>
+      <replace source="\\'d8" target="Ш" prefer="yes"/>
+      <replace source="\\'d9" target="Щ" prefer="yes"/>
+      <replace source="\\'da" target="Ъ" prefer="yes"/>
+      <replace source="\\'db" target="Ы" prefer="yes"/>
+      <replace source="\\'dc" target="Ь" prefer="yes"/>
+      <replace source="\\'dd" target="Э" prefer="yes"/>
+      <replace source="\\'de" target="Ю" prefer="yes"/>
+      <replace source="\\'df" target="Я" prefer="yes"/>
+      <replace source="\\'e0" target="а" prefer="yes"/>
+      <replace source="\\'e1" target="б" prefer="yes"/>
+      <replace source="\\'e2" target="в" prefer="yes"/>
+      <replace source="\\'e3" target="г" prefer="yes"/>
+      <replace source="\\'e4" target="д" prefer="yes"/>
+      <replace source="\\'e5" target="е" prefer="yes"/>
+      <replace source="\\'e6" target="ж" prefer="yes"/>
+      <replace source="\\'e7" target="з" prefer="yes"/>
+      <replace source="\\'e8" target="и" prefer="yes"/>
+      <replace source="\\'e9" target="й" prefer="yes"/>
+      <replace source="\\'ea" target="к" prefer="yes"/>
+      <replace source="\\'eb" target="л" prefer="yes"/>
+      <replace source="\\'ec" target="м" prefer="yes"/>
+      <replace source="\\'ed" target="н" prefer="yes"/>
+      <replace source="\\'ee" target="о" prefer="yes"/>
+      <replace source="\\'ef" target="п" prefer="yes"/>
+      <replace source="\\'f0" target="р" prefer="yes"/>
+      <replace source="\\'f1" target="с" prefer="yes"/>
+      <replace source="\\'f2" target="т" prefer="yes"/>
+      <replace source="\\'f3" target="у" prefer="yes"/>
+      <replace source="\\'f4" target="ф" prefer="yes"/>
+      <replace source="\\'f5" target="х" prefer="yes"/>
+      <replace source="\\'f6" target="ц" prefer="yes"/>
+      <replace source="\\'f7" target="ч" prefer="yes"/>
+      <replace source="\\'f8" target="ш" prefer="yes"/>
+      <replace source="\\'f9" target="щ" prefer="yes"/>
+      <replace source="\\'fa" target="ъ" prefer="yes"/>
+      <replace source="\\'fb" target="ы" prefer="yes"/>
+      <replace source="\\'fc" target="ь" prefer="yes"/>
+      <replace source="\\'fd" target="э" prefer="yes"/>
+      <replace source="\\'fe" target="ю" prefer="yes"/>
+      <replace source="\\'ff" target="я" prefer="yes"/>
+      
+     <!-- The same characters followed by a \r\n: -->
+      <replace source="\\'80\r\n" target="Ђ"/>
+      <replace source="\\'81\r\n" target="Ѓ"/>
+      <replace source="\\'83\r\n" target="ѓ"/>
+      <replace source="\\'8a\r\n" target="Љ"/>
+      <replace source="\\'8c\r\n" target="Њ"/>
+      <replace source="\\'8d\r\n" target="Ќ"/>
+      <replace source="\\'8e\r\n" target="Ћ"/>
+      <replace source="\\'8f\r\n" target="Џ"/>
+      <replace source="\\'90\r\n" target="ђ"/>
+      <replace source="\\'9a\r\n" target="љ"/>
+      <replace source="\\'9c\r\n" target="њ"/>
+      <replace source="\\'9d\r\n" target="ќ"/>
+      <replace source="\\'9e\r\n" target="ћ"/>
+      <replace source="\\'9f\r\n" target="џ"/>
+      <replace source="\\'a1\r\n" target="Ў"/>
+      <replace source="\\'a2\r\n" target="ў"/>
+      <replace source="\\'a3\r\n" target="Ј"/>
+      <replace source="\\'a5\r\n" target="Ґ"/>
+      <replace source="\\'a8\r\n" target="Ё"/>
+      <replace source="\\'aa\r\n" target="Є"/>
+      <replace source="\\'af\r\n" target="Ї"/>
+      <replace source="\\'b3\r\n" target="і"/>
+      <replace source="\\'b4\r\n" target="ґ"/>
+      <replace source="\\'b5\r\n" target="µ"/>
+      <replace source="\\'b8\r\n" target="ё"/>
+      <replace source="\\'ba\r\n" target="є"/>
+      <replace source="\\'bc\r\n" target="ј"/>
+      <replace source="\\'bd\r\n" target="Ѕ"/>
+      <replace source="\\'be\r\n" target="ѕ"/>
+      <replace source="\\'bf\r\n" target="ї"/>
+      <replace source="\\'c0\r\n" target="А"/>
+      <replace source="\\'c1\r\n" target="Б"/>
+      <replace source="\\'c2\r\n" target="В"/>
+      <replace source="\\'c3\r\n" target="Г"/>
+      <replace source="\\'c4\r\n" target="Д"/>
+      <replace source="\\'c5\r\n" target="Е"/>
+      <replace source="\\'c6\r\n" target="Ж"/>
+      <replace source="\\'c7\r\n" target="З"/>
+      <replace source="\\'c8\r\n" target="И"/>
+      <replace source="\\'c9\r\n" target="Й"/>
+      <replace source="\\'ca\r\n" target="К"/>
+      <replace source="\\'cb\r\n" target="Л"/>
+      <replace source="\\'cc\r\n" target="М"/>
+      <replace source="\\'cd\r\n" target="Н"/>
+      <replace source="\\'ce\r\n" target="О"/>
+      <replace source="\\'cf\r\n" target="П"/>
+      <replace source="\\'d0\r\n" target="Р"/>
+      <replace source="\\'d1\r\n" target="С"/>
+      <replace source="\\'d2\r\n" target="Т"/>
+      <replace source="\\'d3\r\n" target="У"/>
+      <replace source="\\'d4\r\n" target="Ф"/>
+      <replace source="\\'d5\r\n" target="Х"/>
+      <replace source="\\'d6\r\n" target="Ц"/>
+      <replace source="\\'d7\r\n" target="Ч"/>
+      <replace source="\\'d8\r\n" target="Ш"/>
+      <replace source="\\'d9\r\n" target="Щ"/>
+      <replace source="\\'da\r\n" target="Ъ"/>
+      <replace source="\\'db\r\n" target="Ы"/>
+      <replace source="\\'dc\r\n" target="Ь"/>
+      <replace source="\\'dd\r\n" target="Э"/>
+      <replace source="\\'de\r\n" target="Ю"/>
+      <replace source="\\'df\r\n" target="Я"/>
+      <replace source="\\'e0\r\n" target="а"/>
+      <replace source="\\'e1\r\n" target="б"/>
+      <replace source="\\'e2\r\n" target="в"/>
+      <replace source="\\'e3\r\n" target="г"/>
+      <replace source="\\'e4\r\n" target="д"/>
+      <replace source="\\'e5\r\n" target="е"/>
+      <replace source="\\'e6\r\n" target="ж"/>
+      <replace source="\\'e7\r\n" target="з"/>
+      <replace source="\\'e8\r\n" target="и"/>
+      <replace source="\\'e9\r\n" target="й"/>
+      <replace source="\\'ea\r\n" target="к"/>
+      <replace source="\\'eb\r\n" target="л"/>
+      <replace source="\\'ec\r\n" target="м"/>
+      <replace source="\\'ed\r\n" target="н"/>
+      <replace source="\\'ee\r\n" target="о"/>
+      <replace source="\\'ef\r\n" target="п"/>
+      <replace source="\\'f0\r\n" target="р"/>
+      <replace source="\\'f1\r\n" target="с"/>
+      <replace source="\\'f2\r\n" target="т"/>
+      <replace source="\\'f3\r\n" target="у"/>
+      <replace source="\\'f4\r\n" target="ф"/>
+      <replace source="\\'f5\r\n" target="х"/>
+      <replace source="\\'f6\r\n" target="ц"/>
+      <replace source="\\'f7\r\n" target="ч"/>
+      <replace source="\\'f8\r\n" target="ш"/>
+      <replace source="\\'f9\r\n" target="щ"/>
+      <replace source="\\'fa\r\n" target="ъ"/>
+      <replace source="\\'fb\r\n" target="ы"/>
+      <replace source="\\'fc\r\n" target="ь"/>
+      <replace source="\\'fd\r\n" target="э"/>
+      <replace source="\\'fe\r\n" target="ю"/>
+      <replace source="\\'ff\r\n" target="я"/>
+      <!-- The same characters followed by a \n: -->
+      <replace source="\\'80\n" target="Ђ"/>
+      <replace source="\\'81\n" target="Ѓ"/>
+      <replace source="\\'83\n" target="ѓ"/>
+      <replace source="\\'8a\n" target="Љ"/>
+      <replace source="\\'8c\n" target="Њ"/>
+      <replace source="\\'8d\n" target="Ќ"/>
+      <replace source="\\'8e\n" target="Ћ"/>
+      <replace source="\\'8f\n" target="Џ"/>
+      <replace source="\\'90\n" target="ђ"/>
+      <replace source="\\'9a\n" target="љ"/>
+      <replace source="\\'9c\n" target="њ"/>
+      <replace source="\\'9d\n" target="ќ"/>
+      <replace source="\\'9e\n" target="ћ"/>
+      <replace source="\\'9f\n" target="џ"/>
+      <replace source="\\'a1\n" target="Ў"/>
+      <replace source="\\'a2\n" target="ў"/>
+      <replace source="\\'a3\n" target="Ј"/>
+      <replace source="\\'a5\n" target="Ґ"/>
+      <replace source="\\'a8\n" target="Ё"/>
+      <replace source="\\'aa\n" target="Є"/>
+      <replace source="\\'af\n" target="Ї"/>
+      <replace source="\\'b3\n" target="і"/>
+      <replace source="\\'b4\n" target="ґ"/>
+      <replace source="\\'b5\n" target="µ"/>
+      <replace source="\\'b8\n" target="ё"/>
+      <replace source="\\'ba\n" target="є"/>
+      <replace source="\\'bc\n" target="ј"/>
+      <replace source="\\'bd\n" target="Ѕ"/>
+      <replace source="\\'be\n" target="ѕ"/>
+      <replace source="\\'bf\n" target="ї"/>
+      <replace source="\\'c0\n" target="А"/>
+      <replace source="\\'c1\n" target="Б"/>
+      <replace source="\\'c2\n" target="В"/>
+      <replace source="\\'c3\n" target="Г"/>
+      <replace source="\\'c4\n" target="Д"/>
+      <replace source="\\'c5\n" target="Е"/>
+      <replace source="\\'c6\n" target="Ж"/>
+      <replace source="\\'c7\n" target="З"/>
+      <replace source="\\'c8\n" target="И"/>
+      <replace source="\\'c9\n" target="Й"/>
+      <replace source="\\'ca\n" target="К"/>
+      <replace source="\\'cb\n" target="Л"/>
+      <replace source="\\'cc\n" target="М"/>
+      <replace source="\\'cd\n" target="Н"/>
+      <replace source="\\'ce\n" target="О"/>
+      <replace source="\\'cf\n" target="П"/>
+      <replace source="\\'d0\n" target="Р"/>
+      <replace source="\\'d1\n" target="С"/>
+      <replace source="\\'d2\n" target="Т"/>
+      <replace source="\\'d3\n" target="У"/>
+      <replace source="\\'d4\n" target="Ф"/>
+      <replace source="\\'d5\n" target="Х"/>
+      <replace source="\\'d6\n" target="Ц"/>
+      <replace source="\\'d7\n" target="Ч"/>
+      <replace source="\\'d8\n" target="Ш"/>
+      <replace source="\\'d9\n" target="Щ"/>
+      <replace source="\\'da\n" target="Ъ"/>
+      <replace source="\\'db\n" target="Ы"/>
+      <replace source="\\'dc\n" target="Ь"/>
+      <replace source="\\'dd\n" target="Э"/>
+      <replace source="\\'de\n" target="Ю"/>
+      <replace source="\\'df\n" target="Я"/>
+      <replace source="\\'e0\n" target="а"/>
+      <replace source="\\'e1\n" target="б"/>
+      <replace source="\\'e2\n" target="в"/>
+      <replace source="\\'e3\n" target="г"/>
+      <replace source="\\'e4\n" target="д"/>
+      <replace source="\\'e5\n" target="е"/>
+      <replace source="\\'e6\n" target="ж"/>
+      <replace source="\\'e7\n" target="з"/>
+      <replace source="\\'e8\n" target="и"/>
+      <replace source="\\'e9\n" target="й"/>
+      <replace source="\\'ea\n" target="к"/>
+      <replace source="\\'eb\n" target="л"/>
+      <replace source="\\'ec\n" target="м"/>
+      <replace source="\\'ed\n" target="н"/>
+      <replace source="\\'ee\n" target="о"/>
+      <replace source="\\'ef\n" target="п"/>
+      <replace source="\\'f0\n" target="р"/>
+      <replace source="\\'f1\n" target="с"/>
+      <replace source="\\'f2\n" target="т"/>
+      <replace source="\\'f3\n" target="у"/>
+      <replace source="\\'f4\n" target="ф"/>
+      <replace source="\\'f5\n" target="х"/>
+      <replace source="\\'f6\n" target="ц"/>
+      <replace source="\\'f7\n" target="ч"/>
+      <replace source="\\'f8\n" target="ш"/>
+      <replace source="\\'f9\n" target="щ"/>
+      <replace source="\\'fa\n" target="ъ"/>
+      <replace source="\\'fb\n" target="ы"/>
+      <replace source="\\'fc\n" target="ь"/>
+      <replace source="\\'fd\n" target="э"/>
+      <replace source="\\'fe\n" target="ю"/>
+      <replace source="\\'ff\n" target="я"/>
+      <!-- The same characters followed by a \r: -->
+      <replace source="\\'80\r" target="Ђ"/>
+      <replace source="\\'81\r" target="Ѓ"/>
+      <replace source="\\'83\r" target="ѓ"/>
+      <replace source="\\'8a\r" target="Љ"/>
+      <replace source="\\'8c\r" target="Њ"/>
+      <replace source="\\'8d\r" target="Ќ"/>
+      <replace source="\\'8e\r" target="Ћ"/>
+      <replace source="\\'8f\r" target="Џ"/>
+      <replace source="\\'90\r" target="ђ"/>
+      <replace source="\\'9a\r" target="љ"/>
+      <replace source="\\'9c\r" target="њ"/>
+      <replace source="\\'9d\r" target="ќ"/>
+      <replace source="\\'9e\r" target="ћ"/>
+      <replace source="\\'9f\r" target="џ"/>
+      <replace source="\\'a1\r" target="Ў"/>
+      <replace source="\\'a2\r" target="ў"/>
+      <replace source="\\'a3\r" target="Ј"/>
+      <replace source="\\'a5\r" target="Ґ"/>
+      <replace source="\\'a8\r" target="Ё"/>
+      <replace source="\\'aa\r" target="Є"/>
+      <replace source="\\'af\r" target="Ї"/>
+      <replace source="\\'b3\r" target="і"/>
+      <replace source="\\'b4\r" target="ґ"/>
+      <replace source="\\'b5\r" target="µ"/>
+      <replace source="\\'b8\r" target="ё"/>
+      <replace source="\\'ba\r" target="є"/>
+      <replace source="\\'bc\r" target="ј"/>
+      <replace source="\\'bd\r" target="Ѕ"/>
+      <replace source="\\'be\r" target="ѕ"/>
+      <replace source="\\'bf\r" target="ї"/>
+      <replace source="\\'c0\r" target="А"/>
+      <replace source="\\'c1\r" target="Б"/>
+      <replace source="\\'c2\r" target="В"/>
+      <replace source="\\'c3\r" target="Г"/>
+      <replace source="\\'c4\r" target="Д"/>
+      <replace source="\\'c5\r" target="Е"/>
+      <replace source="\\'c6\r" target="Ж"/>
+      <replace source="\\'c7\r" target="З"/>
+      <replace source="\\'c8\r" target="И"/>
+      <replace source="\\'c9\r" target="Й"/>
+      <replace source="\\'ca\r" target="К"/>
+      <replace source="\\'cb\r" target="Л"/>
+      <replace source="\\'cc\r" target="М"/>
+      <replace source="\\'cd\r" target="Н"/>
+      <replace source="\\'ce\r" target="О"/>
+      <replace source="\\'cf\r" target="П"/>
+      <replace source="\\'d0\r" target="Р"/>
+      <replace source="\\'d1\r" target="С"/>
+      <replace source="\\'d2\r" target="Т"/>
+      <replace source="\\'d3\r" target="У"/>
+      <replace source="\\'d4\r" target="Ф"/>
+      <replace source="\\'d5\r" target="Х"/>
+      <replace source="\\'d6\r" target="Ц"/>
+      <replace source="\\'d7\r" target="Ч"/>
+      <replace source="\\'d8\r" target="Ш"/>
+      <replace source="\\'d9\r" target="Щ"/>
+      <replace source="\\'da\r" target="Ъ"/>
+      <replace source="\\'db\r" target="Ы"/>
+      <replace source="\\'dc\r" target="Ь"/>
+      <replace source="\\'dd\r" target="Э"/>
+      <replace source="\\'de\r" target="Ю"/>
+      <replace source="\\'df\r" target="Я"/>
+      <replace source="\\'e0\r" target="а"/>
+      <replace source="\\'e1\r" target="б"/>
+      <replace source="\\'e2\r" target="в"/>
+      <replace source="\\'e3\r" target="г"/>
+      <replace source="\\'e4\r" target="д"/>
+      <replace source="\\'e5\r" target="е"/>
+      <replace source="\\'e6\r" target="ж"/>
+      <replace source="\\'e7\r" target="з"/>
+      <replace source="\\'e8\r" target="и"/>
+      <replace source="\\'e9\r" target="й"/>
+      <replace source="\\'ea\r" target="к"/>
+      <replace source="\\'eb\r" target="л"/>
+      <replace source="\\'ec\r" target="м"/>
+      <replace source="\\'ed\r" target="н"/>
+      <replace source="\\'ee\r" target="о"/>
+      <replace source="\\'ef\r" target="п"/>
+      <replace source="\\'f0\r" target="р"/>
+      <replace source="\\'f1\r" target="с"/>
+      <replace source="\\'f2\r" target="т"/>
+      <replace source="\\'f3\r" target="у"/>
+      <replace source="\\'f4\r" target="ф"/>
+      <replace source="\\'f5\r" target="х"/>
+      <replace source="\\'f6\r" target="ц"/>
+      <replace source="\\'f7\r" target="ч"/>
+      <replace source="\\'f8\r" target="ш"/>
+      <replace source="\\'f9\r" target="щ"/>
+      <replace source="\\'fa\r" target="ъ"/>
+      <replace source="\\'fb\r" target="ы"/>
+      <replace source="\\'fc\r" target="ь"/>
+      <replace source="\\'fd\r" target="э"/>
+      <replace source="\\'fe\r" target="ю"/>
+      <replace source="\\'ff\r" target="я"/>
+    </replacement-rule>
+  </rules>
+
+</format>
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-lextor.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-lextor.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-lextor.1	(revision 70339)
@@ -0,0 +1,132 @@
+.TH apertium-lextor 1 2006-12-12 "" ""
+.SH NAME
+apertium-lextor \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-lextor
+.B \-\-trainwrd\fR stopwords words n left right corpus model
+[
+.B \-\-weightexp\fR w
+]
+[
+.B \-\-debug\fR
+]
+.PP
+.B apertium\-lextor
+.B \-\-trainlch\fR stopwords lexchoices n left right corpus wordmodel dic bildic model
+[
+.B \-\-weightexp\fR w
+]
+[
+.B \-\-debug\fR
+]
+.PP
+.B apertium\-lextor
+.B \-\-lextor\fR model dic left right
+[
+.B \-\-debug\fR
+]
+[
+.B \-\-weightexp\fR w
+]
+.PP
+.SH DESCRIPTION
+.BR apertium\-lextor 
+is the application responsible for training and usage of the \fIlexical
+selector module\fR.
+.SH OPTIONS
+.PP
+.B \-\-trainwrd | \-t\fR
+.br
+Train word co-occurrences model. It needs the following required parameters:
+.TP
+.I stopwords\fR file containing a list of stop words. Stop words are ignored.
+.TP
+.I words\fR file containing a list of words. For each word a co-occurrence model is built.
+.TP
+.I n\fR number of words per co\-occurrence model (for each model, the \fIn\fR most frequent words).
+.TP
+.I left\fR left\-side context to take into account (number of words).
+.TP
+.I right\fR right\-side context to take into account (number of words).
+.TP
+.I corpus\fR file containing the training corpus.
+.TP
+.I model\fR output file on which the co\-occurrence models are saved.
+.PP
+.B \-\-trainlch | \-r\fR
+.br
+Train lexical choices co\-occurrence models using a target language
+co\-occurrence model and a bilingual dictionary. It needs the
+following required parameters:
+.TP
+.I stopwords\fR file containing a list of stop words. Stop words are ignored.
+.TP
+.I lexchoices\fR file containing a list of lexical choices. For each lexical choice a co\-occurrence model is built.
+.TP
+.I n\fR number of words per co\-occurrence model (for each model, the n most frequent words).
+.TP
+.I left\fR left\-side context to take into account (number of words).
+.TP
+.I right\fR right\-side context to take into account (number of words).
+.TP
+.I corpus\fR file containing the training corpus.
+.TP 
+.I wordmodel\fR target\-language word co\-occurrence model (previously trained by means of the \fB\-\-trainwrd\fR option).
+.TP
+.I dic\fR the lexical-selection dictionary (binary format).
+.TP
+.I bildic\fR the bilingual dictionary (binary format).
+.TP
+.I model\fR output file on which the co\-occurrence models are saved.
+.PP
+.PP
+.B \-\-lextor | \-l
+.br
+Perform the lexical selection on the input stream. It needs the
+following required parameters:
+.TP
+.I model\fR  file containing the model to be used for the lexical selection.
+.TP
+.I dic\fR lexical\-selection dictionary (binary format).
+.TP
+.I left\fR left\-side context to take into account (number of words).
+.TP
+.I right\fR right\-side context to take into account (number of words).
+.PP
+.B \-\-weightexp w
+.br 
+Specify a weight value to change the influence of surrounding words
+while training or performing the lexical selection. The parameter
+\fIw\fR must be a positive value.
+.PP
+.B \-\-debug | \-d
+.br 
+Show debug information while working.
+.PP
+.B \-\-help | \-h
+.br
+Shows this help.
+.PP
+.B \-\-version | \-v
+.br
+Shows license information.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\-eval\fR(1),
+.I apertium\-gen\-lextormono\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-lextorbil.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-lextorbil.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-lextorbil.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-gen-lextorbil 1 2006-12-11 "" ""
+.SH NAME
+apertium-gen-lextorbil \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-gen\-lextorbil
+.I lr\fR\ |
+.I rl\fR
+input_file output_file
+.PP
+.SH DESCRIPTION
+.BR apertium\-gen\-lextorbil 
+is the application responsible for generating the bilingual dictionary
+used by the transfer module when apertium\-lextor is being used to
+perform lexical selection.
+.SH OPTIONS
+.TP
+.B lr\fR The bilingual dictionary to generate is for left to right translation.
+.PP
+.B rl\fR The bilingual dictionary to generate is for right to left translation.
+.SH FILES
+These are the kinds of files used with this tool:
+.PP
+.B input_file
+A bilingual dictionary.
+.PP
+.B output_file
+A bilingual dictionary in which each word has \fIonly\fR one
+translation equivalent.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextormono\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\fR(1),
+.I apertium\-lextor\-eval\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-lextormono.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-lextormono.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-lextormono.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-gen-lextormono 1 2006-12-11 "" ""
+.SH NAME
+apertium-gen-lextormono \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-gen\-lextormono
+.I lr\fR\ |
+.I rl\fR
+input_file output_file
+.PP
+.SH DESCRIPTION
+.BR apertium\-gen\-lextormono 
+is the application responsible for generating the monolingual
+dictionary used by the lexical selection module to know about the
+translation sense marks of each source language word.
+.SH OPTIONS
+.TP
+.B lr\fR The monolingual dictionary to generate is for left to right translation.
+.PP
+.B rl\fR The monolingual dictionary to generate is for right to left translation.
+.SH FILES
+These are the kinds of files used with this tool:
+.PP
+.B input_file
+A bilingual dictionary.
+.PP
+.B output_file
+A monolingual dictionary that for each word gives its translation
+sense marks.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\-eval\fR(1),
+.I apertium\-lextor\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-modes.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-modes.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-modes.1	(revision 70339)
@@ -0,0 +1,43 @@
+.TH apertium\-gen\-modes 1 2007-03-11 "" ""
+.SH NAME
+apertium\-gen\-modes \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-gen\-modes
+modes-file [package name]
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It creates a series of \fI.mode\fR files from a \fImodes-file\fR 
+these files are then put into the current directory if they are marked
+as \fIinstall\fR, and for modes that are not to be installed, for 
+example debugging modes, these are put into a \fImodes\fR directory 
+inside the linguistic data. 
+.SH OPTIONS
+If a package name is specified, it creates the modes with the apertium
+install prefix plus the package name. If you wish to install the modes, 
+you should specify the package name. If you don't want to install the modes,
+leave it off.
+.SH FILES
+.B modes-file
+A XML file that tells \fBapertium\-gen\-modes\fR which scripts must
+be created in the directory \fImodes\fR.	
+.SH SEE ALSO
+.I apertium\-interchunk\fR(1),
+.I apertium\-postchunk\fR(1),
+.I apertium\-validate\-interchunk\fR(1),
+.I apertium\-validate\-modes\fR(1),
+.I apertium\-validate\-postchunk\fR(1).
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005-2007 Universitat d'Alacant / Universidad de
+Alicante. This is free software.  You may
+redistribute copies of it under the terms of the GNU General Public
+License <http://www.gnu.org/licenses/gpl.html>.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-stopwords-lextor.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-stopwords-lextor.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-stopwords-lextor.1	(revision 70339)
@@ -0,0 +1,45 @@
+.TH apertium-gen-stopwords-lextor 1 2006-12-12 "" ""
+.SH NAME
+apertium-gen-stopwords-lextor \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-gen\-stopwords\-lextor
+n input_file output_file
+.PP
+.SH DESCRIPTION
+.BR apertium\-gen\-stopwords\-lextor 
+is the application responsible for generating the list of
+\fIstopwords\fR used by the lexical selection module
+(apertium\-lextor). Stopwords are ignored as they cannot have multiple
+translations.
+.SH OPTIONS
+.B n
+the desired number of stopwords.
+.SH FILES
+These are the kinds of parameters and files used with this tool:
+.PP
+.B input_file
+contains a large preprocessed corpus (see
+apertium\-preprocess\-corpus\-lextor).
+.PP
+.B output_file
+The file which gets the generated stopwords.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-gen\-lextormono\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\-eval\fR(1),
+.I apertium\-lextor\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-wlist-lextor-translation.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-wlist-lextor-translation.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-wlist-lextor-translation.1	(revision 70339)
@@ -0,0 +1,56 @@
+.TH apertium-gen-wlist-lextor-translation 1 2006-12-12 "" ""
+.SH NAME
+apertium-gen-wlist-lextor-translation \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-gen\-wlist\-lextor\-translation
+.B \-\-mono|\-m\fR dic.bin 
+.B \-\-bil|\-b\fR bildic.bin 
+.B \-\-wlist|\-w\fR wlistfile
+.PP
+.SH DESCRIPTION
+.BR apertium\-gen\-wlist\-lextor\-translation 
+is the application responsible for generating all the possible
+translations of polysemous words.
+.SH OPTIONS
+.TP
+.B \-\-mono|\-m\fR dic.bin
+.TP
+ Specifies the monolingual lexical selection dictionary to use (see apertium\-gen\-lextormono).
+.TP
+.B \-\-bil|\-b\fR bildic.bin
+.TP
+Specifies the bilingual lexical selection ditionary to use (see apertium\-gen\-lextorbil).
+.TP 
+.B \-\-wlist|-w\fR wlistfile
+.TP
+Specifies the list of words to translate (see apertium\-gen\-wlist\-lextor).
+.TP 
+.B \-\-help|\-h\fR
+.TP
+Shows a brief usage help.
+.TP 
+.B \-\-version|\-v\fR
+.TP
+Shows the version string of this tool and it's license.
+.SH FILES
+This tool uses no files apart from the ones associated to each option.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-lextormono\fR(1),
+.I apertium\-lextor\-eval\fR(1),
+.I apertium\-lextor\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-wlist-lextor.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-wlist-lextor.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-gen-wlist-lextor.1	(revision 70339)
@@ -0,0 +1,42 @@
+.TH apertium-gen-wlist-lextor 1 2006-12-12 "" ""
+.SH NAME
+apertium-gen-wlist-lextor \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-gen\-wlist\-lextor
+input_file output_file
+.PP
+.SH DESCRIPTION
+.BR apertium\-gen\-wlist\-lextor 
+is the application responsible for generating the list of words used by
+apertium\-lextor.
+.SH OPTIONS
+This tool currently has no options.
+.SH FILES
+These are the kinds of files used with this tool:
+.PP
+.B input_file
+is a lextor monolingual dictionary file generated with
+\fIapertium\-gen\-lextormono\fR. These files usually have the extension \fI.dix\fR.
+.PP
+.B output_file
+The file which gets the generated list of words.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-gen\-lextormono\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\-eval\fR(1),
+.I apertium\-lextor\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-lextor-eval.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-lextor-eval.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-lextor-eval.1	(revision 70339)
@@ -0,0 +1,62 @@
+.TH apertium-lextor-eval 1 2006-12-12 "" ""
+.SH NAME
+apertium-lextor-eval \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-lextor\-eval
+.B \-\-reference\fR reftext 
+.B \-\-parameters\fR | \fB\-p\fR model dic left right
+.PP
+.SH DESCRIPTION
+.BR apertium\-lextor\-eval 
+is the application used to evaluate the performance of lexical
+selection models that have been previously estimated with
+\fBapertium\-lextor\fR(1). To achieve this purpose a manually
+disambiguated corpus is used. This corpus is read from the standard
+input and must be in the intermediate format used by apertium.
+.SH OPTIONS
+.TP
+.B \-\-reference | \-r\fR
+.br
+Specifies the reference corpus used for evaluation (one word per line
+with the correct translation sense for those words with more than
+one).
+.TP
+.B \-\-parameters | \-p\fR
+.br
+It allows to specify the following required parameters:
+.TP
+.I model\fR the file containing the model to be used for the lexical selection.
+.TP
+.I dic\fR  the lexical\-selection dictionary in binary format.
+.TP
+.I left\fR left\-side context to take into account (number of words).
+.TP
+.I right\fR right\-side context to take into account (number of words).
+.PP
+.B \-\-help | \-h
+.br
+Shows this help.
+.PP
+.B \-\-version | \-v
+.br
+Shows license information.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-preprocess\-corpus\-lextor\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\-mono\fR(1),
+.I apertium\-lextor\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-preprocess-corpus-lextor.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-preprocess-corpus-lextor.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-preprocess-corpus-lextor.1	(revision 70339)
@@ -0,0 +1,48 @@
+.TH apertium-preprocess-corpus-lextor 1 2006-12-12 "" ""
+.SH NAME
+apertium-preprocess-corpus-lextor \- This application is part of
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium machine translation
+architecture: \fBhttp://apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-preprocess\-corpus\-lextor
+data_dir translation_dir input_file output_file
+.PP
+.SH DESCRIPTION
+.BR apertium\-preprocess\-corpus\-lextor 
+is the application responsible for preprocessing the training corpus
+for the lexical selector training.
+.SH OPTIONS
+This tool currently has no options.
+.SH FILES
+These are the kinds of files and directories used with this tool:
+.PP
+.B data_dir
+the path to the linguistic data to use.
+.PP
+.B translation_dir
+the translation direction to use.
+.PP
+.B input_file
+contains a large corpus in 
+.I raw\fR format.
+.PP
+.B output_file
+The file which gets the preprocessed corpus.
+.PP
+.SH SEE ALSO
+.I apertium\-gen\-lextorbil\fR(1),
+.I apertium\-gen\-lextormono\fR(1),
+.I apertium\-gen\-lextor\-eval\fR(1),
+.I apertium\-gen\-stopwords\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\fR(1),
+.I apertium\-gen\-wlist\-lextor\-translation\fR(1),
+.I apertium\-lextor\fR(1).
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+(c) 2005,2006 Universitat d'Alacant / Universidad de Alicante. All rights
+reserved.
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-acx.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-acx.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-acx.1	(revision 70339)
@@ -0,0 +1,40 @@
+.TH apertium\-validate\-acx 1 2006\-03\-11 "" ""
+.SH NAME
+apertium\-validate\-acx \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open\-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-validate\-acx 
+<input_file>
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It is a script that validates a set of structural acx rules
+against the apertium structural acx rules RNG using the
+\fBxmllint\fR utility.
+.SH OPTIONS
+It has no options.
+.SH FILES
+.B input_file
+A \fIacx.xml\fR file
+.PP
+.B acx.rng
+The DTD used to validate the input file.
+.SH SEE ALSO
+.I apertium\-gen\-modes\fR(1),
+.I apertium\-gen\-oldbil\fR(1),
+.I apertium\-interchunk\fR(1),
+.I apertium\-validate\-modes\fR(1),
+.I apertium\-validate\-interchunk\fR(1),
+.I apertium\-validate\-postchunk\fR(1).
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005-2007 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-dictionary.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-dictionary.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-dictionary.1	(revision 70339)
@@ -0,0 +1,23 @@
+.TH apertium-validate-dictionary 1 2006-03-21 "" ""
+.SH NAME
+apertium-validate-dictionary \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-validate-dictionary <input_file>
+.SH DESCRIPTION
+.BR apertium-validate-dictionary
+is a script that validates a dictionary file against
+the apertium DTD file for dictionaries using the xmllint utility.
+
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-interchunk.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-interchunk.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-interchunk.1	(revision 70339)
@@ -0,0 +1,34 @@
+.TH apertium\-validate\-interchunk 1 2006\-03\-11 "" ""
+.SH NAME
+apertium\-validate\-interchunk \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open\-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-validate\-interchunk 
+<input_file>
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It is a script that validates a set of structural interchunk rules
+against the apertium structural interchunk rules DTD using the
+\fBxmllint\fR utility.
+.SH OPTIONS
+It has no options.
+.SH FILES
+.B input_file
+A \fIinterchunk.xml\fR file
+.PP
+.B modes.dtd
+The DTD used to validate the input file.
+.PP
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005-2007 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-modes.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-modes.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-modes.1	(revision 70339)
@@ -0,0 +1,39 @@
+.TH apertium\-validate\-modes 1 2006\-03\-11 "" ""
+.SH NAME
+apertium\-validate\-modes \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open\-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-validate\-modes 
+<input_file>
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It is a script that validates a \fImodes.xml\fR file against the
+apertium structural modes DTD using the \fBxmllint\fR utility.
+.SH OPTIONS
+It has no options.
+.SH FILES
+.B input_file
+A \fImodes.xml\fR file
+.PP
+.B modes.dtd
+The DTD used to validate the input file.
+.SH SEE ALSO
+.I apertium\-gen\-modes\fR(1),
+.I apertium\-gen\-oldbil\fR(1),
+.I apertium\-interchunk\fR(1),
+.I apertium\-validate\-postchunk\fR(1),
+.I apertium\-validate\-interchunk\fR(1).
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005-2007 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-postchunk.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-postchunk.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-postchunk.1	(revision 70339)
@@ -0,0 +1,39 @@
+.TH apertium\-validate\-postchunk 1 2006\-03\-11 "" ""
+.SH NAME
+apertium\-validate\-postchunk \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open\-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium\-validate\-postchunk 
+<input_file>
+.SH DESCRIPTION
+This is an intermediate tool from Apertium level 2 engine. You should
+never have to use it independently.
+.PP
+It is a script that validates a set of structural postchunk rules
+against the apertium structural postchunk rules DTD using the
+\fBxmllint\fR utility.
+.SH OPTIONS
+It has no options.
+.SH FILES
+.B input_file
+A \fIpostchunk.xml\fR file
+.PP
+.B postchunk.dtd
+The DTD used to validate the input file.
+.SH SEE ALSO
+.I apertium\-gen\-modes\fR(1),
+.I apertium\-gen\-oldbil\fR(1),
+.I apertium\-interchunk\fR(1),
+.I apertium\-validate\-modes\fR(1),
+.I apertium\-validate\-interchunk\fR(1).
+.SH BUGS
+Lots of them...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005-2007 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-tagger.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-tagger.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-tagger.1	(revision 70339)
@@ -0,0 +1,25 @@
+.TH apertium-validate-tagger 1 2006-03-21 "" ""
+.SH NAME
+apertium-validate-tagger \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open-source machine translation
+toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-validate-tagger <input_file>
+.SH DESCRIPTION
+.BR apertium-validate-tagger
+is a script that checks the validity of a set of rules which 
+enforce the state to state transition probabilities used by the 
+part-of-speech tagger. The script uses xmllint to validate
+against a DTD.
+
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-transfer.1
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-transfer.1	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/apertium-validate-transfer.1	(revision 70339)
@@ -0,0 +1,22 @@
+.TH apertium-validate-transfer 1 2006-03-21 "" ""
+.SH NAME
+apertium-validate-transfer \- This application is part of 
+(
+.B apertium
+)
+.PP
+This tool is part of the apertium open-source machine translation toolbox: \fBhttp://www.apertium.org\fR.
+.SH SYNOPSIS
+.B apertium-validate-transfer <input_file>
+.SH DESCRIPTION
+.BR apertium-validate-transfer
+is a script that validates a set of structural transfer rules against
+the apertium structural transfer rules DTD using the xmllint utility.
+
+.SH BUGS
+Lots of...lurking in the dark and waiting for you!
+.SH AUTHOR
+Copyright (c) 2005, 2006 Universitat d'Alacant / Universidad de Alicante.
+This is free software.  You may redistribute copies of it under the terms
+of the GNU General Public License <http://www.gnu.org/licenses/gpl.html>.
+
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/deformat-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/deformat-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/deformat-header.sh	(revision 70339)
@@ -0,0 +1,51 @@
+if [ $# != 2 ]
+then if [ $# != 3 ]
+     then echo "USAGE: $(basename $0) -[aAmM] <input_file> <output_file>";
+          echo "  -a: apertium standard mode";
+          echo "  -A: apertium optimized mode (default mode)";
+          echo "  -m: matxin standard mode";
+          echo "  -M: matxin optimized mode"; 
+          exit 1;
+     elif [ $1 != "-a" ] && [ $1 != "-A" ] && [ $1 != "-m" ] && [ $1 != "-M" ]
+     then echo "USAGE: $(basename $0) -[AaMm] <input file> <output_file>";
+          echo "  -a: apertium standard mode";
+          echo "  -A: apertium optimized mode (default mode)";
+          echo "  -m: matxin standard mode";
+          echo "  -M: matxin optimized mode"; 
+          exit 1;
+     fi
+fi
+
+FLEXOPTS=""
+FILE1=$1;
+FILE2=$2;
+
+if [ $# = 2 ]
+then if [ ! -e $1 ] 
+     then echo "ERROR: '$1' file not found";
+          exit 1;
+     fi 
+fi
+
+MODE="apertium" # default mode
+
+if [ $# = 3 ]
+then if [ ! -e $2 ]
+     then echo "ERROR: '$2' file not found";
+          exit 1;
+     fi
+
+     if [ $1 = "-a" ]
+     then FLEXOPTS="";
+          MODE="apertium";
+     elif [ $1 = "-m" ]
+     then FLEXOPTS="";
+          MODE="matxin";
+     elif [ $1 = "-M" ]
+     then FLEXOPTS="-Cfer";
+          MODE="matxin";
+     fi
+
+     FILE1=$2;
+     FILE2=$3;
+fi
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/gen-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/gen-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/gen-header.sh	(revision 70339)
@@ -0,0 +1,30 @@
+if [ $# != 2 ]
+then if [ $# != 3 ]
+     then echo "USAGE: $(basename $0) [-O] <input_file> <output_file>";
+          exit 1;
+     elif [ $1 != "-O" ]
+     then echo "USAGE: $(basename $0) [-O] <input file> <output_file>";
+          exit 1;
+     fi
+fi
+
+FLEXOPTS=""
+FILE1=$1;
+FILE2=$2;
+
+if [ $# = 2 ]
+then if [ ! -e $1 ] 
+     then echo "ERROR: '$1' file not found";
+          exit 1;
+     fi 
+fi
+
+if [ $# = 3 ]
+then if [ ! -e $2 ]
+     then echo "ERROR: '$2' file not found";
+          exit 1;
+     fi
+     FLEXOPTS="-Cfer";
+     FILE1=$2;
+     FILE2=$3;
+fi
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/gen-stopwords-lextor.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/gen-stopwords-lextor.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/gen-stopwords-lextor.sh	(revision 70339)
@@ -0,0 +1,45 @@
+
+if [ $# != 3 ]
+then echo "USAGE: $(basename $0) <n> <input_file> <output_file>" 1>&2
+     echo "where <n> is the desired number of stopwords" 1>&2
+     echo "      <input_file> contains a large preprocessed corpus" 1>&2
+     echo "      <output_file> is the file to which the list of stopwords is written" 1>&2
+     exit 1
+fi
+
+N=$1
+INFILE=$2
+OUTFILE=$3
+
+if [ ! -e $INFILE  ]
+then echo "ERROR: '$INFILE' file not found" 1>&2
+     exit 1
+fi
+
+cat $INFILE |\
+sed -re "s/(\^[0-9���������������������������������������������ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz <>�+.,;:_'#*%()?�!�-]+\\$)/\1\n/g" |\
+sed -re "s/^[ \t]+//g" |\
+sed -re "s/[ \t]+$//g" |\
+sed -re "s/^\^//g" |\
+sed -re "s/\\\$$//g" |\
+awk '{if (length($0)>0) print tolower($0)}' |\
+awk '{ #Only lemma and first tag; rest of tags, if present, are ignored
+  if (index($0,">")>0)
+    print substr($0,1,index($0,">"));
+  else
+    print $0;
+}' |\
+sort | uniq -c | sort -n -r |\
+head -n $N |\
+awk 'BEGIN{FS=" "}
+{
+  c="";
+  for(i=2; i<=NF; i++) {
+    if (length(c)>0)
+      c= c " "
+    c = c $i  
+  }
+  print c;
+}' > $OUTFILE
+
+exit 0
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/gen-wlist-lextor-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/gen-wlist-lextor-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/gen-wlist-lextor-header.sh	(revision 70339)
@@ -0,0 +1,25 @@
+
+if [ $# != 2 ]
+then echo "USAGE: $(basename $0) <input_file> <output_file>" 1>&2
+     echo "where <input_file> is a lextor monolingual dictionary (.dix) file" 1>&2
+     echo "generated with apertium-gen-lextormono" 1>&2
+     exit 1
+fi
+
+if [ ! -e $1 ]
+then echo "ERROR: '$1' file not found" 1>&2
+     exit 1
+fi
+
+
+$LTTOOLBOX_PATH/lt-expand $1 | grep -v "__REGEXP__" |\
+awk 'BEGIN{FS=":"}{if(index($2,"__")>0) print $1}' |\
+sort | uniq > $2 #|\
+#awk '{ #Only lemma and first tag; rest of tags, if present, are ignored
+#  if (index($0,">")>0)
+#    print substr($0,1,index($0,">"));
+#  else
+#    print $0;
+#}' > $2
+
+exit 0
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/preprocess-corpus-lextor.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/preprocess-corpus-lextor.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/preprocess-corpus-lextor.sh	(revision 70339)
@@ -0,0 +1,54 @@
+
+if [ $# != 4 ]
+then echo "USAGE: $(basename $0) <dada_dir> <translation_dir> <input_file> <output_file>" 1>&2
+     echo "where <data_dir> is the path to the linguistic data to use" 1>&2 
+     echo "      <translation_dir> is the translation direction to use" 1>&2
+     echo "      <input_file> contains a large corpus in raw format" 1>&2
+     echo "      <output_file> is the file to which the preprocessed corpus is written" 1>&2
+     exit 1
+fi
+
+DATA_DIR=$1
+TRANSLATION_DIR=$2
+INFILE=$3
+OUTFILE=$4
+
+if [ ! -e $INFILE  ]
+then echo "ERROR: '$INFILE' file not found" 1>&2
+     exit 1
+fi
+
+if [ ! -e $DATA_DIR/$TRANSLATION_DIR.automorf.bin  ]
+then echo "ERROR: '$DATA_DIR/$TRANSLATION_DIR.automorf.bin' file not found" 1>&2
+     exit 1
+fi
+
+if [ ! -e $DATA_DIR/$TRANSLATION_DIR.prob  ]
+then echo "ERROR: '$DATA_DIR/$TRANSLATION_DIR.prob' file not found" 1>&2
+     exit 1
+fi
+
+
+cat $INFILE | $APERTIUM_PATH/apertium-destxt |\
+$LTTOOLBOX_PATH/lt-proc -a $DATA_DIR/$TRANSLATION_DIR.automorf.bin |\
+$APERTIUM_PATH/apertium-tagger -g $DATA_DIR/$TRANSLATION_DIR.prob |\
+$APERTIUM_PATH/apertium-pretransfer |\
+$APERTIUM_PATH/apertium-retxt |\
+awk 'BEGIN{FS="\\$"} #Discards characters not belonging to apertium words
+{
+  c="";
+  for (j=1; j<=NF; j++) {
+    w=$j;
+    w=substr(w,index(w,"^"));
+            
+    if ((length(w)>0) && (index(w,"^")>0)) {                    
+      if (length(c)>0)
+        c = c " ";                                  
+      c = c w "$";
+    }
+  }
+  
+  print c;
+}' >  $OUTFILE
+
+exit 0
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/script_header.sh.cmake_in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/script_header.sh.cmake_in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/script_header.sh.cmake_in	(revision 70339)
@@ -0,0 +1,7 @@
+#!${BASH}
+
+export APERTIUM_PATH=${APERTIUM_PATH}
+export LTTOOLBOX_PATH=${LTTOOLBOX_PATH}
+export DEFAULT_DIRECTORY=${DEFAULT_DIRECTORY}
+
+${SCRIPT}

Property changes on: branches/weighted-transfer/tags/midterm/apertium/apertium/script_header.sh.cmake_in
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/trans-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/trans-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/trans-header.sh	(revision 70339)
@@ -0,0 +1,107 @@
+case $# in
+  2)
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=txt
+    ;;
+  3)
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=$3
+    ;;
+  4)
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=$3
+    FICHERO=$4
+    ;;
+  5)  
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=$3
+    FICHERO=$4
+    SALIDA=$5
+    ;;
+  *)
+    echo "USAGE: $(basename $0) <datadir> <translation> [format [infile [outfile]]]"
+    echo " datadir          Directory of linguistic data"
+    echo " translation      LANG1-LANG2"
+    echo " format           one of: txt (default), txtu, html, htmlu, rtf, rtfu"
+    echo " infile           input file (stdin by default)"
+    echo " outfile          output file (stdout by default)"
+    exit 1;
+esac
+
+#Par�metros obligatorios
+PREFIJO=$2    #Direcci�n traducci�n Ejm.- es-ca
+FORMATADOR=$3 #Fuente a traducir Ejm.- txt
+
+DATOS=$1
+
+#Parametro opcional, de no estar, lee de la entrada estandar (stdin)
+FICHERO=$4    #Fichero con el texto a traducir
+
+PATH=.:/usr/local/bin:$PATH
+AUTOMORF=$DATOS/$PREFIJO.automorf.bin
+AUTOBIL=$DATOS/$PREFIJO.autobil.bin
+#AUTOBIL=$DATOS/$PREFIJO.lextorbil.bin
+AUTOGEN=$DATOS/$PREFIJO.autogen.bin
+AUTOPGEN=$DATOS/$PREFIJO.autopgen.bin
+
+DEP="dep"
+
+TURL="cat" #No hace nada, se introduce para no tener
+           #que cambiar la l�nea de montaje, pues en algunos
+	   #casos se usa como ultimo eslab�n de la cadena el
+	   #programa turl o ext-turl.
+REF=
+	      
+case "$FORMATADOR" in 
+	txt)
+		FORMATADOR="txt"
+		GENERADOR="lt-proc -g"		
+		;;
+	txtu)
+		FORMATADOR="txt"
+		GENERADOR="lt-proc -n"
+		;;
+	rtf)
+		FORMATADOR="rtf"
+		GENERADOR="lt-proc -g"		
+		;;
+	rtfu)
+		FORMATADOR="rtf"		
+		GENERADOR="lt-proc -n"
+		;;
+	html)
+		FORMATADOR="html"
+		GENERADOR="lt-proc -g"	
+		;;
+	htmlu)
+		FORMATADOR="html"
+		GENERADOR="lt-proc -n"		
+		;;
+	*) # Por defecto asumimos txt
+		FORMATADOR="txt"
+		GENERADOR="lt-proc -g"
+		;;	
+esac
+
+if [ -z $REF ]
+then 
+        REF=$FORMATADOR
+fi
+
+$APERTIUM_PATH/apertium-des$FORMATADOR $FICHERO | \
+$LTTOOLBOX_PATH/lt-proc $AUTOMORF | \
+$APERTIUM_PATH/apertium-tagger -g $DATOS/$PREFIJO.prob | \
+$APERTIUM_PATH/apertium-pretransfer | \
+#$APERTIUM_PATH/apertium-lextor -l $DATOS/$PREFIJO.lextor $DATOS/$PREFIJO.lextormono.bin 3 3 | \
+$APERTIUM_PATH/apertium-transfer $DATOS/trules-$PREFIJO.xml $DATOS/trules-$PREFIJO.bin $AUTOBIL | \
+$LTTOOLBOX_PATH/$GENERADOR $AUTOGEN  | \
+$LTTOOLBOX_PATH/lt-proc -p $AUTOPGEN | \
+if [ x$SALIDA = x ]
+then $APERTIUM_PATH/apertium-re$FORMATADOR 
+else
+  $APERTIUM_PATH/apertium-re$FORMATADOR >$SALIDA
+fi
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/trans-lextor-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/trans-lextor-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/trans-lextor-header.sh	(revision 70339)
@@ -0,0 +1,107 @@
+case $# in
+  2)
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=txt
+    ;;
+  3)
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=$3
+    ;;
+  4)
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=$3
+    FICHERO=$4
+    ;;
+  5)  
+    DATOS=$1
+    PREFIJO=$2
+    FORMATADOR=$3
+    FICHERO=$4
+    SALIDA=$5
+    ;;
+  *)
+    echo "USAGE: $(basename $0) <datadir> <translation> [format [infile [outfile]]]"
+    echo " datadir          Directory of linguistic data"
+    echo " translation      LANG1-LANG2"
+    echo " format           one of: txt (default), txtu, html, htmlu, rtf, rtfu"
+    echo " infile           input file (stdin by default)"
+    echo " outfile          output file (stdout by default)"
+    exit 1;
+esac
+
+#Par�metros obligatorios
+PREFIJO=$2    #Direcci�n traducci�n Ejm.- es-ca
+FORMATADOR=$3 #Fuente a traducir Ejm.- txt
+
+DATOS=$1
+
+#Parametro opcional, de no estar, lee de la entrada estandar (stdin)
+FICHERO=$4    #Fichero con el texto a traducir
+
+PATH=.:/usr/local/bin:$PATH
+AUTOMORF=$DATOS/$PREFIJO.automorf.bin
+#AUTOBIL=$DATOS/$PREFIJO.autobil.bin
+AUTOBIL=$DATOS/$PREFIJO.lextorbil.bin
+AUTOGEN=$DATOS/$PREFIJO.autogen.bin
+AUTOPGEN=$DATOS/$PREFIJO.autopgen.bin
+
+DEP="dep"
+
+TURL="cat" #No hace nada, se introduce para no tener
+           #que cambiar la l�nea de montaje, pues en algunos
+	   #casos se usa como ultimo eslab�n de la cadena el
+	   #programa turl o ext-turl.
+REF=
+	      
+case "$FORMATADOR" in 
+	txt)
+		FORMATADOR="txt"
+		GENERADOR="lt-proc -g"		
+		;;
+	txtu)
+		FORMATADOR="txt"
+		GENERADOR="lt-proc -n"
+		;;
+	rtf)
+		FORMATADOR="rtf"
+		GENERADOR="lt-proc -g"		
+		;;
+	rtfu)
+		FORMATADOR="rtf"		
+		GENERADOR="lt-proc -n"
+		;;
+	html)
+		FORMATADOR="html"
+		GENERADOR="lt-proc -g"	
+		;;
+	htmlu)
+		FORMATADOR="html"
+		GENERADOR="lt-proc -n"		
+		;;
+	*) # Por defecto asumimos txt
+		FORMATADOR="txt"
+		GENERADOR="lt-proc -g"
+		;;	
+esac
+
+if [ -z $REF ]
+then 
+        REF=$FORMATADOR
+fi
+
+$APERTIUM_PATH/apertium-des$FORMATADOR $FICHERO | \
+$LTTOOLBOX_PATH/lt-proc $AUTOMORF | \
+$APERTIUM_PATH/apertium-tagger -g $DATOS/$PREFIJO.prob | \
+$APERTIUM_PATH/apertium-pretransfer | \
+$APERTIUM_PATH/apertium-lextor -l $DATOS/$PREFIJO.lextor $DATOS/$PREFIJO.lextormono.bin 3 3 | \
+$APERTIUM_PATH/apertium-transfer $DATOS/trules-$PREFIJO.xml $DATOS/trules-$PREFIJO.bin $AUTOBIL | \
+$LTTOOLBOX_PATH/$GENERADOR $AUTOGEN  | \
+$LTTOOLBOX_PATH/lt-proc -p $AUTOPGEN | \
+if [ x$SALIDA = x ]
+then $APERTIUM_PATH/apertium-re$FORMATADOR 
+else
+  $APERTIUM_PATH/apertium-re$FORMATADOR >$SALIDA
+fi
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transformdic-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transformdic-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transformdic-header.sh	(revision 70339)
@@ -0,0 +1,20 @@
+if [ $# != 3 ]
+then echo "USAGE: $(basename $0) lr|rl <input_file> <output_file>";
+     exit 1;
+fi
+
+FILE1=$2;
+FILE2=$3;
+
+if [ ! -e $2 ] 
+then echo "ERROR: '$1' file not found";
+     exit 1;
+fi
+
+if [ $1 = "lr" ]
+then xsltproc $XSLTPROC_OPTIONS_LR $STYLESHEET $FILE1 >$FILE2
+elif [ $1 = "rl" ]
+then xsltproc $XSLTPROC_OPTIONS_RL $STYLESHEET $FILE1 >$FILE2
+else 
+  echo "ERROR: $1 option invalid";
+fi
Index: branches/weighted-transfer/tags/midterm/apertium/apertium/transformdicbil-header.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium/transformdicbil-header.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium/transformdicbil-header.sh	(revision 70339)
@@ -0,0 +1,14 @@
+if [ $# != 2 ]
+then echo "USAGE: $(basename $0) <input_file> <output_file>";
+     exit 1;
+fi
+
+FILE1=$1;
+FILE2=$2;
+
+if [ ! -e $1 ] 
+then echo "ERROR: '$1' file not found";
+     exit 1;
+fi
+
+xsltproc $XSLTPROC_OPTIONS $STYLESHEET $FILE1 >$FILE2
Index: branches/weighted-transfer/tags/midterm/apertium/apertium
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium/apertium
___________________________________________________________________
Added: svn:ignore
## -0,0 +1,43 ##
+.deps
+.libs
+Makefile
+Makefile.in
+stamp-*
+apertium
+apertium-[dfgilprtv]*[!1]
+apertium_config.h
+apertium_config.h.in
+apertium_deshtml.cc
+apertium_deslatex.cc
+apertium_desmediawiki.cc
+apertium_desodt.cc
+apertium_despptx.cc
+apertium_desrtf.cc
+apertium_destxt.cc
+apertium_deswxml.cc
+apertium_desxlsx.cc
+apertium_desxpresstag.cc
+apertium-multiple-translations
+apertium_postlatex.cc
+apertium_postlatex_raw.cc
+apertium_prelatex.cc
+apertium_rehtml.cc
+apertium_rehtml_noent.cc
+apertium_relatex.cc
+apertium_remediawiki.cc
+apertium_reodt.cc
+apertium_repptx.cc
+apertium_rertf.cc
+apertium_retxt.cc
+apertium_rewxml.cc
+apertium_rexlsx.cc
+apertium_rexpresstag.cc
+apertium-unformat
+apertium-utils-fixlatex
+dix.rnc
+format.rnc
+interchunk.rnc
+modes.rnc
+postchunk.rnc
+tagger.rnc
+transfer.rnc
Index: branches/weighted-transfer/tags/midterm/apertium/.gitignore
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/.gitignore	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/.gitignore	(revision 70339)
@@ -0,0 +1,81 @@
+*.la
+*.lo
+*.o
+*.pyc
+
+**.deps/
+**.dirstamp
+
+# /
+/autom4te.cache
+
+/compile
+/config.guess
+/config.status
+/config.sub
+/configure
+/depcomp
+/install-sh
+/libtool
+/ltmain.sh
+/missing
+
+/aclocal.m4
+/config.log
+/INSTALL
+/Makefile
+/Makefile.in
+
+/*.pc
+
+# /apertium/
+/apertium/.libs
+
+/apertium/apertium
+/apertium/apertium-*[!1]
+
+!/apertium/apertium-createmodes.awk
+!/apertium/apertium-header.sh
+!/apertium/apertium-multiple-translations.cc
+!/apertium/apertium-unformat-header.sh
+
+
+/apertium/apertium_config.h
+/apertium/apertium_config.h.in
+/apertium/apertium_config.h.in~
+/apertium/apertium_deshtml.cc
+/apertium/apertium_deslatex.cc
+/apertium/apertium_desmediawiki.cc
+/apertium/apertium_desodt.cc
+/apertium/apertium_despptx.cc
+/apertium/apertium_desrtf.cc
+/apertium/apertium_destxt.cc
+/apertium/apertium_deswxml.cc
+/apertium/apertium_desxlsx.cc
+/apertium/apertium_desxpresstag.cc
+/apertium/apertium_postlatex.cc
+/apertium/apertium_postlatex_raw.cc
+/apertium/apertium_prelatex.cc
+/apertium/apertium_rehtml.cc
+/apertium/apertium_rehtml_noent.cc
+/apertium/apertium_relatex.cc
+/apertium/apertium_remediawiki.cc
+/apertium/apertium_reodt.cc
+/apertium/apertium_repptx.cc
+/apertium/apertium_rertf.cc
+/apertium/apertium_retxt.cc
+/apertium/apertium_rewxml.cc
+/apertium/apertium_rexlsx.cc
+/apertium/apertium_rexpresstag.cc
+
+/apertium/dix.rnc
+/apertium/format.rnc
+/apertium/interchunk.rnc
+/apertium/Makefile
+/apertium/Makefile.in
+/apertium/modes.rnc
+/apertium/postchunk.rnc
+/apertium/tagger.rnc
+/apertium/transfer.rnc
+
+/apertium/stamp-*
Index: branches/weighted-transfer/tags/midterm/apertium/Makefile.am
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/Makefile.am	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/Makefile.am	(revision 70339)
@@ -0,0 +1,19 @@
+SUBDIRS = $(GENERIC_LIBRARY_NAME)
+DIST_SUBDIRS = $(GENERIC_LIBRARY_NAME)
+
+modesdir=$(prefix)/share/apertium/modes
+
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = apertium.pc
+
+aclocaldir = $(datadir)/aclocal
+aclocal_DATA = apertium.m4
+
+EXTRA_DIST=autogen.sh README-MODES apertium.m4
+
+install-data-local:
+	mkdir -p $(DESTDIR)$(modesdir)
+	$(INSTALL_DATA) README-MODES  $(DESTDIR)$(modesdir)/README
+
+test: tests/run_tests.py
+	$<
Index: branches/weighted-transfer/tags/midterm/apertium/configure.ac
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/configure.ac	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/configure.ac	(revision 70339)
@@ -0,0 +1,189 @@
+#                                               -*- Autoconf -*-
+# Process this file with autoconf to produce a configure script.
+
+AC_PREREQ(2.52)
+
+m4_define([required_lttoolbox_version], [3.3.3])
+m4_define([required_libxml_version], [2.6.17])
+m4_define([required_libpcre_version], [6.4])
+#m4_define([required_pkg_config_version], [0.15])
+
+AC_INIT([apertium], [3.4.2], [sortiz@users.sourceforge.net])
+AC_CONFIG_HEADER([apertium/apertium_config.h])
+
+AC_CANONICAL_SYSTEM
+
+GENERIC_LIBRARY_NAME=apertium
+
+# Release versioning
+GENERIC_MAJOR_VERSION=3
+GENERIC_MINOR_VERSION=4
+GENERIC_MICRO_VERSION=0
+
+# API version (often = GENERIC_MAJOR_VERSION.GENERIC_MINOR_VERSION)
+GENERIC_API_VERSION=$GENERIC_MAJOR_VERSION.$GENERIC_MINOR_VERSION
+AC_SUBST(GENERIC_API_VERSION)
+AC_SUBST(GENERIC_MAJOR_VERSION)
+
+# Shared library versioning
+GENERIC_LIBRARY_VERSION=0:0:0
+#                       | | |
+#                +------+ | +---+
+#                |        |     |
+#             current:revision:age
+#                |        |     |
+#                |        |     +- increment if interfaces have been added
+#                |        |        set to zero if interfaces have been removed
+#                                  or changed
+#                |        +- increment if source code has changed
+#                |           set to zero if current is incremented
+#                +- increment if interfaces have been added, removed or changed
+
+AC_SUBST(GENERIC_LIBRARY_VERSION)
+PACKAGE=$GENERIC_LIBRARY_NAME
+AC_SUBST(GENERIC_LIBRARY_NAME)
+
+GENERIC_VERSION=$GENERIC_MAJOR_VERSION.$GENERIC_MINOR_VERSION.$GENERIC_MICRO_VERSION
+GENERIC_RELEASE=$GENERIC_MAJOR_VERSION.$GENERIC_MINOR_VERSION
+AC_SUBST(GENERIC_RELEASE)
+AC_SUBST(GENERIC_VERSION)
+
+VERSION=$GENERIC_VERSION
+
+AM_INIT_AUTOMAKE(no-define)
+
+AC_PROG_CXX
+AC_PROG_LIBTOOL
+AM_SANITY_CHECK
+AC_LANG_CPLUSPLUS
+
+CFLAGS="-Wall -Wextra $CFLAGS"
+CXXFLAGS="-Wall -Wextra $CXXFLAGS"
+
+AC_ARG_ENABLE(debug,
+              [  --enable-debug    Enable "-g -Wall" compiler options],
+              [CXXFLAGS="-g -Wall"; CFLAGS="-g -Wall"; AC_DEFINE([ENABLE_DEBUG], [1], [ENABLE_DEBUG])])
+
+AC_ARG_ENABLE(profile,
+              [  --enable-profile  Enable "-pg -g -Wall" compiler options],
+              [CXXFLAGS="-pg -g -Wall"; CFLAGS="-pg -g -Wall"; LDFLAGS="-pg"])
+
+
+AC_PATH_PROG(XMLLINT, xmllint, no)
+if test x$ac_cv_path_XMLLINT = x
+then
+  AC_MSG_ERROR([You don't have xmllint installed.])
+fi
+if test x$ac_cv_path_XMLLINT = xno
+then
+  AC_MSG_ERROR([You don't have xmllint installed.])
+fi
+
+  AC_PATH_PROG(XSLTPROC, xsltproc, no)
+  if test x$ac_cv_path_XSLTPROC = x
+  then
+    AC_MSG_ERROR([You don't have xsltproc installed.])
+  fi
+  if test x$ac_cv_path_XSLTPROC = xno
+  then
+    AC_MSG_ERROR([You don't have xsltproc installed.])
+  fi
+
+AC_PATH_PROG(BASH, bash, no)
+if test x$ac_cv_path_BASH = x
+then
+  AC_MSG_ERROR([You don't have bash installed.])
+fi
+if test x$ac_cv_path_BASH = xno
+then
+  AC_MSG_ERROR([You don't have bash installed.])
+fi
+
+AC_PATH_PROG(FLEX, flex, no)
+if test x$ac_cv_path_FLEX = x
+then
+  AC_MSG_ERROR([You don't have flex installed.])
+fi
+if test x$ac_cv_path_FLEX = xno
+then
+  AC_MSG_ERROR([You don't have flex installed.])
+fi
+
+AC_PATH_PROG(PKG_CONFIG, pkg-config, no)
+if test x$ac_cv_path_PKG_CONFIG = x
+then
+  AC_MSG_ERROR([You don't have pkg-config installed.])
+fi
+if test x$ac_cv_path_PKG_CONFIG = xno
+then
+  AC_MSG_ERROR([You don't have pkg-config installed.])
+fi
+
+AC_CHECK_FUNCS(strcasecmp)
+
+if test x$(uname) != xDarwin;
+then
+AC_CHECK_HEADER(pcreposix.h,
+  AC_CHECK_LIB(pcre, pcre_fullinfo,[
+    LIBS="$LIBS -lpcreposix -lpcre"
+    no_comp_check=yes],
+    AC_MSG_ERROR([*** unable to locate pcre library ***])),
+  AC_MSG_ERROR([*** unable to locate pcreposix.h include file ***]))
+
+AC_CHECK_HEADER(pcrecpp.h,
+  AC_CHECK_LIB(pcrecpp,pcre_compile,[
+  LIBS="$LIBS -lpcrecpp"
+  no_comp_check=yes],
+  AC_MSG_ERROR([*** unable to locate pcrecpp library ***])),
+  AC_MSG_ERROR([*** unable to locate pcrecpp.h include file ***]))
+fi
+
+
+PKG_CHECK_MODULES(APERTIUM, [
+  lttoolbox >= required_lttoolbox_version
+  libxml-2.0 >= required_libxml_version
+  libpcre >= required_libpcre_version], CPPFLAGS="$CPPFLAGS $APERTIUM_CFLAGS"; LIBS="$LIBS $APERTIUM_LIBS")
+
+# Check for wide strings
+AC_DEFUN([AC_CXX_WSTRING],[
+  AC_CACHE_CHECK(whether the compiler supports wide strings,
+  ac_cv_cxx_wstring,
+  [AC_LANG_SAVE
+   AC_LANG_CPLUSPLUS
+   AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include <string>]],[[
+std::wstring test = L"test";
+   ]])],
+   [ac_cv_cxx_wstring=yes], [ac_cv_cxx_wstring=no])
+   AC_LANG_RESTORE
+  ])
+])
+
+AC_CXX_WSTRING
+AC_C_BIGENDIAN
+
+if test "$ac_cv_cxx_wstring" = no
+then
+  AC_MSG_ERROR([Missing wide string support])
+fi
+
+
+# Checks for header files.
+AC_HEADER_STDC
+AC_CHECK_HEADERS([stdlib.h string.h unistd.h stddef.h])
+
+# Checks for typedefs, structures, and compiler characteristics.
+AC_HEADER_STDBOOL
+AC_C_CONST
+AC_TYPE_SIZE_T
+
+# Checks for library functions.
+AC_FUNC_ERROR_AT_LINE
+
+AC_CHECK_DECLS([fread_unlocked, fwrite_unlocked, fgetc_unlocked, fputc_unlocked, fputs_unlocked, getopt, getopt_long, fgetwc_unlocked, fputwc_unlocked, fgetws_unlocked, fputws_unlocked])
+AC_CHECK_FUNCS([setlocale strdup getopt snprintf mbtowc])
+AC_REPLACE_FUNCS(getopt_long)
+
+AM_CONDITIONAL([WINDOWS], [test x$version_type = xwindows])
+AS_IF([test x$version_type = xwindows], [AC_DEFINE(HAVE_GETOPT_LONG,0)], [])
+
+AC_OUTPUT([Makefile apertium.pc apertium/Makefile])
Index: branches/weighted-transfer/tags/midterm/apertium/tests/run_tests.py
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/tests/run_tests.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/tests/run_tests.py	(revision 70339)
@@ -0,0 +1,17 @@
+#!/usr/bin/env python3
+
+import sys
+import os
+sys.path.append(os.path.realpath("."))
+
+import unittest
+import pretransfer
+
+if __name__ == "__main__":
+    os.chdir(os.path.dirname(__file__))
+    failures = 0
+    for module in [pretransfer]:
+        suite = unittest.TestLoader().loadTestsFromModule(module)
+        res = unittest.TextTestRunner(verbosity = 2).run(suite)
+        failures += len(res.failures)
+    sys.exit(min(failures, 255))

Property changes on: branches/weighted-transfer/tags/midterm/apertium/tests/run_tests.py
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium/tests/pretransfer/__init__.py
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/tests/pretransfer/__init__.py	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/tests/pretransfer/__init__.py	(revision 70339)
@@ -0,0 +1,94 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+import unittest
+
+import itertools
+from subprocess import Popen, PIPE, call
+from tempfile import mkdtemp
+from shutil import rmtree
+
+import signal
+class Alarm(Exception):
+    pass
+
+class PretransferTest(unittest.TestCase):
+    """Subclass and override inputs/expectedOutputs (and possibly other
+stuff) to create new pretransfer tests."""
+
+    flags = ["-z"]
+    inputs = [""]
+    expectedOutputs = [""]
+    expectedRetCodeFail = False
+
+    def alarmHandler(self, signum, frame):
+        raise Alarm
+
+    def withTimeout(self, seconds, cmd, *args, **kwds):
+        signal.signal(signal.SIGALRM, self.alarmHandler)
+        signal.alarm(seconds)
+        ret = cmd(*args, **kwds)
+        signal.alarm(0)         # reset the alarm
+        return ret
+
+    def communicateFlush(self, string):
+        self.proc.stdin.write(string.encode('utf-8'))
+        self.proc.stdin.write(b'\0')
+        self.proc.stdin.flush()
+
+        output = []
+        char = None
+        try:
+            char = self.withTimeout(2, self.proc.stdout.read, 1)
+        except Alarm:
+            pass
+        while char and char != b'\0':
+            output.append(char)
+            try:
+                char = self.withTimeout(2, self.proc.stdout.read, 1)
+            except Alarm:
+                break           # send what we got up till now
+
+        return b"".join(output).decode('utf-8')
+
+    def runTest(self):
+        try:
+            self.proc = Popen(["../apertium/apertium-pretransfer"] + self.flags,
+                              stdin=PIPE,
+                              stdout=PIPE,
+                              stderr=PIPE)
+
+            for inp, exp in zip(self.inputs, self.expectedOutputs):
+                self.assertEqual(self.communicateFlush(inp+"[][\n]"),
+                                 exp+"[][\n]")
+
+            self.proc.communicate() # let it terminate
+            self.proc.stdin.close()
+            self.proc.stdout.close()
+            self.proc.stderr.close()
+            retCode = self.proc.poll()
+            if self.expectedRetCodeFail:
+                self.assertNotEqual(retCode, 0)
+            else:
+                self.assertEqual(retCode, 0)
+
+        finally:
+            pass
+
+
+class BasicPretransferTest(PretransferTest):
+    inputs =          ["^a<n>$", "^a<n>+c<po>$",   "^a<vblex><pres># b$", "[<div>]^a<n>$", "[<div>]^a<vblex><pres># b$"]
+    expectedOutputs = ["^a<n>$", "^a<n>$ ^c<po>$", "^a# b<vblex><pres>$", "[<div>]^a<n>$", "[<div>]^a# b<vblex><pres>$"]
+
+class JoinGroupPretransferTest(PretransferTest):
+    inputs =          ["[<div>]^a<vblex><pres>+c<po># b$",   "[<div>]^a<vblex><pres>+c<po>+d<po># b$"]
+    expectedOutputs = ["[<div>]^a# b<vblex><pres>$ ^c<po>$", "[<div>]^a# b<vblex><pres>$ ^c<po>$ ^d<po>$"]
+
+
+# Proposed inline blank format:
+class InlineBlankPretransferTest(PretransferTest):
+    inputs =          ["[{<i>}]^a<vblex><pres>+c<po># b$",          "[{<i>}]^a<vblex><pres>+c<po>+d<po># b$"]
+    expectedOutputs = ["[{<i>}]^a# b<vblex><pres>$ [{<i>}]^c<po>$", "[{<i>}]^a# b<vblex><pres>$ [{<i>}]^c<po>$ [{<i>}]^d<po>$"]
+    @unittest.expectedFailure
+    def runTest(self):
+        super().runTest(self)
Index: branches/weighted-transfer/tags/midterm/apertium/tests/README
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/tests/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/tests/README	(revision 70339)
@@ -0,0 +1,7 @@
+Tests require python3, run like
+
+    python3 tests/run_tests.py
+
+You may have to do "(sudo) make install" once before running the tests.
+
+They should all pass.
Index: branches/weighted-transfer/tags/midterm/apertium/Jenkinsfile
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/Jenkinsfile	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/Jenkinsfile	(revision 70339)
@@ -0,0 +1,10 @@
+node {
+   stage 'Checkout'
+   checkout scm
+
+   stage 'Build'
+   sh "./autogen.sh && make clean && make"
+
+   stage 'Test'
+   sh "make test"
+}
Index: branches/weighted-transfer/tags/midterm/apertium/NEWS
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/NEWS	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/NEWS	(revision 70339)
@@ -0,0 +1,128 @@
+
+===================
+ NEWS for apertium
+===================
+
+SVN
+---
+
+Version 3.4.2, 2016-05-15 (-r68437)
+---------------------------------
+
+* some bugfixes to apertium-tagger, e.g.
+  https://sourceforge.net/p/apertium/tickets/94/
+
+* bugfixes to modes: now accept dirs with spaces, and allow installing apertium
+  itself and language data to different prefixes, as well as auto-generating
+  debug modes
+
+* fix a crash when apertium-tagger is compiled with with clang
+
+* new option -n to deformatters turns off dot-insertion
+  http://sourceforge.net/p/apertium/tickets/68
+
+* new transfer instruction <reject-current-rule shifting="yes|no"/>;
+  see transfer.dtd for details (not implemented for
+  interchunk/postchunk)
+
+* apertium-transfer-tools-generalisation-dev branch merged; outputs
+  extra trace information from transfer for generalising
+  corpus-generated transfer rules
+
+* apertium-tagger: supervised training and tagging for unigram models
+  based on http://coltekin.net/cagri/papers/trmorph-tools.pdf
+
+* fix some off-by-one/out-of-bounds segfaults in transfer
+  https://sourceforge.net/p/apertium/tickets/89/
+
+* various distribution-related fixes, static analysis fixes,
+  documentation
+
+Version 3.4.0, 2015-03-17 (-r59200)
+---------------------------------
+
+* transfer files now work even if they were compiled with a different
+  version of pcre
+
+* more explicit validation checks on .dix compilation
+
+* various fixes to driver script:
+
+  * `apertium -d . -l` behaves as expected now
+
+  * `>>` no longer empties out the destination file
+
+  * safer variable quoting
+
+* some Windows Unicode fixes
+
+* tagger now resets its state after a flush
+
+
+Version 3.3, 2014-08-20 (-r56825)
+---------------------------------
+
+* new Light Sliding Window Part-of-Speech Tagger (GsoC project merged)
+
+* new LaTeX format handler
+
+* new html-noent format handler (html without turning non-ASCII into entities)
+
+* bilingual lookup can now be separate from transfer
+
+  * see new -b options to lt-proc/apertium-transfer
+
+* apertium.m4 now available for language pairs to simplify build rules
+  and depend on monolingual data
+
+* some memory leaks and many minor bugs fixed
+
+  * pretransfer now allows '+' inside tags
+
+* --trace modes for transfer
+
+
+Version 3.2, 2010-09-21 (-r25741)
+---------------------------------
+
+* Fixed some bugs in pretransfer, allow '+' inside tags
+
+* Updated the DTDs to allow comments anywhere
+
+
+Version 3.1, 2008-09-29
+-----------------------
+
+
+Version 3.0, 2008-08-01
+-----------------------
+
+* Debian package
+
+
+Version 2.0, 2007-06-19
+-----------------------
+
+
+Version 1.9, 2006-12-15
+-----------------------
+
+
+Version 1.0, 2006-10-02
+-----------------------
+
+* Debian package
+
+
+Version 0.9, 2005-09-29
+-----------------------
+
+
+Version 0.8, 2005-08-01
+-----------------------
+
+
+
+# Local Variables:
+# mode: markdown
+# End:
Index: branches/weighted-transfer/tags/midterm/apertium/apertium.m4
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium.m4	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium.m4	(revision 70339)
@@ -0,0 +1,155 @@
+# apertium.m4 - Macros to locate and utilise apertium libraries -*- Autoconf -*-
+# serial 1 (apertium-3.4.2)
+#
+# Copyright (C) 2013--2016 Universitat d'Alacant / Universidad de Alicante
+#
+# This program is free software; you can redistribute it and/or
+# modify it under the terms of the GNU General Public License as
+# published by the Free Software Foundation; either version 2 of the
+# License, or (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <http://www.gnu.org/licenses/>.
+
+
+# AP_CHECK_LING([ID], [MONOLINGUAL_PACKAGE])
+#
+# Check to see whether MONOLINGUAL_PACKAGE exists, and if so sets
+# AP_LIB[ID] and AP_SRC[ID].
+#
+# As an example, AP_CHECK_LING([1], [apertium-fie]) would check that
+# apertium-fie exists, and set AP_LIB1 and AP_SRC1 to the paths
+# containing the binaries and sources respectively of that monolingual
+# language package.
+#
+# Also sets up options --with-lang[ID] (e.g. --with-lang1) if the user
+# wants to use the source code checkout instead of installed files.
+# ------------------------------------------
+AC_DEFUN([AP_CHECK_LING],
+[
+  AC_ARG_VAR([AP_SRC][$1], [Path to $2 sources, same as AP_LIB$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_LIB][$1], [Path to $2 binaries, same as AP_SRC$1 if --with-lang$1 set])
+  AC_ARG_VAR([AP_SUBDIRS], [List of all --with-lang dirs; add it to SUBDIRS to make configure-specified dependencies recursively])
+  AC_ARG_WITH([lang][$1],
+    [dnl
+AS_HELP_STRING([--with-lang][$1],dnl
+[Uninstalled source directory for $2, defines AP_SRC$1 and AP_LIB$1 for Makefile, otherwise these are set to paths of installed files.])
+    ],
+    [
+      AP_LIB$1=$withval
+      AP_SRC$1=$withval
+      echo "Using $2 from $withval"
+      AP_SUBDIRS="$AP_SUBDIRS $withval"
+    ],
+    [
+      # TODO: PKG_CHECK_MODULES sets useless variables, while _EXISTS
+      # doesn't error if not found, should make a PKG_CHECK macro that
+      # errors but does not set _CFLAGS/_LIBS
+      PKG_CHECK_MODULES(m4_toupper(m4_bpatsubst($2, [-], [_])), [$2])
+      AP_LIB$1=`pkg-config --variable=dir $2`
+      AP_SRC$1=`pkg-config --variable=srcdir $2`
+    ])
+  if test -z "$AP_SRC$1" || ! test -d "$AP_SRC$1"; then
+    AC_MSG_ERROR([Could not find sources dir for $2 (AP_SRC$1="$AP_SRC$1")])
+  fi
+])
+
+
+# AP_MKINCLUDE()
+#
+# Creates the file ap_include.am and sets the variable ap_include to
+# point to this path. Now in your Makefile.am you can include
+# ap_include.am by writing @ap_include@ on a line by itself.
+#
+# The file defines a pattern rule for making modes files, and a goal
+# for installing the ones that have install="yes" in modes.xml. To
+# generate modes, include a line like
+#
+#     noinst_DATA=modes/$(PREFIX1).mode
+#
+# in your Makefile.am with _at most one mode_ (the others will be
+# created even if you list only one, listing several will lead to
+# trouble with parallell make).
+# 
+# Install the modes by making install-data-local dependent on
+# install-modes, ie.
+#
+#     install-data-local: install-modes
+#
+# Also defined is a goal for making the .deps folder. If you want some
+# file to be built in a folder named .deps, just make that goal
+# dependent on .deps/.d, e.g.
+#
+#     .deps/intermediate.dix: original.dix .deps/.d
+# 
+# ------------------------------------------
+AC_DEFUN([AP_MKINCLUDE],
+[
+  AC_SUBST_FILE(ap_include)
+  ap_include=$srcdir/ap_include.am
+
+  cat >$srcdir/ap_include.am <<EOF
+
+modes/%.mode: modes.xml
+	apertium-validate-modes modes.xml
+	apertium-gen-modes modes.xml
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then mv \$\$modes modes/; fi
+
+apertium_modesdir=\$(prefix)/share/apertium/modes/
+install-modes:
+	mv modes modes.bak
+	apertium-gen-modes -f modes.xml \$(prefix)/share/apertium/\$(BASENAME)
+	rm -rf modes
+	mv modes.bak modes
+	test -d \$(DESTDIR)\$(apertium_modesdir) || mkdir \$(DESTDIR)\$(apertium_modesdir)
+	modes=\`xmllint --xpath '//mode@<:@@install="yes"@:>@/@name' modes.xml | sed 's/ *name="\(@<:@^"@:>@*\)"/\1.mode /g'\`; \\
+		if test -n "\$\$modes"; then \\
+			\$(INSTALL_DATA) \$\$modes \$(DESTDIR)\$(apertium_modesdir); \\
+			rm \$\$modes; \\
+		fi
+
+.deps/.d:
+	test -d .deps || mkdir .deps
+	touch \$[]@
+
+.PRECIOUS: .deps/.d
+
+langs:
+	@fail=; \
+	if \$(am__make_keepgoing); then \
+	  failcom='fail=yes'; \
+	else \
+	  failcom='exit 1'; \
+	fi; \
+	dot_seen=no; \
+	list='\$(AP_SUBDIRS)'; \
+	for subdir in \$\$list; do \
+	  echo "Making \$\$subdir"; \
+	  (\$(am__cd) \$\$subdir && \$(MAKE) \$(AM_MAKEFLAGS) all-am) \
+	  || eval \$\$failcom; \
+	done; \
+	\$(MAKE) \$(AM_MAKEFLAGS) all-am || exit 1; \
+	test -z "\$\$fail"
+.PHONY: langs
+
+
+.deps/%.autobil.prefixes: %.autobil.bin .deps/.d
+	lt-print $< | sed 's/ /@_SPACE_@/g' > .deps/\@S|@*.autobil.att
+	hfst-txt2fst -e ε <  .deps/\@S|@*.autobil.att > .deps/\@S|@*.autobil.hfst
+	hfst-project -p upper .deps/\@S|@*.autobil.hfst > .deps/\@S|@*.autobil.upper                                   # bidix
+	echo ' @<:@ ? - %+ @:>@* ' | hfst-regexp2fst > .deps/\@S|@*.any-nonplus.hfst                                                        # [^+]*
+	hfst-concatenate -1 .deps/\@S|@*.autobil.upper -2 .deps/\@S|@*.any-nonplus.hfst -o .deps/\@S|@*.autobil.nonplussed    # bidix [^+]*
+	echo ' %+ ' | hfst-regexp2fst > .deps/\@S|@*.single-plus.hfst                                                                 # +
+	hfst-concatenate -1 .deps/\@S|@*.single-plus.hfst -2 .deps/\@S|@*.autobil.nonplussed -o .deps/\@S|@*.autobil.postplus # + bidix [^+]*
+	hfst-repeat -f0 -t3 -i .deps/\@S|@*.autobil.postplus -o .deps/\@S|@*.autobil.postplus.0,3                      # (+ bidix [^+]*){0,3} -- gives at most three +
+	hfst-concatenate -1 .deps/\@S|@*.autobil.nonplussed -2 .deps/\@S|@*.autobil.postplus.0,3 -o \@S|@@                 # bidix [^+]* (+ bidix [^+]*){0,3}
+
+EOF
+
+])
Index: branches/weighted-transfer/tags/midterm/apertium/apertium.pc.in
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/apertium.pc.in	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/apertium.pc.in	(revision 70339)
@@ -0,0 +1,10 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: apertium
+Description: rule-based machine translation system
+Version: @VERSION@
+Libs: -L${libdir} -l@GENERIC_LIBRARY_NAME@@GENERIC_MAJOR_VERSION@ @APERTIUM_LIBS@
+Cflags: -I${includedir}/@GENERIC_LIBRARY_NAME@-@GENERIC_API_VERSION@ -I${libdir}/@GENERIC_LIBRARY_NAME@-@GENERIC_API_VERSION@/include @APERTIUM_CFLAGS@
Index: branches/weighted-transfer/tags/midterm/apertium/COPYING
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/COPYING	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/COPYING	(revision 70339)
@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.
Index: branches/weighted-transfer/tags/midterm/apertium/COPYING.hunalign
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/COPYING.hunalign	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/COPYING.hunalign	(revision 70339)
@@ -0,0 +1,502 @@
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2.1 of the License, or (at your option) any later version.
+
+    This library is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
Index: branches/weighted-transfer/tags/midterm/apertium/README
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/README	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/README	(revision 70339)
@@ -0,0 +1,68 @@
+REQUIREMENTS
+
+* This package needs the package lttoolbox-3.3.1 installed in the
+system, as well as libxml and libpcre.
+
+See www.apertium.org for more information on installing.
+
+DESCRIPTION
+
+When building, this package generates, among others, the following
+modules:
+
+* apertium-deshtml, apertium-desrtf, apertium-destxt
+  Deformatters for html, rtf and txt document formats.
+
+* apertium-rehtml, apertium-rertf, apertium-retxt
+  Reformatters for html, rtf and txt document formats.
+
+* apertium
+  Translator program.  Execute without parameters to see the usage.
+
+QUICK START
+
+1) Download the packages for lttoolbox-VERSION.tar.gz and
+   apertium-VERSION.tar.gz and linguistic data
+
+   Note: If you are using the translator from SVN, run ./autogen.sh before
+         running ./configure in all cases.
+
+2) Unpack lttoolbox and do ('#' means 'do that with root privileges'):
+   $ cd lttoolbox-VERSION
+   $ ./configure
+   $ make
+   # make install
+
+3) Unpack apertium and do:
+   $ cd apertium-VERSION
+   $ ./configure
+   $ make
+   # make install
+
+4) Unpack linguistic data (LING_DATA_DIR) and do:
+   $ cd LING_DATA_DIR
+   $ ./configure
+   $ make
+   and wait for a while (minutes).
+
+5) Use the translator
+
+   USAGE: apertium [-d datadir] [-f format] [-u] <direction> [in [out]]
+    -d datadir       directory of linguistic data
+    -f format        one of: txt (default), html, rtf, odt, docx, wxml, xlsx, pptx,
+                     xpresstag, html-noent, latex, latex-raw
+    -a               display ambiguity
+    -u               don't display marks '*' for unknown words
+    -n               don't insert period before possible sentence-ends
+    -m memory.tmx    use a translation memory to recycle translations
+    -o direction     translation direction using the translation memory,
+                     by default 'direction' is used instead
+    -l               lists the available translation directions and exits
+    direction        typically, LANG1-LANG2, but see modes.xml in language data
+    in               input file (stdin by default)
+    out              output file (stdout by default)
+
+
+   Sample:
+
+   $ apertium -f txt es-ca <input >output
Index: branches/weighted-transfer/tags/midterm/apertium/ChangeLog
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/ChangeLog	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/ChangeLog	(revision 70339)
@@ -0,0 +1,11 @@
+(See SVN for the actual ChangeLog.)
+
+
+
+Mon Jun  5 00:29:11 BST 2006
+
+Initial packaging.
+
+Wed Oct  3 07:12:19 BST 2007
+
+Packaging version 3.0.
Index: branches/weighted-transfer/tags/midterm/apertium/autogen.sh
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/autogen.sh	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/autogen.sh	(revision 70339)
@@ -0,0 +1,35 @@
+#! /bin/sh
+
+# If the user specified a --prefix, take that, otherwise /usr/local/
+# is the default.
+PREFIX=/usr/local
+prefixnext=false
+for i in "$@"; do
+    case $i in
+        --prefix=*)		# equals separated:
+	    PREFIX="${i#*=}"
+	    ;;
+        --prefix)		# space separated:
+	    prefixnext=true
+	    ;;
+        *)
+	    $prefixnext && PREFIX="$i" && prefixnext=false
+	    ;;
+    esac
+done
+
+# Set the paths needed by libtool/pkg-config/aclocal etc. By inferring
+# them based on --prefix , users don't have to edit ~/.bashrc. We only
+# append, so if a user has some other preference, that will override.
+PATH="${PATH}:/usr/local/bin"
+export PATH
+LD_LIBRARY_PATH="${LD_LIBRARY_PATH}:${PREFIX}/lib"
+export LD_LIBRARY_PATH
+PKG_CONFIG_PATH="${PKG_CONFIG_PATH}:${PREFIX}/share/pkgconfig:${PREFIX}/lib/pkgconfig"
+export PKG_CONFIG_PATH
+ACLOCAL_PATH="${ACLOCAL_PATH}:${PREFIX}/share/aclocal"
+export ACLOCAL_PATH
+
+
+# Pass on all args to configure
+autoreconf -fi && ./configure "$@"

Property changes on: branches/weighted-transfer/tags/midterm/apertium/autogen.sh
___________________________________________________________________
Added: svn:executable
## -0,0 +1 ##
+*
\ No newline at end of property
Index: branches/weighted-transfer/tags/midterm/apertium/README-MODES
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/README-MODES	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/README-MODES	(revision 70339)
@@ -0,0 +1,3 @@
+For information on modes, please see our Wiki:
+
+  http://wiki.apertium.org/wiki/Modes
Index: branches/weighted-transfer/tags/midterm/apertium/AUTHORS
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/AUTHORS	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/AUTHORS	(revision 70339)
@@ -0,0 +1,11 @@
+(c) 2005-2007 Universitat d'Alacant / Universidad de Alicante.
+(c) 2007-2008 Prompsit Language Engineering S.L.
+
+Most of the files tmx_* are taken from the hunalign package:
+(C) Copyright 2004. Media Research Centre at the
+Sociology and Communications Department of the
+Budapest University of Technology and Economics.
+
+hunalign is licensed under the GNU Lesser GPL v. 2.1, see
+COPYING.hunalign for more details.
+
Index: branches/weighted-transfer/tags/midterm/apertium/cmake/CMakeUseFlex.cmake
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/cmake/CMakeUseFlex.cmake	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/cmake/CMakeUseFlex.cmake	(revision 70339)
@@ -0,0 +1,42 @@
+# - Look for GNU flex, the lexer generator.
+# Defines the following:
+#  FLEX_EXECUTABLE - path to the flex executable
+#  FLEX_FILE - parse a file with flex
+#  FLEX_PREFIX_OUTPUTS - Set to true to make FLEX_FILE produce outputs of
+#                        lex.${filename}.c, not lex.yy.c . Passes -P to flex.
+
+IF(NOT DEFINED FLEX_PREFIX_OUTPUTS)
+  SET(FLEX_PREFIX_OUTPUTS FALSE)
+ENDIF(NOT DEFINED FLEX_PREFIX_OUTPUTS)
+
+IF(NOT FLEX_EXECUTABLE)
+  FIND_PROGRAM(FLEX_EXECUTABLE flex)
+  IF (FLEX_EXECUTABLE)
+    MESSAGE (STATUS "Found flex -- ${FLEX_EXECUTABLE}")
+  ELSE (FLEX_EXECUTABLE)
+    MESSAGE (ERROR "flex not found")
+  ENDIF(FLEX_EXECUTABLE)
+ENDIF(NOT FLEX_EXECUTABLE)
+
+IF(FLEX_EXECUTABLE)
+  MACRO(FLEX OUT_FILE SWITCHES IN_FILE)
+    GET_FILENAME_COMPONENT(PATH "${IN_FILE}" PATH)
+
+    IF(NOT EXISTS "${CMAKE_CURRENT_BINARY_DIR}/${PATH}")
+      FILE(MAKE_DIRECTORY "${CMAKE_CURRENT_BINARY_DIR}/${PATH}")
+    ENDIF(NOT EXISTS "${CMAKE_CURRENT_BINARY_DIR}/${PATH}")
+
+    SET(FULL_OUT_FILE "${CMAKE_CURRENT_BINARY_DIR}/${PATH}${OUT_FILE}")
+    SET(FULL_IN_FILE  "${CMAKE_CURRENT_SOURCE_DIR}/${IN_FILE}")
+
+    ADD_CUSTOM_COMMAND(
+      OUTPUT  "${FULL_OUT_FILE}"
+      COMMAND "${FLEX_EXECUTABLE}"
+      ARGS    "${SWITCHES}"
+              -o"${FULL_OUT_FILE}"
+              "${FULL_IN_FILE}"
+      DEPENDS "${FULL_IN_FILE}")
+
+    SET_SOURCE_FILES_PROPERTIES("${FULL_OUT_FILE}" PROPERTIES GENERATED TRUE)
+  ENDMACRO(FLEX)
+ENDIF(FLEX_EXECUTABLE)
Index: branches/weighted-transfer/tags/midterm/apertium/cmake/CMakeUseXsltproc.cmake
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/cmake/CMakeUseXsltproc.cmake	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/cmake/CMakeUseXsltproc.cmake	(revision 70339)
@@ -0,0 +1,35 @@
+# - Look for GNU xsltproc, the lexer generator.
+# Defines the following:
+#  XSLTPROC_EXECUTABLE - path to the xsltproc executable
+#  XSLTPROC_FILE - parse a file with xsltproc
+#  XSLTPROC_PREFIX_OUTPUTS - Set to true to make XSLTPROC_FILE produce outputs of
+#                        lex.${filename}.c, not lex.yy.c . Passes -P to xsltproc.
+
+IF(NOT XSLTPROC_EXECUTABLE)
+  FIND_PROGRAM(XSLTPROC_EXECUTABLE xsltproc)
+  IF (XSLTPROC_EXECUTABLE)
+    MESSAGE (STATUS "Found xsltproc -- ${XSLTPROC_EXECUTABLE}")
+  ELSE (XSLTPROC_EXECUTABLE)
+    MESSAGE (ERROR "xsltproc not found")
+  ENDIF(XSLTPROC_EXECUTABLE)
+ENDIF(NOT XSLTPROC_EXECUTABLE)
+
+IF(XSLTPROC_EXECUTABLE)
+  MACRO(XSLTPROC OUT_FILE XSL_FILE XML_FILE)
+    GET_FILENAME_COMPONENT(PATH "${XSL_FILE}" PATH)
+
+    SET(FULL_OUT_FILE "${CMAKE_CURRENT_SOURCE_DIR}/${OUT_FILE}")
+    SET(FULL_XSL_FILE "${CMAKE_CURRENT_SOURCE_DIR}/${XSL_FILE}")
+    SET(FULL_XML_FILE "${CMAKE_CURRENT_SOURCE_DIR}/${XML_FILE}")
+
+    ADD_CUSTOM_COMMAND(
+      OUTPUT  "${FULL_OUT_FILE}"
+      COMMAND "${XSLTPROC_EXECUTABLE}"
+      ARGS    -o "${FULL_OUT_FILE}"
+              "${FULL_XSL_FILE}"
+              "${FULL_XML_FILE}"
+      DEPENDS "${FULL_XSL_FILE}" "${FULL_XML_FILE}")
+
+    SET_SOURCE_FILES_PROPERTIES("${FULL_OUT_FILE}" PROPERTIES GENERATED TRUE)
+  ENDMACRO(XSLTPROC)
+ENDIF(XSLTPROC_EXECUTABLE)
Index: branches/weighted-transfer/tags/midterm/apertium/cmake/FindLibPcre.cmake
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/cmake/FindLibPcre.cmake	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/cmake/FindLibPcre.cmake	(revision 70339)
@@ -0,0 +1,38 @@
+IF (LIBPCRE_INCLUDE_DIR AND LIBPCRE_LIBRARIES)
+   # in cache already
+   SET(LibPcre_FIND_QUIETLY TRUE)
+ENDIF (LIBPCRE_INCLUDE_DIR AND LIBPCRE_LIBRARIES)
+
+IF (NOT WIN32)
+   # use pkg-config to get the directories and then use these values
+   # in the FIND_PATH() and FIND_LIBRARY() calls
+   INCLUDE(UsePkgConfig)
+   PKGCONFIG(libpcre LIBPCRE_INCLUDES LIBPCRE_LIB_DIR LIBPCRE_LDFLAGS LIBPCRE_CFLAGS)
+   SET(LIBPCRE_DEFINITIONS ${LIBPCRE_CFLAGS})
+ENDIF (NOT WIN32)
+
+FIND_PATH(LIBPCRE_INCLUDE_DIR pcre.h
+          PATHS ${LIBPCRE_INCLUDES})
+
+FIND_LIBRARY(LIBPCRE_LIBRARIES
+             NAMES pcre libpcre
+             PATHS ${LIBPCRE_LIB_DIR})
+
+IF (LIBPCRE_INCLUDE_DIR AND LIBPCRE_LIBRARIES)
+   SET(LIBPCRE_FOUND TRUE)
+ELSE (LIBPCRE_INCLUDE_DIR AND LIBPCRE_LIBRARIES)
+   SET(LIBPCRE_FOUND FALSE)
+ENDIF (LIBPCRE_INCLUDE_DIR AND LIBPCRE_LIBRARIES)
+
+IF (LIBPCRE_FOUND)
+   IF (NOT LibPcre_FIND_QUIETLY)
+      MESSAGE(STATUS "Found LibPcre: ${LIBPCRE_LIBRARIES}")
+   ENDIF (NOT LibPcre_FIND_QUIETLY)
+ELSE (LIBPCRE_FOUND)
+   IF (LibPcre_FIND_REQUIRED)
+      MESSAGE(SEND_ERROR "Could NOT find LibPcre")
+   ENDIF (LibPcre_FIND_REQUIRED)
+ENDIF (LIBPCRE_FOUND)
+
+MARK_AS_ADVANCED(LIBPCRE_INCLUDE_DIR LIBPCRE_LIBRARIES)
+
Index: branches/weighted-transfer/tags/midterm/apertium/cmake/FindLibXml2.cmake
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/cmake/FindLibXml2.cmake	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/cmake/FindLibXml2.cmake	(revision 70339)
@@ -0,0 +1,59 @@
+# - Try to find LibXml2
+# Once done this will define
+#
+#  LIBXML2_FOUND - system has LibXml2
+#  LIBXML2_INCLUDE_DIR - the LibXml2 include directory
+#  LIBXML2_LIBRARIES - the libraries needed to use LibXml2
+#  LIBXML2_DEFINITIONS - Compiler switches required for using LibXml2
+#
+# Copyright (c) 2006, Alexander Neundorf <neundorf@kde.org>
+# This code is available under the BSD license, see licenses/BSD for details.
+
+# Copyright (c) 2006, Alexander Neundorf, <neundorf@kde.org>
+#
+# Redistribution and use is allowed according to the terms of the BSD license.
+# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
+
+
+IF (LIBXML2_INCLUDE_DIR AND LIBXML2_LIBRARIES)
+   # in cache already
+   SET(LibXml2_FIND_QUIETLY TRUE)
+ENDIF (LIBXML2_INCLUDE_DIR AND LIBXML2_LIBRARIES)
+
+IF (NOT WIN32)
+   # use pkg-config to get the directories and then use these values
+   # in the FIND_PATH() and FIND_LIBRARY() calls
+   INCLUDE(UsePkgConfig)
+   PKGCONFIG(libxml-2.0 _LibXml2IncDir _LibXml2LinkDir _LibXml2LinkFlags _LibXml2Cflags)
+   SET(LIBXML2_DEFINITIONS ${_LibXml2Cflags})
+ENDIF (NOT WIN32)
+
+FIND_PATH(LIBXML2_INCLUDE_DIR libxml/xpath.h
+   PATHS
+   ${_LibXml2IncDir}
+   PATH_SUFFIXES libxml2
+   )
+
+FIND_LIBRARY(LIBXML2_LIBRARIES NAMES xml2 libxml2
+   PATHS
+   ${_LibXml2LinkDir}
+   )
+
+IF (LIBXML2_INCLUDE_DIR AND LIBXML2_LIBRARIES)
+   SET(LIBXML2_FOUND TRUE)
+ELSE (LIBXML2_INCLUDE_DIR AND LIBXML2_LIBRARIES)
+   SET(LIBXML2_FOUND FALSE)
+ENDIF (LIBXML2_INCLUDE_DIR AND LIBXML2_LIBRARIES)
+
+IF (LIBXML2_FOUND)
+   IF (NOT LibXml2_FIND_QUIETLY)
+      MESSAGE(STATUS "Found LibXml2: ${LIBXML2_LIBRARIES}")
+   ENDIF (NOT LibXml2_FIND_QUIETLY)
+ELSE (LIBXML2_FOUND)
+   IF (LibXml2_FIND_REQUIRED)
+      MESSAGE(SEND_ERROR "Could NOT find LibXml2")
+   ENDIF (LibXml2_FIND_REQUIRED)
+ENDIF (LIBXML2_FOUND)
+
+MARK_AS_ADVANCED(LIBXML2_INCLUDE_DIR LIBXML2_LIBRARIES)
+
Index: branches/weighted-transfer/tags/midterm/apertium/cmake/FindLttoolbox3.cmake
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium/cmake/FindLttoolbox3.cmake	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium/cmake/FindLttoolbox3.cmake	(revision 70339)
@@ -0,0 +1,57 @@
+# - Try to find Lttoolbox3
+# Once done this will define
+#
+#  LTTOOLBOX3_FOUND - system has Lttoolbox3
+#  LTTOOLBOX3_INCLUDE_DIR - the Lttoolbox3 include directory
+#  LTTOOLBOX3_LIBRARIES - the libraries needed to use Lttoolbox3
+#  LTTOOLBOX3_DEFINITIONS - Compiler switches required for using Lttoolbox3
+#
+# Copyright (c) 2006, Alexander Neundorf <neundorf@kde.org>
+# This code is available under the BSD license, see licenses/BSD for details.
+
+# Copyright (c) 2006, Alexander Neundorf, <neundorf@kde.org>
+#
+# Redistribution and use is allowed according to the terms of the BSD license.
+# For details see the accompanying COPYING-CMAKE-SCRIPTS file.
+#
+# This is derived from FindLibXml2.cmake
+
+IF (LTTOOLBOX3_INCLUDE_DIR AND LTTOOLBOX3_LIBRARIES)
+   # in cache already
+   SET(Lttoolbox3_FIND_QUIETLY TRUE)
+ENDIF (LTTOOLBOX3_INCLUDE_DIR AND LTTOOLBOX3_LIBRARIES)
+
+IF (NOT WIN32)
+   # use pkg-config to get the directories and then use these values
+   # in the FIND_PATH() and FIND_LIBRARY() calls
+   INCLUDE(UsePkgConfig)
+   PKGCONFIG(lttoolbox-3.0 LTTOOLBOX3_INCLUDES LTTOOLBOX3_LIB_DIR LTTOOLBOX3_LDFLAGS LTTOOLBOX3_CFLAGS)
+   SET(LTTOOLBOX3_DEFINITIONS ${LTTOOLBOX3_CFLAGS})
+ENDIF (NOT WIN32)
+
+FIND_PATH(LTTOOLBOX3_INCLUDE_DIR lttoolbox/alphabet.h
+   PATHS ${LTTOOLBOX3_INCLUDES}
+   PATH_SUFFIXES lttoolbox-3.0)
+
+FIND_LIBRARY(LTTOOLBOX3_LIBRARIES
+             NAMES lttoolbox3
+             PATHS ${LTTOOLBOX3_LIB_DIR})
+
+IF (LTTOOLBOX3_INCLUDE_DIR AND LTTOOLBOX3_LIBRARIES)
+   SET(LTTOOLBOX3_FOUND TRUE)
+ELSE (LTTOOLBOX3_INCLUDE_DIR AND LTTOOLBOX3_LIBRARIES)
+   SET(LTTOOLBOX3_FOUND FALSE)
+ENDIF (LTTOOLBOX3_INCLUDE_DIR AND LTTOOLBOX3_LIBRARIES)
+
+IF (LTTOOLBOX3_FOUND)
+   IF (NOT Lttoolbox3_FIND_QUIETLY)
+      MESSAGE(STATUS "Found Lttoolbox3: ${LTTOOLBOX3_LIBRARIES}")
+   ENDIF (NOT Lttoolbox3_FIND_QUIETLY)
+ELSE (LTTOOLBOX3_FOUND)
+   IF (Lttoolbox3_FIND_REQUIRED)
+      MESSAGE(SEND_ERROR "Could NOT find Lttoolbox3")
+   ENDIF (Lttoolbox3_FIND_REQUIRED)
+ENDIF (LTTOOLBOX3_FOUND)
+
+MARK_AS_ADVANCED(LTTOOLBOX3_INCLUDE_DIR LTTOOLBOX3_LIBRARIES)
+
Index: branches/weighted-transfer/tags/midterm/apertium
===================================================================
--- branches/weighted-transfer/tags/midterm/apertium	(nonexistent)
+++ branches/weighted-transfer/tags/midterm/apertium	(revision 70339)

Property changes on: branches/weighted-transfer/tags/midterm/apertium
___________________________________________________________________
Added: svn:ignore
## -0,0 +1,16 ##
+autom4te.cache
+Makefile
+Makefile.in
+missing
+configure
+config.sub
+config.status
+config.log
+config.guess
+aclocal.m4
+*.pc
+depcomp
+install-sh
+libtool
+ltmain.sh
+compile