view c/regexParser/createBitVectorList.cc @ 102:07f4761c6c58 impl-bitvector

revert descendTreeNode function
author Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp>
date Tue, 17 Nov 2015 16:35:54 +0900
parents 2cc097419169
children 4ad2a75dec4a
line wrap: on
line source

#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include "bitVector.h"
#include "regexParser.h"

extern BitVectorPtr bitSet(int);
extern void bitPrint(BitVectorPtr);
BitVectorListPtr createBitVector(NodePtr);
BitVectorListPtr descendTreeNode(NodePtr,BitVectorListPtr);
BitVectorListPtr setNextBitVectorList(BitVectorListPtr bvl, BitVectorListPtr next, NodePtr n);

BitVectorListPtr initBvl;

BitVectorListPtr allocateBitVectorList() {
    BitVectorListPtr bvl = (BitVectorListPtr)malloc(sizeof(BitVectorList));
    bvl->self = bvl;
    bvl->bi = (BitVectorPtr)malloc(sizeof(BitVector));

    return bvl;
}

BitVectorListPtr createBitVector(NodePtr n,BitVectorListPtr bvl) {
    BitVectorListPtr nextBvl = bvl->next[(int)n->Value.character] = allocateBitVectorList();
    nextBvl->self = bvl->next[(int)n->Value.character];
    nextBvl->bi = bitSet(n->nodeNumber);
    nextBvl->initBvl = initBvl;

    return nextBvl;
}


BitVectorListPtr initBitVector() {

    BitVectorListPtr bvl = allocateBitVectorList();
    bvl->initBvl = initBvl = bvl;
    bvl->bi = bitSet(0);

    for (int i = 0; i < 256; i++) {
        bvl->next[i] = NULL;
    }

    return bvl;
}

void printBitVectorList (BitVectorListPtr bvl) {
    bool initPrintFlag = true;
    for (int i = 0; i < 256; i++) {
        if (bvl->next[i] != NULL) {
            if (initPrintFlag) {
                puts("----");
                printf("     state : "); bitPrint(bvl->bi);
                initPrintFlag = false;
            }
            printf("input char : %c\n",i);
            printf("next state : "); bitPrint(bvl->next[i]->bi);
        }
    }

    for (int i = 0; i < 256; i++) {
        if (bvl->next[i] != NULL) {
            printBitVectorList(bvl->next[i]);
        }
    }
}

BitVectorListPtr descendTreeNode(NodePtr n,BitVectorListPtr bvl) {

    if (n->tokenType == '*') {
        bvl = descendTreeNode(n->left,bvl);
    } else if (n->tokenType == '|') {
        bvl = descendTreeNode(n->left,bvl);
        bvl = descendTreeNode(n->parent->right,bvl);
    } else if (n->Value.character == '+') {
        bvl = descendTreeNode(n->left,bvl);
        bvl = descendTreeNode(n->right,bvl);
    } else if (n->tokenType == 'a') {
        bvl = createBitVector(n,bvl);
    }
    return bvl;
}

BitVectorListPtr createBitVectorList(NodePtr n) {
    BitVectorListPtr bvl = initBitVector();
    descendTreeNode(n,bvl);
    printBitVectorList(bvl);
    return bvl;
}