summaryrefslogtreecommitdiff
path: root/src/parser/antlr_parser.h
diff options
context:
space:
mode:
authorMorgan Deters <mdeters@gmail.com>2010-03-16 20:24:37 +0000
committerMorgan Deters <mdeters@gmail.com>2010-03-16 20:24:37 +0000
commit9576517676138a8ca2887a967f1b056662ef6754 (patch)
treef0040a8189d20496dcaa760055b2b818f8a57525 /src/parser/antlr_parser.h
parent12ad4cf2de936acbf8c21117804c69b2deaa7272 (diff)
* test/unit/Makefile.am, test/unit/expr/attribute_white.h,
test/unit/expr/node_white.h: add whitebox attribute test (pulled out attribute stuff from node_white) * test/unit/parser/parser_black.h: fix memory leaks uncovered by valgrind * src/theory/interrupted.h: actually make this "lightweight" (not derived from CVC4::Exception), as promised in my last commit * src/theory/uf/theory_uf.h, test/unit/expr/attribute_black.h: match the new-style cleanup function definition * src/expr/attribute.cpp, src/expr/attribute.h: support for attribute deletion, custom cleanup functions, clearer cleanup function definition. * src/expr/node_manager.h, src/expr/node_manager.cpp: reclaim remaining zombies in dtor, rename NodeValueSet ==> "NodeValuePool", and enable freeing of NodeValues * src/expr/type.h, src/expr/type.cpp: reference-counting for types, customized cleanup function for types, also code cleanup * (various): changed "const Type*" to "Type*" (to enable reference-counting etc. Types are still immutable.) * src/util/output.h: add ::isOn()-- which queries whether a Debug/Trace flag is currently on or not. * src/smt/smt_engine.cpp, src/parser/antlr_parser.cpp, src/expr/type.cpp, src/expr/expr_manager.cpp, various others: minor code cleanup
Diffstat (limited to 'src/parser/antlr_parser.h')
-rw-r--r--src/parser/antlr_parser.h28
1 files changed, 14 insertions, 14 deletions
diff --git a/src/parser/antlr_parser.h b/src/parser/antlr_parser.h
index 94d919555..e970ebd52 100644
--- a/src/parser/antlr_parser.h
+++ b/src/parser/antlr_parser.h
@@ -137,7 +137,7 @@ protected:
/**
* Returns a sort, given a name
*/
- const Type* getSort(const std::string& sort_name);
+ Type* getSort(const std::string& sort_name);
/**
* Types of symbols. Used to define namespaces.
@@ -193,7 +193,7 @@ protected:
* @param name the symbol to lookup
* @param type the (namespace) type of the symbol
*/
- const Type* getType(const std::string& var_name,
+ Type* getType(const std::string& var_name,
SymbolType type = SYM_VARIABLE);
/**
@@ -244,13 +244,13 @@ protected:
Expr mkExpr(Kind kind, const std::vector<Expr>& children);
/** Create a new CVC4 variable expression of the given type. */
- Expr mkVar(const std::string& name, const Type* type);
+ Expr mkVar(const std::string& name, Type* type);
/** Create a set of new CVC4 variable expressions of the given
type. */
const std::vector<Expr>
mkVars(const std::vector<std::string> names,
- const Type* type);
+ Type* type);
/** Create a new variable definition (e.g., from a let binding). */
void defineVar(const std::string& name, const Expr& val);
@@ -258,12 +258,12 @@ protected:
void undefineVar(const std::string& name);
/** Returns a function type over the given domain and range types. */
- const Type* functionType(const Type* domain, const Type* range);
+ Type* functionType(Type* domain, Type* range);
/** Returns a function type over the given types. argTypes must be
non-empty. */
- const Type* functionType(const std::vector<const Type*>& argTypes,
- const Type* rangeType);
+ Type* functionType(const std::vector<Type*>& argTypes,
+ Type* rangeType);
/**
* Returns a function type over the given types. If types has only
@@ -271,7 +271,7 @@ protected:
*
* @param types a non-empty list of input and output types.
*/
- const Type* functionType(const std::vector<const Type*>& types);
+ Type* functionType(const std::vector<Type*>& types);
/**
* Returns a predicate type over the given sorts. If sorts is empty,
@@ -279,17 +279,17 @@ protected:
* @param sorts a list of input types
*/
- const Type* predicateType(const std::vector<const Type*>& sorts);
+ Type* predicateType(const std::vector<Type*>& sorts);
/**
* Creates a new sort with the given name.
*/
- const Type* newSort(const std::string& name);
+ Type* newSort(const std::string& name);
/**
* Creates a new sorts with the given names.
*/
- const std::vector<const Type*>
+ const std::vector<Type*>
newSorts(const std::vector<std::string>& names);
/** Is the symbol bound to a boolean variable? */
@@ -302,10 +302,10 @@ protected:
bool isPredicate(const std::string& name);
/** Returns the boolean type. */
- const BooleanType* booleanType();
+ BooleanType* booleanType();
/** Returns the kind type (i.e., the type of types). */
- const KindType* kindType();
+ KindType* kindType();
/** Returns the minimum arity of the given kind. */
static unsigned int minArity(Kind kind);
@@ -346,7 +346,7 @@ private:
SymbolTable<Expr> d_varSymbolTable;
/** The sort table */
- SymbolTable<const Type*> d_sortTable;
+ SymbolTable<Type*> d_sortTable;
/** Are semantic checks enabled during parsing? */
bool d_checksEnabled;
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback