diff options
author | Dejan Jovanović <dejan.jovanovic@gmail.com> | 2010-04-14 19:06:53 +0000 |
---|---|---|
committer | Dejan Jovanović <dejan.jovanovic@gmail.com> | 2010-04-14 19:06:53 +0000 |
commit | f8ca588548491146fffbf22b2e9082986504211c (patch) | |
tree | 980553ffdb2b275a1e203c6e87743a01d1d5e5bc /src/parser/smt | |
parent | 7c83d004874a46efe36d58717f7a4d72553b3693 (diff) |
Marging from types 404:415, changes: Massive
* Types are now represented as nodes in the attribute table and are managed, i.e. you can say
Type booleanType = d_nodeManager->booleanType();
Type t = d_nodeManager->mkFunctionType(booleanType, booleanType);
FunctionType ft = (FunctionType)t;
Assert(ft.getArgTypes()[0], booleanType);
* The attributes now have a table for Nodes and a table for TNodes (both should be used with caution)
* Changes the way nodes are extracted from NodeBuilder, added several methods to
extract a Node, NodeValue, or Node*, with corresponding methods for extraction
* Used the above in the construction of Expr and Type objects
* The NodeManager now destroys the attributes in the destructor by pausing the
garbage collection
* To achive destruction a flag d_inDesctruction has been added to loosen the assertion
in NodeValue::dec() (there might be -refcount TNodes leftover)
* Beginnings of the Bitvector constants using GMP
Not yet in tiptop phase, needs more documentation, and Types should be pulled out to TypeNodes eventually. Also, the types are currently defined in the builting_kinds, and I need to add these to the theory specific definitions with special 'type' constructs.
I hate branching and merging.
Diffstat (limited to 'src/parser/smt')
-rw-r--r-- | src/parser/smt/Smt.g | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/src/parser/smt/Smt.g b/src/parser/smt/Smt.g index 25c2fbc89..15f0c8844 100644 --- a/src/parser/smt/Smt.g +++ b/src/parser/smt/Smt.g @@ -285,7 +285,7 @@ attribute functionDeclaration @declarations { std::string name; - std::vector<Type*> sorts; + std::vector<Type> sorts; } : LPAREN_TOK functionName[name,CHECK_UNDECLARED] t = sortSymbol // require at least one sort @@ -305,10 +305,10 @@ functionDeclaration predicateDeclaration @declarations { std::string name; - std::vector<Type*> p_sorts; + std::vector<Type> p_sorts; } : LPAREN_TOK predicateName[name,CHECK_UNDECLARED] sortList[p_sorts] RPAREN_TOK - { Type *t; + { Type t; if( p_sorts.empty() ) { t = EXPR_MANAGER->booleanType(); } else { @@ -329,7 +329,7 @@ sortDeclaration /** * Matches a sequence of sort symbols and fills them into the given vector. */ -sortList[std::vector<CVC4::Type*>& sorts] +sortList[std::vector<CVC4::Type>& sorts] : ( t = sortSymbol { sorts.push_back(t); })* ; @@ -341,7 +341,7 @@ sortName[std::string& name, CVC4::parser::DeclarationCheck check] : identifier[name,check,SYM_SORT] ; -sortSymbol returns [CVC4::Type* t] +sortSymbol returns [CVC4::Type t] @declarations { std::string name; } |