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 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533
|
/*-----------------------------------------------------------------------
File : pcl_miniprotocol.c
Author: Stephan Schulz
Contents
Protocols (=arrays) of PCL steps, all inclusive ;-)
Copyright 1998, 1999, 2002 by the author.
This code is released under the GNU General Public Licence and
the GNU Lesser General Public License.
See the file COPYING in the main E directory for details..
Run "eprover -h" for contact information.
Changes
<1> Mon Jul 15 23:13:21 CEST 2002
New (from pcl_protocol.c)
-----------------------------------------------------------------------*/
#include "pcl_miniprotocol.h"
/*---------------------------------------------------------------------*/
/* Global Variables */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Forward Declarations */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Internal Functions */
/*---------------------------------------------------------------------*/
/*---------------------------------------------------------------------*/
/* Exported Functions */
/*---------------------------------------------------------------------*/
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtAlloc()
//
// Return an initialized PCLMini protocol data structure.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
PCLMiniProt_p PCLMiniProtAlloc(void)
{
PCLMiniProt_p handle = PCLMiniProtCellAlloc();
TypeBank_p sort_table = TypeBankAlloc();
Sig_p sig = SigAlloc(sort_table);
SigInsertInternalCodes(sig);
handle->terms = TBAlloc(sig);
handle->steps = PDArrayAlloc(1,500000);
handle->max_ident = 0;
return handle;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtFree()
//
// Free a PCLMini protocol
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
void PCLMiniProtFree(PCLMiniProt_p junk)
{
long i;
PCLMiniStep_p step;
assert(junk && junk->terms);
for(i=0; i<=junk->max_ident; i++)
{
step = PDArrayElementP(junk->steps, i);
if(step)
{
PCLMiniStepFree(step);
PDArrayAssignP(junk->steps, i, NULL);
}
}
TypeBankFree(junk->terms->sig->type_bank);
SigFree(junk->terms->sig);
junk->terms->sig = NULL;
TBFree(junk->terms);
PDArrayFree(junk->steps);
PCLMiniProtCellFree(junk);
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtInsertStep()
//
// Insert a step into prot. Return true if it was not already in the
// protokol, otherwise false.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool PCLMiniProtInsertStep(PCLMiniProt_p prot, PCLMiniStep_p step)
{
PCLMiniStep_p local_step;
assert(prot&&step);
local_step = PDArrayElementP(prot->steps, step->id);
if(local_step)
{
assert(step==local_step);
return false;
}
PDArrayAssignP(prot->steps, step->id, step);
prot->max_ident = MAX(step->id, prot->max_ident);
return true;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtFindStep()
//
// Given a PCLMini-Identifier, find the matching step in prot.
//
// Global Variables: -
//
// Side Effects : May reorganize the tree.
//
/----------------------------------------------------------------------*/
PCLMiniStep_p PCLMiniProtFindStep(PCLMiniProt_p prot, unsigned long id)
{
PCLMiniStep_p local_step;
local_step = PDArrayElementP(prot->steps, id);
return local_step;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtExtractStep()
//
// Extract the step from the protokol and return it.
//
// Global Variables:
//
// Side Effects :
//
/----------------------------------------------------------------------*/
PCLMiniStep_p PCLMiniProtExtractStep(PCLMiniProt_p prot, PCLMiniStep_p
step)
{
PCLMiniStep_p local_step;
assert(prot&&step);
local_step = PDArrayElementP(prot->steps, step->id);
if(local_step)
{
assert(step==local_step);
PDArrayAssignP(prot->steps, step->id, NULL);
return step;
}
return NULL;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtDeleteStep()
//
// Delete a step from a protocol. Return true if the step existed in
// the protocol, false otherwise. In the second case, the step is
// _not_ freed.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool PCLMiniProtDeleteStep(PCLMiniProt_p prot, PCLMiniStep_p step)
{
PCLMiniStep_p local_step;
assert(prot&&step);
local_step = PDArrayElementP(prot->steps, step->id);
if(local_step)
{
assert(step==local_step);
PDArrayAssignP(prot->steps, step->id, NULL);
PCLMiniStepFree(local_step);
return true;
}
return false;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtParse()
//
// Parse a PCLMini listing into prot. Return number of steps parsed.
//
// Global Variables: -
//
// Side Effects : Memory operations
//
/----------------------------------------------------------------------*/
long PCLMiniProtParse(Scanner_p in, PCLMiniProt_p prot)
{
long res = 0;
PCLMiniStep_p step;
DStr_p source_name, errpos;
long line, column;
StreamType type;
while(TestInpTok(in, PosInt))
{
if(!in->ignore_comments)
{
fprintf(GlobalOut, "%s", DStrView(AktToken(in)->comment));
DStrReset(AktToken(in)->comment);
}
line = AktToken(in)->line;
column = AktToken(in)->column;
source_name = DStrGetRef(AktToken(in)->source);
type = AktToken(in)->stream_type;
step = PCLMiniStepParse(in, prot->terms);
if(!PCLMiniProtInsertStep(prot, step))
{
errpos = DStrAlloc();
DStrAppendStr(errpos, PosRep(type, source_name, line, column));
DStrAppendStr(errpos, " duplicate PCL identifier");
Error(DStrView(errpos), SYNTAX_ERROR);
DStrFree(errpos);
}
DStrReleaseRef(source_name);
res++;
}
if(!in->ignore_comments)
{
fprintf(GlobalOut, "%s", DStrView(AktToken(in)->comment));
DStrReset(AktToken(in)->comment);
}
return res;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtPrint()
//
// Print a PCLMini protocol.
//
// Global Variables: -
//
// Side Effects : Output, some memory operations
//
/----------------------------------------------------------------------*/
void PCLMiniProtPrint(FILE* out, PCLMiniProt_p prot,
OutputFormatType format)
{
long i;
PCLMiniStep_p step;
assert(prot && prot->terms);
for(i=0; i<=prot->max_ident; i++)
{
step = PDArrayElementP(prot->steps, i);
if(step)
{
PCLMiniStepPrintFormat(out, step, prot->terms, format);
}
}
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniExprCollectPreconds()
//
// Collect all PCLMini steps referenced in expr into tree.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void PCLMiniExprCollectPreconds(PCLMiniProt_p prot, PCLExpr_p expr, PTree_p *tree)
{
PCLMiniStep_p step;
int i;
long id;
assert(prot && expr);
switch(expr->op)
{
case PCLOpNoOp:
assert(false);
break;
case PCLOpInitial:
break;
case PCLOpQuote:
id = PCLExprArgInt(expr,0);
step = PCLMiniProtFindStep(prot, id);
if(!step)
{
Error("Dangling reference in PCL protocol!",
SYNTAX_ERROR);
}
PTreeStore(tree, step);
break;
default:
for(i=0; i<expr->arg_no; i++)
{
PCLMiniExprCollectPreconds(prot, PCLExprArg(expr,i), tree);
}
break;
}
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtMarkProofClauses()
//
// Mark all proof steps in protokoll with PCLIsProofStep. Return
// true if empty clause was encountered.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
bool PCLMiniProtMarkProofClauses(PCLMiniProt_p prot, bool fast)
{
bool res = false;
long i;
PStack_p to_proc = PStackAlloc();
PCLMiniStep_p step;
PTree_p root = NULL;
if(fast)
{
i = prot->max_ident;
step = PCLMiniProtFindStep(prot, i);
while(step&&(i>=0)&&PCLStepExtract(step->extra))
{
PStackPushP(to_proc, step);
i--;
if(i>=0)
{
step = PCLMiniProtFindStep(prot, i);
}
}
}
else
{
for(i=0; i<=prot->max_ident;i++)
{
step = PCLMiniProtFindStep(prot, i);
if(step && PCLStepExtract(step->extra))
{
{
PStackPushP(to_proc, step);
}
}
}
}
while(!PStackEmpty(to_proc))
{
step = PStackPopP(to_proc);
if((PCLStepIsShell(step)
&&step->extra
&&(strcmp(step->extra, "'proof'")==0))
||
(!PCLStepIsShell(step) &&
PCLStepIsClausal(step) &&
(step->logic.clause->literal_no == 0)))
{
res = true;
}
if(!PCLStepQueryProp(step,PCLIsProofStep))
{
PCLStepSetProp(step, PCLIsProofStep);
PCLMiniExprCollectPreconds(prot, step->just, &root);
while(root)
{
step = PTreeExtractRootKey(&root);
PStackPushP(to_proc, step);
}
}
}
PStackFree(to_proc);
return res;
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtSetClauseProp()
//
// Set a property in a PCLMiniStep protocol.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void PCLMiniProtSetClauseProp(PCLMiniProt_p prot, PCLStepProperties props)
{
long i;
PCLMiniStep_p step;
for(i=0; i<=prot->max_ident; i++)
{
step = PDArrayElementP(prot->steps, i);
if(step)
{
PCLStepSetProp(step,props);
}
}
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtDelClauseProp()
//
// Delete a property in a PCLMiniSteps protocol.
//
// Global Variables: -
//
// Side Effects : -
//
/----------------------------------------------------------------------*/
void PCLMiniProtDelClauseProp(PCLMiniProt_p prot, PCLStepProperties props)
{
long i;
PCLMiniStep_p step;
for(i=0; i<=prot->max_ident; i++)
{
step = PDArrayElementP(prot->steps, i);
if(step)
{
PCLStepDelProp(step,props);
}
}
}
/*-----------------------------------------------------------------------
//
// Function: PCLMiniProtPrintProofClauses()
//
// Print a PCLMini protocol.
//
// Global Variables: -
//
// Side Effects : Output, some memory operations
//
/----------------------------------------------------------------------*/
void PCLMiniProtPrintProofClauses(FILE* out, PCLMiniProt_p prot,
OutputFormatType format)
{
long i;
PCLMiniStep_p step;
assert(prot && prot->terms);
for(i=0; i<=prot->max_ident; i++)
{
step = PDArrayElementP(prot->steps, i);
if(step&&PCLStepQueryProp(step, PCLIsProofStep))
{
PCLMiniStepPrintFormat(out, step, prot->terms, format);
fputc('\n',out);
}
}
}
/*---------------------------------------------------------------------*/
/* End of File */
/*---------------------------------------------------------------------*/
|