00001 00003 // 00004 // FreeLing - Open Source Language Analyzers 00005 // 00006 // Copyright (C) 2004 TALP Research Center 00007 // Universitat Politecnica de Catalunya 00008 // 00009 // This library is free software; you can redistribute it and/or 00010 // modify it under the terms of the GNU General Public 00011 // License as published by the Free Software Foundation; either 00012 // version 2.1 of the License, or (at your option) any later version. 00013 // 00014 // This library is distributed in the hope that it will be useful, 00015 // but WITHOUT ANY WARRANTY; without even the implied warranty of 00016 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 00017 // General Public License for more details. 00018 // 00019 // You should have received a copy of the GNU General Public 00020 // License along with this library; if not, write to the Free Software 00021 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 00022 // 00023 // contact: Lluis Padro (padro@lsi.upc.es) 00024 // TALP Research Center 00025 // despatx C6.212 - Campus Nord UPC 00026 // 08034 Barcelona. SPAIN 00027 // 00029 00030 00031 #ifndef _SUFFRULE 00032 #define _SUFFRULE 00033 00034 #include "regexp-pcre++.h" 00035 00036 00041 00042 class sufrule { 00043 public: 00044 std::string term,output,retok,lema; 00045 RegEx cond; 00046 int acc,enc,always,nomore; 00047 00048 sufrule() : cond("") {} 00049 sufrule(const std::string & c) : cond(c) {} 00050 sufrule(const sufrule & s) : cond(s.cond) { 00051 term=s.term; output=s.output; retok=s.retok; 00052 acc=s.acc; enc=s.enc; nomore=s.nomore; 00053 lema=s.lema; always=s.always; 00054 } 00055 }; 00056 00057 00058 #endif