blob: d0eee6089226884167ee117b6020a073639ea986 (
plain)
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
/********************* */
/*! \file strings_rewriter.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Andres Noetzli
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 Rewrite rules for string-specific operators in theory of strings
**
**/
#include "cvc4_private.h"
#ifndef CVC4__THEORY__STRINGS__STRINGS_REWRITER_H
#define CVC4__THEORY__STRINGS__STRINGS_REWRITER_H
#include "expr/node.h"
#include "theory/strings/sequences_rewriter.h"
namespace CVC4 {
namespace theory {
namespace strings {
/**
* An extension of SequencesRewriter that handles operators that
* are specific to strings (and cannot be applied to sequences).
*/
class StringsRewriter : public SequencesRewriter
{
public:
StringsRewriter(HistogramStat<Rewrite>* statistics);
RewriteResponse postRewrite(TNode node) override;
/** rewrite string to integer
*
* This is the entry point for post-rewriting terms n of the form
* str.to_int( s )
* Returns the rewritten form of n.
*/
Node rewriteStrToInt(Node n);
/** rewrite integer to string
*
* This is the entry point for post-rewriting terms n of the form
* str.from_int( i )
* Returns the rewritten form of n.
*/
Node rewriteIntToStr(Node n);
/** rewrite string convert
*
* This is the entry point for post-rewriting terms n of the form
* str.tolower( s ) and str.toupper( s )
* Returns the rewritten form of n.
*/
Node rewriteStrConvert(Node n);
/** rewrite string less than
*
* This is the entry point for post-rewriting terms n of the form
* str.<( t, s )
* Returns the rewritten form of n.
*/
Node rewriteStringLt(Node n);
/** rewrite string less than or equal
*
* This is the entry point for post-rewriting terms n of the form
* str.<=( t, s )
* Returns the rewritten form of n.
*/
Node rewriteStringLeq(Node n);
/** rewrite str.from_code
*
* This is the entry point for post-rewriting terms n of the form
* str.from_code( t )
* Returns the rewritten form of n.
*/
Node rewriteStringFromCode(Node n);
/** rewrite str.to_code
*
* This is the entry point for post-rewriting terms n of the form
* str.to_code( t )
* Returns the rewritten form of n.
*/
Node rewriteStringToCode(Node n);
/** rewrite is digit
*
* This is the entry point for post-rewriting terms n of the form
* str.is_digit( t )
* Returns the rewritten form of n.
*/
Node rewriteStringIsDigit(Node n);
};
} // namespace strings
} // namespace theory
} // namespace CVC4
#endif /* CVC4__THEORY__STRINGS__STRINGS_REWRITER_H */
|