1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/********************* */
/*! \file theory_strings_preprocess.h
** \verbatim
** Top contributors (to current version):
** Morgan Deters, Andrew Reynolds, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2017 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Strings Preprocess
**
** Strings Preprocess.
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__STRINGS__PREPROCESS_H
#define __CVC4__THEORY__STRINGS__PREPROCESS_H
#include <vector>
#include "util/hash.h"
#include "theory/theory.h"
#include "theory/rewriter.h"
#include "context/cdchunk_list.h"
#include "context/cdhashmap.h"
namespace CVC4 {
namespace theory {
namespace strings {
class StringsPreprocess {
//Constants
Node d_zero;
Node d_one;
//mapping from kinds to UF
std::map< Kind, std::map< unsigned, Node > > d_uf;
//get UF for node
Node getUfForNode( Kind k, Node n, unsigned id = 0 );
Node getUfAppForNode( Kind k, Node n, unsigned id = 0 );
//recursive simplify
Node simplifyRec( Node t, std::vector< Node > &new_nodes, std::map< Node, Node >& visited );
public:
StringsPreprocess( context::UserContext* u );
~StringsPreprocess();
//returns a node that is equivalent to t under assumptions in new_nodes
Node simplify( Node t, std::vector< Node > &new_nodes );
//process assertion: guarentees to remove all extf
Node processAssertion( Node n, std::vector< Node > &new_nodes );
//proces assertions: guarentees to remove all extf, rewrite in place
void processAssertions( std::vector< Node > &vec_node );
};
}/* CVC4::theory::strings namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
#endif /* __CVC4__THEORY__STRINGS__PREPROCESS_H */
|
