Version abc70930

6 files changed, 0 insertions, 1227 deletions

diff --git a/src/bdd/parse/module.make b/src/bdd/parse/module.make
deleted file mode 100644
index 4f590f01..00000000
--- a/src/bdd/parse/module.make
+++ /dev/null
@@ -1,3 +0,0 @@
-SRC +=  src/bdd/parse/parseCore.c \
-    src/bdd/parse/parseEqn.c \
-    src/bdd/parse/parseStack.c
diff --git a/src/bdd/parse/parse.h b/src/bdd/parse/parse.h
deleted file mode 100644
index 4923fbdd..00000000
--- a/src/bdd/parse/parse.h
+++ /dev/null
@@ -1,54 +0,0 @@
-/**CFile****************************************************************
-
-  FileName    [parse.h]
-
-  PackageName [MVSIS 2.0: Multi-valued logic synthesis system.]
-
-  Synopsis    [Parsing symbolic Boolean formulas into BDDs.]
-
-  Author      [MVSIS Group]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - September 8, 2003.]
-
-  Revision    [$Id: parse.h,v 1.0 2003/09/08 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-#ifndef __PARSE_H__
-#define __PARSE_H__
-
-////////////////////////////////////////////////////////////////////////
-///                          INCLUDES                                ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                         PARAMETERS                               ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                    STRUCTURE DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                       GLOBAL VARIABLES                           ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                       MACRO DEFINITIONS                          ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/*=== parseCore.c =============================================================*/
-extern DdNode * Parse_FormulaParser( FILE * pOutput, char * pFormula, int nVars, int nRanks, 
-      char * ppVarNames[], DdManager * dd, DdNode * pbVars[] );
-
-#endif
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
diff --git a/src/bdd/parse/parseCore.c b/src/bdd/parse/parseCore.c
deleted file mode 100644
index 21a37070..00000000
--- a/src/bdd/parse/parseCore.c
+++ /dev/null
@@ -1,504 +0,0 @@
-/**CFile****************************************************************
-
-  FileNameIn  [parseCore.c]
-
-  PackageName [MVSIS 1.3: Multi-valued logic synthesis system.]
-
-  Synopsis    [Boolean formula parser.]
-
-  Author      [MVSIS Group]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - February 1, 2003.]
-
-  Revision    [$Id: parseCore.c,v 1.0 2003/02/01 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-/*
-        Some aspects of Boolean Formula Parser:
-
- 1) The names in the boolean formulas can be any strings of symbols
-    that start with char or underscore and contain chars, digits 
-    and underscores: For example: 1) a&b <+> c'&d => a + b;   
-    2) a1 b2 c3' dummy' + (a2+b2')c3 dummy
- 2) Constant values 0 and 1 can be used just like normal variables
- 3) Any boolean operator (listed below) and parantheses can be used
-    any number of times provided there are equal number of opening
-    and closing parantheses.
- 4) By default, absence of an operator between vars and before and 
-    after parantheses is taken for AND. 
- 5) Both complementation prefix and complementation suffix can be 
-    used at the same time (but who needs this?)
- 6) Spaces (tabs, end-of-lines) may be inserted anywhere,
-    except between characters of the operations: <=>, =>, <=, <+>
- 7) The stack size is defined by macro STACKSIZE and is used by the 
-    stack constructor.
-*/
- 
-////////////////////////////////////////////////////////////////////////
-///                        DECLARATIONS                              ///
-////////////////////////////////////////////////////////////////////////
-
-#include "parseInt.h"
-
-// the list of operation symbols to be used in expressions
-#define PARSE_SYM_OPEN    '('   // opening paranthesis
-#define PARSE_SYM_CLOSE   ')'   // closing paranthesis
-#define PARSE_SYM_LOWER   '['   // shifts one rank down 
-#define PARSE_SYM_RAISE   ']'   // shifts one rank up
-#define PARSE_SYM_CONST0  '0'   // constant 0
-#define PARSE_SYM_CONST1  '1'   // constant 1
-#define PARSE_SYM_NEGBEF1 '!'   // negation before the variable
-#define PARSE_SYM_NEGBEF2 '~'   // negation before the variable
-#define PARSE_SYM_NEGAFT  '\''  // negation after the variable
-#define PARSE_SYM_AND1    '&'   // logic AND
-#define PARSE_SYM_AND2    '*'   // logic AND
-#define PARSE_SYM_XOR1    '<'   // logic EXOR   (the 1st symbol) 
-#define PARSE_SYM_XOR2    '+'   // logic EXOR   (the 2nd symbol)
-#define PARSE_SYM_XOR3    '>'   // logic EXOR   (the 3rd symbol)
-#define PARSE_SYM_OR      '+'   // logic OR
-#define PARSE_SYM_EQU1    '<'   // equvalence   (the 1st symbol)
-#define PARSE_SYM_EQU2    '='   // equvalence   (the 2nd symbol)
-#define PARSE_SYM_EQU3    '>'   // equvalence   (the 3rd symbol)
-#define PARSE_SYM_FLR1    '='   // implication  (the 1st symbol)
-#define PARSE_SYM_FLR2    '>'   // implication  (the 2nd symbol)
-#define PARSE_SYM_FLL1    '<'   // backward imp (the 1st symbol)
-#define PARSE_SYM_FLL2    '='   // backward imp (the 2nd symbol)
-// PARSE_SYM_FLR1 and PARSE_SYM_FLR2 should be the same as PARSE_SYM_EQU2 and PARSE_SYM_EQU3!
-
-// the list of opcodes (also specifying operation precedence)
-#define PARSE_OPER_NEG 10  // negation
-#define PARSE_OPER_AND  9  // logic AND
-#define PARSE_OPER_XOR  8  // logic EXOR   (a'b | ab')   
-#define PARSE_OPER_OR   7  // logic OR
-#define PARSE_OPER_EQU  6  // equvalence   (a'b'| ab )
-#define PARSE_OPER_FLR  5  // implication  ( a' | b )
-#define PARSE_OPER_FLL  4  // backward imp ( 'b | a )
-#define PARSE_OPER_MARK 1  // OpStack token standing for an opening paranthesis
-
-// these are values of the internal Flag
-#define PARSE_FLAG_START  1 // after the opening parenthesis 
-#define PARSE_FLAG_VAR    2 // after operation is received
-#define PARSE_FLAG_OPER   3 // after operation symbol is received
-#define PARSE_FLAG_ERROR  4 // when error is detected
-
-#define STACKSIZE 1000
-
-static DdNode * Parse_ParserPerformTopOp( DdManager * dd, Parse_StackFn_t * pStackFn, int Oper );
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/**Function*************************************************************
-
-  Synopsis    [Derives the BDD corresponding to the formula in language L.]
-
-  Description [Takes the stream to output messages, the formula, the number
-  variables and the rank in the formula. The array of variable names is also 
-  given. The BDD manager and the elementary 0-rank variable are the last two
-  arguments. The manager should have at least as many variables as 
-  nVars * (nRanks + 1). The 0-rank variables should have numbers larger 
-  than the variables of other ranks.]
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-DdNode * Parse_FormulaParser( FILE * pOutput, char * pFormulaInit, int nVars, int nRanks, 
-      char * ppVarNames[], DdManager * dd, DdNode * pbVars[] )
-{
-    char * pFormula;
-    Parse_StackFn_t * pStackFn;
-    Parse_StackOp_t * pStackOp;
-    DdNode * bFunc, * bTemp;
-    char * pTemp;
-    int nParans, fFound, Flag;
-    int Oper, Oper1, Oper2;
-    int i, v, fLower;
-
-    // make sure that the number of vars and ranks is correct
-    if ( nVars * (nRanks + 1) > dd->size )
-    {
-        printf( "Parse_FormulaParser(): The BDD manager does not have enough variables.\n" );
-        return NULL;
-    }
-
-    // make sure that the number of opening and closing parantheses is the same
-    nParans = 0;
-    for ( pTemp = pFormulaInit; *pTemp; pTemp++ )
-        if ( *pTemp == '(' )
-            nParans++;
-        else if ( *pTemp == ')' )
-            nParans--;
-    if ( nParans != 0 )
-    {
-        fprintf( pOutput, "Parse_FormulaParser(): Different number of opening and closing parantheses ().\n" );
-        return NULL;
-    }
-
-    nParans = 0;
-    for ( pTemp = pFormulaInit; *pTemp; pTemp++ )
-        if ( *pTemp == '[' )
-            nParans++;
-        else if ( *pTemp == ']' )
-            nParans--;
-    if ( nParans != 0 )
-    {
-        fprintf( pOutput, "Parse_FormulaParser(): Different number of opening and closing brackets [].\n" );
-        return NULL;
-    }
-
-    // copy the formula
-    pFormula = ALLOC( char, strlen(pFormulaInit) + 3 );
-    sprintf( pFormula, "(%s)", pFormulaInit );
-
-    // start the stacks
-    pStackFn = Parse_StackFnStart( STACKSIZE );
-    pStackOp = Parse_StackOpStart( STACKSIZE );
-
-    Flag = PARSE_FLAG_START;
-    fLower = 0;
-    for ( pTemp = pFormula; *pTemp; pTemp++ )
-    {
-        switch ( *pTemp )
-        {
-        // skip all spaces, tabs, and end-of-lines
-        case ' ':
-        case '\t':
-        case '\r':
-        case '\n':
-            continue;
-
-        // treat Constant 0 as a variable
-        case PARSE_SYM_CONST0:
-            Parse_StackFnPush( pStackFn, b0 );   Cudd_Ref( b0 );
-            if ( Flag == PARSE_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): No operation symbol before constant 0.\n" );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            Flag = PARSE_FLAG_VAR; 
-            break;
-
-        // the same for Constant 1
-        case PARSE_SYM_CONST1:
-            Parse_StackFnPush( pStackFn, b1 );    Cudd_Ref( b1 );
-            if ( Flag == PARSE_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): No operation symbol before constant 1.\n" );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            Flag = PARSE_FLAG_VAR; 
-            break;
-
-        case PARSE_SYM_NEGBEF1:
-        case PARSE_SYM_NEGBEF2:
-            if ( Flag == PARSE_FLAG_VAR )
-            {// if NEGBEF follows a variable, AND is assumed
-                Parse_StackOpPush( pStackOp, PARSE_OPER_AND );
-                Flag = PARSE_FLAG_OPER;
-            }
-            Parse_StackOpPush( pStackOp, PARSE_OPER_NEG );
-            break;
-
-        case PARSE_SYM_NEGAFT:
-            if ( Flag != PARSE_FLAG_VAR )
-            {// if there is no variable before NEGAFT, it is an error
-                fprintf( pOutput, "Parse_FormulaParser(): No variable is specified before the negation suffix.\n" );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            else // if ( Flag == PARSE_FLAG_VAR )
-                Parse_StackFnPush( pStackFn, Cudd_Not( Parse_StackFnPop(pStackFn) ) );
-            break;
-
-        case PARSE_SYM_AND1:
-        case PARSE_SYM_AND2:
-        case PARSE_SYM_OR:
-            if ( Flag != PARSE_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): There is no variable before AND, EXOR, or OR.\n" );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            if ( *pTemp == PARSE_SYM_AND1 || *pTemp == PARSE_SYM_AND2 )
-                Parse_StackOpPush( pStackOp, PARSE_OPER_AND );
-            else //if ( Str[Pos] == PARSE_SYM_OR )
-                Parse_StackOpPush( pStackOp, PARSE_OPER_OR );
-            Flag = PARSE_FLAG_OPER; 
-            break;
-
-        case PARSE_SYM_EQU1:
-            if ( Flag != PARSE_FLAG_VAR )
-            { 
-                fprintf( pOutput, "Parse_FormulaParser(): There is no variable before Equivalence or Implication\n" );
-                Flag = PARSE_FLAG_ERROR; break;
-            }
-            if ( pTemp[1] == PARSE_SYM_EQU2 )
-            { // check what is the next symbol in the string
-                pTemp++; 
-                if ( pTemp[1] == PARSE_SYM_EQU3 )
-                {   
-                    pTemp++; 
-                    Parse_StackOpPush( pStackOp, PARSE_OPER_EQU ); 
-                }
-                else
-                {   
-                    Parse_StackOpPush( pStackOp, PARSE_OPER_FLL ); 
-                }
-            }
-            else if ( pTemp[1] == PARSE_SYM_XOR2 )
-            {
-                pTemp++; 
-                if ( pTemp[1] == PARSE_SYM_XOR3 )
-                {   
-                    pTemp++; 
-                    Parse_StackOpPush( pStackOp, PARSE_OPER_XOR ); 
-                }
-                else
-                {   
-                    fprintf( pOutput, "Parse_FormulaParser(): Wrong symbol after \"%c%c\"\n", PARSE_SYM_EQU1, PARSE_SYM_XOR2 );
-                    Flag = PARSE_FLAG_ERROR; 
-                    break;
-                }
-            }
-            else
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): Wrong symbol after \"%c\"\n", PARSE_SYM_EQU1 );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            Flag = PARSE_FLAG_OPER; 
-            break;
-
-        case PARSE_SYM_EQU2:
-            if ( Flag != PARSE_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): There is no variable before Reverse Implication\n" );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            if ( pTemp[1] == PARSE_SYM_EQU3 )
-            {   
-                pTemp++; 
-                Parse_StackOpPush( pStackOp, PARSE_OPER_FLR ); 
-            }
-            else
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): Wrong symbol after \"%c\"\n", PARSE_SYM_EQU2 );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            Flag = PARSE_FLAG_OPER; 
-            break;
-
-        case PARSE_SYM_LOWER:
-        case PARSE_SYM_OPEN:
-            if ( Flag == PARSE_FLAG_VAR )
-                Parse_StackOpPush( pStackOp, PARSE_OPER_AND );
-            Parse_StackOpPush( pStackOp, PARSE_OPER_MARK );
-            // after an opening bracket, it feels like starting over again
-            Flag = PARSE_FLAG_START; 
-            break;
-
-        case PARSE_SYM_RAISE:
-            fLower = 1;
-        case PARSE_SYM_CLOSE:
-            if ( !Parse_StackOpIsEmpty( pStackOp ) )
-            {
-                while ( 1 )
-                {
-                    if ( Parse_StackOpIsEmpty( pStackOp ) )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParser(): There is no opening paranthesis\n" );
-                        Flag = PARSE_FLAG_ERROR; 
-                        break;
-                    }
-                    Oper = Parse_StackOpPop( pStackOp );
-                    if ( Oper == PARSE_OPER_MARK )
-                        break;
-
-                    // perform the given operation
-                    if ( Parse_ParserPerformTopOp( dd, pStackFn, Oper ) == NULL )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParser(): Unknown operation\n" );
-                        free( pFormula );
-                        return NULL;
-                    }
-                }
-
-                if ( fLower )
-                {
-                    bFunc = Parse_StackFnPop( pStackFn );
-                    bFunc = Extra_bddMove( dd, bTemp = bFunc, -nVars );   Cudd_Ref( bFunc );
-                    Cudd_RecursiveDeref( dd, bTemp );
-                    Parse_StackFnPush( pStackFn, bFunc );
-                }
-            }
-            else
-            {
-                fprintf( pOutput, "Parse_FormulaParser(): There is no opening paranthesis\n" );
-                Flag = PARSE_FLAG_ERROR; 
-                break;
-            }
-            if ( Flag != PARSE_FLAG_ERROR )
-                Flag = PARSE_FLAG_VAR; 
-            fLower = 0;
-            break;
-
-
-        default:
-            // scan the next name
-            fFound = 0;
-            for ( i = 0; pTemp[i] && pTemp[i] != ' ' && pTemp[i] != '\t' && pTemp[i] != '\r' && pTemp[i] != '\n'; i++ )
-            {
-                for ( v = 0; v < nVars; v++ )
-                    if ( strncmp( pTemp, ppVarNames[v], i+1 ) == 0 && strlen(ppVarNames[v]) == (unsigned)(i+1) )
-                    {
-                        pTemp += i;
-                        fFound = 1;
-                        break;
-                    }
-                if ( fFound )
-                    break;
-            }
-            if ( !fFound )
-            { 
-                fprintf( pOutput, "Parse_FormulaParser(): The parser cannot find var \"%s\" in the input var list.\n", pTemp ); 
-                Flag = PARSE_FLAG_ERROR; 
-                break; 
-            }
-
-            // assume operation AND, if vars follow one another
-            if ( Flag == PARSE_FLAG_VAR )
-                Parse_StackOpPush( pStackOp, PARSE_OPER_AND );
-            Parse_StackFnPush( pStackFn, pbVars[v] );  Cudd_Ref( pbVars[v] );
-            Flag = PARSE_FLAG_VAR; 
-            break;
-        }
-
-        if ( Flag == PARSE_FLAG_ERROR )
-            break;      // error exit
-        else if ( Flag == PARSE_FLAG_START )
-            continue;  //  go on parsing
-        else if ( Flag == PARSE_FLAG_VAR )
-            while ( 1 )
-            {  // check if there are negations in the OpStack     
-                if ( Parse_StackOpIsEmpty(pStackOp) )
-                    break;
-                Oper = Parse_StackOpPop( pStackOp );
-                if ( Oper != PARSE_OPER_NEG )
-                {
-                    Parse_StackOpPush( pStackOp, Oper );
-                    break;
-                }
-                else
-                {
-                      Parse_StackFnPush( pStackFn, Cudd_Not(Parse_StackFnPop(pStackFn)) );
-                }
-            }
-        else // if ( Flag == PARSE_FLAG_OPER )
-            while ( 1 )
-            {  // execute all the operations in the OpStack
-               // with precedence higher or equal than the last one
-                Oper1 = Parse_StackOpPop( pStackOp ); // the last operation
-                if ( Parse_StackOpIsEmpty(pStackOp) ) 
-                {  // if it is the only operation, push it back
-                    Parse_StackOpPush( pStackOp, Oper1 );
-                    break;
-                }
-                Oper2 = Parse_StackOpPop( pStackOp ); // the operation before the last one
-                if ( Oper2 >= Oper1 )  
-                {  // if Oper2 precedence is higher or equal, execute it
-//                    Parse_StackPush( pStackFn,  Operation( FunStack.Pop(), FunStack.Pop(), Oper2 ) );
-                    if ( Parse_ParserPerformTopOp( dd, pStackFn, Oper2 ) == NULL )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParser(): Unknown operation\n" );
-                        free( pFormula );
-                        return NULL;
-                    }
-                    Parse_StackOpPush( pStackOp,  Oper1 );     // push the last operation back
-                }
-                else
-                {  // if Oper2 precedence is lower, push them back and done
-                    Parse_StackOpPush( pStackOp, Oper2 );
-                    Parse_StackOpPush( pStackOp, Oper1 );
-                    break;
-                }
-            }
-    }
-
-    if ( Flag != PARSE_FLAG_ERROR )
-    {
-        if ( !Parse_StackFnIsEmpty(pStackFn) )
-        {    
-            bFunc = Parse_StackFnPop(pStackFn);
-            if ( Parse_StackFnIsEmpty(pStackFn) )
-                if ( Parse_StackOpIsEmpty(pStackOp) )
-                {
-                    Parse_StackFnFree(pStackFn);
-                    Parse_StackOpFree(pStackOp);
-                    Cudd_Deref( bFunc );
-                    free( pFormula );
-                    return bFunc;
-                }
-                else
-                    fprintf( pOutput, "Parse_FormulaParser(): Something is left in the operation stack\n" );
-            else
-                fprintf( pOutput, "Parse_FormulaParser(): Something is left in the function stack\n" );
-        }
-        else
-            fprintf( pOutput, "Parse_FormulaParser(): The input string is empty\n" );
-    }
-    free( pFormula );
-    return NULL;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Performs the operation on the top entries in the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-DdNode * Parse_ParserPerformTopOp( DdManager * dd, Parse_StackFn_t * pStackFn, int Oper )
-{
-    DdNode * bArg1, * bArg2, * bFunc;
-    // perform the given operation
-    bArg2 = Parse_StackFnPop( pStackFn );
-    bArg1 = Parse_StackFnPop( pStackFn );
-    if ( Oper == PARSE_OPER_AND )
-        bFunc = Cudd_bddAnd( dd, bArg1, bArg2 );
-    else if ( Oper == PARSE_OPER_XOR )
-        bFunc = Cudd_bddXor( dd, bArg1, bArg2 );
-    else if ( Oper == PARSE_OPER_OR )
-        bFunc = Cudd_bddOr( dd, bArg1, bArg2 );
-    else if ( Oper == PARSE_OPER_EQU )
-        bFunc = Cudd_bddXnor( dd, bArg1, bArg2 );
-    else if ( Oper == PARSE_OPER_FLR )
-        bFunc = Cudd_bddOr( dd, Cudd_Not(bArg1), bArg2 );
-    else if ( Oper == PARSE_OPER_FLL )
-        bFunc = Cudd_bddOr( dd, Cudd_Not(bArg2), bArg1 );
-    else
-        return NULL;
-    Cudd_Ref( bFunc );
-    Cudd_RecursiveDeref( dd, bArg1 );
-    Cudd_RecursiveDeref( dd, bArg2 );
-    Parse_StackFnPush( pStackFn,  bFunc );
-    return bFunc;
-}
-
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
diff --git a/src/bdd/parse/parseEqn.c b/src/bdd/parse/parseEqn.c
deleted file mode 100644
index 02d83966..00000000
--- a/src/bdd/parse/parseEqn.c
+++ /dev/null
@@ -1,349 +0,0 @@
-/**CFile****************************************************************
-
-  FileNameIn  [parseEqn.c]
-
-  PackageName [ABC: Logic synthesis and verification system.]
-
-  Synopsis    [Boolean formula parser.]
-
-  Author      [Alan Mishchenko]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - December 18, 2006.]
-
-  Revision    [$Id: parseEqn.c,v 1.0 2006/12/18 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-
-////////////////////////////////////////////////////////////////////////
-///                        DECLARATIONS                              ///
-////////////////////////////////////////////////////////////////////////
-
-#include "parseInt.h"
-#include "vec.h"
-#include "hop.h"
-
-// the list of operation symbols to be used in expressions
-#define PARSE_EQN_SYM_OPEN    '('   // opening paranthesis
-#define PARSE_EQN_SYM_CLOSE   ')'   // closing paranthesis
-#define PARSE_EQN_SYM_CONST0  '0'   // constant 0
-#define PARSE_EQN_SYM_CONST1  '1'   // constant 1
-#define PARSE_EQN_SYM_NEG     '!'   // negation before the variable
-#define PARSE_EQN_SYM_AND     '*'   // logic AND
-#define PARSE_EQN_SYM_OR      '+'   // logic OR
-
-// the list of opcodes (also specifying operation precedence)
-#define PARSE_EQN_OPER_NEG    10    // negation
-#define PARSE_EQN_OPER_AND     9    // logic AND
-#define PARSE_EQN_OPER_OR      7    // logic OR
-#define PARSE_EQN_OPER_MARK    1    // OpStack token standing for an opening paranthesis
-
-// these are values of the internal Flag
-#define PARSE_EQN_FLAG_START   1    // after the opening parenthesis 
-#define PARSE_EQN_FLAG_VAR     2    // after operation is received
-#define PARSE_EQN_FLAG_OPER    3    // after operation symbol is received
-#define PARSE_EQN_FLAG_ERROR   4    // when error is detected
-
-#define PARSE_EQN_STACKSIZE 1000
-
-static Hop_Obj_t * Parse_ParserPerformTopOp( Hop_Man_t * pMan, Parse_StackFn_t * pStackFn, int Oper );
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/**Function*************************************************************
-
-  Synopsis    [Derives the AIG corresponding to the equation.]
-
-  Description [Takes the stream to output messages, the formula, the vector
-  of variable names and the AIG manager.]
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-Hop_Obj_t * Parse_FormulaParserEqn( FILE * pOutput, char * pFormInit, Vec_Ptr_t * vVarNames, Hop_Man_t * pMan )
-{
-    char * pFormula;
-    Parse_StackFn_t * pStackFn;
-    Parse_StackOp_t * pStackOp;
-    Hop_Obj_t * gFunc;
-    char * pTemp, * pName;
-    int nParans, fFound, Flag;
-    int Oper, Oper1, Oper2;
-    int i, v;
-
-    // make sure that the number of opening and closing parantheses is the same
-    nParans = 0;
-    for ( pTemp = pFormInit; *pTemp; pTemp++ )
-        if ( *pTemp == '(' )
-            nParans++;
-        else if ( *pTemp == ')' )
-            nParans--;
-    if ( nParans != 0 )
-    {
-        fprintf( pOutput, "Parse_FormulaParserEqn(): Different number of opening and closing parantheses ().\n" );
-        return NULL;
-    }
-
-    // copy the formula
-    pFormula = ALLOC( char, strlen(pFormInit) + 3 );
-    sprintf( pFormula, "(%s)", pFormInit );
-
-    // start the stacks
-    pStackFn = Parse_StackFnStart( PARSE_EQN_STACKSIZE );
-    pStackOp = Parse_StackOpStart( PARSE_EQN_STACKSIZE );
-
-    Flag = PARSE_EQN_FLAG_START;
-    for ( pTemp = pFormula; *pTemp; pTemp++ )
-    {
-        switch ( *pTemp )
-        {
-        // skip all spaces, tabs, and end-of-lines
-        case ' ':
-        case '\t':
-        case '\r':
-        case '\n':
-            continue;
-        case PARSE_EQN_SYM_CONST0:
-            Parse_StackFnPush( pStackFn, Hop_ManConst0(pMan) );  // Cudd_Ref( b0 );
-            if ( Flag == PARSE_EQN_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParserEqn(): No operation symbol before constant 0.\n" );
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break;
-            }
-            Flag = PARSE_EQN_FLAG_VAR; 
-            break;
-        case PARSE_EQN_SYM_CONST1:
-            Parse_StackFnPush( pStackFn, Hop_ManConst1(pMan) );  //  Cudd_Ref( b1 );
-            if ( Flag == PARSE_EQN_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParserEqn(): No operation symbol before constant 1.\n" );
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break;
-            }
-            Flag = PARSE_EQN_FLAG_VAR; 
-            break;
-        case PARSE_EQN_SYM_NEG:
-            if ( Flag == PARSE_EQN_FLAG_VAR )
-            {// if NEGBEF follows a variable, AND is assumed
-                Parse_StackOpPush( pStackOp, PARSE_EQN_OPER_AND );
-                Flag = PARSE_EQN_FLAG_OPER;
-            }
-            Parse_StackOpPush( pStackOp, PARSE_EQN_OPER_NEG );
-            break;
-        case PARSE_EQN_SYM_AND:
-        case PARSE_EQN_SYM_OR:
-            if ( Flag != PARSE_EQN_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParserEqn(): There is no variable before AND, EXOR, or OR.\n" );
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break;
-            }
-            if ( *pTemp == PARSE_EQN_SYM_AND )
-                Parse_StackOpPush( pStackOp, PARSE_EQN_OPER_AND );
-            else //if ( *pTemp == PARSE_EQN_SYM_OR )
-                Parse_StackOpPush( pStackOp, PARSE_EQN_OPER_OR );
-            Flag = PARSE_EQN_FLAG_OPER; 
-            break;
-        case PARSE_EQN_SYM_OPEN:
-            if ( Flag == PARSE_EQN_FLAG_VAR )
-            {
-//                Parse_StackOpPush( pStackOp, PARSE_EQN_OPER_AND );
-                fprintf( pOutput, "Parse_FormulaParserEqn(): An opening paranthesis follows a var without operation sign.\n" ); 
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break; 
-            }
-            Parse_StackOpPush( pStackOp, PARSE_EQN_OPER_MARK );
-            // after an opening bracket, it feels like starting over again
-            Flag = PARSE_EQN_FLAG_START; 
-            break;
-        case PARSE_EQN_SYM_CLOSE:
-            if ( !Parse_StackOpIsEmpty( pStackOp ) )
-            {
-                while ( 1 )
-                {
-                    if ( Parse_StackOpIsEmpty( pStackOp ) )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParserEqn(): There is no opening paranthesis\n" );
-                        Flag = PARSE_EQN_FLAG_ERROR; 
-                        break;
-                    }
-                    Oper = Parse_StackOpPop( pStackOp );
-                    if ( Oper == PARSE_EQN_OPER_MARK )
-                        break;
-
-                    // perform the given operation
-                    if ( Parse_ParserPerformTopOp( pMan, pStackFn, Oper ) == NULL )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParserEqn(): Unknown operation\n" );
-                        free( pFormula );
-                        return NULL;
-                    }
-                }
-            }
-            else
-            {
-                fprintf( pOutput, "Parse_FormulaParserEqn(): There is no opening paranthesis\n" );
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break;
-            }
-            if ( Flag != PARSE_EQN_FLAG_ERROR )
-                Flag = PARSE_EQN_FLAG_VAR; 
-            break;
-
-
-        default:
-            // scan the next name
-            for ( i = 0; pTemp[i] && 
-                         pTemp[i] != ' ' && pTemp[i] != '\t' && pTemp[i] != '\r' && pTemp[i] != '\n' &&
-                         pTemp[i] != PARSE_EQN_SYM_AND && pTemp[i] != PARSE_EQN_SYM_OR && pTemp[i] != PARSE_EQN_SYM_CLOSE; i++ )
-              {
-                    if ( pTemp[i] == PARSE_EQN_SYM_NEG || pTemp[i] == PARSE_EQN_SYM_OPEN )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParserEqn(): The negation sign or an opening paranthesis inside the variable name.\n" );
-                        Flag = PARSE_EQN_FLAG_ERROR; 
-                        break;
-                    }
-              }
-            // variable name is found
-            fFound = 0;
-            Vec_PtrForEachEntry( vVarNames, pName, v )
-                if ( strncmp(pTemp, pName, i) == 0 && strlen(pName) == (unsigned)i )
-                {
-                    pTemp += i-1;
-                    fFound = 1;
-                    break;
-                }
-            if ( !fFound )
-            { 
-                fprintf( pOutput, "Parse_FormulaParserEqn(): The parser cannot find var \"%s\" in the input var list.\n", pTemp ); 
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break; 
-            }
-            if ( Flag == PARSE_EQN_FLAG_VAR )
-            {
-                fprintf( pOutput, "Parse_FormulaParserEqn(): The variable name \"%s\" follows another var without operation sign.\n", pTemp ); 
-                Flag = PARSE_EQN_FLAG_ERROR; 
-                break; 
-            }
-            Parse_StackFnPush( pStackFn, Hop_IthVar( pMan, v ) ); // Cudd_Ref( pbVars[v] );
-            Flag = PARSE_EQN_FLAG_VAR; 
-            break;
-        }
-
-        if ( Flag == PARSE_EQN_FLAG_ERROR )
-            break;      // error exit
-        else if ( Flag == PARSE_EQN_FLAG_START )
-            continue;  //  go on parsing
-        else if ( Flag == PARSE_EQN_FLAG_VAR )
-            while ( 1 )
-            {  // check if there are negations in the OpStack     
-                if ( Parse_StackOpIsEmpty(pStackOp) )
-                    break;
-                Oper = Parse_StackOpPop( pStackOp );
-                if ( Oper != PARSE_EQN_OPER_NEG )
-                {
-                    Parse_StackOpPush( pStackOp, Oper );
-                    break;
-                }
-                else
-                {
-                      Parse_StackFnPush( pStackFn, Hop_Not(Parse_StackFnPop(pStackFn)) );
-                }
-            }
-        else // if ( Flag == PARSE_EQN_FLAG_OPER )
-            while ( 1 )
-            {  // execute all the operations in the OpStack
-               // with precedence higher or equal than the last one
-                Oper1 = Parse_StackOpPop( pStackOp ); // the last operation
-                if ( Parse_StackOpIsEmpty(pStackOp) ) 
-                {  // if it is the only operation, push it back
-                    Parse_StackOpPush( pStackOp, Oper1 );
-                    break;
-                }
-                Oper2 = Parse_StackOpPop( pStackOp ); // the operation before the last one
-                if ( Oper2 >= Oper1 )  
-                {  // if Oper2 precedence is higher or equal, execute it
-                    if ( Parse_ParserPerformTopOp( pMan, pStackFn, Oper2 ) == NULL )
-                    {
-                        fprintf( pOutput, "Parse_FormulaParserEqn(): Unknown operation\n" );
-                        free( pFormula );
-                        return NULL;
-                    }
-                    Parse_StackOpPush( pStackOp,  Oper1 );     // push the last operation back
-                }
-                else
-                {  // if Oper2 precedence is lower, push them back and done
-                    Parse_StackOpPush( pStackOp, Oper2 );
-                    Parse_StackOpPush( pStackOp, Oper1 );
-                    break;
-                }
-            }
-    }
-
-    if ( Flag != PARSE_EQN_FLAG_ERROR )
-    {
-        if ( !Parse_StackFnIsEmpty(pStackFn) )
-        {    
-            gFunc = Parse_StackFnPop(pStackFn);
-            if ( Parse_StackFnIsEmpty(pStackFn) )
-                if ( Parse_StackOpIsEmpty(pStackOp) )
-                {
-                    Parse_StackFnFree(pStackFn);
-                    Parse_StackOpFree(pStackOp);
-//                    Cudd_Deref( gFunc );
-                    free( pFormula );
-                    return gFunc;
-                }
-                else
-                    fprintf( pOutput, "Parse_FormulaParserEqn(): Something is left in the operation stack\n" );
-            else
-                fprintf( pOutput, "Parse_FormulaParserEqn(): Something is left in the function stack\n" );
-        }
-        else
-            fprintf( pOutput, "Parse_FormulaParserEqn(): The input string is empty\n" );
-    }
-    free( pFormula );
-    return NULL;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Performs the operation on the top entries in the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-Hop_Obj_t * Parse_ParserPerformTopOp( Hop_Man_t * pMan, Parse_StackFn_t * pStackFn, int Oper )
-{
-    Hop_Obj_t * gArg1, * gArg2, * gFunc;
-    // perform the given operation
-    gArg2 = Parse_StackFnPop( pStackFn );
-    gArg1 = Parse_StackFnPop( pStackFn );
-    if ( Oper == PARSE_EQN_OPER_AND )
-        gFunc = Hop_And( pMan, gArg1, gArg2 );
-    else if ( Oper == PARSE_EQN_OPER_OR )
-        gFunc = Hop_Or( pMan, gArg1, gArg2 );
-    else
-        return NULL;
-//    Cudd_Ref( gFunc );
-//    Cudd_RecursiveDeref( dd, gArg1 );
-//    Cudd_RecursiveDeref( dd, gArg2 );
-    Parse_StackFnPush( pStackFn,  gFunc );
-    return gFunc;
-}
-
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
diff --git a/src/bdd/parse/parseInt.h b/src/bdd/parse/parseInt.h
deleted file mode 100644
index 17f48375..00000000
--- a/src/bdd/parse/parseInt.h
+++ /dev/null
@@ -1,74 +0,0 @@
-/**CFile****************************************************************
-
-  FileName    [parseInt.h]
-
-  PackageName [MVSIS 2.0: Multi-valued logic synthesis system.]
-
-  Synopsis    [Parsing symbolic Boolean formulas into BDDs.]
-
-  Author      [MVSIS Group]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - September 8, 2003.]
-
-  Revision    [$Id: parseInt.h,v 1.0 2003/09/08 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-#ifndef __PARSE_INT_H__
-#define __PARSE_INT_H__
-
-////////////////////////////////////////////////////////////////////////
-///                          INCLUDES                                ///
-////////////////////////////////////////////////////////////////////////
-
-
-#include <stdio.h>
-#include "cuddInt.h"
-#include "extra.h"
-#include "parse.h"
-
-////////////////////////////////////////////////////////////////////////
-///                         PARAMETERS                               ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                    STRUCTURE DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-typedef int bool;
-
-typedef struct ParseStackFnStruct    Parse_StackFn_t;    // the function stack
-typedef struct ParseStackOpStruct    Parse_StackOp_t;    // the operation stack
-
-////////////////////////////////////////////////////////////////////////
-///                       GLOBAL VARIABLES                           ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                       MACRO DEFINITIONS                          ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/*=== parseStack.c =============================================================*/
-extern Parse_StackFn_t *  Parse_StackFnStart  ( int nDepth );
-extern bool               Parse_StackFnIsEmpty( Parse_StackFn_t * p );
-extern void               Parse_StackFnPush   ( Parse_StackFn_t * p, void * bFunc );
-extern void *             Parse_StackFnPop    ( Parse_StackFn_t * p );
-extern void               Parse_StackFnFree   ( Parse_StackFn_t * p );
-
-extern Parse_StackOp_t *  Parse_StackOpStart  ( int nDepth );
-extern bool               Parse_StackOpIsEmpty( Parse_StackOp_t * p );
-extern void               Parse_StackOpPush   ( Parse_StackOp_t * p, int Oper );
-extern int                Parse_StackOpPop    ( Parse_StackOp_t * p );
-extern void               Parse_StackOpFree   ( Parse_StackOp_t * p );
-
-#endif
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
diff --git a/src/bdd/parse/parseStack.c b/src/bdd/parse/parseStack.c
deleted file mode 100644
index cd7cd7e3..00000000
--- a/src/bdd/parse/parseStack.c
+++ /dev/null
@@ -1,243 +0,0 @@
-/**CFile****************************************************************
-
-  FileName    [parseStack.c]
-
-  PackageName [MVSIS 1.3: Multi-valued logic synthesis system.]
-
-  Synopsis    [Stacks used by the formula parser.]
-
-  Author      [MVSIS Group]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - August 18, 2003.]
-
-  Revision    [$Id: parseStack.c,v 1.0 2003/02/01 00:00:00 alanmi Exp $]
-
-***********************************************************************/
-
-#include "parseInt.h"
-
-////////////////////////////////////////////////////////////////////////
-///                        DECLARATIONS                              ///
-////////////////////////////////////////////////////////////////////////
-
-struct ParseStackFnStruct
-{
-    void **     pData;        // the array of elements
-    int           Top;          // the index
-    int           Size;         // the stack size
-};
-
-struct ParseStackOpStruct
-{
-    int *         pData;        // the array of elements
-    int           Top;          // the index
-    int           Size;         // the stack size
-};
-
-////////////////////////////////////////////////////////////////////////
-///                     FUNCTION DEFINITIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-/**Function*************************************************************
-
-  Synopsis    [Starts the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-Parse_StackFn_t * Parse_StackFnStart( int nDepth )
-{
-    Parse_StackFn_t * p;
-    p = ALLOC( Parse_StackFn_t, 1 );
-    memset( p, 0, sizeof(Parse_StackFn_t) );
-    p->pData = ALLOC( void *, nDepth );
-    p->Size = nDepth;
-    return p;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Checks whether the stack is empty.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-bool Parse_StackFnIsEmpty( Parse_StackFn_t * p )
-{
-    return (bool)(p->Top == 0);
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Pushes an entry into the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Parse_StackFnPush( Parse_StackFn_t * p, void * bFunc )
-{
-    if ( p->Top >= p->Size )
-    {
-        printf( "Parse_StackFnPush(): Stack size is too small!\n" );
-        return;
-    }
-    p->pData[ p->Top++ ] = bFunc;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Pops an entry out of the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void * Parse_StackFnPop( Parse_StackFn_t * p )
-{
-    if ( p->Top == 0 )
-    {
-        printf( "Parse_StackFnPush(): Trying to extract data from the empty stack!\n" );
-        return NULL;
-    }
-    return p->pData[ --p->Top ];
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Deletes the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Parse_StackFnFree( Parse_StackFn_t * p )
-{
-    FREE( p->pData );
-    FREE( p );
-}
-
-
-
-
-/**Function*************************************************************
-
-  Synopsis    [Starts the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-Parse_StackOp_t * Parse_StackOpStart( int nDepth )
-{
-    Parse_StackOp_t * p;
-    p = ALLOC( Parse_StackOp_t, 1 );
-    memset( p, 0, sizeof(Parse_StackOp_t) );
-    p->pData = ALLOC( int, nDepth );
-    p->Size = nDepth;
-    return p;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Checks whether the stack is empty.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-bool Parse_StackOpIsEmpty( Parse_StackOp_t * p )
-{
-    return (bool)(p->Top == 0);
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Pushes an entry into the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Parse_StackOpPush( Parse_StackOp_t * p, int Oper )
-{
-    if ( p->Top >= p->Size )
-    {
-        printf( "Parse_StackOpPush(): Stack size is too small!\n" );
-        return;
-    }
-    p->pData[ p->Top++ ] = Oper;
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Pops an entry out of the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-int Parse_StackOpPop( Parse_StackOp_t * p )
-{
-    if ( p->Top == 0 )
-    {
-        printf( "Parse_StackOpPush(): Trying to extract data from the empty stack!\n" );
-        return -1;
-    }
-    return p->pData[ --p->Top ];
-}
-
-/**Function*************************************************************
-
-  Synopsis    [Deletes the stack.]
-
-  Description []
-               
-  SideEffects []
-
-  SeeAlso     []
-
-***********************************************************************/
-void Parse_StackOpFree( Parse_StackOp_t * p )
-{
-    FREE( p->pData );
-    FREE( p );
-}
-
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
-
-