Mercurial > hg > Applications > Grep
view c/regexParser/createBitVectorList.cc @ 100:804e51f19f17 impl-bitvector
implement allocateBitVectorList
author | Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Tue, 17 Nov 2015 03:17:07 +0900 |
parents | 1e5b56e8263b |
children | 2cc097419169 |
line wrap: on
line source
#include <stdio.h> #include <stdlib.h> #include "bitVector.h" #include "regexParser.h" extern BitVectorPtr bitSet(int); extern void bitPrint(BitVectorPtr); BitVectorListPtr createBitVector(NodePtr); BitVectorListPtr descendTreeNode(NodePtr,BitVectorListPtr); 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; puts("-----"); printf(" state : "); bitPrint(bvl->bi); for (int i = 0; i < 256; i++) { if (bvl->next[i] != NULL) { printf("input char : %c\n",i); } } printf("next state : ");bitPrint(bvl->next[(int)n->Value.character]->bi); puts("-----"); return bvl->next[(int)n->Value.character]; } 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; } 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); return bvl; }