Mercurial > hg > Applications > Grep
comparison regexParser/main.cc @ 190:3e8e5780ad4a pairPro
change node::State to State
author | Masataka Kohagura <kohagura@cr.ie.u-ryukyu.ac.jp> |
---|---|
date | Fri, 25 Dec 2015 15:30:52 +0900 |
parents | fccf7941ecc2 |
children | 4fefd80c05f2 |
comparison
equal
deleted
inserted
replaced
189:fccf7941ecc2 | 190:3e8e5780ad4a |
---|---|
1 #include <stdio.h> | 1 #include <stdio.h> |
2 #include <stdlib.h> | 2 #include <stdlib.h> |
3 #include <string.h> | 3 #include <string.h> |
4 #include "regexParser.h" | 4 #include "regexParser.h" |
5 #include "subsetConstraction.h" | |
6 #include "node.h" | |
5 | 7 |
6 extern NodePtr regex(RegexInfoPtr); | |
7 extern void printTree(NodePtr); | |
8 extern TransitionGeneratorPtr generateTransitionList(NodePtr n); | |
9 int main(int argc, char **argv) | 8 int main(int argc, char **argv) |
10 { | 9 { |
11 RegexInfo ri; | 10 RegexInfo ri; |
12 ri.stateNumber = 1; | 11 ri.stateNumber = 1; |
13 for (int i = 1; i < argc; i++) { | 12 for (int i = 1; i < argc; i++) { |
17 } | 16 } |
18 printf("regex : %s\n",ri.ptr); | 17 printf("regex : %s\n",ri.ptr); |
19 NodePtr n = regex(&ri); | 18 NodePtr n = regex(&ri); |
20 printTree(n); | 19 printTree(n); |
21 TransitionGeneratorPtr tg = generateTransitionList(n); | 20 TransitionGeneratorPtr tg = generateTransitionList(n); |
21 printState(tg); | |
22 return 0; | 22 return 0; |
23 } | 23 } |